Parity Obstruction in Pythagorean Triples

#hsc-maths#proofs#medium

Parity (odd/even) arguments are a fundamental tool in the HSC Proofs topic, appearing from Extension 1 through to Extension 2. In this problem we use a contradiction argument to show that a Pythagorean triple cannot have both smaller legs even while the hypotenuse is odd. By carefully tracking the parity of squares, you’ll see how a simple algebraic substitution can quickly expose an inconsistency — a pattern you can apply to many other number-theoretic proofs.

Problem Statement

Prove that there is no Pythagorean triple (a,b,c)(a, b, c) where aa and bb (the two smallest numbers) are both even and cc (the largest number) is odd.


Hints

Use proof by contradiction. Assume such a triple exists with a=2ka = 2k and b=2mb = 2m (both even) and cc odd.

Substitute into the Pythagorean equation a2+b2=c2a^2 + b^2 = c^2 and analyze the parity of c2c^2. What can you conclude about the parity of cc?


Solutions

Proof by Contradiction:

Assume there exists a Pythagorean triple (a,b,c)(a, b, c) where:

  • a2+b2=c2a^2 + b^2 = c^2
  • aa and bb are both even
  • cc is odd

Since aa and bb are even, write a=2ka = 2k and b=2mb = 2m for integers k,mk, m. We can now substitute these expressions into the Pythagorean equation to isolate a factor of 44 on the left‑hand side.

Substitute into Pythagorean equation:

(2k)2+(2m)2=c24k2+4m2=c24(k2+m2)=c2\begin{aligned} (2k)^2 + (2m)^2 &= c^2 \\ 4k^2 + 4m^2 &= c^2 \\ 4(k^2 + m^2) &= c^2 \end{aligned}

The resulting equation shows c2c^2 is a multiple of 44, so c2c^2 is certainly even. This is the crucial observation that lets us test the parity of cc itself.

Analyze parity of c2c^2:

The equation shows c2=4(k2+m2)c^2 = 4(k^2 + m^2), which is a multiple of 44.

In particular, c2c^2 is divisible by 22, so c2c^2 is even.

But if cc itself is odd, what would its square be? Let’s check directly.

Derive parity of cc:

If cc were odd, then c=2n+1c = 2n+1 for some integer nn, and:

c2=(2n+1)2=4n2+4n+1=2(2n2+2n)+1c^2 = (2n+1)^2 = 4n^2 + 4n + 1 = 2(2n^2 + 2n) + 1

This shows c2c^2 would be odd, contradicting that c2c^2 is even.

Therefore, cc must be even.

We have arrived at a contradiction: we started by assuming cc is odd, but the algebra forced cc to be even. No such Pythagorean triple can exist.

Contradiction:

We derived that cc must be even, which contradicts our assumption that cc is odd.

Hence, no such Pythagorean triple exists. \blacksquare


Takeaways

  • Proof by contradiction often succeeds when a simple invariant such as parity can force an inconsistency from the assumed conditions.
  • Reconstruct the full proof from the hint and the solution outline, and justify every transformation explicitly.
  • Check edge cases and verify where each assumption is used in the argument.

Further Readings

If you found this proof interesting, be sure to check out these relevant HSC booklets to sharpen your reasoning skills: HSC Proofs, HSC Distributions, HSC Last Resorts

Written by Vu Hung Nguyen

Mathematics Educator · LinkedIn · About