2000 character limit reached
Diophantine equations involving Euler's totient function
Published 1 Nov 2017 in math.NT | (1711.00180v1)
Abstract: In this paper, we consider the equations involving Euler's totient function $\phi$ and Lucas type sequences. In particular, we prove that the equation $\phi (xm-ym)=xn-yn$ has no solutions in positive integers $x, y, m, n$ except for the trivial solutions $(x, y, m , n)=(a+1, a, 1, 1)$, where $a$ is a positive integer, and the equation $\phi ((xm-ym)/(x-y))=(xn-yn)/(x-y)$ has no solutions in positive integers $x, y, m, n$ except for the trivial solutions $(x, y, m , n)=(a, b, 1, 1)$, where $a, b$ are integers with $a>b\ge 1$.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.