 ### 课程日历

16节日挑战课程，每节课通过不同的数学问题学习新的知识内容

4节周挑战复习课程，集中解决周挑战测试中遇到的问题

2022年9月
1
2
3
4
5
6
7
8
9
10
11
12
14
15
17
18
19
21
22
24
25
26
28
29
2022年10月
1
2
3
5
6
8
9
10
12
13
15
16
17
19
20
22
23
24
26
27
29
30
31
2022年11月
2
3
5
6
7
9
10
12
13
14
16
17
19
20
21
22
23
24
25
26
27
28
29
30

### 课程大纲

LIVE在线直播课程每个模块包含16次日挑战Session（第1课到第16课）+ 4次周挑战复习课（Weekly Challenge 1到4）共20节课程。每四节日挑战Session结束后将有一次周挑战复习课，学生需要在复习课前进入Pre-Recorded课程完成周挑战测验。

Remainder mod 10; definition of modular congruency; notation of a modulo b; remainders of n²; modular addition, subtraction and multiplication; remainders modulo 11; negative remainders

Explanation and motivation for divisibility rules for 3 and 9 and shortcuts for their use; sum and average of an arithmetic progression; triangular numbers; modular multiplication

Explanation and motivation for divisibility rules for 2, 4, and 8 and shortcuts for their use; permutations; divisibility by 12; sum and average of arithmetic progression; negative remainders

Remainders after dividing by 99; factors; patterns in multiples of 9 mod 1; palindromic numbers; factors of 1001 and 1111; negative remainders; remainders mod 11; arithmetic progression

Prime factorization; number of factors; sum of factors; average of factors; sum of reciprocals of factors; product of factors; factors of 111; expanding factors; sum of consecutive powers of 2; geometric series

Number of zeroes at the end of combinatorial expressions such as factorial; modular multiplication; floor function; ways to choose n objects; sum of consecutive powers of 2;

Least Common Multiple (LCM); Greatest Common Divisor (GCD); prime factorization; product of LCM and GCD; quotient of LCM and GCD; factorials

Motivation for and examples of Euclidean Algorithm for finding GCD; Fibonacci numbers; factors of 111; relatively prime numbers

Relatively prime numbers; pattern of cycling remainders; remainders of multiples of 2, 3, 4, 5, 6, 7, 8 and 9; Venn diagram; Inclusion / exclusion; Euler's Totient Function

Chinese Remainder Theorem and use with composite moduli; negative remainders; solving sets of congruences; LCM; remainders of multiples of 6 mod 5; negative remainders

Chinese Remainder Theorem with non-relatively-prime moduli; remainders of multiples of 9 mod 12; cycles of remainders of multiples of 9; LCM; reduction of systems of congruences; unsolvable congruences

Systems of three congruences; Euler's Totient Function; remainders modulo composite numbers; pairwise relatively prime numbers; Venn diagram; factoring; combinatorial counting

Factoring tricks for solving algebraic equations; area and perimeter of rectangles; number of ways to factor; equations in 1/x; impossibility of division by 0; number of integers solutions to an equation

Remainders of powers; cycles of remainders of powers; pattern of last two digits of powers of 7; remainders of powers of 7 mod 4; power towers

Multiplicative inverses with respect to a modulus; explanation and motivation for divisibility trick for 7; repeating cycles of remainders

Terminating decimals and their fraction representations; repeating periods of repeating decimals; proof of why square root of 2 is irrational; prime factorization; proof techiques and directions of logic; proof by contradiction

### 启明星助教老师 ###### VIVIAN LOH 