Power savings for counting solutions to polynomial-factorial equations

Hung Bui, Kyle Pratt, Alexandru Zaharescu

Research output: Contribution to journalArticlepeer-review


Let P be a polynomial with integer coefficients and degree at least two. We prove an upper bound on the number of integer solutions n ≤ N to n! = P(x) which yields a power saving over the trivial bound. In particular, this applies to a century-old problem of Brocard and Ramanujan. The previous best result was that the number of solutions is o(N). The proof uses techniques of Diophantine and Padé approximation.
Original languageEnglish
Article number109021
JournalAdvances in Mathematics
Publication statusPublished - 1 Jun 2023


Dive into the research topics of 'Power savings for counting solutions to polynomial-factorial equations'. Together they form a unique fingerprint.

Cite this