Divisibility Notation

Welcome, students, to one of the most important ideas in number theory: divisibility notation 📘. This lesson will show you how mathematicians write statements about divisibility, why this language is useful, and how it connects to later ideas like greatest common divisors and linear combinations. By the end, you should be able to read and use divisibility notation confidently, explain what it means in words, and apply it in simple proofs and examples.

Learning goals for this lesson:

Explain the main ideas and terminology behind divisibility notation.
Apply number theory reasoning related to divisibility notation.
Connect divisibility notation to the broader topic of divisibility and basic proof.
Summarize how divisibility notation fits into number theory.
Use evidence or examples to support divisibility statements.

What does divisibility mean?

In everyday life, divisibility is about whether one number fits into another evenly. For example, $12$ can be divided by $3$ with no remainder, so we say $3$ divides $12$. On the other hand, $12$ does not divide evenly by $5$, because $12 \div 5$ gives a remainder.

Mathematically, we write $a \mid b$ to mean “$a$ divides $b$.” This means there is some integer $k$ such that $b = ak$. In other words, $b$ is a multiple of $a$.

For example:

$3 \mid 12$ because $12 = 3 \cdot 4$.
$5 \mid 20$ because $20 = 5 \cdot 4$.
$4 \nmid 10$ because there is no integer $k$ such that $10 = 4k$.

That little symbol $\mid$ is very important. It helps us write short, precise statements in number theory. Instead of saying “$a$ goes into $b$ evenly,” we can say $a \mid b$.

A key idea to remember is that divisibility is only defined for integers in this course. So when we write $a \mid b$, we usually mean $a$ and $b$ are integers and $a \neq 0$.

Reading and interpreting the notation

When you see $a \mid b$, read it as “$a$ divides $b$” or “$a$ is a divisor of $b$.” The number $a$ is called a divisor or factor of $b$. The number $b$ is a multiple of $a$.

Here are some useful translations:

$a \mid b$ means $b$ is a multiple of $a$.
$a \nmid b$ means $a$ does not divide $b$.
If $a \mid b$, then $b = ak$ for some integer $k$.

Example: since $7 \mid 35$, we know $35 = 7 \cdot 5$. So $7$ is a factor of $35$, and $35$ is a multiple of $7$.

This notation also works with negative numbers. For example, $4 \mid -12$ because $-12 = 4 \cdot (-3)$. Similarly, $-4 \mid 12$ because $12 = (-4) \cdot (-3)$. In divisibility, signs matter less than the idea of integer multiples.

A common mistake is to think that $a \mid b$ means $a < b$. That is not always true. For example, $12 \mid 36$, but also $12 \mid 12$. In fact, any nonzero integer divides itself because $a = a \cdot 1$.

Another useful fact is that $1$ divides every integer, because any integer $n$ can be written as $n = 1 \cdot n$.

Divisibility notation in action

Let’s practice with examples. Suppose students is checking whether $6 \mid 42$.

We ask: is there an integer $k$ such that $42 = 6k$? Yes, because $42 = 6 \cdot 7$. So $6 \mid 42$.

Now check whether $8 \mid 30$.

We look for an integer $k$ with $30 = 8k$. Since $30 \div 8 = 3.75$, there is no integer $k$. So $8 \nmid 30$.

This idea connects closely to remainders. If one integer divides another, the remainder is $0$. For instance, when $45$ is divided by $9$, the remainder is $0$, so $9 \mid 45$.

Divisibility notation is also useful in algebra. Suppose $a \mid b$ and $a \mid c$. Then $a$ divides both numbers. This can help us prove that $a$ divides combinations like $b+c$ or $b-c$. For example, if $4 \mid 20$ and $4 \mid 12$, then $4 \mid (20+12)$ because $20+12=32$, and $32=4\cdot 8$.

This is one reason divisibility notation is powerful: it lets us make general statements, not just one-time calculations.

Basic proof ideas using divisibility notation

Number theory often uses short proofs based on the definition of divisibility. The definition is the starting point.

Suppose we want to prove: if $a \mid b$ and $a \mid c$, then $a \mid (b+c)$.

Here is the reasoning:

If $a \mid b$, then $b = am$ for some integer $m$.
If $a \mid c$, then $c = an$ for some integer $n$.
Then $b+c = am + an = a(m+n)$.
Since $m+n$ is an integer, $a \mid (b+c)$.

This proof works because we used the definition of divisibility carefully.

A similar proof shows that if $a \mid b$, then $a \mid kb$ for any integer $k$. If $b = am$, then $kb = k(am) = a(km)$, and $km$ is an integer.

