Divisor power sum function: Difference between revisions
(Created page with '{{arithmetic function}} ==Definition== Let <math>k</math> be a real number (typically an integer). The '''divisor power sum function''' <math>\sigma_k</math> is defined as the ...') |
No edit summary |
||
Line 3: | Line 3: | ||
==Definition== | ==Definition== | ||
Let <math>k</math> be a real number (typically an integer). The '''divisor power sum function''' <math>\sigma_k</math> is defined as the following [[arithmetic function]] from the natural numbers to the real numbers: | Let <math>k</math> be a real number (typically an integer). The '''divisor power sum function''' (sometimes called the '''divisor function''') <math>\sigma_k</math> is defined as the following [[arithmetic function]] from the natural numbers to the real numbers: | ||
<math>\sigma_k(n) = \sum_{d|n} d^k</math>. | <math>\sigma_k(n) = \sum_{d|n} d^k</math>. |
Revision as of 22:16, 2 May 2009
This article defines an arithmetic function or number-theoretic function: a function from the natural numbers to a ring (usually, the ring of integers, rational numbers, real numbers, or complex numbers).
View a complete list of arithmetic functions
Definition
Let be a real number (typically an integer). The divisor power sum function (sometimes called the divisor function) is defined as the following arithmetic function from the natural numbers to the real numbers:
.
The sum is over all the positive divisors of .
Definition in terms of Dirichlet product
The divisor power sum function is defined as:
.
Here is the power function, and is the all ones function.
Particular cases
The case
The case gives the divisor count function, i.e., the function that counts the number of positive divisors of .
The case
The case gives the divisor sum function, i.e., the sum of all the positive divisors.