ON THE NUMBER OF DIVISORS OF n2 - 1

Adrian W. Dudek

doi:10.1017/S0004972715001136

ON THE NUMBER OF DIVISORS OF n² - 1

Adrian W. Dudek^*

^*Corresponding author for this work

Research output: Contribution to journal › Article › peer-review

8 Citations (Scopus)

Abstract

We prove an asymptotic formula for the sum ∑_n≤N d(n² - 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 ∑_d≤N g(d), where g(d) denotes the number of solutions x in ℤ_d to the equation x² ≡ 1 (mod d).

Original language	English
Pages (from-to)	194-198
Number of pages	5
Journal	Bulletin of the Australian Mathematical Society
Volume	93
Issue number	2
DOIs	https://doi.org/10.1017/S0004972715001136
Publication status	Published - 1 Apr 2016

Access to Document

10.1017/S0004972715001136

Cite this

@article{6962f6a929cd4cddbf6f3361ea6e3ca8,

title = "ON THE NUMBER OF DIVISORS OF n2 - 1",

abstract = "We prove an asymptotic formula for the sum ∑n≤N d(n2 - 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 ∑d≤N g(d), where g(d) denotes the number of solutions x in ℤd to the equation x2 ≡ 1 (mod d).",

keywords = "Diophantine quintuples, arithmetic functions, asymptotic estimate, divisor sum",

author = "Dudek, \{Adrian W.\}",

note = "Publisher Copyright: {\textcopyright} 2015 Australian Mathematical Publishing Association Inc.",

year = "2016",

month = apr,

day = "1",

doi = "10.1017/S0004972715001136",

language = "English",

volume = "93",

pages = "194--198",

journal = "Bulletin of the Australian Mathematical Society",

issn = "0004-9727",

publisher = "Cambridge University Press",

number = "2",

}

TY - JOUR

T1 - ON THE NUMBER OF DIVISORS OF n2 - 1

AU - Dudek, Adrian W.

PY - 2016/4/1

Y1 - 2016/4/1

N2 - We prove an asymptotic formula for the sum ∑n≤N d(n2 - 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 ∑d≤N g(d), where g(d) denotes the number of solutions x in ℤd to the equation x2 ≡ 1 (mod d).

AB - We prove an asymptotic formula for the sum ∑n≤N d(n2 - 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 ∑d≤N g(d), where g(d) denotes the number of solutions x in ℤd to the equation x2 ≡ 1 (mod d).

KW - Diophantine quintuples

KW - arithmetic functions

KW - asymptotic estimate

KW - divisor sum

UR - https://www.scopus.com/pages/publications/84960857363

U2 - 10.1017/S0004972715001136

DO - 10.1017/S0004972715001136

M3 - Article

SN - 0004-9727

VL - 93

SP - 194

EP - 198

JO - Bulletin of the Australian Mathematical Society

JF - Bulletin of the Australian Mathematical Society

IS - 2

ER -

ON THE NUMBER OF DIVISORS OF n² - 1

Abstract

Access to Document

Other files and links

Fingerprint

Cite this