Math Is Fun Forum

  Discussion about math, puzzles, games and fun.   Useful symbols: ÷ × ½ √ ∞ ≠ ≤ ≥ ≈ ⇒ ± ∈ Δ θ ∴ ∑ ∫ • π ƒ -¹ ² ³ °

You are not logged in.

#1 2009-05-16 22:26:45

Kurre
Member
Registered: 2006-07-18
Posts: 280

prime number problem

Let p be a prime. Prove that if q|2^p-1, then p|q-1.

Please dont give full answer, only hints.

Offline

#2 2009-05-17 00:14:20

JaneFairfax
Member
Registered: 2007-02-23
Posts: 6,868

Re: prime number problem


Consider the multiplicative group
of nonzero integers
. It is clear that
must be odd; thus, by Fermat’s little theorem, the order of 2 in the group must divide
. If
then the order of 2 also divides
and hence is
since
is prime.

Offline

#3 2009-05-17 08:11:00

Kurre
Member
Registered: 2006-07-18
Posts: 280

Re: prime number problem

thanks

Offline

#4 2009-05-18 20:02:47

whatismath
Member
Registered: 2007-04-10
Posts: 19

Re: prime number problem

I think we do not need to assume

to be prime.
Actually, Jane's argument shows

for all prime factor
of
.
Any factor
of
is a product of
such
, i.e.
for some
.
Hence
,
or
.

Offline

#5 2009-05-18 20:38:55

Kurre
Member
Registered: 2006-07-18
Posts: 280

Re: prime number problem

I did not write that q must be prime

Offline

Board footer

Powered by FluxBB