加载中…
F. Luca proved for any fixed rational number that the Diophantine equations of the form , where is either the Euler function or the divisor sum function or the function counting the number of divisors, have only finitely many integer solutions . In this paper we generalize the mentioned result and show that Diophantine equations of the form have finitely many integer solutions, too. In addition, we do so by including the case is the sum of \textsuperscript{th} powers of divisors function. Moreover, we observe that the same holds by replacing some of the factorials with certain examples of Bhargava factorials.

生成讲解博客的中文版本

生成AI智能校验的中文版本