Number of divisors function: Difference between revisions

From Citizendium
Jump to navigation Jump to search
imported>Richard Pinch
(or sigma-zero)
imported>Meg Taylor
No edit summary
Line 2: Line 2:
In [[number theory]] the '''number of divisors function''' of a positive integer, denoted ''d''(''n'') or τ(''n'') or σ<sub>0</sub>(''n''), is the number of positive integer [[divisor]]s of the number ''n''.
In [[number theory]] the '''number of divisors function''' of a positive integer, denoted ''d''(''n'') or τ(''n'') or σ<sub>0</sub>(''n''), is the number of positive integer [[divisor]]s of the number ''n''.


It is a [[multiplicative function]], that is is ''m'' and ''n'' are coprime then <math>d(mn) = d(m) d(n)</math>.   
It is a [[multiplicative function]], that is ''m'' and ''n'' are coprime then <math>d(mn) = d(m) d(n)</math>.   


The value of ''d'' on a general integer ''n'' with prime factorisation
The value of ''d'' on a general integer ''n'' with prime factorisation

Revision as of 03:26, 1 November 2013

This article is a stub and thus not approved.
Main Article
Discussion
Related Articles  [?]
Bibliography  [?]
External Links  [?]
Citable Version  [?]
 
This editable Main Article is under development and subject to a disclaimer.

In number theory the number of divisors function of a positive integer, denoted d(n) or τ(n) or σ0(n), is the number of positive integer divisors of the number n.

It is a multiplicative function, that is m and n are coprime then .

The value of d on a general integer n with prime factorisation

is then

The average order of d(n) is . The normal order of log(d(n)) is log(2) log log(n).