The Euler totient function on Lucas sequences
From MaRDI portal
Publication:5877882
Recommendations
Cites work
- Approximate formulas for some functions of prime numbers
- Diophantine equations involving Euler's totient function
- Diophantine equations involving the Euler totient function
- 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
- Euler indicators of binary recurrence sequences.
- Members of Lucas sequences whose Euler function is a power of 2
- Multiply perfect numbers in Lucas sequences with odd parameters
- On the Euler function of repdigits
- On the equation \(\varphi(5^m-1)=5^n-1\)
- On the equation φ(Xm- 1) = Xn- 1
- Pell numbers whose Euler function is a Pell number
- The Euler function of Fibonacci and Lucas numbers and factorials
- The large sieve
- \(\sigma_k(F_m)=F_n\)
- φ(Fn ) = Fm
Cited in
(8)- Euler indicators of binary recurrence sequences.
- Equations with arithmetic functions of Pell numbers
- Diophantine equations involving Euler's totient function
- The Euler function of Fibonacci and Lucas numbers and factorials
- scientific article; zbMATH DE number 1311364 (Why is no real title available?)
- THE EULER TOTIENT FUNCTION ON QUADRATIC FIELDS
- The Euler Totient Function on Lucas Sequences
- Members of Lucas sequences whose Euler function is a power of 2
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)