section 5.4.2, due November 30

The RSA algorithm was difficult for me to follow. I think I understood the very basic concept, but I got lost on most of the details. It's cool that all the things we've learned about primes come into play with this algorithm. I'm wondering how pseudoprimes and other special cases affect this code. Are they wise to choose? Unwise? I'd probably be able to figure that out myself had I understood it a bit better.