Exercise 2.9.2 (Number of solutions modulo $p$)

Suppose that f ( x ) = a x 2 + bx + c , and that D = b 2 4 ac . Show that if p is an odd prime, p a , p D , then f ( x ) 0 ( mod p ) has exactly one solution. Show that if p is an odd prime, p a , p D , then the congruence f ( x ) 0 ( mod p ) has either 0 or 2 solutions, and that if x is a solution then f ( x ) 0 ( mod p ) .

Answers

Proof. Since p is odd, 2 has an inverse modulo p , which we write 2 1 , and since p a , a has an inverse modulo p , which we write a 1 (i.e. a a 1 1 ( mod p ) ).

Then

f ( x ) = a x 2 + bx + c a [ ( x + 2 1 a 1 b ) 2 2 2 a 2 D ] ( mod p ) .

(We may write this more readably f ( x ) a [ ( x + b 2 a ) 2 D 4 a 2 ] ( mod p ) ).

Since p is prime, and p a ,

f ( x ) 0 ( mod p ) ( x + 2 1 a 1 b ) 2 2 2 a 2 D ( mod p ) . (1)
If p D , f ( x ) 0 ( mod p ) ( x + 2 1 a 1 b ) 2 0 x 2 1 a 1 b ) .

Therefore the equation f ( x ) 0 ( mod p ) has exactly one solution modulo p , which is 2 1 a 1 b (this is the root of f ( x ) = 2 ax + b modulo p ).

If p D and D is not a square modulo p (i.e. ( D p ) = 1 ), then the equation (1) has no solution.
If p D and D is a square modulo p (i.e. ( D p ) = 1 ), then D δ 2 ( mod p ) for some integer δ , and f ( x ) 0 ( mod p ) ( x + 2 1 a 1 ( b δ ) ) ( x + 2 1 a 1 ( b + δ ) ) 0 ( mod p ) .

Therefore the equation f ( x ) 0 ( mod p ) has two solutions modulo p , which are 2 1 a 1 ( b δ ) , 2 1 a 1 ( b + δ ) . Since p D , then p δ , thus these solutions are distinct modulo p .

If x 2 1 a 1 ( b ± δ ) ( mod p ) is such a solution, f ( x ) = 2 ax + b = ± δ 0 ( mod p ) , since p δ . □

User profile picture
2024-05-18 09:08
Comments