Find the total number of points having integral co-ordinates that lie inside the triangle having vertices as ( 0 , 0 ) , ( 0 , 3 6 0 ) and ( 7 2 0 , 0 )
Bonus: Can you find the total number of such integral points inside a triangle having vertices as ( 0 , 0 ) , ( 0 , n ) and ( m , 0 ) ?
Try also Integral Co-ordinates .
Try Also Integral Co-ordinates -3
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Sir I did like to see your solution for a higher version :)
Hmm, I see. Then how did you got the answer? I mean as far as I remember you were the first one to answer that.
Log in to reply
The triangle is so small. I just draw it out to scale and count.
Yeah, even I did the same for verification :)
Using Pick's Theorem as used by @Henry U in my previous simpler version of this problem.
The Area of a Polygon, A = I + 2 B − 1
Here, I is the total number of interior points inside the polygon.
B is the total number of points on the boundary of the polygon.
Here, we can simply tell that area of our triangle having ( 0 , 0 ) , ( 0 , n ) and ( m , 0 ) as vertices is A ′ = 2 1 m n
Now, we need to find B we have n points on one side and m points on another side and origin and also k points on the hypotenuse.
We get k = g c d ( − n , m ) − 1 For detailed explanation visit .
Now we have, A = A ′
2 1 m n = I + 2 1 ( 1 + m + n + g c d ( − n , m ) − 1 ) − 1
We get I = 2 1 m n − 2 1 ( m + n + g c d ( − n , m ) ) + 1
Finally, N ( n , m ) = I = 2 1 ( m n − m − n − g c d ( − n , m ) ) + 1
Hence, for n = 3 6 0 , m = 7 2 0
N ( 3 6 0 , 7 2 0 ) = 2 1 ( 7 2 0 × 3 6 0 − 7 2 0 − 3 6 0 − g c d ( − 3 6 0 , 7 2 0 ) ) + 1 = 1 2 8 8 8 1
I might be seriously wrong, please do correct me if so.
Problem Loading...
Note Loading...
Set Loading...
Consider a right triangle of vertices ( 0 , 0 ) , ( 0 , n ) , and ( m , 0 ) . I am using m = 2 0 and n = 1 5 for convenience. If we consider the rectangle twice the size of the triangle with vertices ( 0 , 0 ) , ( 0 , n ) , ( m , 0 ) , and ( m , n ) . Then we can find the number of points with integer coordinates in the triangle as:
N △ = 2 N rectangle − N 4 sides − N diagonal-2
where
Therefore,
N △ = 2 ( m + 1 ) ( n + 1 ) − 2 ( m + n ) − g cd ( m , n ) + 1 = 2 m n − m − n − g cd ( m , n ) + 1
For m = 7 2 0 and n = 3 6 0 , N △ = 2 7 2 0 × 3 6 0 − 7 2 0 − 3 6 0 − 3 6 0 + 1 = 1 2 8 8 8 1 .