The Euler totient function on Lucas sequences
From MaRDI portal
Publication:5877882
DOI10.1142/S1793042123500148WikidataQ114071760 ScholiaQ114071760MaRDI QIDQ5877882FDOQ5877882
Publication date: 16 February 2023
Published in: International Journal of Number Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2110.04247
Arithmetic functions; related numbers; inversion formulas (11A25) Fibonacci and Lucas numbers and polynomials and generalizations (11B39) Diophantine equations (11D99)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The large sieve
- Approximate formulas for some functions of prime numbers
- Estimation de la fonction de Tchebychef θ sur le k-ième nombre premier et grandes valeurs de la fonction ω(n) nombre de diviseurs premiers de n
- Multiply perfect numbers in Lucas sequences with odd parameters
- Euler indicators of binary recurrence sequences.
- φ(Fn ) = Fm
- Diophantine equations involving Euler’s totient function
- Diophantine equations involving the Euler totient function
- On the Euler function of repdigits
- On the equation φ(Xm- 1) = Xn- 1
- ON THE EQUATION 𝜙(5m- 1) = 5n- 1
- Pell numbers whose Euler function is a Pell number
Cited In (3)
Recommendations
This page was built for publication: The Euler totient function on Lucas sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5877882)