◀ ▲ ▶Branches / Number-theory / Definition: Divisor, Complementary Divisor, Multiple

Definition: Divisor, Complementary Divisor, Multiple

Divisibility is a relation $R\subseteq \mathbb Z \times \mathbb Z$ denoted by the sign "$\mid$" and defined as follows:

$$d\mid n:=\Leftrightarrow\exists m\in\mathbb Z\;\; d\cdot m=n\wedge d\neq 0.\label{E18333}\tag{1}$$

In other words, for two integers $n,d\in\mathbb Z$ with $d\neq 0$ $d$ is a divisor of $n$, denoted by $d\mid n$ if and only if there is an \(m\in\mathbb Z\) with \(dm=n\). In order to indicate that \(d\) is a divisor of \(n\) we write \(d\mid n\), otherwise we write \(d\not\mid n\).

There are some related concepts, which shall be introduced here also:

• The integer \(m=\frac nd\) (if it exists) is unique and called complementary divisor of \(d\) with respect to \(n\).
• The number $n$ is called the multiple of $d$ and $m.$¹
• A divisor \(d\mid n\) is called a trivial divisor of \(n\), if \(d=1\) or \(d=n\), otherwise, it is called a non-trivial divisor.
• A proper divisor of \(n\) is a non-trivial divisor \(d\mid n\) with \(d\neq n.\)

Table of Contents

Examples: 1

Mentioned in:

Corollaries: 1 2
Definitions: 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17
Examples: 18 19 20 21
Explanations: 22
Lemmas: 23 24 25 26
Motivations: 27
Parts: 28 29
Proofs: 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74
Propositions: 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98
Theorems: 99 100 101 102

Thank you to the contributors under CC BY-SA 4.0!

Github:

References

Bibliography

1. Kramer Jürg, von Pippich, Anna-Maria: "Von den natürlichen Zahlen zu den Quaternionen", Springer-Spektrum, 2013

Footnotes