How Many 120° Triples?

Geometry Level 3

How many triangles have one angle that is 120 ° 120° , one side that is 1 1 more than its shortest side, and all integer sides?

finitely many none infinitely many

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

Mark Hennings
Aug 28, 2019

We want a triangle with sides a , a + 1 , b a,a+1,b where b > a + 1 b > a+1 , and b b is the side opposite the angle of 12 0 120^\circ , so that b 2 = a 2 + ( a + 1 ) 2 2 a ( a + 1 ) cos 12 0 = 3 a 2 + 3 a + 1 b^2 \; = \; a^2 + (a+1)^2 - 2a(a+1)\cos120^\circ \; = \; 3a^2 + 3a + 1 so that 4 b 2 3 ( 2 a + 1 ) 2 = 1 4b^2 - 3(2a+1)^2 \; = \; 1 The positive integer solutions of the equation x 2 3 y 2 = 1 x^2 - 3y^2 = 1 are given by the formula x n + y n 3 = ( 2 + 3 ) n x_n + y_n\sqrt{3} = (2 + \sqrt{3})^n for n 0 n \ge 0 . It is easy to show that we can ensure that x n x_n is even and y n y_n is odd by choosing n n to be odd. If we define a n = 1 2 ( y 2 n + 1 1 ) b n = 1 2 x 2 n + 1 n 0 a_n \; = \; \tfrac12(y_{2n+1} - 1) \hspace{1cm} b_n \; = \; \tfrac12x_{2n+1} \hspace{2cm} n \ge 0 we obtain sequences of integers defined by the recurrence relations a n = 7 a n 1 + 4 b n 1 + 3 b n = 12 a n 1 + 7 b n 1 + 6 \begin{aligned} a_n & = \; 7a_{n-1} + 4b_{n-1} + 3 \\ b_n & = \; 12a_{n-1} + 7b_{n-1} + 6 \end{aligned} with a 0 = 0 a_0=0 and b 0 = 1 b_0=1 , and we have b n 2 = 3 a n 2 + 3 a n + 1 n 0 b_n^2 \; = \; 3a_n^2 + 3a_n + 1 \hspace{2cm} n \ge 0 while it is clear that b n > a n + 1 b_n > a_n+1 for all n 1 n \ge 1 . Thus we have i n f i n i t e l y \boxed{\mathrm{infinitely}} many triangles.

Well done!

David Vreken - 1 year, 9 months ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...