2.2, due January 12

Modular Arithmetic? Hooray! I thought this was one of the coolest parts of MATH290 and was so excited to use it again. My FHE brother mocked my excitement, but he just doesn't understand how cool it really is.  It's so cryptic and yet simple.  The only tricky thing is finding the equivalent congruence class.  Sometimes I forget that [0]=[n] so I'll create an extra congruence class for [n], but this can be easily solved if you create congruence classes based off of the remainder term in the Division Algorithm.  Modular arithmetic seems like it would be very useful in creating numerical codes for security or personal information because you only have n congruence classes but these classes contain every posssible integer.  Modular arithmetic is so fascinating!