5.3 up to section 5.3.1, due November 17

I had no idea the numbers that are considered to be "small" for a computer were actually so big! When they were using Fermat's theorem to see if a number could be prime, I got confused because they were looking to see if 2^11386 was 1 mod 11387, but it didn't look like they ever actually found that because they had 2^11387. It's easy to find from there but why did they stop there? At first I was all excited because someone made fermat's deterministic, but as soon as I read it I was disappointed cause it'll still take forever. This concept is a little frustration because we have proved a million ways that there are infinitely many primes and yet we don't know how to find very many of them.