# Triangular grid in cartesian plane!

Find the number of ways to from (0,0) to (8,8) in the right angled isosceles triangle forming the sides:

1) (0,0) to (8,0)

2) (8,0) to (8,8)

3) (0,0) to (8,8)

You can only go in positive vertical or horizontal directions(only integer co-ordinates). Diagonals are not allowed.

Bonus: Try to find the number of ways for a general case like (0,0) to (m,m)

Note by Saarthak Marathe
2 years, 7 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:

Can we go up and sideways only from the integral values or from anywhere in between?

- 2 years, 6 months ago

Only integral values

- 2 years, 6 months ago