On Prime Factors of Terms of Linear Recurrence Sequences
From MaRDI portal
Publication:2840807
DOI10.1007/978-1-4614-6642-0_18zbMath1315.11011OpenAlexW947555791MaRDI QIDQ2840807
Publication date: 23 July 2013
Published in: Springer Proceedings in Mathematics & Statistics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-1-4614-6642-0_18
Related Items (6)
Some arithmetical properties of convergents to algebraic numbers ⋮ ‐PARTS OF TERMS OF INTEGER LINEAR RECURRENCE SEQUENCES ⋮ On the number of distinct prime factors of a sum of super-powers ⋮ On the prime factors of the iterates of the Ramanujan τ–function ⋮ On the digital representation of integers with bounded prime factors ⋮ A lower bound for the two-variable Artin conjecture and prime divisors of recurrence sequences
Cites Work
- On divisors of Lucas and Lehmer numbers
- \(p\)-adic logarithmic forms and a problem of Erdős
- The intrinsic divisors of Lehmer numbers in the case of negative discriminant
- Linearformen mit algebraischen Koeffizienten
- The zero multiplicity of linear recurrence sequences
- On the \(abc\) conjecture. II.
- On binary recurrence sequences
- On the multiplicity of linear recurrence sequences
- On a fundamental inequality in number theory
- Existence of primitive divisors of Lucas and Lehmer numbers
- An explicit lower bound for a homogeneous rational linear form in the logarithms of algebraic numbers. II
- On the zeros of linear recurrence sequences
- ON THE LARGEST PRIME FACTOR OF THE MERSENNE NUMBERS
- On Divisors of Fermat, Fibonacci, Lucas and Lehmer Numbers, II
- On divisors of terms of linear recurrence sequences.
- The greatest prime factor of $a^n - b^n$
- A lower bound for linear forms in logarithms
- On Divisors of Fermat, Fibonacci, Lucas, and Lehmer Numbers
- Arithmetic properties of members of a binary recurrent sequence
- Primitive divisors of the expression An - Bn in algebraic number fields.
- Uniformly counting points of bounded height
- On two theorems of Gelfond and some of their applications
- A sharpening of the bounds for linear forms in logarithms
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On Prime Factors of Terms of Linear Recurrence Sequences