Carmichael numbers in the sequence $(2^n k+1)_{n\geq 1}$
From MaRDI portal
Publication:3450041
DOI10.1090/mcom/2982zbMath1400.11017arXiv1305.3580OpenAlexW1509830276MaRDI QIDQ3450041
Amalia Pizarro-Madariaga, Florian Luca, Javier Cilleruelo
Publication date: 2 November 2015
Published in: Mathematics of Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1305.3580
Linear forms in logarithms; Baker's method (11J86) Factorization; primality (11A51) Schmidt Subspace Theorem and applications (11J87)
Related Items
Sierpiński and Carmichael numbers, There are no Carmichael numbers of the form \(2^np+1\) with \(p\) prime
Cites Work
- Unnamed Item
- On the density of odd integers of the form \((p-1)2^{-n}\) and related questions
- There are infinitely many Carmichael numbers
- On the largest prime factor of \((ab+1)(ac+1)(bc+1)\)
- An upper bound for the g.c.d. of \(a^n-1\) and \(b^n -1\)
- A lower bound for the height of a rational function at \(S\)-unit points
- The distribution of integers with a divisor in a given interval
- A Mordell-Lang plus Bogomolov type result for curves in \(\mathbb G_m^2\)
- Classical and modular approaches to exponential Diophantine equations. I: Fibonacci and Lucas perfect powers
- An explicit lower bound for a homogeneous rational linear form in the logarithms of algebraic numbers. II
- The Impossibility of Certain Types of Carmichael Numbers
- On the greatest prime factor of (𝑎𝑏+1)(𝑎𝑐+1)
- A quantitative lower bound for the greatest prime factor of (ab+1)(bc+1)(ca+1)
