On the equation φ(Xm- 1) = Xn- 1

DOI10.1142/S1793042115400187zbMath1390.11069OpenAlexW1926111058MaRDI QIDQ2942534

Bernadette Faye, Florian Luca

Publication date: 11 September 2015

Published in: International Journal of Number Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s1793042115400187

zbMATH Keywords

applications of sieve methodsapplications of primitive divisors of Lucas sequencesDiophantine equations involving Euler function

Mathematics Subject Classification ID

Applications of sieve methods (11N36) Exponential Diophantine equations (11D61) Fibonacci and Lucas numbers and polynomials and generalizations (11B39)

Related Items (3)

Unnamed Item ⋮ Diophantine equations involving Euler’s totient function ⋮ The Euler totient function on Lucas sequences

Cites Work

• Repunit Lehmer numbers
• On the Euler function of repdigits
• The large sieve
• ON THE EQUATION 𝜙(5^m- 1) = 5ⁿ- 1

This page was built for publication: On the equation φ(X^m- 1) = Xⁿ- 1