Euler's totient function and more number-theoretic functions
NT problems including showing there are infinitely many 4k+1 primes.
The useful Lifting the Exponent Lemma, which states that for odd prime p and m,n such that p|(m-n), vp(m^p-n^p) = vp(m-n)+1.
Techniques for solving equations with the constraint that the variables must take integer values.
Review of NT, review of counting and intro to combinatorial identities.
No in-person class