- Published on
Contradiction with a + b <= 5
- Authors

- Name
- Vu Hung
Problem Statement
Prove by contradiction that if are integers and , then or .
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 of the conclusion
We want to prove: If , then or .
Assume the conclusion is false. The negation of `` or '' is:
Step 2: Apply the integer constraint
Since and are integers with and , we must have:
(The smallest integer greater than 2 is 3.)
Step 3: Derive a contradiction
Adding these inequalities:
But this contradicts our hypothesis that .
We cannot have both and simultaneously.
Conclusion
Since assuming the negation of the conclusion leads to a contradiction, the conclusion must be true.
Therefore, if are integers with , then or .
\hfill
Takeaways
- **Negating
Or'' Statements:** The negation ofor '' is ``not AND not '' - Integer Constraints: For integers, implies (no integers strictly between 2 and 3)
- Contradiction Structure: Derive statement that directly contradicts a hypothesis (here: vs )
- Logical Form: Statement has form ; negate conclusion to get
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 Last Resorts: https://vumaths.com/booklets/hsc-last-resorts/
- HSC Sequences: https://vumaths.com/booklets/hsc-sequences/
Connect with me
If you're eager for more HSC Maths insights, be sure to check out my GitHub. For deeper dives and regular tips, join my Substack. Let's tackle these challenging math problems together! You can also catch my daily math content on Website - Vu's Maths Hub.
