(a) Try to use the methods in this chapter to compute the square root of 23 modulo 1279. (The number 1279 is prime.) What goes wrong?
(b) More generally, if p is an odd prime, explain why the methods in this chapter cannot be used to find square roots modulo p. We will investigate the problem of square roots modulo p in later chapters.
(c) Even more generally, explain why our method for computing kth roots modulo m does not work if gcd (k, φ(m) )> 1
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.