Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

This is essentially a two part problem.

Prove that $2^{4n+3} = 1$ (mod $8n+7$) with $8n+7$ a prime.

Using this prove that $2^{4019} - 1$ is not a Mersenne prime, $4019$ is a prime

For first part I got, $2^{4n+3} = a^{8n+6} = a^{\phi(p)} = 1 \pmod p = 1\pmod{8n+7}$

But how do I use this to prove $2^{4019} - 1$ not a Mersenne prime?

share|cite|improve this question
This has nothing to do with quadratic reciprocity. – Tim Ratigan Dec 19 '13 at 21:21
Maybe you have met the fact that $2$ is a quadratic residue of any prime of the form $8k\pm 1$. From that you can show that $2^{4019}\equiv 1\pmod {8039}$. This says that $8039$ divides $2^{4019}-1$. You may even have met in class exactly the same argument to show that $23$ divides $2^{11}-1$, or that $47$ divides $2^{23}-1$. – André Nicolas Dec 19 '13 at 23:30


$8039$ is prime

$8039\equiv 7\pmod 8$

$8039=2\cdot 4019+1$

share|cite|improve this answer
What is the difference between $=$ and $\equiv$? – Link Dec 19 '13 at 22:02
@Link "$\equiv$" is typically used for equivalence mod $m$, where as "$=$" is actual equality. For instance, $1\equiv 4\equiv 7\equiv 10\pmod 3$, but $1\ne4\ne7\ne10$. – Tim Ratigan Dec 19 '13 at 22:16

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

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