Cat's journey: Find the number of different paths from start to destination

spaccio

New member
Joined
Jun 11, 2017
Messages
3
Cat starts his journey on the plane from point with coordinates (0; 0) and wants to reach point with coordinates (n; m). From point (x; y) with one step cat can either reach point (x+1; y) or point (x; y+1). Find the number of different paths from start to destination, when n = 6 and m = 4...
 
Cat starts his journey on the plane from point with coordinates (0; 0) and wants to reach point with coordinates (n; m). From point (x; y) with one step cat can either reach point (x+1; y) or point (x; y+1). Find the number of different paths from start to destination, when n = 6 and m = 4...
What are your thoughts?

Please share your work with us ...even if you know it is wrong.

If you are stuck at the beginning tell us and we'll start with the definitions.

You need to read the rules of this forum. Please read the post titled "Read before Posting" at the following URL:

http://www.freemathhelp.com/forum/announcement.php?f=33
 
Cat starts his journey on the plane from point with coordinates (0; 0) and wants to reach point with coordinates (n; m). From point (x; y) with one step cat can either reach point (x+1; y) or point (x; y+1). Find the number of different paths from start to destination, when n = 6 and m = 4...
What is your understanding of the rule for the cat's steps?

Thank you! ;)
 
Top