The answer to exercise marked [BB] can be found in the Back of the Book.
(a) Find all integers x, 0 ≤ x < n, that satisfy each of the following congruences.
i. x2≡ 1 (mod n), n = 5
ii. x2 ≡ 1 (mod n), n = 7
iii. x2 ≡ (mod n), n = 13
(b) [BB] Suppose p ≠ 2is a prime. Find all integers x, 0 ≤ x < p, such that x2 ≡ 1 (mod p).
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.