2.25. Suppose n = pq with p and q distinct odd primes. (a) Suppose that gcd(a, pq) = 1. Prove that if the equation x2 ≡ a (mod n) has any solutions, then it has four solutions. (b) Suppose that you had a machine that could find all four solutions for some given a. How could you use this machine to factor n?Hoffstein, Jeffrey. An Introduction to Mathematical Cryptography (Undergraduate Texts in Mathematics) (p. 112). Springer New York. Kindle Edition.

answer:

your answer is d

Step-by-step explanation:

the answer is c.

for continuous functions, they continue in the same pattern and you have to find that pattern kinda like slope

step-by-step explanation:

consider an orange peel: if you want to try and lay it flat, you have to stretch it, we know exactly how things are being stretched or squashed at any given point. we have many different map projections because each has different patterns of some projections can even preserve certain features of the earth without