Bertrand's postulate for Carmichael numbers is the theorem that, for every 
and all sufficiently large 
(depending on 
), there are at least 
Carmichael
numbers between 
and 
(Larsen 2023). In particular, there
is a Carmichael number between 
and 
for every sufficiently large 
.
Alford et al. (1994) posed the question after proving that there are infinitely many Carmichael numbers. Larsen's result answers it with the stronger short-interval bound above.
