Primes Generated by Recurrence Sequences
From MaRDI portal
Abstract: We consider primitive divisors of terms of integer sequences defined by quadratic polynomials. Apart from some small counterexamples, when a term has a primitive divisor, that primitive divisor is unique. It seems likely that the number of terms with a primitive divisor has a natural density. We discuss two heuristic arguments to suggest a value for that density, one using recent advances made about the distribution of roots of polynomial congruences.
Recommendations
Cited in
(21)- The arithmetic of consecutive polynomial sequences over finite fields
- Sequences of prime reciprocals. Preliminaries
- Duadic sequences of prime lengths
- Primitive divisors of some Lehmer-Pierce sequences
- Prime divisors of some recurrence sequence
- Primefree shifted Lucas sequences
- On the use of the least common multiple to build a prime-generating recurrence
- scientific article; zbMATH DE number 2186653 (Why is no real title available?)
- Three approaches to a sequence problem
- Efficient finite groups arising in the study of relative asphericity
- A natural prime-generating recurrence
- scientific article; zbMATH DE number 3968663 (Why is no real title available?)
- A conjecture based on Somos-4 sequence and its extension
- scientific article; zbMATH DE number 1112448 (Why is no real title available?)
- Sequences with Translates Containing Many Primes
- Primes in Sequences Associated to Polynomials (After Lehmer)
- On a family of sequences related to Chebyshev polynomials
- On new identities for Mersenne numbers
- The Membership Problem for Hypergeometric Sequences with Quadratic Parameters
- Fibonacci primes, primes of the form 2ⁿ-k and beyond
- Two problems on the greatest prime factor of \(n^2+1\)
This page was built for publication: Primes Generated by Recurrence Sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3529173)