Logo
Published on

Mersenne Prime Exponent Cannot Be Even

Authors
  • avatar
    Name
    Vu Hung
    Twitter

Problem Statement

Prove that for all integers n≥3n \geq 3, if 2n−12^n - 1 is prime, then nn cannot be even.


Hints

Use proof by contrapositive. Instead of proving "P  ⟹  QP \implies Q", prove "¬Q  ⟹  ¬P\neg Q \implies \neg P".

That is, prove: "If nn is even (and n≥3n \geq 3), then 2n−12^n - 1 is composite."

Write n=2kn = 2k and factor 22k−12^{2k} - 1 as a difference of squares.


Solutions

Proof by Contrapositive:

We prove the contrapositive: If nn is even (with n≥3n \geq 3), then 2n−12^n - 1 is composite.

Assume nn is even. Then n=2kn = 2k for some integer kk.

Since n≥3n \geq 3 and nn is even, we have n≥4n \geq 4, so k≥2k \geq 2.

Substitute:

2n−1=22k−1=(2k)2−122^n - 1 = 2^{2k} - 1 = (2^k)^2 - 1^2

Factor as difference of squares:

2n−1=(2k−1)(2k+1)2^n - 1 = (2^k - 1)(2^k + 1)

Since k≥2k \geq 2:

  • 2k≥42^k \geq 4, so 2k−1≥3>12^k - 1 \geq 3 > 1
  • 2k≥42^k \geq 4, so 2k+1≥5>12^k + 1 \geq 5 > 1

Both factors are integers strictly greater than 11, so their product is composite.

Therefore, 2n−12^n - 1 is composite.

By contrapositive, if 2n−12^n - 1 is prime, then nn cannot be even. ■\blacksquare

Note: This is why Mersenne primes have the form 2p−12^p - 1 where pp itself is prime (though not all such numbers are prime).


Takeaways

  • 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:


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 Substack. Let's tackle these challenging math problems together! You can also catch my daily math content on Website - Vu's Maths Hub.