Carmichael numbers in the sequence (2ⁿ k+1)_n 1
From MaRDI portal
Publication:3450041
Abstract: We prove that for each odd number k, the sequence (k2^n+1)_{nge 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.
Recommendations
Cites work
- A lower bound for the height of a rational function at \(S\)-unit points
- A Mordell-Lang plus Bogomolov type result for curves in \(\mathbb G_m^2\)
- A quantitative lower bound for the greatest prime factor of (ab+1)(bc+1)(ca+1)
- An explicit lower bound for a homogeneous rational linear form in logarithms of algebraic numbers. II
- An upper bound for the g.c.d. of \(a^n-1\) and \(b^n -1\)
- Classical and modular approaches to exponential Diophantine equations. I: Fibonacci and Lucas perfect powers
- scientific article; zbMATH DE number 897262 (Why is no real title available?)
- On the density of odd integers of the form \((p-1)2^{-n}\) and related questions
- On the greatest prime factor of (𝑎𝑏+1)(𝑎𝑐+1)
- On the largest prime factor of (ab+1)(ac+1)(bc+1)
- The distribution of integers with a divisor in a given interval
- The Impossibility of Certain Types of Carmichael Numbers
- There are infinitely many Carmichael numbers
Cited in
(8)- Carmichael numbers with a totient of the form \(a^2+nb^2\)
- There are no Carmichael numbers of the form \(2^np+1\) with \(p\) prime
- Carmichael numbers composed of primes from a Beatty sequence
- Carmichael numbers with p+1 n+1
- scientific article; zbMATH DE number 6427303 (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
- Yet another curious property of 1729
This page was built for publication: Carmichael numbers in the sequence \((2^{n} k+1)_{n\geq 1}\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3450041)
