How many triplets of positive integers exist such that ?
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.
I will solve this by reducing this problem to the classic problem of solving x 2 + y 2 = a . First, take the congruence modulo 3 to find that x 2 + y 2 + z 2 ≡ 1 m o d 3 . Remember that in modulo 3, squares are always congruent to 1 or 0 . So it must be that exactly one is congruent to 1 and the others are congruent to 0. But because we have perfect symmetry with the variables let's just pick y ≡ 0 m o d 3 , z ≡ 0 m o d 3 .
Let's now make the substitution y = 3 y 1 , z = 3 z 1 to get the equation x 2 + 9 y 1 2 + 9 z 1 2 = 2 0 1 1 . Now take the congruence modulo 9 to find x 2 ≡ 4 m o d 9 ⟹ x ≡ ± 2 m o d 9 .
On the other hand, let's find an inequality for x . The equation implies that y 2 + z 2 = 2 0 1 1 − x 2 . This implies that 2 0 1 1 − x 2 > 0 ⟹ 2 0 1 1 > x 2 ⟹ 4 4 ≥ x .
But remember that x = 9 k ± 2 . Let's first assume that x = 9 k + 2 . This means 4 4 ≥ 9 k + 2 ⟹ 4 ≥ k . So we only need to check k = 0 , 1 , 2 , 3 , 4 . In the other case 4 4 ≥ 9 k − 2 ⟹ 5 ≥ k and in this case we only have to check k = 1 , 2 , 3 , 4 , 5 . (We don't check 0 because 9*0 - 2 is negative).
This reduces the problem to 10 computations. First, you compute 2 0 1 1 − x 2 for one of the 1 0 x 's we have to consider. Then you quickly check if it is congruent to 3 mod 4 or has a prime power factor congruent to 3 mod 4 which would imply it is impossible to write it as a sum of two squares. But if the number can be written as a sum of two squares then you solve the equation 9 y 1 2 + 9 z 1 2 = 2 0 1 1 − x 2 first by dividing by 9 and then factorizing 2 0 1 1 − x 2 over the Gaussian integers.
This last part may be hard but actually, you only have to do it in 3 cases. When x = 2 9 , 7 , 4 3 because for the other values of x, you can quickly disqualify them by checking their normal factorization and finding factors congruent to 3 mod 4. The main solutions I found after all this are:
( 2 9 , 9 , 3 3 ) , ( 2 9 , 2 1 , 2 7 ) , ( 7 , 2 1 , 3 9 ) , ( 4 3 , 9 , 9 ) . And remember the other solutions are built by permuting these solutions so the total number of positive solutions are 3 ! + 3 ! + 3 ! + ( 2 3 ) = 2 1 .