Introduction to Divisibility Rules

In mathematics, especially in number theory, divisibility is a fundamental concept that helps us understand when one number can be divided by another without leaving a remainder. For example, 12 is divisible by 3 because 12 / 3 = 4 exactly, with no remainder.

Why is this important? In competitive exams and problem-solving, quickly determining whether a number is divisible by another saves time and effort. Instead of performing long division, you can use simple rules to check divisibility instantly. These rules are especially useful when dealing with large numbers or simplifying fractions.

This chapter will guide you through the most common divisibility rules, starting from the simplest and moving to more complex ones. You will learn how to apply these rules, understand their reasoning, and use them in real-life contexts such as dividing money or measuring quantities.

Basic Divisibility Rules

Let's begin with the divisibility rules for some of the most frequently encountered numbers: 2, 3, 5, 9, and 10. These rules rely on patterns in the digits of a number, making them easy to remember and apply.

Why do these rules work? For 2 and 5, the last digit determines divisibility because of the base-10 number system. For 3 and 9, the sum of digits rule works because 10 ≡ 1 (mod 3 or 9), so each digit contributes its face value modulo 3 or 9.

Divisibility Rules for 4, 6, and 8

Next, we explore divisibility rules for 4, 6, and 8. These are slightly more involved but still rely on patterns in the digits.

Notice how the rules for 4 and 8 focus on the last two or three digits. This is because powers of 10 (like 100 or 1000) are divisible by 4 and 8 respectively, so only the last digits affect divisibility.

Divisibility Rules for 7, 11, and 13

Divisibility rules for 7, 11, and 13 are less straightforward but can be mastered with practice. These rules often involve a process of subtraction or addition of parts of the number.

Divisibility by 7 (Doubling and Subtracting Method)

To check if a number is divisible by 7:

1. Take the last digit of the number.
2. Double it.
3. Subtract this doubled value from the remaining leading part of the number.
4. If the result is divisible by 7 (including 0), then the original number is divisible by 7.
5. If not, repeat the process with the new number.

graph TD    A[Start with number N] --> B[Separate last digit d]    B --> C[Double d to get 2d]    C --> D[Subtract 2d from remaining number]    D --> E{Is result divisible by 7?}    E -->|Yes| F[Original number divisible by 7]    E -->|No| G[Repeat process with new number]

Divisibility by 11 (Alternating Sum Method)

Sum the digits in odd positions and the digits in even positions separately. If the difference between these two sums is divisible by 11 (including 0), then the number is divisible by 11.

Divisibility by 13

A similar method to 7 can be used: multiply the last digit by 4 and add it to the remaining leading number. Repeat until a small number is obtained. If that number is divisible by 13, so is the original.

Prime Factorization and Divisibility

Understanding prime factorization helps us see why divisibility rules work and how to check divisibility for composite numbers.

Prime factorization is expressing a number as a product of prime numbers. For example, 12 = 2 x 2 x 3.

If a number is divisible by another, it must contain all the prime factors of that number.

Here, 60 is factorized into 6 and 10, which further break down into primes 2, 3, 2, and 5. To check if a number is divisible by 60, it must be divisible by 2, 3, and 5 in the correct powers.

Worked Examples