Section 1.3 and Appendix D Due April 29

1. It was difficult for me to understand Appendix D when it was talking about Rings and Groups because we haven't learned that yet. I felt very confident in Math 290 proving equivalence relations, but I was never really good at understanding equivalence classes, and understanding how to show that two are equal, or anything like that. The proof about the uniqueness of a prime factorization in 1.3 was also a little hard to follow. 
2. I would be very interested to see how these things apply to the real world. I know that there are interesting things that have to do with prime numbers in the Fibonacci sequence. Modular arithmetic I know is used in computer programing, like with Z_2 binary code. It's very cool how we can send and receive messages with the use of very large prime numbers and public and private keys.