Exercise 5.7

By calculating directly show that the number of solutions to x 2 y 2 a ( mod p ) is p 1 if p a , and 2 p 1 if p a . (Hint. Use the change of variables u = x + y , v = x y .)

Answers

Proof. Let S = { ( x ¯ , y ¯ ) 𝔽 p 2 | x ¯ 2 y ¯ 2 = a ¯ } , and T = { ( u ¯ , v ¯ ) 𝔽 p 2 | u ¯ v ¯ = a ¯ } . Then f : { S T ( x ¯ , y ¯ ) ( x ¯ + y ¯ , x ¯ y ¯ ) is well defined (if ( x ¯ , y ¯ ) S , ( x ¯ y ¯ ) ( x ¯ + y ¯ ) = a , so ( x ¯ + y ¯ , x ¯ y ¯ ) T ). Moreover f is a bijection, with inverse ( u ¯ , v ¯ ) ( ( u ¯ + v ¯ ) 2 , ( u ¯ v ¯ ) 2 ) , so | S | = | T | .

We compute | T | .

Suppose that p a , so a ¯ 0 ¯ . For v ¯ = 0 , there is no solution, and for each v ¯ 0 , we obtain the unique solution ( a ¯ v ¯ 1 , v ¯ ) , so there exist p 1 solutions.

Suppose that p a . The solutions of u ¯ v ¯ = 0 ¯ are ( 0 ¯ , 0 ¯ ) if u ¯ = v ¯ = 0 ¯ , ( 0 ¯ , v ¯ ) for each v ¯ 0 ¯ , and ( u ¯ , 0 ¯ ) for each v ¯ = 0 ¯ , that is to say N = 1 + ( p 1 ) + ( p 1 ) = 2 p 1 solutions.

Conclusion :

Card { ( x ¯ , y ¯ ) 𝔽 p 2 | x ¯ 2 y ¯ 2 = a ¯ } = p 1 if p a = 2 p 1 if p a
User profile picture
2022-07-19 00:00
Comments