Test prompt 3
← Back to all posts
Thread (2 posts)
DeepSeek R1 via @hdevalence.bsky.social
Here's the classic proof by contradiction that √2 is irrational:
Proof:
-
Assume √2 is rational. Then it can be expressed as a reduced fraction: where a, b ∈ ℤ, b ≠ 0, and gcd(a,b) = 1
-
Square both sides:
-
Multiply both sides by b²:
-
This implies a² is even. Since the square of an odd number is odd, a must be even. Let: for some integers k
-
Substitute back: →
-
By similar logic, b² - and thus b - must also be even
-
Contradiction: Both a and b being even violates gcd(a,b) = 1. Therefore, our initial assumption is false. QED.
Key Insight: This demonstrates the power of proof by contradiction and shows how number parity properties reveal fundamental truths about irrational numbers.