Abstract
For a positive integer n we write φ(n) for the Euler function of n. In this note, we show that if b > 1 is a fixed positive integer, then the equation
has only finitely many positive integer solutions (x, y, m, n).
Similar content being viewed by others
References
Yu. Bilu, G. Hanrot and P. M. Voutier: Existence of primitive divisors of Lucas and Lehmer numbers (with an appendix by M. Mignotte). J. Reine Angew. Math. 539 (2001), 75–122.
R. D. Carmichael: On the numerical factors of the arithmetic forms α n ± β n. Ann. Math. 15 (1913), 30–70.
F. Luca: On the equation φ(|x m + y m|) = |x n + y n|. Indian J. Pure Appl. Math. 30 (1999), 183–197.
F. Luca: On the equation φ(x m − y m) = x n + y n. Irish Math. Soc. Bull. 40 (1998), 46–55.
F. Luca: Euler indicators of binary recurrent sequences. Collect. Math. 53 (2002), 133–156.
F. Luca: Problem 10626. Amer. Math. Monthly 104 (1997), 871.
K. K. Norton: On the number of restricted prime factors of an integer I. Illinois J. Math. 20 (1976), 681–705 Zbl 0329.10035.
C. Pomerance: On the distribution of amicable numbers. J. Reine Angew. Math. 293/294 (1977), 217–222.
Author information
Authors and Affiliations
Corresponding author
Additional information
Dedicated to William D. Banks on his $$ \sqrt {\varphi (2005)} ^{th} $$ birthday.
Rights and permissions
About this article
Cite this article
Luca, F. On the Euler function of repdigits. Czech Math J 58, 51–59 (2008). https://doi.org/10.1007/s10587-008-0004-0
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10587-008-0004-0