Explicit upper bound for an average number of divisors of quadratic polynomials (Q258051)

Let \(\tau(n)\) be the number of positive divisors of the integer \(n\), \(f(n)\in \mathbb{Z}[n]\) be a polynomial. In this article an explicit upper bound for the sum \[ \sum_{n=1}^{N}\tau(f(n)) \] with quadratic polynomials \(f(n)\) is presented. More precisely, the author obtains that if \(f(n)=n^2+2bn+c\in \mathbb{Z}[n],\,f(n)>0\) for \(n\geq 1\), \(\delta=b^2-c\neq 0\), \(\delta\not\equiv 1 (4)\), \(\delta\)-square-free, then \[ \sum_{n=1}^{N}\tau(n^2+2bn+c)<C_1N\log N+C_2N+C_3 \] with constants \(C_1,\,C_2,\,C_3\) depending on \(b\) and \(c\). Also the estimate of the sum with \(f(n)=n^2+1\) is received. The obtained bound is of the right order of magnitude \(N\log N\), as predicted by the asymptotic formulas. Applying this result, the author improves the results of \textit{C. Elsholtz} et al. [Monatsh. Math. 175, No. 2, 227--239 (2014; Zbl 1347.11030)], \textit{N. C. Bonciocat} et al. [Publ. Mat., Barc. 56, No. 2, 279--304 (2012; Zbl 1354.11024)], and \textit{T. Trudgian} [J. Number Theory 157, 233--249 (2015; Zbl 1367.11036)], for maximal possible number of \(D(-1)\)-quadruples.