These kinds of results show how divisibility notation helps us make logical arguments. Instead of checking many examples, we use the structure of integers.

Another common proof uses contradiction. For example, if someone claims $6 \mid 25$, you can test that claim by asking whether $25 = 6k$ for some integer $k$. Since no integer works, the statement is false.

Connection to greatest common divisors and linear combinations

Divisibility notation is not just a symbol by itself. It connects to bigger ideas in number theory.

A greatest common divisor, written $\gcd(a,b)$, is the largest positive integer that divides both $a$ and $b$. For example, $\gcd(12,18)=6$ because $6$ divides both $12$ and $18$, and no larger positive integer does.

Notice how divisibility notation helps define $\gcd$. We are looking for numbers $d$ such that $d \mid a$ and $d \mid b$.

Divisibility also appears in linear combinations. A linear combination of integers $a$ and $b$ has the form $ax + by$, where $x$ and $y$ are integers. If $d \mid a$ and $d \mid b$, then $d$ divides every linear combination $ax + by$.

For example, if $4 \mid 12$ and $4 \mid 20$, then $4$ divides $12x + 20y$ for any integers $x$ and $y$. Why? Because $12=4\cdot 3$ and $20=4\cdot 5$, so

12x + 20y = $4\cdot 3$x + $4\cdot 5$y = 4(3x+5y).

Since $3x+5y$ is an integer, $4 \mid (12x+20y)$.

This idea becomes very important later when studying the relationship between $\gcd(a,b)$ and linear combinations of $a$ and $b$.

Helpful properties of divisibility

Here are several facts that are often used in number theory:

If $a \mid b$ and $b \mid c$, then $a \mid c$.
If $a \mid b$, then $a \mid bc$ for any integer $c$.
If $a \mid b$ and $a \mid c$, then $a \mid (b+c)$ and $a \mid (b-c)$.
If $a \mid b$ and $b \neq 0$, then $|a| \le |b|$ may be true in many cases, but not always when signs are involved in a simple way, so be careful. The safest rule is to use the definition $b=ak$.

Let’s use a chain example. If $2 \mid 6$ and $6 \mid 18$, then $2 \mid 18$. This is because $18=6\cdot 3$ and $6=2\cdot 3$, so $18=2\cdot 9$.

Another example: if $5 \mid 15$, then $5 \mid 15x$ for any integer $x$. For instance, $5 \mid 45$ because $45 = 15 \cdot 3$, and $15$ itself is divisible by $5$.

These properties help you simplify calculations and build proofs step by step.

Common mistakes to avoid

When learning divisibility notation, students, it helps to watch out for a few mistakes ⚠️.

Do not confuse $a \mid b$ with $a/b$ as a fraction. The symbol $\mid$ is a statement, not an arithmetic operation.
Do not assume $a \mid b$ means $a < b$.
Do not forget that $a \mid b$ means there must be an integer multiplier.
Do not use decimal multipliers in proofs. For divisibility, the multiplier must be an integer.

For example, $4 \mid 20$ is true because $20 = 4 \cdot 5$. But $4 \mid 18$ is false because $18 = 4 \cdot 4.5$, and $4.5$ is not an integer.

The best habit is to always rewrite a divisibility statement in the form $b=ak$ with $k$ an integer.

Conclusion

Divisibility notation is one of the main languages of number theory. The statement $a \mid b$ tells us that $a$ divides $b$ exactly, meaning $b$ is an integer multiple of $a$. This notation makes it easier to express ideas clearly, test examples, and prove important results.

It also connects directly to later topics in divisibility and basic proof, especially greatest common divisors and linear combinations. By understanding $a \mid b$ deeply, you are building the foundation for more advanced number theory reasoning. Keep practicing by translating between words, symbols, and examples, and you will become much more confident with proofs and integer relationships 😊.

Study Notes

$a \mid b$ means “$a$ divides $b$.”
$a \mid b$ is true exactly when $b = ak$ for some integer $k$.
$a \nmid b$ means $a$ does not divide $b$.
Divisibility is about integer multiples and remainders of $0$.
$1$ divides every integer, and every nonzero integer divides itself.
If $a \mid b$ and $a \mid c$, then $a \mid (b+c)$ and $a \mid (b-c)$.
If $a \mid b$, then $a \mid kb$ for any integer $k$.
Divisibility notation is used to define and study $\gcd(a,b)$.
If $d \mid a$ and $d \mid b$, then $d$ divides every linear combination $ax+by$.
The safest way to prove a divisibility statement is to start from the definition $b=ak$.