Mathematics X
Real Numbers
Divisibility
What is meant by divisibility in Mathematics?
In mathematics, divisibility refers to the relationship between two numbers where one number can be evenly divided by another number without leaving a remainder. It is a fundamental concept used to determine if one number is a factor or multiple of another number.
Let us consider two integers, [math]\displaystyle{ a }[/math] and [math]\displaystyle{ b }[/math]. We say that "[math]\displaystyle{ a }[/math] is divisible by [math]\displaystyle{ b }[/math]" or "[math]\displaystyle{ b }[/math] divides [math]\displaystyle{ a }[/math]" if there exists an integer [math]\displaystyle{ k }[/math] such that when we multiply [math]\displaystyle{ b }[/math] by [math]\displaystyle{ k }[/math], we obtain [math]\displaystyle{ a }[/math]. In other words, [math]\displaystyle{ a = bk }[/math]
The terms used to describe this relationship are as follows:
Dividend: The number being divided "[math]\displaystyle{ a }[/math]".
Divisor: The number by which the dividend is divided "[math]\displaystyle{ b }[/math]".
Quotient: The result of the division, the integer obtained "[math]\displaystyle{ k }[/math]".
Remainder: The whole number that is left over when the dividend is divided by the divisor (if it is not evenly divisible).
If the remainder is zero, it indicates that the division is exact, and the dividend is divisible by the divisor. Conversely, if the remainder is not zero, it means the division is not exact, and the dividend is not divisible by the divisor.
Divisibility plays a significant role in many areas of mathematics, including number theory, algebra, arithmetic, and cryptography. It is used to determine prime numbers, factors, multiples, common divisors, and various properties of integers. Divisibility rules and properties provide useful shortcuts and techniques to identify divisibility without performing actual division calculations, making it a valuable tool in problem-solving and mathematical reasoning.
Here are some key points to consider when exploring the divisibility of numbers:
Divisibility by 2: A number is divisible by 2 if its units digit is even, meaning it ends with 0, 2, 4, 6, or 8. For example, 24, 136, and 1,790 are divisible by 2.
Divisibility by 3: A number is divisible by 3 if the sum of its digits is divisible by 3. For example, 87 (8 + 7 = 15) and 1,452 (1 + 4 + 5 + 2 = 12) are divisible by 3.
Divisibility by 4: A number is divisible by 4 if the number formed by its last two digits is divisible by 4. For example, 2,408 (08 is divisible by 4) and 456 (56 is divisible by 4) are divisible by 4.
Divisibility by 5: A number is divisible by 5 if its units digit is 0 or 5. For example, 250 and 1,035 are divisible by 5.
Divisibility by 6: A number is divisible by 6 if it is divisible by both 2 and 3. In other words, it should satisfy the criteria for divisibility by 2 and 3 simultaneously. For example, 48 (divisible by 2 and 3) and 198 (divisible by 2 and 3) are divisible by 6.
Divisibility by 9: A number is divisible by 9 if the sum of its digits is divisible by 9. For example, 2,601 (2 + 6 + 0 + 1 = 9) and 4,914 (4 + 9 + 1 + 4 = 18) are divisible by 9.
Divisibility by 10: A number is divisible by 10 if it ends with a zero, indicating that it is a multiple of 10. For example, 80, 1,350, and 25,000 are divisible by 10.
These are some of the basic rules for divisibility by small integers. However, there are more complex rules for divisibility by larger primes and composite numbers. For example, divisibility rules for 7, 11, and 13 involve alternating digit sums and differences.
Understanding the concept of divisibility and applying the relevant rules can greatly simplify calculations, factorisation, and problem-solving in mathematics. Divisibility plays a crucial role in determining factors, multiples, prime numbers, and various properties of integers, making it an essential concept across different branches of mathematics.
How do we denote "[math]\displaystyle{ a }[/math] divides b"?
In mathematics, we express the relationship of divisibility by saying "a divides b" or "b is divisible by a." Symbolically, we use the notation "a | b" to represent this concept.
Using the notation "a | b," we can say that "a divides b" if there exists an integer k such that a * k = b. In other words, if we can find an integer k such that when we multiply a by k, we obtain b, then we say that a divides b.
For example:
If 3 divides 12, we write it as 3 | 12, because 3 * 4 = 12. If 7 divides 35, we write it as 7 | 35, because 7 * 5 = 35. If 2 does not divide 9, we write it as 2 does not divide 9, or equivalently, 2 does not | 9, because there is no integer k such that 2 * k = 9. The notation "a | b" is a concise and commonly used way to express the concept of divisibility in mathematics. It helps in stating properties, theorems, and relationships related to divisibility, and it allows for clearer and more efficient communication about the mathematical relationships between numbers.
