Number of divisors function: Difference between revisions

From Citizendium
Jump to navigation Jump to search
imported>Richard Pinch
(normal order)
imported>Richard Pinch
(subpages)
Line 1: Line 1:
{{subpages}}
In [[number theory]] the '''number of divisors function''' of a positive integer, denoted ''d''(''n'') or τ(''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''), is the number of positive integer [[divisor]]s of the number ''n''.



Revision as of 16:57, 6 December 2008

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), is the number of positive integer divisors of the number n.

It is a multiplicative function, that is 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).