Some Diophantine equations involving arithmetic functions and Bhargava factorials
Daniel M. Baczkowski, Sa\v{s}a Novakovi\'c

TL;DR
This paper extends previous results on the finiteness of solutions to certain factorial-based Diophantine equations, including cases with multiple factorials, various arithmetic functions, and Bhargava factorials.
Contribution
It generalizes earlier finiteness results to equations with multiple factorials, new divisor functions, and Bhargava factorials, broadening the scope of known solutions.
Findings
Finitely many solutions for equations with multiple factorials and arithmetic functions.
Inclusion of sum of powers of divisors function in the finiteness results.
Extension of results to equations involving Bhargava factorials.
Abstract
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Mathematical Theories · Polynomial and algebraic computation · Advanced Mathematical Identities
