|
|
|
|
|
Divisor FunctionIn mathematics the divisor function σa(n) is defined as the sum of the ath powers of the divisors of n, or -
The notation d(n) is also used to denote σ0(n), or the number of divisors of n. The sigma function σ(n) is - .
For example iff p is a prime number, -
because, by definition, the factors of a prime number are 1 and itself. Generally, the divisor function is multiplicative, but not completely multiplicative. The consequence of this is that, if we write -
then we have -
We also note . This function is the one used to recognize perfect numbers which are the n for which . As an example, for two distinct primes p and q, let -
Then -
-
Two Dirichlet series involving the divisor function are: -
and -
A Lambert series involving the divisor function is: -
for arbitrary complex |q| ≤ 1 and a. This summation also appears as the Fourier series of the Eisenstein series and the invariants of the Weierstrass elliptic functions. See also References - Tom M.Apostol, Introduction to Analytic Number Theory, (1976) Springer-Verlag, New York. ISBN 0-387-90163-9
|
 |
|
| Copyright 2005-2009 OnPedia.com. All Rights Reserved |
|
|