Book: Introduction To Number Theory Time Commitment
Book: Introduction To Number Theory Time Commitment
Introduction to Number Theory covers fundamental principles of number theory, including primes and
composites, divisors and multiples, divisibility, remainders, modular arithmetic, and number
bases.
This course is specifically designed for high-performing students and draws material from many
programs for top middle and high school students in the country. Our philosophy is that students
develop more by learning to solve problems they haven’t seen before, as opposed to offering repeated
drills that students can memorize their way through. In this way, our classes are structured much more
like courses at top-tier colleges.
Book: Introduction to Number Theory, by Mathew Crawford
Time Commitment: This 12-week course includes 1.5 in-class hours and 3-5 hours of homework each
week, corresponding to a half year course.
Grading: 40% Alcumus homework, 35% Short-Answer Challenge Problems, 20% Writing Challenge
Problems (proofs), and 5% Class Participation. Alcumus is the AoPS online learning system that
adjusts to student performance to deliver appropriate problems and lessons.
Content:
Week Topic
1 Integers, Fractions, Decimals, and Number Bases
2 Base Number Arithmetic
3 Multiples, Divisors, and Prime Numbers
4 Common Factors, Common Multiples, Euclidean Algorithm
5 Divisor Problems, More with the Euclidean Algorithm
6 Factorials, Special Integers, Algebra with Integers
7 Units Digit, Introduction to Modular Arithmetic
8 Calculations with Modular Arithmetic
9 Divisibility Rules and Multiplicative Inverses
10 Multiplicative Inverses, Solving Linear Congruences
11 Systems of Linear Congruences and the Chinese Remainder Theorem
12 Number Sense and Applications of Number Theory
Sample Problems:
I The product of any two of the positive integers 30, 72, and N is divisible by the third. What is the
smallest possible value of N ?
I Find the units digit of n given that mn = 336 and m has a units digit of 7.
I A natural number leaves a remainder of 1 when divided by 9, a remainder of 7 when divided by 11,
and a remainder of 10 when divided by 12. Find the remainder when the number is divided by 66.