Take the 2-minute tour ×
Cryptography Stack Exchange is a question and answer site for software developers, mathematicians and others interested in cryptography. It's 100% free, no registration required.

How can I see if $2^{333}-1 $ is a prime number?

Does this have to do with Mersenne prime numbers ($2^n-1$) ??

Thank you!

share|improve this question

closed as too localized by Thomas, mikeazo Jan 31 '13 at 21:42

This question is unlikely to help any future visitors; it is only relevant to a small geographic area, a specific moment in time, or an extraordinarily narrow situation that is not generally applicable to the worldwide audience of the internet. For help making this question more broadly applicable, visit the help center. If this question can be reworded to fit the rules in the help center, please edit the question.

Ask Wolfram|Alpha! –  Thomas Jan 31 '13 at 21:13

2 Answers 2

up vote 5 down vote accepted

No, $2^{333} - 1$ cannot be a prime. It is easy to see this via the exponent, $333$, which has factorization $3\cdot3\cdot37$. From this we know, by a well-known identity, that

$$ 2^{333} - 1 = (2^{37} - 1)\cdot (1 + 2^{37} + 2^{37\cdot2} + 2^{37\cdot3} + 2^{37\cdot4} + 2^{37\cdot5} + 2^{37\cdot6} + 2^{37\cdot7} + 2^{37\cdot8}). $$

share|improve this answer
It's also divisible by $2^3 - 1 = 7$ by the same argument. i.e. It's not even close to prime. –  Joe Z. Feb 1 '13 at 20:38

No it's not prime. Its prime factorization (in ascending order) is


share|improve this answer
Source:mathematica (and wolframalpha can do it too) –  AFS Jan 31 '13 at 21:20

Not the answer you're looking for? Browse other questions tagged or ask your own question.