Chapter 1: 36E (page 51)
1.36. Square roots. In this problem, we'll see that it is easy to compute square roots modulo a prime pwith .
(a) Suppose . Show that is an integer.
(b) We say x is a square root of a modulo p if . Show that if and if a has a square root modulo p, then is such a square root.
Short Answer
- is showed as integer.
- It is proved that, if and if a has a square root modulo p, then is such a square root is depicted.