Math 2.0

definition

Divisors of a natural number

Definition

Let nn be a positive integer. The set of divisors of nn is the set of positive integers dd that divide nn: D(n)={d∈Z>0:d∣n}.D(n) = \{ d \in \mathbb{Z}_{>0} : d \mid n \}.

Remarks

The set D(n)D(n) is finite, because each d∈D(n)d \in D(n) satisfies 1≤d≤n1 \le d \le n. It always contains 11 and nn. For example, D(12)={1,2,3,4,6,12}D(12) = \{1, 2, 3, 4, 6, 12\}. The map d↦n/dd \mapsto n/d is a bijection from D(n)D(n) to itself. Sums over D(n)D(n) define the divisor function and the Dirichlet convolution.

Explanations

L1 human

The divisors of nn are the numbers that go into nn with no remainder. They come in pairs dd and n/dn/d. For n=12n = 12, the pairs are 11 and 1212, 22 and 66, and 33 and 44.

What this node needs for W1
  • an inventory row: the row of the inventory that the node accounts for (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 2 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. Divisibility definition
  2. Divisors of a natural number definition

What depends on this

13 nodes use this node, directly or through other nodes.

Sources

  1. Web https://en.wikipedia.org/wiki/Divisor, Definition