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 the theorem I need to show: "Let $q$ be a prime of the form $4k+3$. If $2q+1$ is prime, then $2q+1$ divides $2^q−1$."

I need to show this to show that $2^{251} - 1$ is not a Mersenne Prime.

share|cite|improve this question
up vote 3 down vote accepted

Since $p=2q+1$ is a prime of the form $8k+7$, it follows that $2$ is a quadratic residue of $p$. (Recall that $2$ is a quadratic residue of the odd prime $p$ iff $p$ is of the form $8k\pm 1$.)

Thus by Euler's Criterion, $2^{(p-1)/2}\equiv 1\pmod{p}$, and therefore $2^q\equiv 1\pmod{p}$. This says that $p$, that is, $2q+1$, divides $2^q-1$.

Note that $2q+1$ is a proper divisor of $2^q-1$ unless $2q+1=2^q-1$. That happens when $q=3$, but nowhere else, since for $q\gt 3$, $2q+1\lt 2^q-1$.

share|cite|improve this answer
    
Thank you for help – Winnie Nov 14 '12 at 15:33

Your Answer

 
discard

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.