# Divisor count function

This article defines an arithmetic function or number-theoretic function: a function from the natural numbers to a ring (usually, the ring of integers, rational numbers, real numbers, or complex numbers).
View a complete list of arithmetic functions

## Definition

Let  be a natural number. The divisor count function of , denoted  , or , is defined as the number of positive divisors of . In other words:

.

Suppose we have:

.

Then:

.

## Behavior

### Lower bound

The divisor count function of  takes its lowest value (other than ) at primes.

.

In particular:

.

### Upper bound

Fill this in later

## Relation with other arithmetic functions

### Family of divisor power sum functions

For any real number (typically, integer) , the divisor power sum function  is the sum of  powers of all the positive divisors of . The divisor count function is the special case . The case  is the divisor sum function, often just denoted , while the case  is the divisor square sum function.

## Relation with properties of numbers

• Prime number is a natural number  for which .
• Perfect square is a natural number  for which  is odd.
• Refactorable number is a natural number  for which  divides .

## Properties

### Multiplicativity

This arithmetic function is a multiplicative function: the product of this function for two natural numbers that are relatively prime is the value of the function at the product.
View a complete list of multiplicative functions

### Complete multiplicativity

NO: This arithmetic function is not a completely multiplicative function: in other words, the product of the values of the function at two natural numbers need not equal the value at the product.

For natural numbers  and , it is not necessary that . In fact, the equality holds if and only if  and  are relatively prime.

### Preservation of divisibility

NO: This arithmetic function is not a divisibility-preserving function: it does not preserve divisibility.

If  divides , it is not necessary that  should divide .

## Generalization to other rings

This generalizes the notion of divisor count function from the case of the ring of integers  to more general classes of rings.

### Unique factorization domains

Suppose  is a unique factorization domain. The divisor count function is a function defined on the nonzero elements of , and is defined as the number of associate classes of divisors of that element. (Note that this does not count the actual number of divisors, but only the number of divisors up to multiplication by units -- this has the same effect as counting only the positive divisors does in the case of integers). Further, the same formula in terms of factorization holds. If we have:

.

Then:

.

## Algebraic significance

• Number of subgroups of the cyclic group: For any natural number ,  equals the number of subgroups of the cyclic group of order  under the action of the automorphism group.
• Number of automorphism classes of elements in the cyclic group: For any natural number ,  equals the number of equivalence classes of elements in the cyclic group of order  under the action of the automorphism group. In fact, two elements are in the same automorphism class if and only if they generate the same subgroup. The sizes of these equivalence classes are  for the divisors  of , and this is a combinatorial proof of the fact that .
• Number of associate classes of elements in the ring of integers modulo : For any natural number ,  equals the number of equivalence classes of elements in the ring of integers modulo  under the relation of being associate elements. In fact, the equivalence classes of associate elements are precisely the same as the equivalence classes under the action of automorphisms of the additive group of the ring. Thus, their sizes are , for the divisors  of .
• Number of irreducible factors of the polynomial  over : This polynomial is a product of irreducible factors called cyclotomic polynomials  for the divisors  of , where  has as its roots the primitive  roots of unity. The degree of  is .