Type: Article
Publication Date: 2009-06-15
Citations: 2
DOI: https://doi.org/10.51286/albjm/1245207560
Giuga has conjectured that if the sum of the (n−1)-st powers of the residues modulo n is −1(mod n), then n is 1 or prime. It is known that any counterexample is a Carmichael number. Lehmer has asked if φ(n) divides n−1, with φ being Euler's function, must it be true that n is 1 or prime. No examples are known, but a composite number with this property must be a Carmichael number. We show that there are infinitely many Carmichael numbers n that are not counterexamples to Giuga's conjecture and also do not satisfy φ(n)|n−1.
Action | Title | Year | Authors |
---|---|---|---|
+ | Carmichael numbers and the sieve | 2016 |
William D. Banks Tristan Freiberg |
+ | Sierpiński and Carmichael numbers | 2014 |
William D. Banks Carrie E. Finch Florian Luca Carl Pomerance Pantelimon Stănică |