Results 1 to 2 of 2

Math Help - A hard one...

  1. #1
    MHF Contributor Also sprach Zarathustra's Avatar
    Joined
    Dec 2009
    From
    Russia
    Posts
    1,506
    Thanks
    1

    A hard one...

    Mr. X and Mr. Y are standing at the same point on plane(suppose Z^2 or R^2), in every step every one of them make one step right or upward.
    In how many ways we can choose pair of paths in length of n (one to each one of them) so they will meet only at the end of marching, but not in middle of marching.
    Follow Math Help Forum on Facebook and Google+

  2. #2
    Newbie
    Joined
    Dec 2009
    Posts
    19

    Catalan Numbers

    think of the recursive Definition of Cataln numbers...
    Follow Math Help Forum on Facebook and Google+

Similar Math Help Forum Discussions

  1. Hard one.
    Posted in the Calculus Forum
    Replies: 7
    Last Post: April 8th 2010, 12:36 PM
  2. Help, it's hard! :-S
    Posted in the Advanced Algebra Forum
    Replies: 1
    Last Post: December 8th 2009, 01:45 PM
  3. NP or NP-hard?
    Posted in the Advanced Applied Math Forum
    Replies: 2
    Last Post: September 28th 2009, 06:55 AM
  4. g of hard
    Posted in the Pre-Calculus Forum
    Replies: 1
    Last Post: September 24th 2009, 03:09 AM
  5. Log Qn (Not too hard!!)
    Posted in the Calculus Forum
    Replies: 3
    Last Post: May 16th 2008, 07:01 AM

Search Tags


/mathhelpforum @mathhelpforum