When we say one number divides another, we're saying it fits perfectly inside it, with nothing left over. For example, 3 divides 12 because we can make 12 by adding four 3s together. In the language of mathematics, this is a very specific relationship.

This definition is the bedrock for many ideas in number theory. For example, $4|20$ because $20 = 4 \times 5$. Here, our integer $c$ is 5. On the other hand, $4$ does not divide $22$, because there's no integer you can multiply by 4 to get exactly 22. Notice that any integer $a$ divides 0, since $0 = a \times 0$. The only number that doesn't divide anything is 0 itself, since division by zero is undefined.

Divisibility follows a few logical rules. Understanding them helps us reason about how numbers relate to each other without doing a lot of calculation.

First, divisibility is transitive. If a number fits perfectly inside a second number, and that second number fits perfectly inside a third, then the first number must also fit inside the third. It's like Russian nesting dolls. If a small doll fits in a medium one, and the medium one fits in a large one, the small one definitely fits in the large one.

Formally, if $a|b$ and $b|c$, then $a|c$.

Another powerful property involves linear combinations of numbers. If a number $a$ divides two other numbers, say $b$ and $c$, then it must also divide any sum or difference of their multiples. This might sound complicated, but it's incredibly useful for proving more advanced results in number theory.

Stated mathematically, if $a|b$ and $a|c$, then for any integers $x$ and $y$, we have $a|(bx + cy)$.

Let's test this. We know $4|8$ and $4|12$. Let's pick two random integers for $x$ and $y$, say $x=2$ and $y=5$. The linear combination is $8(2) + 12(5) = 16 + 60 = 76$. Does 4 divide 76? Yes, $76 = 4 \times 19$. The property holds.

What happens when one number doesn't divide another perfectly? We get a remainder. The process of long division is something we all learn in school, but in number theory, it's formalised by a theorem called the Division Algorithm. It's less of an algorithm and more of a guarantee.

Let's see this with an example. Suppose we want to divide $a = 29$ by $b = 6$. We are looking for integers $q$ and $r$ such that $29 = 6q + r$, with the condition that $0 \le r < 6$.

We know that $6 \times 4 = 24$, which is the largest multiple of 6 that doesn't exceed 29. So, our quotient is $q=4$. The amount left over is $29 - 24 = 5$. This is our remainder, $r=5$. Since $0 \le 5 < 6$, our condition is met.

Thus, we have $29 = 6(4) + 5$. The Division Algorithm guarantees that $q=4$ and $r=5$ are the only integers that work for this pair of numbers. This idea of a unique quotient and remainder, especially the remainder, is a cornerstone for concepts like modular arithmetic.

Understanding these basic properties of how integers divide one another is the first step. With this foundation, we can begin to explore the deeper structures hidden within the world of numbers.