Carmichael numbers in the sequence (k2^n+1)_(nge 1)
classification
🧮 math.NT
keywords
carmichaelnumbersequencecontainsnumbersprovefiniteonly
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.