Divisors of a natural number
Definition
Let be a positive integer. The set of divisors of is the set of positive integers that divide :
Remarks
The set is finite, because each satisfies . It always contains and . For example, . The map is a bijection from to itself. Sums over define the divisor function and the Dirichlet convolution.
Explanations
L1 human
The divisors of are the numbers that go into with no remainder. They come in pairs and . For , the pairs are and , and , and and .
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.
- no evidence level
- Divisibility definition
- Divisors of a natural number definition
What depends on this
13 nodes use this node, directly or through other nodes.
- Sum of divisors 009QCP5T3Z
- Multiplicativity of the divisor function 04WC36XKV6
- Möbius inversion formula 07Q4TBTFVB
- The Möbius function is the inverse of the constant function 1 0ASC73QEQT
- Number of divisors 0BKJT6WG96
- Deficient number 0G01TS1RRP
- Dirichlet convolution 0KH1N66QWW
- Dirichlet convolution of multiplicative functions is multiplicative 0PR88XHDMB
- Dirichlet convolution formula 0SAR26CKPS
- Perfect number 0SB7Q8SYSF
- Abundant number 0VS0MP1P5H
- Euclid–Euler theorem 0WETJCKNRG
- Divisor function 0YEW47VJ0J
Sources
- Web https://en.wikipedia.org/wiki/Divisor, Definition
What links here
Used by
- Number of divisors 0BKJT6WG96
- Dirichlet convolution 0KH1N66QWW
- Divisor function 0YEW47VJ0J