On a Diophantine equation involving Fibonacci numbers and the Ramanujan \(\tau\)-function of factorials
From MaRDI portal
Publication:2115627
DOI10.1007/s13370-021-00950-1zbMath1499.11069OpenAlexW4205728046MaRDI QIDQ2115627
Publication date: 17 March 2022
Published in: Afrika Matematika (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s13370-021-00950-1
Binomial coefficients; factorials; (q)-identities (11B65) Fourier coefficients of automorphic forms (11F30) Fibonacci and Lucas numbers and polynomials and generalizations (11B39)
Related Items (2)
On the solutions of the Diophantine equation \(F_n \pm \frac{a (10^m - 1)}{9} = k!\) ⋮ On the solutions of the Diophantine equation \(P_n \pm \frac{a(10^m -1)}{9}=k!\)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fibonacci numbers at most one away from a perfect power
- Divisibilite de certaines fonctions arithmétiques
- Effective lower bound for the \(p\)-adic distance between powers of algebraic numbers
- Sums of factorials in binary recurrence sequences
- PV-numbers and sets of multiplicity
- Distinct digits in basebexpansions of linear recurrence sequences
- FACTORIALS AND THE RAMANUJAN FUNCTION
- Waring's problem with the Ramanujan $ \tau$-function
- On the representation of an integer in two different bases.
- p-adic logarithmic forms and group varieties II
- On factorials expressible as sums of at most three Fibonacci numbers
- Expansions of binary recurrences in the additive base formed by the number of divisors of the factorial
This page was built for publication: On a Diophantine equation involving Fibonacci numbers and the Ramanujan \(\tau\)-function of factorials
