Number Theory Training Arena
An exhaustive, textbook-style pedagogical resource. Progress sequentially from foundational arithmetic axioms to rapid mental divisibility laws and hyper-advanced Math Olympiad speed shortcuts.
Absolute Basics · Foundational Axioms
The building blocks of integer arithmetic. Before deploying speed shortcuts, every competitor must solidify the conceptual core of primes, composites, and canonical factorization trees.
Prime vs. Composite Numbers
A prime number is an integer strictly greater than 1 whose only positive divisors are 1 and itself. A composite number possesses at least one divisor other than 1 and itself, meaning it can be fractured into smaller integer factors.
Crucial Note: The integer 1 is neither prime nor composite by definition. The number 2 is the only even prime in existence.
Fundamental Theorem of Arithmetic
Also known as the Unique Factorization Theorem: Every integer $n > 1$ can be represented as a product of prime numbers in exactly one way, disregarding the order of the multipliers.
Because prime decomposition is immutable and unique, factorization provides the mathematical "DNA" of every number. If two competitors factorize 360, both must inevitably derive $2³ \times 3² \times 5$.
Prime Factorization Trees
A factor tree decomposes a composite recursively into two convenient non-trivial factors until every terminal leaf is a prime atom.
• 6 → 2 × 3
• 10 → 2 × 5
Collate leaves: 2² × 3 × 5
Any initial branch split (e.g. $4 \times 15$ or $2 \times 30$) always converges to the exact same prime product.
Core Divisibility Rules · Case Studies (2 through 10)
Divisibility tests eliminate sluggish trial division. By inspecting terminal digits or modular digit sums, a competitor immediately isolates factors within 200 milliseconds.
Even Terminal Digit
Rule: The integer is divisible by 2 if and only if its last digit is even: {0, 2, 4, 6, 8}. Continuously divide by 2 until the remaining quotient becomes odd.
Sum of Digits Multiple of 3
Rule: If the sum of all digits is divisible by 3, the entire number is divisible by 3. Since 12 ÷ 3 = 4, 831 ÷ 3 = 277 (prime).
Last Two Digits Divisible by 4
Rule: Since 100 = 4 × 25, hundreds are always divisible by 4. Only inspect the last two digits. 24 ÷ 4 = 6 → 3,524 contains 2² = 4.
Terminal 0 or 5
Rule: Any integer ending in 0 or 5 contains 5 as a prime divisor. Divide 2,875 by 5 → 575; by 5 → 115; by 5 → 23 (yielding 5³ × 23).
Joint 2 and 3 Divisibility
Rule: 6 = 2 × 3. The number must be both even (divisible by 2) AND have a digit sum divisible by 3. 918 is even and 18 ÷ 3 = 6 → divisible by 6.
Last Three Digits Divisible by 8
Rule: Since 1,000 = 8 × 125, test the last 3 digits. 128 ÷ 8 = 16. Fast shortcut: If hundreds digit is odd, test if last 2 digits + 4 is divisible by 8 (28+4 = 32).
Digital Sum Multiple of 9
Rule: If the digital root is 9 (sum of digits divisible by 9), the number contains 3² = 9. 4,725 ÷ 9 = 525. Digit sum of 525 is 12 (not div by 9, but div by 3 → 525 ÷ 3 = 175 = 5² × 7).
Terminal Zero Isolation
Rule: Any integer ending in zero contains 10 = 2 × 5. Instantly slice off the trailing zero, record 2 × 5, and factor the remaining quotient (493 = 17 × 29).
Advanced Cognitive Strategy · Olympiad Peak Speed Mechanisms
Mastery heuristics utilized by Olympiad finalists to decompose integers in sub-second bursts without electronic calculators.
Strategy 01: Parity & Modulo 5 Isolation
Immediate extraction of powers of 2 and 5 by terminal digit inspection
Even Composite Stripping
When the last digit is {0, 2, 4, 6, 8}, divide continuously by 2. 360 → 180 → 90 → 45. Stripping 2³ drops the composite from 360 to an odd 45 in three quick mental operations.
Terminal 5 Factor Extraction
Any integer ending in 5 contains 5 as a divisor. 875 ÷ 5 = 175; 175 ÷ 5 = 35; 35 ÷ 5 = 7. Three consecutive divisions leave the single prime 7.
Decadic Zero Pairing (10 = 2 × 5)
Every trailing zero represents a factor of 10 = 2 × 5. Two trailing zeros in 4,200 immediately provide 2² × 5², leaving 42 = 2 × 3 × 7.
Odd Non-5 Quotient Isolation
Dividing 1,020 by 20 yields 51. Since 51 ends in 1, it has zero factors of 2 and 5. This allows immediate transition to Modulo 3 and digit sum tests.
Strategy 02: Sum of Digits & Modulo 9 Heuristics
Digital root heuristics for rapid identification of 3 and 3² = 9 divisors
Modulo 9 Digital Root Test
18 is divisible by 9, proving 1,458 contains 9. 1,458 ÷ 9 = 162. Digital sum of 162 is 1+6+2 = 9, so 162 ÷ 9 = 18. Thus 1,458 = 2 × 3⁶.
Modulo 3 Single Extraction
15 mod 9 = 6 ≠ 0, but 15 is divisible by 3. This guarantees exactly one initial factor of 3. 438 ÷ 3 = 146. Parity reveals 146 ÷ 2 = 73 (prime).
Casting Out Nines Shortcut
Cast out digits summing to 9 to accelerate mental checks: ignore 9, then 5+2+2 = 9. 9,522 is divisible by 9 → 9,522 ÷ 9 = 1,058 = 2 × 23².
Fast Elimination of Non-Multiples
11 mod 3 = 2. You instantly eliminate 3 and 9 from all factorization trees without ever attempting trial division. Move directly to primes ≥ 7.
Strategy 03: Fermat's Difference of Squares (a² - b²)
Decomposition of odd composites via algebraic difference of squares identity
Nearby Square Decomposition
899 is one less than 900 = 30². By the identity a² - b² = (a-b)(a+b), 899 = (30 - 1)(30 + 1) = 29 × 31. Solved in 2 seconds without trial division.
Two-Step Square Proximity
2,496 is four less than 2,500 = 50². Using a² - b², 2,496 = (50 - 2)(50 + 2) = 48 × 52. Further factor 48 = 2⁴ × 3 and 52 = 2² × 13 → 2⁶ × 3 × 13.
Twin Prime Factorization Clue
3,599 is one less than 3,600 = 60². Therefore 3,599 = (60 - 1)(60 + 1) = 59 × 61. Both 59 and 61 are prime numbers, completing the decomposition.
Fermat Iterative Testing
Ceiling root of 1,517 is 39 (39² = 1,521). 1,521 - 1,517 = 4 = 2². Thus 1,517 = 39² - 2² = (39 - 2)(39 + 2) = 37 × 41. Solved on the first Fermat step.
Zero-Timer Strategy Sandbox
Select a strategy model, enter any positive integer, and watch the step-by-step mathematical decomposition without timer pressure.