Abundance
How far the divisors of n overshoot twice n: .
Abundance(n), where is the sum of the divisors of .SageMath
sigma(abs(n), 1) - 2*abs(n)SymPyabundance(abs(n))Typed signatures
| Type | Package | Applies |
|---|---|---|
(integer) -> integer | number-theory | always |
Details
- Positive for an abundant number, zero for a perfect one, negative for a deficient one.
- Defined on nonzero integers, with the sign of a unit, as in PrimeOmega: . At 0 it stays unevaluated.
- , which makes IsPerfect the test for 0.
- Neither Wolfram nor Sage names it; SymPy's
abundanceanswers positive integers only.
Plot
Examples
Basic #
Scope #
Applications #
Properties #
About
| Examples | 12 |
|---|---|
| Checked against | Wolfram Language 11 agree1 differSageMath 11 agree1 errorSymPy 11 agree1 unevaluatedJulia 11 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.ts See also: AliquotSum, DivisorSigma, IsPerfect, PerfectNumber