a 2 + b 2 + 1 6 c 2 = 9 k 2 + 1
Find all prime numbers a , b , c and positive integers k which satisfy the equation above.
If the solutions can be represented as ( a 1 , b 1 , c 1 , k 1 ) , ( a 2 , b 2 , c 2 , k 1 ) , … , ( a n , b n , c n , k n )
Evaluate i = 1 ∑ n ( a i + b i + c i + k i ) .
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.
Problem Loading...
Note Loading...
Set Loading...
Look mod 3 : get a 2 + b 2 + c 2 ≡ 1 mod 3 . Since squares are 0 or 1 mod 3 , this implies that two of the three primes are congruent to 0 mod 3 --that is, they must equal 3 .
So we get 1 8 + 1 6 c 2 = 9 k 2 + 1 or (up to interchanging a and b ) 1 5 3 + b 2 = 9 k 2 + 1 .
The first equation gives ( 3 k − 4 c ) ( 3 k + 4 c ) = 1 7 , so k = 3 , c = 2 is clearly the only possibility, so we've got the solution ( 3 , 3 , 2 , 3 ) .
The second equation gives ( 3 k − b ) ( 3 k + b ) = 1 5 2 . The only two possibilities are that the factors are 4 ⋅ 3 8 and 2 ⋅ 7 6 because they have to have the same parity. This leads to ( 3 , 7 , 3 , 1 7 ) and ( 3 , 1 3 , 3 , 3 7 ) . Plus we can switch a and b to get ( 7 , 3 , 3 , 1 7 ) and ( 1 3 , 3 , 3 , 3 7 ) .
The sum of all the coordinates is 1 8 3 .