10.46298/hrj.1999.138
https://hrj.episciences.org/138
Halbeisen, L
L
Halbeisen
Hungerbühler, N
N
Hungerbühler
On generalised Carmichael numbers.
For arbitrary integers $k\in\mathbb Z$, we investigate the set $C_k$ of the generalised Carmichael number, i.e. the natural numbers $n< \max\{1, 1-k\}$ such that the equation $a^{n+k}\equiv a \mod n$ holds for all $a\in\mathbb N$. We give a characterization of these generalised Carmichael numbers and discuss several special cases. In particular, we prove that $C_1$ is infinite and that $C_k$ is infinite, whenever $1-k>1$ is square-free. We also discuss generalised 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 $a^n\equiv 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.
episciences.org
Korselt's criterion
Fermat congruence
square-free numbers
generalised Carmichael numbers
[MATH] Mathematics [math]
2015-06-12
1999-01-01
1999-01-01
en
journal article
https://hal.archives-ouvertes.fr/hal-01109575v1
2804-7370
https://hrj.episciences.org/138/pdf
VoR
application/pdf
Hardy-Ramanujan Journal
Volume 22 - 1999
Researchers
Students