So many triangles!

Geometry Level 5

For how many positive integers n < 2017 n < 2017 does there exist a right angle isosceles triangle on the Cartesian plane with the property that the vertices are lattice points and exactly n n lattice points are situated on the perimeter?


The answer is 1008.

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.

1 solution

Sharky Kesa
Jan 29, 2017

Let's try some simple cases first so we can get something inspired for the actual proof.

If the perpendicular sides are parallel to the coordinate axes, we find that we can generate all multiples of 3.

Now we try if the vertices are ( 0 , 0 ) (0,0) , ( 1 , 1 ) (1,1) and ( 1 , 1 ) (1, -1) . This gives us 4 lattice points, and if we continue doing triangles of the form ( 0 , 0 ) (0,0) , ( m , m ) (m,m) and ( m , m ) (m,-m) , we find we can generate all multiples of 4.

Now we will try the proof and see fi we can get something like the above results.

For sake of convenience, we can assume the apex of the triangle is ( 0 , 0 ) (0,0) , and the other vertices are ( m , n ) (m,n) and ( n , m ) (n, -m) . Note that the number of lattice points between the origin and ( m , n ) (m,n) is gcd ( m , n ) + 1 \text{gcd}(m,n) + 1 . The same holds true for the number of lattice points between the origin and ( n , m ) (n,-m) . To count the number of lattice points on the hypotenuse, we translate the side so one of the vertices (assume it's ( n , m ) (n,-m) ) is now at ( 0 , 0 ) (0,0) . Thus, the other vertex must be at ( m n , m + n ) (m-n,m+n) , so the number of lattice points on the hypotenuse must be gcd ( m + n , m n ) + 1 \text{gcd}(m+n,m-n) + 1 .

Let k = gcd ( m , n ) k=\text{gcd}(m,n) . We must have that k m k \mid m and k n k \mid n , so k m + n , m n k \mid m+n, m-n . Thus, k gcd ( m + n , m n ) k \mid \text{gcd}(m+n,m-n) .

Let l = gcd ( m + n , m n ) l=\text{gcd}(m+n,m-n) . We must have l m + n l \mid m+n and l m n l \mid m-n , so l 2 m , 2 n l \mid 2m, 2n . Thus, either k = l k=l if l l is odd or 2 k = l 2k=l if l l is even. Note that l l is odd if m m and n n have different parities and l l is even if m m and n n have the same parity.

Thus, if we m m and n n have different parity, we get there are 3 l 3l lattice points on the triangle (thus generating all multiples of 3), and if m m and n n have the same parity, we get there are 4 l 4l lattice points on the triangle (thus generating all multiples of 4).

We already have a pair of constructions satisfying these two properties, so we are done!

Now all that remains is to count the number of positive integers which satisfy. By PIE, we have

2016 3 + 2016 4 2016 12 = 1008 \left \lfloor \dfrac{2016}{3} \right \rfloor+ \left \lfloor \dfrac{2016}{4} \right \rfloor - \left \lfloor \dfrac{2016}{12} \right \rfloor = \boxed{1008}

Therefore, our answer is 1008 \boxed{1008} .

This is BMO2 2016/2017 q1! Was this intentionally copied or was it just a coincidence?

Freddie Hand - 4 years, 4 months ago

Log in to reply

Not copied, I liked the problem.

Sharky Kesa - 4 years, 4 months ago

Log in to reply

OK, that's good!

Freddie Hand - 4 years, 4 months ago

There is an assumption that "the other vertices are ( m , n ) , ( n , m ) (m, n), (n, -m) ". You have to justify why we can apply a rotation, which doesn't necessarily map lattice points to lattice points.

It has to do with the condition of "right angled triangles", and you should show how it's used to give this result.

Calvin Lin Staff - 4 years, 4 months ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...