Are there prime numbers n for which S=/0?

koulis
Messages
1
Reaction score
0
Member warned about posting without the homework template
We have the set:S={1<a<n:gcd(a,n)=1,a^(n-1)=/1(modn)}
Are there prime numbers n for which S=/0?After this, are there any composite numbers n for which S=0?

(with =/ i mean the 'not equal' and '0' is the empty set)

for the first one i know that there are no n prime numbers suh that S to be not empty from Fermat's little theorem.Any ideas or hints for the second one?
 
Physics news on Phys.org
koulis said:
We have the set:S={1<a<n:gcd(a,n)=1,a^(n-1)=/1(modn)}
Are there prime numbers n for which S=/0?After this, are there any composite numbers n for which S=0?

(with =/ i mean the 'not equal' and '0' is the empty set)

for the first one i know that there are no n prime numbers suh that S to be not empty from Fermat's little theorem.Any ideas or hints for the second one?

Try it for a few small composite values of n. And be careful, 2 is prime.
 
Last edited:
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...
Back
Top