Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

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

How to prove following statement :

For prime numbers $p$ greater than $3$, it is true that:

if $p=2^n-a$ and $a\equiv 1 \pmod 6$ then $p\equiv 1\pmod 3$

if $p=2^n+a$ and $a\equiv 5 \pmod 6$ then $p\equiv 1\pmod 3$

if $p=2^n-a$ and $a\equiv 5 \pmod 6$ then $p\equiv 2\pmod 3$

if $p=2^n+a$ and $a\equiv 1 \pmod 6$ then $p\equiv 2\pmod 3$

Maybe some conclusions from my previous question could be useful...

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

Observing the fact that $2^n =2,4 \mod 6$ and that $p \neq 0,3 \mod 6$ solves them..

share|cite|improve this answer
following your hint I have proved statement...thanks – pedja Nov 17 '11 at 5:42

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.