Find the 4th smallest heronian triangle(triangle with integer sides) with sides , and for a positive integer n. The perimeter of the triangle is "p" and the area is "a" for positive integers p and n.
is a positive integer x.
Find .
Details and Assumptions
The first such triangle has area 12 and perimeter 16.
Hint : The answer is the sum of 2 perfect squares.
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.
The sides of all isosceles Heronian triangles, for any integers x , y can be expressed as
A = B = x 2 + y 2
C = 2 ( x 2 − y 2 )
Hence, if A = B = n and C = n + 1 , we end up with the Pell Equation
x 2 − 3 y 2 = 1
The first integer solution { x , y } . is { 2 , 1 } . The y of the next can be found by this recursion formula
y i + 1 = 2 y i + x i
so that we have the sequence of solutions
{ 2 , 1 } , { 7 , 4 } , { 2 6 , 1 5 } , { 9 7 , 5 6 } , { 3 6 2 , 2 0 9 } , { 1 3 5 1 , 7 8 0 } , { 5 0 4 1 , 2 9 1 1 } , . . .
The 4 th smallest Heronian triangle meeting the conditions would be based on { 9 7 , 5 6 }
n = 9 7 2 + 5 6 2 = 1 2 5 4 5
n + 1 = 2 ( 9 7 2 − 5 6 2 ) = 1 2 5 4 6
so that the area works out to 6 8 1 4 9 8 7 2 and the rest is calculation work