On the number of divisors of \(n^{2}-1\) (Q2800089)

We quote the author's perfect summary: ``We prove an asymptotic formula for the sum \thinspace \(\sum_{n\leq N}d(n^2-1)\), where \(d(n)\) denotes the number of divisors of \(n\). During the course of our proof, we also furnish an asymptotic formula for the sum \(\sum_{d\leq N}g(d)\), where \(g(d)\) denotes the number of solutions \(x\) in \(\mathbb Z_d\) to the equation \(x^2\equiv 1\pmod d\).''NEWLINENEWLINEThe results may be applied, in particular, for the problem of Diophantine quintuples (for which the author gives an updated bibliography).NEWLINENEWLINEThe proofs of the two theorems (i.e., the two results quoted in the summary) are elementary and the most technical ingredient is a classical result, getting an asymptotic for the partial sums of coefficients of a suitable Dirichlet series.