1 results
ON THE NUMBER OF DIVISORS OF
$n^{2}-1$
- Part of
-
- Journal:
- Bulletin of the Australian Mathematical Society / Volume 93 / Issue 2 / April 2016
- Published online by Cambridge University Press:
- 02 October 2015, pp. 194-198
- Print publication:
- April 2016
-
- Article
-
- You have access
- Export citation
-
We prove an asymptotic formula for the sum
$\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~(\text{mod}~d)$.
