Math 2.0

definition

Deficient number

Definition

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

Remarks

Each prime pp is deficient, since its only smaller divisor is 11. More generally, each prime power is deficient. For example, 1+2+4=7<81 + 2 + 4 = 7 < 8. Each divisor of a deficient number or of a perfect number, other than the number itself, is deficient.

Explanations

L1 human

A deficient number has "too few" divisors: its smaller divisors add up to less than the number. Most small numbers are deficient, for example 1,2,3,4,5,7,8,9,101, 2, 3, 4, 5, 7, 8, 9, 10.

What this node 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 node is. They do not measure its truth.

What this needs

To read this node, read these 6 nodes in this order. The foundations come first, and the list ends with this node.

Each node uses the nodes above it. The colour of the bar on a box shows the evidence level, and the box also gives it as text. The list below has the same nodes.
  • 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. Deficient number definition

Sources

  1. Web https://en.wikipedia.org/wiki/Deficient_number, lead section