arXiv · 1305.3580
Carmichael numbers in the sequence (k2^n+1)_{n\ge 1}
Abstract
We prove that for each odd number k, the sequence (k2^n+1)_{n\ge 1} contains only a finite number of Carmichael numbers. We also prove that k=27 is the smallest value for which such a sequence contains some Carmichael number.
Explore related subjects
Keep this discovery
Javer Cilleruelo, Florian Luca, Amalia Pizarro. 2013-05-15. Carmichael numbers in the sequence (k2^n+1)_{n\ge 1}. https://arxiv.org/abs/1305.3580
Cite the original work for its findings. Save a collection to share your selection of sources.