On the number of divisors of n^2-1

DOI10.1017/S0004972715001136MaRDI QIDQ2800089zbMATH OpenFDO

Authors Adrian W. Dudek

Publication date 14 April 2016

Published in Bulletin of the Australian Mathematical Society (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1507.08893

zbMATH Keywords

arithmetic functionsasymptotic estimateDiophantine quintuplesdivisor sum

Mathematics Subject Classification ID

Congruences; primitive roots; residue systems (11A07) Asymptotic results on arithmetic functions (11N37)

Abstract: We prove an asymptotic formula for the sum $su{m}_{nleqN}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 $su{m}_{dleqN}g(d)$, where $g(d)$ denotes the number of solutions $x$ in $mathbb{Z}_d$ to the equation $x^{2}equiv1modd$.

Review text

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.

Recommendations

• scientific article; zbMATH DE number 3939433
• scientific article; zbMATH DE number 1303759
• An additive divisor problem
• scientific article; zbMATH DE number 495704
• scientific article; zbMATH DE number 4012736

Cites work

• Bounds on the number of Diophantine quintuples
• Further remarks on Diophantine quintuples
• scientific article; zbMATH DE number 3968684 (Why is no real title available?)
• scientific article; zbMATH DE number 2239783 (Why is no real title available?)
• On Diophantine quintuples and \(D(-1)\)-quadruples
• On the number of divisors of quadratic polynomials

Cited in

(24)

• On the number of divisors of \(x^2 + x + A\)
• Explicit upper bound for the average number of divisors of irreducible quadratic polynomials
• Revisiting the average number of divisors of a quadratic polynomial
• A remark on the average number of divisors of a quadratic polynomial
• On the average number of divisors of reducible quadratic polynomials
• On the sum of two divisors of \((n^2+1)/2\)
• Ingham divisor problem with square-free numbers
• Asymptotic investigations on the number of divisors of \(n\).
• Eine Klasse von Abzählproblemen
• An upper bound for the number of diophantine quintuples
• The equation n₁n₂=n₃n₄, the gcd-sum function and the mean values of certain character sums
• Searching for Diophantine quintuples
• Pairs where 2 a - 2 b Divides n a - n b for all n
• Sur le nombre des diviseurs premiers de n
• scientific article; zbMATH DE number 3939433 (Why is no real title available?)
• On the degrees of divisors of \(T^{n}-1\)
• scientific article; zbMATH DE number 4093556 (Why is no real title available?)
• Two divisors of \((n^2 + 1)/2\) summing up to \(\delta n + \delta \pm 2\), \(\delta\) even
• Note on the number of divisors of reducible quadratic polynomials
• GAPS BETWEEN DIVISIBLE TERMS IN
• Two divisors of (n^2+1)/2 summing up to {\delta}n+{\epsilon}, for {\delta} and {\epsilon} even
• scientific article; zbMATH DE number 3243896 (Why is no real title available?)
• The mean of divisor function defined on polynomial rings over finite fields over a sequence of quadratic polynomials
• Two divisors of (n^2+1)/2 summing up to n+1

This page was built for publication: On the number of divisors of \(n^{2}-1\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2800089)