- Published on
Irrationality of Log Base n of n Plus One
- Authors

- Name
- Vu Hung
Problem Statement
Prove that for any integer , is irrational.
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 Contradiction
Step 1: Assume the negation
Assume, for contradiction, that is rational for some integer .
Then we can write:
where are positive integers.
Step 2: Convert to exponential form
By definition of logarithm:
Raising both sides to the power :
Step 3: Analyze modulo
Left side: (clearly divisible by )
Right side: By the Binomial Theorem:
All terms contain except the last term, so:
Step 4: Derive contradiction
From , we have modulo :
This means , so .
For , this is impossible.
Conclusion
The assumption that is rational leads to a contradiction.
Therefore, is irrational for all integers .
\hfill
Takeaways
- Logarithm to Exponential: Converting to enables algebraic manipulation
- Modular Analysis: Working mod reveals contradiction: LHS but RHS
- Binomial Expansion: since only constant term survives
- Non-standard Irrationality: Unlike proofs, this uses modular arithmetic rather than prime factorization
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 Complex Numbers: https://vumaths.com/booklets/hsc-complex-numbers/
- HSC Probability: https://vumaths.com/booklets/hsc-probability/
Connect with me
If you're eager for more HSC Maths insights, be sure to check out my Website - Vu's Maths Hub. For deeper dives and regular tips, join my LinkedIn. Let's tackle these challenging math problems together! You can also catch my daily math content on Substack.
