abundant number

An integer $n$ is an abundant number if the sum of the proper divisors of $n$ is more than $n$ itself, or the sum of all the divisors is more than twice $n$ . That is, $\\sigma(n)>2n$ , with $\\sigma(n)$ being the sum of divisors function.

For example, the integer 30. Its proper divisors are 1, 2, 3, 5, 6, 10, 15, which add up to 42.

Multiplying a perfect number by some integer $x$ gives an abundant number (as long as $x>1$ ).

Given a pair of amicable numbers, the lesser of the two is abundant, its proper divisors adding up to the greater of the two.

单词	AbundantNumber
释义	abundant number An integer $n$ is an abundant number if the sum of the proper divisors of $n$ is more than $n$ itself, or the sum of all the divisors is more than twice $n$ . That is, $\\sigma(n)>2n$ , with $\\sigma(n)$ being the sum of divisors function. For example, the integer 30. Its proper divisors are 1, 2, 3, 5, 6, 10, 15, which add up to 42. Multiplying a perfect number by some integer $x$ gives an abundant number (as long as $x>1$ ). Given a pair of amicable numbers, the lesser of the two is abundant, its proper divisors adding up to the greater of the two.
随便看	upper bound on ϑ⁢(n) UpperHalfPlane upper half plane UpperNilradical upper nilradical UpperSet upper set UpperSetOperationIsAClosureOperator upper set operation is a closure operator UpwardLowenheimSkolemTheorem upward Lowenheim-Skolem theorem UrysohnExtensionTheorem Urysohn extension theorem UrysohnMetrizationTheorem Urysohn metrization theorem UrysohnsLemma Urysohn’s lemma UsingConvolutionToFindLaplaceTransform using convolution to find Laplace transform UsingLaplaceTransformToSolveHeatEquation using Laplace transform to solve heat equation UsingLaplaceTransformToSolveInitialValueProblems using Laplace transform to solve initial value problems UsingMinkowskisConstantToFindAClassNumber using Minkowski’s constant to find a class number