There are no Carmichael numbers of the form 2ⁿp+1 with p prime
A Sierpinski number is an odd positive integer \(k\) such that \(2^nk+1\) is composite for every positive integer \(n\). A Carmichael number is an odd integer \(N\) such that it is composite but \(a^N\equiv a\pmod{N}\) for every \(a\). This paper relates both concepts by considering the set \[ \mathcal{K}=\{k \text{ odd}: \{2^nk+1\}_{n\geq 0} \text{ contains some Carmichael number}\} \] In particular it is proved that all members of \(\mathcal{K}\) are in fact composite. Note that this is equivalent to saying that there is no Carmichael number of the form \(2^np+1\) with \(p\) an odd prime.
- Carmichael numbers in the sequence \((2^{n} k+1)_{n\geq 1}\)
- On the density of odd integers of the form \((p-1)2^{-n}\) and related questions
- Primes in intervals of bounded length
- Sierpiński and Carmichael numbers
- The Impossibility of Certain Types of Carmichael Numbers
- There are infinitely many Carmichael numbers
- Carmichael numbers with a totient of the form \(a^2+nb^2\)
- Carmichael numbers in the sequence \((2^{n} k+1)_{n\geq 1}\)
- On Carmichael and polygonal numbers, Bernoulli polynomials, and sums of base-\(p\) digits
- There are no socialist primes less than 10^9
- scientific article; zbMATH DE number 5274211 (Why is no real title available?)
- Sierpiński and Carmichael numbers
- There is no Carmichael number of the form \(2^n p^2+1\) with \(p\) prime
- A note on Fermat's congruence
- Yet another curious property of 1729
This page was built for publication: There are no Carmichael numbers of the form \(2^np+1\) with \(p\) prime
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2080964)
