Read Prime factorization of factorials
This IOQM pattern tests Finding smallest non-divisor of a factorial via prime bound. Identify the structure before calculating, then use the method below.
Number theory studies integers through divisibility, factors, residues and greatest-common-divisor structure.
Find the structure
Translate the statement into divisibility, factorisation, residues or a greatest-common-divisor condition before testing values.
Build a valid route
Simplify with a factorisation or congruence, then use bounds to keep any remaining cases finite and exact.
Verify the conclusion
Return to the exact wording and test the final conclusion against every stated condition. A clean calculation is not enough if it solves a different problem.
OlympIQ exam lens
- ✓Write the number-theory condition symbolically.
- ✓Factor or reduce modulo a useful base.
- ✓Check all boundary cases.
Never cancel a factor in a divisibility statement until you have checked the relevant coprimality condition.
Ready to try the pattern?
100% coverage across the linked question.
Practise the linked question