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

DOI10.1142/S1793042115400187MaRDI QIDQ2942534zbMATH OpenOpenAlexFDO

Authors 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 primitive divisors of Lucas sequencesapplications of sieve methodsDiophantine equations involving Euler function

Mathematics Subject Classification ID

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

Cites work

• On the equation \(\varphi(5^m-1)=5^n-1\)
• On the Euler function of repdigits
• Repunit Lehmer numbers
• The large sieve

Cited in

(7)

• φ(Fn ) = Fm
• scientific article; zbMATH DE number 5014512 (Why is no real title available?)
• On the equation $\varphi (n)=\varphi (n+1)$
• Diophantine equations involving Euler's totient function
• scientific article; zbMATH DE number 6740669 (Why is no real title available?)
• The Euler totient function on Lucas sequences
• scientific article; zbMATH DE number 7753339 (Why is no real title available?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2942534)