Power savings for counting solutions to polynomial-factorial equations
<p>Let Pbe a polynomial with integer coefficients and degree at least two. We prove an upper bound on the number of integer solutions <em>n</em> ≤ <em>N</em> to <em>n</em>! = <em>P</em>(<em>x</em>)which yields a power saving ov...
| Main Authors: | , , |
|---|---|
| Format: | Journal article |
| Language: | English |
| Published: |
Elsevier
2023
|