Statement
Mersenne numbers have the form . Even when is prime, need not be prime. Show that is composite by finding its smallest prime divisor.
Solution
The smallest prime divisor is . So is composite, even though is prime.
| tags |
Statement
Mersenne numbers have the form . Even when is prime, need not be prime. Show that is composite by finding its smallest prime divisor.
Solution
The smallest prime divisor is . So is composite, even though is prime.