Pseudoprime values of the Fibonacci sequence, polynomials and the Euler function
From MaRDI portal
Publication:2385794
DOI10.1016/S0019-3577(06)81037-2zbMath1135.11004MaRDI QIDQ2385794
Florian Luca, Igor E. Shparlinski
Publication date: 15 October 2007
Published in: Indagationes Mathematicae. New Series (Search for Journal in Brave)
11A25: Arithmetic functions; related numbers; inversion formulas
11B39: Fibonacci and Lucas numbers and polynomials and generalizations
11A51: Factorization; primality
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On a problem of Oppenheim concerning Factorisatio Numerorum
- Integers without large prime factors
- There are infinitely many Carmichael numbers
- Frobenius pseudoprimes
- Two contradictory conjectures concerning Carmichael numbers
- Sur certaines hypothèses concernant les nombres premiers
- A Heuristic Asymptotic Formula Concerning the Distribution of Prime Numbers
- The Distribution of Lucas and Elliptic Pseudoprimes
- The Distribution of Smooth Numbers in Arithmetic Progressions
- On the Distribution of Pseudoprimes