Prime Factors of Fibonacci-Related Recurrences
From MaRDI portal
Cites work
- A two-variable Artin conjecture
- Density of prime divisors of linear recurrences
- Divisibility properties of the Fibonacci entry point
- Generalization of Jarden's theorem
- scientific article; zbMATH DE number 1973372 (Why is no real title available?)
- scientific article; zbMATH DE number 1391669 (Why is no real title available?)
- scientific article; zbMATH DE number 7157672 (Why is no real title available?)
- Lucas sequences with cyclotomic root field
- On groups of linear recurrences. I
- On primes \(p\) for which \(d\) divides \(\text{ord}_p(g)\)
- On the 1/3 density of odd ranked primes in Lucas sequences
- On the density of some sets of primes \(p\), for which \(n\mid \text{ord}_p a\)
- On the divisibility of the rank of appearance of a Lucas sequence
- On the numerical factors of the arithmetic forms ^n ^n.
- Prime density of Lehmer sequences
- Prime divisors of Lucas sequences
- Rank and period of primes in the Fibonacci sequence. A trichotomy
- Square free values of the order function
- Tables of Fibonacci and Lucas factorizations
- The density of primes \(P\), such that \(-1\) is a residue modulo \(P\) of two consecutive Fibonacci numbers, is \(2/3\)
- The Lucas Sequences
- The Maximal Prime Divisors of Linear Recurrences
- The On-Line Encyclopedia of Integer Sequences
- The set of primes dividing the Lucas numbers has density 2/3
This page was built for publication: Prime Factors of Fibonacci-Related Recurrences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6928560)
