Overview
Advanced number theory uses structure in modular arithmetic and prime powers. Orders and lifting techniques often simplify exponent problems.
Key Ideas
- If , the least such is the order of mod .
- LTE (lifting the exponent) helps with when divides .
- Factorization and parity arguments are constant companions.
Core Skills
Use Orders
If , then divides when .
Apply LTE Safely
Check the hypotheses for LTE: typically and .
Combine Moduli
Use CRT to combine congruences after working modulo prime powers.
Worked Example
Find the largest with .
Because , LTE gives . So .
More Examples
Example 1: Order
Find the order of modulo .
, , , so the order is .
Example 2: LTE
Find .
Since , LTE gives .
Example 3: CRT
Solve , .
.
Strategy Checklist
- Compute orders when exponents are involved.
- Verify LTE conditions before applying it.
- Use CRT to combine prime-power congruences.
Practice Problems
| Status | Source | Problem Name | Difficulty | Tags | ||
|---|---|---|---|---|---|---|
| AIME | Very Hard | Show TagsModular Arithmetic, Orders | ||||
| AIME | Very Hard | Show TagsDiophantine, LTE | ||||
| Berkeley Math Circle Monthly Contest 2 | Hard | Show TagsModular Arithmetic, Quadratic residues | ||||
| Berkeley Math Circle: Monthly Contest 6 | Hard | Show TagsInclusion-exclusion, Quadratic residues | ||||
| Berkeley Math Circle | Hard | Show TagsFactorization techniques, Greatest common divisors (gcd), Modular Arithmetic, Multiplicative order, Quadratic residues, Techniques: modulo, size analysis, order analysis, inequalities | ||||
| Berkeley Math Circle | Hard | Show TagsModular Arithmetic, Pigeonhole principle, Quadratic residues | ||||
| Harvard-MIT Mathematics Tournament, Team Round B | Hard | Show TagsFactorization techniques, Quadratic residues | ||||
| USAMO | Hard | Show TagsChinese remainder theorem, Factorization techniques, Greatest common divisors (gcd), Polynomials, Prime numbers, Quadratic residues | ||||
| RMM | Hard | Show TagsFermat / Euler / Wilson theorems, Prime numbers, Quadratic residues | ||||
| HMMT November 2013 | Hard | Show TagsModular Arithmetic, Prime numbers, Quadratic residues | ||||
| HMMT November 2014 | Hard | Show TagsChinese remainder theorem, Prime numbers, Quadratic residues | ||||
| IMO Team Selection Test | Hard | Show TagsInverses mod n, Prime numbers, Quadratic residues | ||||
| HMMT November 2014 | Hard | Show TagsChinese remainder theorem, Fermat / Euler / Wilson theorems, Quadratic residues, Recurrence relations | ||||
| HMMT February | Hard | Show TagsQuadratic residues, Recursion, bijection | ||||
| Berkeley Math Circle | Hard | Show TagsPrime numbers, Quadratic residues | ||||
| HMMT February 2015 | Hard | Show TagsChinese remainder theorem, Field Theory, Polynomials mod p, Quadratic residues | ||||
| HMMT February 2016 | Hard | Show TagsPolynomials mod p, Quadratic residues | ||||
| February 2017 | Hard | Show TagsFermat / Euler / Wilson theorems, Polynomials mod p, Quadratic residues, Recursion, bijection | ||||
| February 2017 | Hard | Show TagsFactorization techniques, Fermat / Euler / Wilson theorems, Prime numbers, Quadratic residues | ||||
| February 2017 | Hard | Show TagsField Theory, Polynomials mod p, Quadratic residues, Recurrence relations | ||||
| HMMT February 2020 | Hard | Show TagsQuadratic reciprocity, Quadratic residues | ||||
| HMIC | Hard | Show TagsAlgebraic properties of binomial coefficients, Fermat / Euler / Wilson theorems, Generating functions, Polynomials mod p, Quadratic residues | ||||
| HMMT February 2020 | Hard | Show TagsPrime numbers, Quadratic forms, Quadratic reciprocity, Quadratic residues | ||||
| Berkeley Math Circle: Monthly Contest 4 | Hard | Show TagsFermat / Euler / Wilson theorems, Quadratic residues | ||||
| HMMT February 2022 | Hard | Show TagsModular Arithmetic, Quadratic residues | ||||
Module Progress:
Join the Discord Community!
Stuck on a problem, or don't understand a module? Join the Discord and get help with your doubts while making more math friends.
