5.1 and section 5.2 through the top of page 202, due November 15

I'm glad we're finally getting closer to being able to effectively test whether or not a number is prime. This section is interesting because it gives insight into how computers test for prime numbers.  The sieve method just looks like what anyone naturally does when checking for primes. I guess it's nice because you end up with a compiled list rather than doing the process for each number. The next example was a little bit confusing to me because I thought they were finding primes again but then it made more sense when I realized that they weren't trying to do that. This was about as far as my understanding extended. Theorem 5.2.1 didn't make sense to me and I think it is partly because there is the greatest integer function and a sum (i'm tired of doing sums). I can compute numbers in this formula but I don't follow the proof because I don't understand how to interpret it.