Divisibility: Definition and Basic Properties
You'll learn what it means for one integer to divide another and discover the foundational properties that govern divisibility relationships.
What Does "Divides" Mean?
When we say an integer a divides b (written as a | b), we mean there exists some integer k such that b = a × k. In other words, when you divide b by a, you get zero remainder — the division is "clean."
Example: 3 | 12 because 12 = 3 × 4. But 3 does not divide 13 (written 3 ∤ 13) because there's no integer k making 13 = 3k.
Think of divisibility like packing: if you can perfectly pack b items into boxes of size a with no leftovers, then a divides b.
Fundamental Properties
Here are the bedrock rules of divisibility:
-
Transitivity: If a | b and b | c, then a | c
- If 3 | 6 and 6 | 18, then 3 | 18
-
Linear Combination: If a | b and a | c, then a divides any linear combination (bx + cy)
- If 5 | 20 and 5 | 35, then 5 | (20×2 + 35×3) = 5 | 145
-
Reflexivity: Every integer divides itself: a | a
-
Divisibility by 1: 1 divides every integer
-
Zero Rule: Every nonzero integer divides 0, but 0 only divides 0
These properties aren't just abstract — they're the machinery behind modular arithmetic, greatest common divisors, and prime factorization.
Key Takeaway: Divisibility captures when one integer is an exact multiple of another; its basic properties (transitivity, linear combinations, reflexivity) form the foundation of all number-theoretic reasoning about factors, multiples, and division.