# How to find the number of ways to go from on point to another on the cartesian plane ?

Supposing we have to go from (0,0) to (5,3). Then what will be the number of ways ?

Note:- You can only go up, right Please give solution with proof and logic.

Note by Aayush Mani
4 years, 4 months ago

MarkdownAppears as
*italics* or _italics_ italics
**bold** or __bold__ bold
- bulleted- list
• bulleted
• list
1. numbered2. list
1. numbered
2. list
Note: you must add a full line of space before and after lists for them to show up correctly
paragraph 1paragraph 2

paragraph 1

paragraph 2

[example link](https://brilliant.org)example link
> This is a quote
This is a quote
    # I indented these lines
# 4 spaces, and now they show
# up as a code block.

print "hello world"
# I indented these lines
# 4 spaces, and now they show
# up as a code block.

print "hello world"
MathAppears as
Remember to wrap math in $$...$$ or $...$ to ensure proper formatting.
2 \times 3 $$2 \times 3$$
2^{34} $$2^{34}$$
a_{i-1} $$a_{i-1}$$
\frac{2}{3} $$\frac{2}{3}$$
\sqrt{2} $$\sqrt{2}$$
\sum_{i=1}^3 $$\sum_{i=1}^3$$
\sin \theta $$\sin \theta$$
\boxed{123} $$\boxed{123}$$

Sort by:

Okay, so you have two choices at any given point. You can go up, and you can go right. Let's name these U and R. To get to $$(5, 3)$$, you have to make 5 R and 3 U. So all that you're really doing is computing 8 (the total number) choose 3 (or 5), which is $$\boxed{56}$$. :D

- 4 years, 4 months ago