Triangle O A B has vertices with coordinates O = ( 0 , 0 ) , A = ( 4 , 0 ) , B = ( 0 , 2 ) . As shown in the diagram, there are 9 points with integer coordinates that lie either wholly inside or on the perimeter of the triangle.
Now, triangle P Q R has vertices with coordinates P = ( − 2 4 , 1 7 ) , Q = ( 1 5 , − 3 5 ) , R = ( 1 0 0 , 1 6 9 ) . How many points with integer coordinates lie either wholly inside or on the perimeter of triangle P Q R ?
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.
Pick's Theorem as above:-Area=I + 1/2
E-1.
So I+E=Area+1/2
E+1=6188+1/2*34+1=6206.
If you construct a rectangle A R C D containing P Q R with width 1 2 4 units and height 2 0 4 units, then this rectangle has 2 0 5 × 1 2 5 lattices points on or inside it.
Firstly, since gcd ( 8 5 , 2 0 4 ) = 1 7 , there are 1 8 lattice points on Q R . Then the number of lattice points on or inside right-triangle R C Q excluding those on Q R is 2 2 0 5 × 8 6 − 1 8 (this is obtained by reflecting C over Q R , thus forming a rectangle).
Secondly, since gcd ( 3 9 , 5 2 ) = 1 3 , there are 1 4 lattice points on P Q . Then the number of lattice points on or inside right-triangle P D Q excluding those on P Q is 2 4 0 × 5 3 − 1 4 (obtained by reflecting D over P Q , thus forming a rectangle).
Lastly, since gcd ( 1 5 2 , 1 2 4 ) = 4 , there are 5 lattice points on P R . Then the number of lattice points on or inside right-triangle P A R excluding those on P R is 2 1 5 3 × 1 2 5 − 5 (obtained in the aforementioned manner).
So the number of lattice points on or inside triangle P Q R is 2 0 5 × 1 2 5 − 2 2 0 5 × 8 6 − 1 8 − 2 4 0 × 5 3 − 1 4 − 2 1 5 3 × 1 2 5 − 5 = 6 2 0 6 .
Note that this solution is more inefficient, but does not use Pick's Theorem.
Well comparing what is going on in the triangle and what is going on in a surrounding rectangle and some associated right-angled triangles is one of the ways of proving Pick's Theorem...
Yes - the solution is doing a similar thing. It's just that the formula for Pick's Theorem is not required.
This is what I did, I'll have to read up on the theorem, it looks cool.
Let's draw the lines passing through the vertices of the rectangle, namely
y P R = 3 1 3 8 x + 3 1 1 4 3 9 y P Q = − 3 4 x − 1 5 y Q R = 5 1 2 x − 7 1
Now, let be x 0 ∈ [ − 2 4 , 1 5 ] ⊂ Z . The point ( x 0 , ⌊ y P R ( x 0 ) ⌋ ) is the point, right under ( x 0 , y P R ( x 0 ) ) , which coordinates are integers. Similarly, the point ( x 0 , ⌈ y P R ( x 0 ) ⌉ ) is the point, right above ( x 0 , y P R ( x 0 ) ) , which coordinates are, again, integers. Hence, the set A = { a = ( x , y ) ∣ x = x 0 , y P R ( x 0 ) ≤ y ≤ y P Q ( x 0 ) } ⊂ Z 2 has cardinality
∣ A ∣ = x 0 = − 2 4 ∑ 1 5 ( ⌊ y P R ( x 0 ) ⌋ − ⌈ y P Q ( x 0 ) ⌉ + 1 ) = x 0 = − 2 4 ∑ 1 5 ( ⌊ 3 1 3 8 x 0 + 3 1 1 4 3 9 ⌋ − ⌈ − 3 4 x 0 − 1 5 ⌉ + 1 ) = 2 0 0 4
We do the same for x 1 ∈ [ 1 6 , 1 0 0 ] , getting B = { b = ( x , y ) ∣ x = x 0 , y P R ( x 0 ) ≤ y ≤ y R Q ( x 0 ) } ⊂ Z 2 . So,
∣ B ∣ = x 1 = 1 6 ∑ 1 0 0 ( ⌊ y P R ( x 1 ) ⌋ − ⌈ y R Q ( x 1 ) ⌉ + 1 ) = x 1 = 1 6 ∑ 1 0 0 ( ⌊ 3 1 3 8 x 1 + 3 1 1 4 3 9 ⌋ − ⌈ 5 1 2 x 1 − 7 1 ⌉ + 1 ) = 4 2 0 2
Eventually,
∣ A ∣ + ∣ B ∣ = 2 0 0 4 + 4 2 0 2 = 6 2 0 6
Problem Loading...
Note Loading...
Set Loading...
We have P Q = ( 3 9 − 5 2 ) Q R = ( 8 5 2 0 4 ) P R = ( 1 2 4 1 5 2 ) Since the highest common factor of 3 9 and − 5 2 is 1 3 , there are 1 4 points with integer coordinates on the line segment P Q , namely the points ( − 2 4 + 3 k , 1 7 − 4 k ) for k = 0 , 1 , 2 , … , 1 3 . Similarly, the highest common factor of 8 5 and 2 0 4 is 1 7 , so there are 1 8 points with integer coordinates on the line segment Q R , and since the highest common factor of 1 2 4 and 1 5 2 is 4 , there are 5 points with integer coordinates on the line segment P R . Thus there are (we have counted the triangle vertices twice) E = 1 4 + 1 8 + 5 − 3 = 3 4 points with integer coordinates that lie on the perimeter of P Q R . Since ⎝ ⎛ 3 9 − 5 2 0 ⎠ ⎞ ∧ ⎝ ⎛ 1 2 4 1 5 2 0 ⎠ ⎞ = ⎝ ⎛ 0 0 1 2 3 7 6 ⎠ ⎞ the triangle P Q R has area 2 1 × 1 2 3 7 6 = 6 1 8 8 square units.
Using Pick's Theorem , there are I points with integer coefficients lying inside the triangle P Q R , where 6 1 8 8 = I + 2 1 E − 1 so that I = 6 1 7 2 . Thus there are a total of I + E = 6 2 0 6 points with integer coefficients lying either inside the triangle P Q R or on the perimeter of P Q R .