Prime Tau Function


The Prime Tau function of n is the total number of positive divisors of n.

To compute Tau(n), first factor n into its prime factors. For this document the following notation is used. An integral number n > 1 can be written as

n = P1^A1 * P2^A2 * . . . * Pr^Ar

where the Pi's are the various different prime factors, Ai the number of times Pi occurs in the prime factorization and r the number of prime factors.

The formula for Tau is:

Tau(n) = (A1+1)*(A2+1)* . . . *(Ar+1).

For example, n = 100 = 2^2 * 5^2
Tau(100) = (2+1)*(2+1)= 9.
They are:
2^0 * 5^0 = 1,
2^1 * 5^0 = 2,
2^2 * 5^0 = 4,
2^0 * 5^1 = 5,
2^1 * 5^1 = 10,
2^2 * 5^1 = 20,
2^0 * 5^2 = 25,
2^1 * 5^2 = 50,
2^2 * 5^2 = 100.

For n = 67500 = 2^2 * 3^3 * 5^4
Tau(67500) = (2+1)*(3+1)*(4+1) = 3*4*5 = 60.

See: Number of Divisors -- From The Prime Glossary
And: Divisor -- From MathWorld

Return to Number Theory, Algorithms, and Real Functions
Return to Harry's Home Page


This page accessed times since March 26, 2005.
Page created by: hjsmithh@sbcglobal.net
Changes last made on Monday, 06-Aug-07 20:47:30 PDT