**commit** a203d958bc494519e4428537817c9e6b7e8da203
**parent** 7af9c83bca436e505783c6cfb5aae0b15f9c837f
**Author:** Chris Noxz <chris@noxz.tech>
**Date:** Wed, 25 Sep 2019 13:05:57 +0200
Emphasise integers are being used when proving divisibility
**Diffstat:**

1 file changed, 4 insertions(+), 3 deletions(-)

**diff --git a/noxz.tech/guides/mathematics/index.md b/noxz.tech/guides/mathematics/index.md**
@@ -29,7 +29,8 @@ out there.
When it comes to divisibility there exists some neat theorems to test a certain
number's different divisibilities, or factors. Following are those theorems and
their proof. Some of the proofs are more trivial than others, such as the proof
-for divisibility by 1, 2, 5 and 10.
+for divisibility by 1, 2, 5 and 10. From here on out it's assumed that every
+number, when working with divisibility, is an integer.
What is the smallest number that is divisible by 1 through 10? The answer is
{- class="spoiler"}2520{--}. You can try the different divisibility theorems
@@ -1324,7 +1325,7 @@ divisible by 10.
{--}
### {- id="math-div-theorems-11"}Divisibility by 11{--}
-The theorem goes that an integer number is divisible by 11 if, and only if, the
+The theorem goes that a number is divisible by 11 if, and only if, the
alternate sum of its digits is divisible by 11, like so:
{- class="math block"}
@@ -1579,7 +1580,7 @@ expression is divisible by 11, and so the theorem is proven.
..{--}
{--}
-We have shown that the procedure above will hold for all cases, as the integer
+We have shown that the procedure above will hold for all cases, as the number
can be extended with infinite digits and still follow the same pattern.
{- id="math-fractions"}Fractions{--}