3.5-3.7

I thought the cool part about this section was fermat's little theorem and how it applies to numbers modulo another number that have gcd of 1 respective to each other. It was really neat how you can do a really big exponent modulo that number much faster by using the theorem to reduce the number significantly. I wasn't quite too strong on how the theorem works since I didn't really get how it went from the prime to just the gcd of one part.