Question: 1. Encrypt the message can you tell me how to get to Sesame Street twice, once using the standard Vigen`ere cipher and once using the original Vigen`ere cipher, both with key word susan.
2. Show that if you choose k integers arbitrarily, then at least two of them will have the same the same remainder on division by k-1. (What principle did you use in solving this problem)?