Homework for Number Theory

MA 261 Section 001
Spring 2021
Max Kutler

Monday, 1/25: Setting the stage
Wednesday, 1/27: Introduction to proofs
Friday, 1/29: Introduction to proofs; presentations
Monday, 2/1: Introduction to LaTeX, Divisibility
Wednesday, 2/3: Divisibility
Friday, 2/5: Congruence modulo n
Monday, 2/8: Congruence modulo n (continued)
Wednesday, 2/10: Congruence modulo n (continued), Induction
Friday, 2/12: Divisibility criteria, axioms
Monday, 2/15: The division algorithm
Wednesday, 2/17: Exam 1
Friday, 2/19: The division algorithm, common divisors
Monday, 2/22: Greatest common divisors, Euclidean Algorithm
Wednesday, 2/24: Induction
Friday, 2/26: Induction
Monday, 3/1: Induction
Wednesday, 3/3: Strong Induction
Friday, 3/5: Linear Diophantine equations
Monday, 3/8: Linear Diophantine equations
Wednesday, 3/10: Linear Diophantine equations
Friday, 3/12: Linear Diophantine equations
Monday, 3/15: Least common multiple
Wednesday, 3/17: Exam 2
Friday, 3/19: Re-assessment
Monday, 3/22: Primes
Wednesday, 3/24: Primes
Monday, 3/29: Fundamental Theorem of Arithmetic
Wednesday, 3/31: Applications of FTA
Friday, 4/2: Applications of FTA
Monday, 4/5: Applications of FTA
Wednesday, 4/7: Applications of FTA
Friday, 4/9: The infinitude of primes
Monday, 4/12: Mersenne and Fermat primes
Wednesday, 4/14: Exam 3
Friday, 4/16: Powers modulo n
Monday, 4/19: Residue systems
Wednesday, 4/21: Linear Congruences
Friday, 4/23: Systems of linear Congruences
Monday, 4/26: Chinese remainder theorem
Wednesday, 4/28: The order of an integer modulo n
Friday, 4/30: Towards Fermat's Little Theorem
Monday, 5/3: Fermat's Little Theorem