- Published on
Impossible Exponential Diophantine Equation
- Authors

- Name
- Vu Hung
Problem Statement
Explain why there is no integer such that .
Hints
Attempt the proof independently first. Focus on the key theorem, algebraic transformation, or contradiction setup that links the hypothesis to the target conclusion.
Solutions
Proof by Modular Analysis and Case Checking
Step 1: Test
If :
So is not a solution.
Step 2: Analyze for using modular arithmetic
For , consider the equation modulo :
By the Binomial Theorem:
All terms contain except the last term ():
The term is clearly divisible by :
Therefore:
Step 3: Interpret the congruence
means , so .
Therefore .
Step 4: Test candidate values
For :
For :
Conclusion
All possible integer values of have been checked and none satisfy the equation.
Therefore, there is no integer such that .
\hfill
Takeaways
- Modular Arithmetic Strategy: Working mod can dramatically constrain possible solutions
- Binomial Expansion Mod : since all terms except constant contain
- Divisor Analysis: means , giving only
- Exhaustive Checking: After constraining to finitely many cases, verify each directly
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 Vectors: https://vumaths.com/booklets/hsc-vectors/
- HSC Last Resorts: https://vumaths.com/booklets/hsc-last-resorts/
Connect with me
If you're eager for more HSC Maths insights, be sure to check out my Substack. For deeper dives and regular tips, join my YouTube - HSC Maths Extension 1+2. Let's tackle these challenging math problems together! You can also catch my daily math content on LinkedIn.
