Home » Subject » Number Theory

Special Primes

Importance: Low ✭
Author(s): George BALAN
Subject: Number Theory
Keywords:
Recomm. for undergrads: yes
Posted by: maththebalans
on: February 18th, 2011
Conjecture   Let $ p $ be a prime natural number. Find all primes $ q\equiv1\left(\mathrm{mod}\: p\right) $, such that $ 2^{\frac{\left(q-1\right)}{p}}\equiv1\left(\mathrm{mod}\: q\right) $.


Bibliography



* indicates original appearance(s) of problem.
add new comment

All primes are

On February 7th, 2013 Anonymous says:

All primes are p=(q-1)/(order of 2 mod q)

reply

paul newell

On February 17th, 2012 Anonymous says:

q divides 2^((q-1)/P))-1 iff p divides (q-1)/( Order of2 mod q )

reply

Comment viewing options

Select your preferred way to display the comments and click "Save settings" to activate your changes.