Math 2.0

Number theory Definition

Abundant number

Builds on Sum of divisors

Definition

A positive integer nn is abundant if the sum of its positive divisors other than nn is greater than nn. Equivalently, σ(n)>2n\sigma(n) > 2n, where σ\sigma is the sum of divisors.

Remarks

The smallest abundant number is 1212, since 1+2+3+4+6=16>121 + 2 + 3 + 4 + 6 = 16 > 12. The smallest odd abundant number is 945945. Each multiple knkn with k≥2k \ge 2 of a perfect number nn is abundant.

Reading path

To understand this page from the ground up, read these 6 pages in order. The foundations come first.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Arithmetic function definition
  2. Divisibility definition
  3. Divisors of a natural number definition
  4. Divisor function definition
  5. Sum of divisors definition
  6. Abundant number definition

Further reading

  1. Web https://en.wikipedia.org/wiki/Abundant_number, Definition and examples
About this page
Tag0VS0MP1P5H
URIm2://0VS0MP1P5H
Kinddefinition
WritingW1 stated
MSC11A25
DefinesAbundant number
UsesSum of divisors

Markdown · JSON · Edit on GitHub

What this page needs for W2

  • edge instance_of in: one example (0 of 1)
  • edge not_instance_of in: one non-example that fails one clause (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.