Category:Highly Composite Numbers

From ProofWiki
Jump to navigation Jump to search

This category contains results about Highly Composite Numbers.
Definitions specific to this category can be found in Definitions/Highly Composite Numbers.

Let $n \in \Z_{>0}$ be a positive integer.

Then $n$ is highly composite if and only if:

$\forall m \in \Z_{>0}, m < n: \map {\sigma_0} m < \map {\sigma_0} n$

where $\map {\sigma_0} n$ is the divisor count function of $n$.

Subcategories

This category has the following 2 subcategories, out of 2 total.