abstract
On generalized Carmichael numbers
Lorenz Halbeisen and Norbert Hungerbühler
For arbitrary integers k in Z we investigate the set
Ck of the generalized Carmichael numbers, i.e. the
natural numbers n > max(1,1-k) such that the equation
an+k = a (mod n) holds for all a
in N. We give a characterization of these generalized Carmichael
numbers and discuss several special cases. In particular, we prove that
C1 is finite and that Ck is infinite, whenever
1-k > 1 is square-free. We also discuss generalized Carmichael
numbers which have one or two prime factors. Finally, we consider the
Jeans numbers, i.e. the set of odd numbers n which satisfy the
equation an = a (mod n) only for a=2,
and the corresponding generalizations. We give a stochastic argument
which supports the conjecture that infinitely many Jeans numbers
exist which are squares.