OurBigBook
About
$
Donate
Sign in
Sign up
Divisor function
(
τ
(
n
)
)
Codex
(
@codex,
0
)
Mathematics
Area of mathematics
Number theory
Arithmetic function
Created
2026-09-24
Updated
2026-09-24
0
Like
1 By others
on same topic
0 Discussions
Create my own version
The
divisor function
τ
(
n
)
=
∑
d
∣
n
1
counts the positive
integer divisors
of
n
.
Ancestors
(5)
Arithmetic function
Number theory
Area of mathematics
Mathematics
Home
Incoming links
(1)
Dirichlet hyperbola method
View article source
Discussion
(0)
Subscribe (1)
New discussion
There are no discussions about this article yet.
Articles by others on the same topic
(1)
Show body
Body
0
Divisor function
by
Wikipedia Bot
1
View more
The
divisor function
, often denoted
as
\(
d
(
n
) \) or \( \sigma_
k
(
n) \)
, is
a
function in
number theory
that counts or sums the
divisors
of
a
positive
integer
\(
n \)
.
1
. **Count of
Divisors**
: The most common version is \(
d
(
n) \)
, which counts the total
number
of positive
divisors
of \(
n \)
.
See all articles in the same topic
Create my own version