- Published on
Consecutive Divisibility Is Impossible
- Authors

- Name
- Vu Hung
Problem Statement
Prove that for positive integers with , either is not divisible by or is not divisible by (or both).
Hints
Use proof by contradiction. Assume both and . What does this tell you about ? What can you conclude about ?
Solutions
Proof by Contradiction:
The statement is equivalent to: "It is not the case that both and ."
Assume, for contradiction, that both and .
Then there exist integers and such that:
Subtracting the first equation from the second:
Let . Then , which means divides .
Since is a positive integer, the only positive divisor of is itself. Therefore, .
This contradicts the given condition that .
Hence, our assumption must be false, and at least one of or is not divisible by .
Takeaways
- Reconstruct the full proof from the hint and the solution outline, and justify every transformation explicitly.
- Check edge cases and verify where each assumption is used in the argument.
Further Readings
If you found this proof interesting, be sure to check out these relevant HSC booklets to sharpen your reasoning skills:
- HSC Proofs: https://vumaths.com/booklets/hsc-proofs/
- HSC Differential Equations: https://vumaths.com/booklets/hsc-differential-equations/
- HSC Trigonometry: https://vumaths.com/booklets/hsc-trigonometry/
Connect with me
If you're eager for more HSC Maths insights, be sure to check out my LinkedIn. For deeper dives and regular tips, join my Instagram. Let's tackle these challenging math problems together! You can also catch my daily math content on YouTube - HSC Maths Extension 1+2.
