Category:Divisor Count Function
Jump to navigation
Jump to search
This category contains results about the divisor count function.
Let $n$ be an integer such that $n \ge 1$.
The divisor count function is defined on $n$ as being the total number of positive integer divisors of $n$.
It is denoted on $\mathsf{Pr} \infty \mathsf{fWiki}$ as $\sigma_0$ (the Greek letter sigma).
That is:
- $\ds \map {\sigma_0} n = \sum_{d \mathop \divides n} 1$
where $\ds \sum_{d \mathop \divides n}$ is the sum over all divisors of $n$.
Subcategories
This category has the following 4 subcategories, out of 4 total.
Pages in category "Divisor Count Function"
The following 26 pages are in this category, out of 26 total.
D
- Divisor Count Function from Prime Decomposition
- Divisor Count Function is Multiplicative
- Divisor Count Function is Odd Iff Argument is Square
- Divisor Count Function is Primitive Recursive
- Divisor Count Function of Power of Prime
- Divisor Count Function of Prime Number
- Divisor Count of Square-Free Integer is Power of 2
I
N
P
S
- Sequence of 4 Consecutive Integers with Equal Number of Divisors
- Sequence of 9 Consecutive Integers each with 48 Divisors
- Sequence of Consecutive Integers with Same Number of Divisors
- Smallest Consecutive Even Numbers such that Added to Divisor Count are Equal
- Smallest Number with 16 Divisors
- Smallest Number with 2^n Divisors
- Smallest Numbers with 240 Divisors
- Smallest Triplet of Integers whose Product with Divisor Count are Equal