AliquotSum
The sum of the proper divisors of n: .
AliquotSum(n), the sum of the divisors of other than itself.SageMath
sigma(abs(n), 1) - abs(n)SymPydivisor_sigma(abs(n)) - abs(n)Typed signatures
| Type | Package | Applies |
|---|---|---|
(integer) -> integer | number-theory | always |
Details
- A prime has aliquot sum 1, and since 1 has no proper divisor.
- Defined on nonzero integers, with the sign of a unit, as in PrimeOmega: . At 0 it stays unevaluated.
- Iterating gives the aliquot sequence; is perfect when , and are amicable when and .
- Neither Wolfram, Sage nor SymPy names it.
Plot
Examples
Basic #
Scope #
Properties #
About
| Examples | 11 |
|---|---|
| Checked against | Wolfram Language 10 agree1 differSageMath 10 agree1 errorSymPy 10 agree1 errormathlib4 7 agree1 unevaluated3 errorJulia 10 agree1 error |
| Crosswalk | WikipediaMathWorldOEISSageMathSymPy |
Implementation
mapped
wolframpackages/oracle/src/mappings.tsWolfram has no head for it; this is its definition, with the sign of n a unit.
mapped
sympypackages/oracle/src/mappings.tsmapped
sagepackages/oracle/src/mappings.tsSage has no head for it; this is its definition, with the sign of n a unit.
mapped
juliapackages/oracle/src/mappings.tsmapped
mathlib4packages/oracle/src/mappings.tsThe sum over Nat.properDivisors, so aliquot 0 = 0; natural n only, where ours takes the sign of n as a unit.
See also: Abundance, DivisorSigma, Divisors, IsPerfect