- #1
pedrommp
- 4
- 0
Homework Statement
If p and q are prime numbers, p>q>2 , and 1+k*p divides q^n for some positive integer n. What can i expect of the values of k ? Does it works just for k=0 ?
Homework Equations
q^n = 1 (mod p)
The Attempt at a Solution
I know that k=0 works , and k=odd don't work cause 1+k*p would be even and q^n is odd ; if n= x*(p-1)+r , -1<r<(p-1) then q^n = q^(x*(p-1)+r) = q^(x*(p-1))*q^r = q^r (mod p) so i just need to check for -1<r<(p-1).