sigma function

The divisor function of order k is the number theoretic function that gives the sum of kth powers of divisors of a given integer.

The divisor function σ_k(n) for n an integer is defined as the sum of the kth powers of the (positive integer) divisors of n, σ_k(n) congruent sum_(d|n) d^k. It is implemented in the Wolfram Language as DivisorSigma[k, n].

Dirichlet divisor problem | distinct prime factors | divisor | divisor product | even divisor function | factor | Fermat's divisor problem | greatest prime factor | Gronwall's theorem | highly composite number | least prime factor | multiperfect number | odd divisor function | Ore's conjecture | perfect number | prime factor | refactorable number | restricted divisor function | Robin's theorem | Silverman constant | sociable numbers | sum of squares function | superabundant number | tau function | totient function | totient valence function | twin peaks | unitary divisor function

DivisorSigma

college level