Professional Documents
Culture Documents
HW1 Solution
HW1 Solution
HW1 Solution
mod n.
Solution: First, for any prime number p > 2, x2 = 1 mod p only has exactly two different solutions.
When n = p1 p2 pk , where pi s are different prime numbers larger than 2, we can write x2 = 1
mod n as x2 = 1 mod (p1 p2 pk ).
Now we want to show that (i) x2 = 1 mod (p1 p2 pk ) is equivalent to a set of equations (ii):
2
x
= 1 mod p1
2
x
= 1 mod p2
2
x
= 1 mod pk
First, it is trivial that (i) implies (ii), so we skip this part. Next, we want to show (ii) implies (i). By
the Chinese remainder theorem, we know that there is one solution and only one solution of x2 in the
range of [1, n = p1 p2 pk ], and we also know that x2 is a solution of (i), which show that the
solution actually is the same both for (i) and (ii). So we have built the equivalence.
For each of the equations in the set there are two different solutions for x, so combine them together
we will have exactly 2k different solutions for x in (i) by solving by Chinese Remainder Theorem.
6. Let integer p be an odd prime number and p does not divide b. Then prove the following statements
(a) b is a quadratic residue of p if and only if b
Solution:
p1
2
= 1 mod p.
p1
p1
p1
2
= 1 mod p.
p1
p1
(b) (5 points) If p = 3 mod 4, then x1 = a 4 mod p, and x2 = p x1 are the only two solutions.
Solution: Since we have proved that there can be and only be two solutions when p is a odd
prime. So we only need to prove that the two roots holds for a = x2 mod p.
p+1
p+1
p1
p1
2
= 1 mod p.
p1
p+3
p1
p1
4
p+3
8
p1
p5
p5
p5
8
mod p, and x2 = p x1
p1
p1
p1