Nice Math Proof - page 7

Prove that if 2n - 1 is prime ,then so is n

Proof

Let z = an -1 Clearly z = (a-1)(an-1 + an-2 + ..+ a + 1) when a is not 2.

Therefore z is always composite if a > 2

If a = 2 and n is even then clearly n = 2v so that z = (2v +1)(2v -1)

If a = 2 and n is uneven , but composite then let n = bc

so that z = 2bc -1 = fc - 1 where f = 2b

It is clear that f is not 2 and that fc - 1 is therefore composite.

Therefore if 2n - 1 is prime then n is not even or odd composite because then 2n - 1 would be composite.

It follows then that n must be prime if 2n - 1 is prime.

 


Back to page 1

Back to page 6


Hosted by www.Geocities.ws

1