2018 is a hypotenuse of a Pythagorean Triple. For the corresponding primitive triple find it's level in the Tree of primitive Pythagorean triples and the parent node. For level numbering use for the first triple . For the parent node find the generating pair of integers using Euclid's formula. Enter the result as concatenated values of .
For example triple is at level 4 on the tree. Its parent node is with . The answer in this case would be .
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.
Primitive triple always has an odd hypotenuse, therefore our corresponding primitive triple will have to have c = 1 0 0 9 . This is only possible for 2 8 2 + 1 5 2 = 1 0 0 9 → a = 5 5 9 , b = 8 4 0
We need matrices: S = ⎣ ⎡ 3 4 5 ⎦ ⎤ E = ⎣ ⎡ 5 5 9 8 4 0 1 0 0 9 ⎦ ⎤ A = ⎣ ⎡ 1 2 2 − 2 − 1 − 2 2 2 3 ⎦ ⎤ B = ⎣ ⎡ 1 2 2 2 1 2 2 2 3 ⎦ ⎤ C = ⎣ ⎡ − 1 − 2 − 2 2 1 2 2 2 3 ⎦ ⎤
We find that: A − 1 × E = P where P = ⎣ ⎡ 2 2 1 6 0 2 2 9 ⎦ ⎤
After further trial and error, we find that: A − 1 × C − 1 × C − 1 × C − 1 × A − 1 × E = S
That means l = 6
For the parent node triple P we get m = 1 5 , n = 2
This gives the answer 6 1 5 2 .
Note: More information about the Tree of primitive Pythagorean triples can be found in Wikipedia article .