1. FreeBSD provides a command primes(6) so that it is convenient for you to type "primes 2 100" to generate prime numbers between 2 and 100.
2. In the original RSA paper, the Euler totient function φ(n) = (p − 1)(q − 1) is used instead of λ(n) = lcm(p − 1, q − 1) = (p − 1)(q − 1) / gcd(p − 1, q − 1). Discuss whether this will make any difference.
3. Is it always necessary to choose two DISTINCT prime numbers? (What will happen if you choose p=q?)
4. Activity:

   Name	Public Key	Ciphertext 1	Ciphertext 2	Ciphertext 3
   Alice	(