3.9, due October 18

Difficult:
     I couldn't follow the examples int he book very well. They kept using (p+1)/4=3 in the sample problems but I didn't know why other than that we used that in the proof of the theorem. I think I understand why it is supposed to work, but I'm not sure how we go about and actually find the square roots.  

Reflective:
     I'm not sure how this gets used in RSA. I understand that dealing with the modulus and large primes can be helpful but I don't know how this applies directly. I see how we want to use it to get the p and q of n, which than allows us to find d and decrypt messages. But it seems it only works on finding the square root of things.