Possible Duplicate:
Counting number of moves on a grid
I have an exercise in my Computer Science class, to figure out how many paths there are from $(0,0)$ to $(x,y)$ on a cartesian coordinate system, while the only legal moves are move up
and move right
.
Is there a simple method to calculate the number of available paths?