Divisor sum function: Difference between revisions

From Number
No edit summary
Line 17: Line 17:


<math>\sigma(n) = \prod_{i=1}^r \left(\frac{p_i^{k_i + 1} - 1}{p_i - 1}\right)</math>.
<math>\sigma(n) = \prod_{i=1}^r \left(\frac{p_i^{k_i + 1} - 1}{p_i - 1}\right)</math>.
==Behavior==
===Lower bound===
The divisor sum function takes its lowest values (in relative terms) at primes. <math>\sigma(p) = p + 1</math> for any prime number <math>p</math>.
Thus, we have:
<math>\lim_{n \to \infty} \sigma(n) \to \infty</math>,
and:
<math>\lim\inf_{n \to \infty} \frac{\sigma(n)}{n} = 1</math>,
===Upper bound===
{{fillin}}


==Relation with other arithmetic functions==
==Relation with other arithmetic functions==

Revision as of 00:13, 29 April 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 n be a natural number. The divisor sum function of n, denoted σ(n), is defined in the following equivalent ways:

  1. σ is the Dirichlet product of the identity function E on the natural numbers and the all-one function U: the function sending every natural number to 1.
  2. We have σ(n)=d|nd.

Formula in terms of prime factorization

Suppose we have:

n=p1k1p2k2prkr,

where the pi are distinct prime divisors of n. Then:

σ(n)=i=1r(piki+11pi1).

Behavior

Lower bound

The divisor sum function takes its lowest values (in relative terms) at primes. σ(p)=p+1 for any prime number p.

Thus, we have:

limnσ(n),

and:

liminfnσ(n)n=1,

Upper bound

Fill this in later

Relation with other arithmetic functions

Relations expressed in terms of Dirichlet products

Relation with properties of numbers

Properties

σ is a multiplicative function but not a completely multiplicative function.