- Published on
Parity of a Difference of Squares
- Authors

- Name
- Vu Hung
Problem Statement
Prove that if are integers, then is even if and only if at least one of and is even.
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
Biconditional Proof
Step 1: Factor the expression
This factorization will be used in both directions.
Forward Direction (): If is even, then at least one of or is even.
Proof:
Since is even, the product is even.
A product of two integers is even if and only if at least one factor is even.
Therefore, at least one of or must be even. \blacksquare
Reverse Direction (): If at least one of or is even, then is even.
Proof:
We consider two cases:
Case 1: is even.
Write for some integer .
Then:
Since is an integer, is even.
Case 2: is even.
Write for some integer .
Then:
Since is an integer, is even.
In both cases, is even. \blacksquare
Conclusion:
Both directions proven, therefore:
Takeaways
- Factorization First: Factoring immediately connects to parity of factors
- Product Parity: Product even at least one factor even (fundamental parity property)
- Case Analysis: Reverse direction handles two cases (either factor even) separately
- Note on Parity: Actually, and always have same parity (both even or both odd), so "at least one even" is equivalent to "both even"
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 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 Instagram. 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 Website - Vu's Maths Hub.
