Find the number of 6 -tuples ( a 1 , a 2 , a 3 , b 1 , b 2 , b 3 ) ∈ ( Z / 2 0 2 7 Z ) 6 such that a 1 2 + a 2 2 + a 3 2 = b 1 2 + b 2 2 + b 3 2 ( m o d 2 0 2 7 ) holds.
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.
@Jon Haussmann , we really liked your comment, and have converted it into a solution. If you subscribe to this solution, you will receive notifications about future comments.
Observe that p = 2 0 2 7 is a prime number.
If f n is the number of tuples such that ∑ i = 1 3 a i 2 − b i 2 = n , then F ( x ) = n ∑ f n x n = a i , b i , i ∑ x a 1 2 + a 2 2 + a 3 2 − b 1 2 − b 2 2 − b 3 2 = ( ( a = 0 ∑ p − 1 x a 2 ) ( b = 0 ∑ p − 1 x − b 2 ) ) 3 . If N is the desired number, then p N = F ( 1 ) + . . . + F ( ζ p − 1 ) where we define ζ = e p 2 π i . Observe that ( a = 0 ∑ p − 1 ζ k a 2 ) ( b = 0 ∑ p − 1 ζ − k b 2 ) = a , b ∑ ζ k ( a 2 − b 2 ) . Now, since the map ( a , b ) → ( a + b , a − b ) is bijective in ( Z / p Z ) 2 , this is equal to x , y ∑ ζ k x y = { p k = 0 p 2 k = 0 So, p N = p 6 + p 3 ( p − 1 ) ⟹ N = p 5 + p 2 ( p − 1 ) and we may conclude.
Problem Loading...
Note Loading...
Set Loading...
More generally, let f ( n ) denote the number of solutions to a 1 2 − b 1 2 + a 2 2 − b 2 2 + ⋯ + a n 2 − b n 2 ≡ 0 ( m o d p ) , where p is a odd prime.
For n = 1 , a 1 2 − b 1 2 ≡ 0 ( m o d p ) If b 1 ≡ 0 ( m o d p ) , then a 1 ≡ 0 ( m o d p ) . Otherwise, for each nonzero residue b 1 , there are two solutions a 1 , so f ( 1 ) = 1 + 2 ( p − 1 ) = 2 p − 1 .
Now, assume n ≥ 2 . Then a n 2 − b n 2 ≡ − ( a 1 2 − b 1 2 + ⋯ + a n − 1 2 − b n − 1 2 ) ( m o d p ) . By definition, there are f ( n − 1 ) solutions where the right-hand side is 0 modulo p . For each such solution, there are 2 p − 1 solutions in a n and b n , so there are ( 2 p − 1 ) f ( n − 1 ) solutions in this case.
Otherwise, there are p 2 n − 2 − f ( n − 1 ) solutions where the right-hand side is nonzero modulo p ; let the right-hand side be r . Then ( a n + b n ) ( a n − b n ) ≡ r ( m o d p ) . If we set c ≡ a n − b n , then a n + b n ≡ r c − 1 ( m o d p ) . This system has a unique solution in a n and b n .
There are p − 1 possible values of c , so there are ( p − 1 ) [ p 2 n − 2 − f ( n − 1 ) ] solutions in this case. Hence, f ( n ) = ( 2 p − 1 ) f ( n − 1 ) + ( p − 1 ) [ p 2 n − 2 − f ( n − 1 ) ] = p f ( n − 1 ) + ( p − 1 ) p 2 n − 2 .
This gives f ( 2 ) = p 3 + p 2 − p and f ( 3 ) = p 5 + p 3 − p 2 . In particular, for p = 2 0 2 7 , the answer is 2 0 2 7 5 + 2 0 2 7 3 − 2 0 2 7 2 = 3 4 2 1 9 1 2 0 9 7 3 0 4 3 8 6 1 .