Basic Contradiction Proofs with Integers
Ever wondered why there's no "biggest" odd number? Proof by contradiction makes this crystal clear. You start by assuming there IS a greatest odd integer n, then show this assumption creates chaos.
Here's the magic: if n is the greatest odd number, then n+2 (which is definitely bigger than n) should also be odd. Since odd + even = odd, we've just found an odd number larger than our "greatest" one - contradiction! This technique works brilliantly for proving there's no upper limit to odd integers.
The same logic applies to proving relationships between even and odd numbers. When you assume n² is even but n is odd, you can write n as 2k+1. Squaring this gives you 4k²+4k+1 = 2+1, which is clearly odd - contradicting your assumption that n² is even.
Key Insight: Always express odd numbers as 2k+1 and even numbers as 2k - this algebraic form makes contradictions obvious when you do the maths.
You'll master this technique quickly once you see the pattern: assume the opposite, do some algebra, spot the contradiction, then conclude the original statement must be true. It's particularly effective for proving properties about infinite sets like prime numbers, where direct proof would be impossible.
