Explicit upper bound for the average number of divisors of irreducible quadratic polynomials (vol 186, pg 663, 2018)

摘要

Consider the divisor sum for integers b and c. We improve the explicit upper bound of this average divisor sum in certain cases, and as an application, we give an improvement in the maximal possible number of -quadruples. The new tool is a numerically explicit Plya-Vinogradov inequality, which has not been formulated explicitly before but is essentially due to Frolenkov-Soundararajan.