Exercise 5.3

Suppose p a . Show that the number of solutions to a x 2 + bx + c 0 ( mod p ) is equal to 1 + ( ( b 2 4 ac ) p ) .

Answers

Proof. Here p is an odd prime number, and p a . Let N be the number of solutions of a x 2 + bx + c 0 ( mod p )

For x ¯ 𝔽 p = pℤ ,

a ¯ x ¯ 2 + b ¯ x ¯ + c ¯ = a ¯ ( x ¯ 2 + b ¯ a ¯ x ¯ + c ¯ a ¯ ) = a ¯ ( ( x ¯ + b ¯ 2 a ¯ ) 2 b ¯ 2 4 a ¯ c ¯ 4 a ¯ 2 )

Let Δ = b 2 4 ac . Then N is the number of solutions of ( x ¯ + b ¯ 2 a ¯ ) 2 Δ ¯ 4 a ¯ 2 = 0 ¯ in 𝔽 p . As in Ex.5.2, N = 1 if Δ ¯ = 0 ¯ , N = 0 if Δ ¯ is not a square in 𝔽 p , otherwise Δ ¯ = δ 2 , δ 𝔽 p , and the solutions are x ¯ = ( b ¯ ± δ ¯ ) 2 a ¯ , so N = 2 . In the three cases, N = 1 + ( Δ p ) . □

User profile picture
2022-07-19 00:00
Comments