Divisibility Rules
Divisibility by 2:
Even numbers are divisible by 2.
For example, 230, 272, 1994, 456, and 118 are even numbers. These numbers are divisible by 2.
The remainder when an integer is divided by 2 is equal to the remainder when its units digit is divided by 2. Alternatively, if an integer is odd, its remainder when divided by 2 is 1; if it is even, its remainder when divided by 2 is 0.
For example, the numbers 2001, 123, 1995, 987, and 456789 leave a remainder of 1 when divided by 2;
The numbers 2000, 102, 124, 376, and 99998 leave a remainder of 0 when divided by 2.
Divisibility by 3:
An integer is divisible by 3 if the sum of its digits is a multiple of 3.
For example, the sum of the digits of 123456 is \( 1+2 +3 +4 +5 +6 =21\). Since 21 is a multiple of 3, this number is divisible by 3.
The remainder when an integer is divided by 3 is equal to the remainder when the sum of its digits is divided by 3.
For example, the sum of the digits of 23518 is 19. Since 19 leaves a remainder of 1 when divided by 3, the number 23518 leaves a remainder of 1 when divided by 3.
Examples:
- Let’s find all possible digits that can replace a if the five-digit number 25a31 is divisible by 3.
\(\to\) The sum of the digits of 25a31 must be a multiple of 3. Therefore,
\[2 + 5 + a + 3 + 1 = 3k \quad(k \in Z)\]
This simplifies to \(11 + a = 3k\). For the sum \(11 + a\) to be a multiple of 3, the possible values for the digit a are 1, 4, and 7. (Since a is a digit, its value must be a single-digit integer from 0 to 9).
- Given that the two-digit number ab and the five-digit number ab8cd are both divisible by 3, let’s determine all possible values for the sum of the digits c and d.
\(\to\) Since \(ab\) and \(ab8cd\) are divisible by 3, we can write \(a+b=3k \quad (k \in Z)\) and \(a+b+8+c+d=3p \quad (p \in Z)\). Subtracting the smaller equation from the larger equation yields \(8+c+d=3(p- k)\). Therefore, for the sum \(8 + c + d\) to be a multiple of 3, the sum c + d must be 1, 4, 7, 10, 13, or 16.
- If the four-digit number 238a leaves a remainder of 2 when divided by 3, let’s find the greatest possible value for the digit a.
\(\to\) Since \(238a\) leaves a remainder of \(2\) when divided by \(3\), we have \(2 + 3 + 8 + a = 3k+2 \quad (k \in Z)\). This simplifies to \(13- 2+a=3k \Rightarrow 11+a=3k\). For the sum \(11 + a\) to be a multiple of \(3\), the greatest possible digit for a is \(7\).
- Let a and b be even digits. The five-digit number 2ab30 leaves a remainder of 1 when divided by 3. Given that a < b, let’s find the number of valid ordered pairs (a, b).
\( \to \) Since \(2 + a + b + 3 + 0 = 3k + 1 \quad (k \in Z) \), it follows that \(4+a+b=3k\). This implies that the sum \(a+b\) can be \(2, 5, 8, 11, 14, \quad \text{or} \quad 17\). However, because a and b are both even digits, their sum must also be an even number. Thus, the sum \(a + b\) can only be 2, 8, or 14. Setting up the condition a < b, the valid ordered pairs (a, b) are (0, 2), (0, 8), (2, 6), and (6, 8), giving a total of four pairs.
Warning: When checking for divisibility by 3, you can ignore any digits or groups of digits that sum to a multiple of 3. This simplifies the process by preventing the sum from becoming unnecessarily large.
Example:
Let’s find the remainder when \(796824983\) is divided by 3.
\[ \begin{array}{c@{\!\!}c@{\!\!}c@{\!\!}c@{\!\!}c@{\!\!}c@{\!\!}c@{\!\!}c@{\!\!}c} 7 & 9 & 6 & 8 & 2 & 4 & 9 & 8 & 3 \\ \uparrow & & & \uparrow & & \uparrow & & \uparrow & \\ 7 + 8 = 15 & & & & 4 + 8 = 12 \\ \end{array} \]
When evaluating the sum of the digits, we can exclude the digits 3, 6, and 9. Furthermore, if we exclude the four digits that sum to 15 (= 7 + 8) and 12 (= 4 + 8), only the digit 2 remains. Consequently, the remainder when this number is divided by 3 is 2.
Divisibility by 4:
An integer is divisible by 4 if the two-digit number formed by its tens and units digits (the last two digits) is a multiple of 4.
For example, the last two digits of the numbers 140352, 7424, 35408, and 1996 form the two-digit numbers 52, 24, 08, and 96, respectively. Since these are multiples of 4, the original integers are also divisible by 4.
The remainder when an integer is divided by 4 is equal to the remainder when the two-digit number formed by its last two digits is divided by 4.
For example, the last two digits of $$20514$$ form the two-digit number 14. Since 14 leaves a remainder of 2 when divided by 4, the number 20514 also leaves a remainder of 2 when divided by 4. Similarly, the last two digits of $$384217$$ form the two-digit number 17. Since 17 leaves a remainder of 1 when divided by 4, the number 384217 also leaves a remainder of 1 when divided by 4.
Example:
Given that the five-digit number 7a35b is divisible by both 3 and 4, let’s find the sum of all distinct possible values for the digit a.
For the number \(7a35b\) to be divisible by 4, the two-digit number formed by its last two digits, 5b, must be divisible by 4. Therefore, the digit b can be either 2 or 6. Let’s analyze the possible values for the digit a in each case.
Since the given number is divisible by 3, the sum of its digits must be a multiple of 3.
For \(b=2\), the number becomes $$7a352$$. The sum of its digits simplifies to the condition that a+5 must be a multiple of 3. In this case, the possible values for the digit a are 1, 4, and 7.
For \(b=6\), the number becomes $$7a356$$. Evaluating the sum of its digits requires that \(a=3k \quad (k \in Z) \). In this case, the possible values for the digit a are 0, 3, 6, and 9. Thus, the sum of all distinct possible values for a is \( 1 + 4 +7+0+3+6+9=30\).
Divisibility by 5:
An integer is divisible by 5 if its units digit is either 0 or 5.
For example, the numbers 1990 and 2005 are divisible by 5. The remainder when an integer is divided by 5 is equal to the remainder when its units digit is divided by 5.
For example, the remainders when 101, 1993, 384217, and 2619 are divided by 5 are 1, 3, 2, and 4, respectively.
Example:
The four-digit number 18ab is divisible by both 3 and 5. Given that \(a < b\), let’s find the greatest possible value for the digit a.
Since the given number is divisible by 5, the units digit b must be either 0 or 5. Under the condition a < b, the digit b can be set to 5. Since this number is also divisible by 3, the sum of its digits must be a multiple of 3. Therefore,
since $$1+8+a+5=3k \quad (k \in Z)$$ the possible values for the digit a are 1, 4, and 7. However, given that a < 5, the greatest possible value for a is 4.
Example:
The four-digit number 87ab leaves a remainder of 2 when divided by 5. If this number is divisible by 4, let’s determine the smallest possible value for the digit a.
For the given number to be divisible by 4, the two-digit number \(ab\) formed by its last two digits must be a multiple of 4. This implies that \(87ab\) is an even integer. Consequently, for the remainder to be 2 when divided by 5, the units digit b must be 2. The smallest two-digit multiple of 4 ending in 2 is 12. Therefore, the smallest possible value for the digit a is 1.
Divisibility by 6:
Even numbers that are divisible by 3 are also divisible by 6.
For example, the sum of the digits of 234 is 9 (a multiple of 3) and the number is even; similarly, the sum of the digits of 38472 is 24 (a multiple of 3) and the number is even. Thus, both numbers are divisible by 6.
The remainder when an integer is divided by 6 is the leftover value after the largest possible multiple of 6 is subtracted from the integer.
Example:
Let’s find the remainder when \(22643\) is divided by 6.
The sum of the digits of this number leaves a remainder of 2 when divided by 3. Therefore, an even integer divisible by 6 can be obtained by subtracting an appropriate value of the form \(3k + 2 \quad (k \in Z) \) from \(22643\).
Consider writing the expression as \(22641 + 2\). The number 22641 is divisible by 3, but since it is odd, it is not divisible by 6. We can obtain a valid even multiple by subtracting 3 from it. Thus, we rewrite the equation as:
$$22643 = 22638 + 5$$
Since 22638 is an even number divisible by 3, it is perfectly divisible by 6. Consequently, the remainder when 22643 is divided by 6 is 5.
Example:
Let’s find the remainder when 568 is divided by 6.
The sum of the digits of 568 leaves a remainder of 1 when divided by 3. Therefore, an even integer divisible by 6 can be obtained by subtracting an appropriate value of the form \(3k + 1 \quad (k \in Z) \) from 568. Thus,
since $$568 = 564 + 4$$, the number 564 is divisible by 6. Consequently, the remainder when 568 is divided by 6 is 4.
Example:
Let’s find the sum of all possible digits that can replace a so that the four-digit number 574a is divisible by 6.
Since we must satisfy the condition $$5+7+4+a=3k \quad (k \in Z) $$ and the digit a must be even, the possible values for a are 2 and 8 (= 2 + 6). Therefore, the sum of these values is found to be 2 + 8 = 10.
Example:
Let’s determine how many valid digits can replace a so that the four-digit number 687a is exactly divisible by both 4 and 6.
The number is divisible by 6 if \[6+8+7+a=3k \quad (k \in Z)\] and the digit a is even. At the same time, for it to be divisible by 4, the two-digit number 7a formed by the last two digits must be a multiple of 4. This condition is met if a is either 2 or 6. However, when a = 2, the resulting number is not divisible by 3. Therefore, the original number is divisible by both 4 and 6 only when a = 6, yielding exactly one valid digit.
Divisibility by 7:
Let \(r_0, r_1, r_2, \cdots, r_n\) represent the individual digits of an \((n+1)\)-digit number. For this integer to be divisible by 7, the following condition must hold for some integer \( k \in Z \):
$$(1\cdot r_0 + 3\cdot r_1+2\cdot r_2) – (1\cdot r_3 + 3\cdot r_4+2\cdot r_5)+ \cdots= 7k$$
Example:
Let’s prove that 252 is divisible by 7.
\[
\begin{array}{c c c c}
2 & 5 & 2 & \Rightarrow 1 \cdot 2 + 3 \cdot 5 + 2 \cdot 2 = 21 \\
\downarrow & \downarrow & \downarrow & \\
2 & 3 & 1 \\
\end{array}
\]
Since 21 is a multiple of 7, the number 252 is divisible by 7.
Example:
Let’s verify that 172046 is divisible by 7.
\[
\begin{array}{c c c c c c c c}
1 & 7 & 2 & 0 & 4 & 6 &\Rightarrow (1 \cdot 6 + 3 \cdot 4 + 2 \cdot 0 )- (1 \cdot 2 + 3 \cdot 7 + 2 \cdot 1)= \\
\downarrow & \downarrow & \downarrow & \downarrow & \downarrow & \downarrow & \\
2 & 3 & 1 & 2 & 3 & 1 &\\
\end{array}
\]
Example:
Let’s verify that 17482591 is divisible by 7.
\[
\begin{array}{l l l l l l l l}
1 & 7 & 4 & 8 & 2 & 5 & 9 & 1\\
\downarrow & \downarrow & \downarrow & \downarrow & \downarrow & \downarrow & \downarrow &\downarrow &\\
3 & 1 & 2 & 3 & 1 & 2 & 3 & 1\\
\end{array}
\]
\[
\Rightarrow (1 \cdot 1 + 3 \cdot 9 + 2 \cdot 5)- (1\cdot 2 + 3 \cdot 8 + 2 \cdot 4)+ (1\cdot 7 + 3 \cdot 1)= \\
38-34+10=14 \]
\[ 14 \text{ is a multiple of } 7, \text{ so } 17482591 \text{ is divisible by } 7. \]
To find the remainder of any integer when divided by 7, the same process is applied. The remainder obtained from the resulting value is equal to the remainder of the original integer.
Example:
Let’s find the remainder when 2518 is divided by 7.
\[
\begin{array}{c c c c}
2 & 5 & 1 & 8 & \Rightarrow (1 \cdot 8 + 3 \cdot 1 + 2 \cdot 5) – 1 \cdot 2 =21-2=19.\\
\downarrow & \downarrow & \downarrow & \downarrow & \\
1 & 2 & 3 & 1 \\
\end{array}
\]
Since 19 leaves a remainder of 5 when divided by 7, the number 2518 also leaves a remainder of 5 when divided by 7.
Divisibility by 8:
An integer is divisible by 8 if the three-digit number formed by its hundreds, tens, and units digits (the last three digits) is a multiple of 8.
For example, the last three digits of the numbers 2024, 1992, and 384112 form the three-digit numbers 024, 992, and 112, respectively. Since these are multiples of 8, the original numbers are all divisible by 8.
The remainder when an integer is divided by 8 is equal to the remainder when the three-digit number formed by its last three digits is divided by 8.
For example, the last three digits of 19012 are 012, which leaves a remainder of 4 when divided by 8, so the remainder is 4;
The last three digits of 384122 form the number 122. Since 122 leaves a remainder of 2 when divided by 8, the original number leaves a remainder of 2.
Example:
Given that the five-digit number 3205a is an even number that leaves a remainder of 2 when divided by 5, let’s find the remainder when this number is divided by 8.
Since the number is even and leaves a remainder of 2 when divided by 5, its units digit must be a = 2. Thus, the number is 32052. To find its remainder when divided by 8, we evaluate the last three digits, 052. Since 52 leaves a remainder of 4 when divided by 8, the final remainder is 4.
Example:
Given that the five-digit number 39a08 is divisible by 8, let’s find the total number of digits that can replace a.
Since the number 39a08 is divisible by 8, the three-digit number a08 formed by its last three digits must be a multiple of 8. In this case, the possible digits that satisfy this condition for a are 0, 2, 4, 6, and 8. Thus, there are 5 valid digits that can replace a.
Divisibility by 9:
An integer is divisible by 9 if the sum of its digits is a multiple of 9.
For example, the sum of the digits of 11827296 is $$(1+1+8+2+7+2+9+6=36)$$. Since 36 is a multiple of 9, this number is exactly divisible by 9.
The remainder when an integer is divided by 9 is equal to the remainder when the sum of its digits is divided by 9.
For example, the sum of the digits of 217996 is 34. Since 34 leaves a remainder of 7 when divided by 9, the original number 217996 also leaves a remainder of 7 when divided by 9.
Examples:
- Given that the five-digit number 3a627 is divisible by 9, let’s determine all possible values for the digit a.
The sum of the digits of 3a627 must be a multiple of 9. Therefore,
$$3+a+6+2+7 = 9k \quad (k \in Z)$$
$$\Rightarrow 18+a=9k$$. Based on this equation, the possible single-digit values for a are \(0\) and \(9\).
- If the four-digit number 4a5b is divisible by 9, let’s find all possible values for the sum a + b.
Since the sum of the digits of 4a5b must be a multiple of 9, we can write $$4+a+5+b= 9k \quad (k \in Z)$$
$$\Rightarrow 9+ (a+b)= 9k$$. Consequently, the possible values for the expression a+b are 0, 9, and 18.
- Let’s find the remainder when the 11-digit number 34343434343 is divided by 9.
The sum of the digits of this number is calculated as \((3 \cdot 6 + 4 \cdot 5 = 38)\). Since 38 leaves a remainder of 2 when divided by 9, the remainder when 34343434343 is divided by 9 is also 2.
- If the five-digit number 65a38 leaves a remainder of 4 when divided by 9, let’s determine all possible digits for a.
The sum of the digits of 65a38 must be 4 more than a multiple of 9. Therefore, $$6+5+a+3+8=9k+4 \quad (k \in Z) $$
$$\Rightarrow 22+a=9k+4 \Rightarrow 18+a=9k$$. Thus, the digits that can replace a are 0 and 9.
Warning:
When testing an integer for divisibility by 9, any digits or combinations of digits that add up to a multiple of 9 can be dropped from the running total. This method streamlines calculation by keeping the sum small.
Example:
Let’s find the remainder when the 25-digit number 7272727272727272727272727 is divided by 9.
\(\Rightarrow\) Since the sum of consecutive 7 and 2 pairs in the given number is 9, if we ignore the digits in the first 24 digits of this number, only 7 remains. Consequently, the remainder when this number is divided by 9 is 7.
Example:
The five-digit number 346ab is an odd number that leaves a remainder of 4 when divided by 5. Given that the remainder when this number is divided by 9 is 2, let’s find the product of the digits a and b.
\(\Rightarrow\) Since the remainder when the given number is divided by 5 is 4, the units digit of this number is either 4 or 9. Since this number is odd, b = 9. At the same time, since the remainder when this number is divided by 9 is 2, the sum of the digits of the number 346a9 must be 2 more than a multiple of 9. If we ignore the digits 3 and 6, whose sum is 9, and the units digit 9,
\[ 4+a = 9k+2 \quad (k \in Z) \Rightarrow 2+a =9k.\] Thus, a = 7 is found, and the product of the digits a and b is \(7 \cdot 9 = 63\).
Divisibility by 10:
Integers whose units digit is 0 are divisible by 10. For example, 190, 2000, and 1235789460 are numbers divisible by 10. The units digit of any integer is equal to its remainder when divided by 10.
For example, the remainders when 235, 1996, 18223, and 217940 are divided by 10 are 5, 6, 3, and 0, respectively.
Example:
The five-digit number 3a27b, which is divisible by 6, leaves a remainder of 4 when divided by 10. Based on this, let’s find the sum of all possible digits that can replace a.
Since the remainder when the given number is divided by 10 is 4, the units digit must be b = 4. Since this number is also divisible by 6, the sum of its digits must be a multiple of 3. If we ignore the digits 3, 2, and 7, whose sum is a multiple of 3,
$$a+b = a+4=3k \quad (k \in Z) $$ must hold. Therefore, the digits that can replace a are 2, 5 (= 2 + 3), and 8 (= 5 + 3). The sum of these values is found to be $$2+5+8=15 $$.
Divisibility by 11:
Let \(r_0, r_1, r_2, \cdots , r_n\) represent the individual digits. For an \((n + 1)\)-digit number \(r_n, r_{n-1}, \cdots , r_2, r_1, r_0\) to be divisible by 11, the following condition must hold for some integer \(k \in Z \):
$$( r_0+r_2+r_4+ \cdots ) – (r_1+r_3+r_5+ \cdots )= 11\cdot k$$ or $$( r_1+r_3+r_5+ \cdots ) – (r_0+r_2+r_4+ \cdots )= 11\cdot k$$
For example, let’s show that 8272671 is divisible by 11.
Let’s apply the rule stated above by alternatingly assigning a plus sign (+) and a minus sign (-) to the digits of the number in order, whether starting from the far right or the far left.
\[
\begin{array}{l l l l l l l l}
8 & 2 & 7 & 2 & 6 & 7 & 1 \\
\downarrow & \downarrow & \downarrow & \downarrow & \downarrow & \downarrow & \downarrow \\
+ & – & + & – & + & – & + \\
\end{array}
\]
\[
\to \, (8 + 7 + 6 + 1) – (2 + 2 + 7) = 22 – 11 = 11
\]
or
\[
\begin{array}{l l l l l l l l}
8 & 2 & 7 & 2 & 6 & 7 & 1 \\
\downarrow & \downarrow & \downarrow & \downarrow & \downarrow & \downarrow & \downarrow \\
– & + & – & + & – & + & – \\
\end{array}
\]
\[
\to \, (2 + 2 + 7 ) – (8 + 7 + 6+1) = 11 – 22 = -11
\]
Since 11 and -11 are multiples of 11, the number 8272671 is divisible by 11.
From this, we see that beginning the sign assignment with (+) or (-) only changes the sign of the resulting value. Therefore, the number can be marked starting with either (+) or (-) arbitrarily.
For Example:
Let’s show that 3851650594 is divisible by 11.
Let’s label the digits of the number alternatingly with (+) and (-).
\[
\begin{array}{l l l l l l l l}
3 & 8 & 5 & 1 & 6 & 5 & 0 & 5 & 9 & 4 & \\
\downarrow & \downarrow & \downarrow & \downarrow & \downarrow & \downarrow & \downarrow & \downarrow& \downarrow & \downarrow \\
+ & – & + & – & + & – & + & -&+&- \\
\end{array}
\]
\[
\to \, (3 + 5 + 6+0+9 ) – (8 + 1 + 5+5+4) = 23-23= 0
\]
Since 0 is a multiple of 11, the number 3851650594 is divisible by 11.
To find the remainder when an integer is divided by 11, its digits are multiplied by alternating signs (+1, -1, +1, -1, …) from right to left, starting specifically with the units digit, and then summed together. If the resulting sum is a positive integer less than 11, this value represents the remainder of the division. If the obtained sum is less than 0 or greater than or equal to 11, multiples of 11 are added to or subtracted from it until a positive value less than 11 is reached. This final value is the remainder when the number is divided by 11.
For Example:
Let’s examine the numbers 32741, 7251803, and 9170;
\[
\begin{array}{l l l l l l l l}
3 & 2 & 7 & 4 & 1 & \\
\downarrow & \downarrow & \downarrow & \downarrow & \downarrow & \\
+ & – & + & – & + & \\
\end{array}
\]
\[
\to \, (3 + 7 + 1) – (2 + 4) = 5 \\
\]
Since the sum is 5, the remainder when 32741 is divided by 11 is 5.
\[
\begin{array}{l l l l l l l l}
7 & 2 & 5 & 1&8 & 0& 3 \\
\downarrow & \downarrow & \downarrow & \downarrow & \downarrow & \downarrow & \downarrow & \\
+ & – & + & – & + &-&+ \\
\end{array}
\]
\[
\to \, (7 + 5 + 8 + 3) – (2 + 1 + 0) = 20
\]
\[
\text{Since } 20 > 11,
\]
\[
20 + 11 \cdot (-1) = 9 \quad \text{and} \quad 9 < 11.
\]
Therefore, the remainder when 7251803 is divided by 11 is 9;
\[
\begin{array}{l l l l l l l l}
9 & 1 & 7 & 0 & \\
\downarrow & \downarrow & \downarrow & \downarrow & \\
– & + & – & + & \\
\end{array}
\]
\[
\to \, (1+ 0 ) – (9 + 7) = -15 \\
\]
\[
\text{Since } -15 < 0,
\]
\[
-15 + 11 \cdot 2 = 7 \quad \text{is obtained}
\]
and the remainder when 9170 is divided by 11 is 7;
Example:
Given that the five-digit number 39a71 is divisible by 11, let’s find the digit that replaces a.
\[
\begin{array}{l l l l l l l l}
3 & 9 & a & 7 & 1 &\\
\downarrow & \downarrow & \downarrow & \downarrow & \downarrow & \\
+ & – & + & – & +&\\
\end{array}
\]
\[
\to \, (3+a+ 1 ) – (9 + 7) = 11\cdot k \quad (k \in Z)\\
\]
\[
\Rightarrow a-12= 11\cdot k\\
\]
\[
\begin{array}{ll}
\text{If we choose } k = -1 & \Rightarrow a – 12 = -11 \Rightarrow a = 1 \quad \text{(is a digit)} \\
\text{If we choose } k = 0 & \Rightarrow a – 12 = 0 \Rightarrow a = 12 \quad \text{(is not a digit)} \\
\text{If we choose } k = 1 & \Rightarrow a – 12 = 11 \Rightarrow a = 23 \quad \text{(is not a digit)}
\end{array}
\]
Since no valid single digit can correspond to a for any value of k other than k = -1, the digit that replaces a is 1.
Example:
Since the number 2a4576 leaves a remainder of 5 when divided by 11, the number \(2a4576 – 5 = 2a4571\) must be exactly divisible by 11. Therefore, for some \(k \in Z\),
\[
\begin{array}{l l l l l l l l}
2 & a & 4 & 5 & 7 & 1&\\
\downarrow & \downarrow & \downarrow & \downarrow & \downarrow & \downarrow & \\
+ & – & + & – & +&-&\\
\end{array}
\]
\[
\begin{array}{l l}
\to (2+4+7)-(a+5+1) = 11\cdot k\\
\Rightarrow 7-a=11\cdot k
\end{array}
\]
For \(k=0\), we find \(7-a=0\, \Rightarrow a=7\). No valid single digit a can be found for other values of $k$.
Example:
Given that the five-digit number a3b73 leaves a remainder of 8 when divided by 11, let’s find how many different values the sum of the digits a and b can take.
Since subtracting 8 from the given number makes it divisible by 11, the number \(a3b73 – 8 = a3b65\) is exactly divisible by 11. Therefore,
\[
\begin{array}{l l l l l l l l}
a & 3 & b & 6 & 5 &\\
\downarrow & \downarrow & \downarrow & \downarrow & \downarrow & \\
+ & – & + & – & +&\\
\end{array}
\]
\[
\begin{array}{l l}
\to (a+b+5)-(3+6) = 11\cdot k\\
\Rightarrow a+b-4=11\cdot k
\end{array}
\]
For \(k = -1\) \(\Rightarrow a+b= -7\) (The sum of two digits cannot be negative.)
For \(k = 0\) \(\Rightarrow a + b = 4\)
For \(k = 1\) \(\Rightarrow a + b = 15\)
For \(k = 2\) \(\Rightarrow a + b = 26\) (The sum of two single digits cannot be greater than 18.)
Accordingly, there are two distinct values that the sum of the digits a and b can take, which are 4 and 15.
Example:
Given that the six-digit number 7a836b leaves a remainder of 7 when divided by 11, let’s find the sum of all the different possible values for a + b.
\begin{array}{l l l l l l l l}
7 &a & 8 & 3 & 6 & b &\\
\downarrow & \downarrow & \downarrow & \downarrow & \downarrow & \downarrow & \\
– & + & – & +& -&+\\
\end{array}
\]
For \(k=- 1 \) \(\Rightarrow a+b=- 8\) (Impossible)
For \(k=0\) \(\Rightarrow a+b=3\) (Possible)
For \(k= 1\) \(\Rightarrow a+b= 14\) (Possible)
For \(k=2 \) \(\Rightarrow a+b= 25\) (Impossible)
From this, the sum of all different possible values for a + b is calculated as \(3+14=17\).
Warning: If a number is divisible by each of a set of coprime numbers, it is also divisible by their product. Accordingly:
-
- A number divisible by 2 and 3 is divisible by 6,
- A number divisible by 3 and 4 is divisible by 12,
- A number divisible by 2 and 9 is divisible by 18,
- A number divisible by 3 and 8 is divisible by 24,
- A number divisible by 4 and 9 is divisible by 36,
- A number divisible by 3 and 10 is divisible by 30,
- A number divisible by 5 and 6 is divisible by 30,
- A number divisible by 3 and 10 is divisible by 30, (A number divisible by 5 and 6 is divisible by 30)
- A number divisible by 3, 4, and 5 is divisible by 60.
Example:
Given that the 5-digit number a235b is divisible by 12, let’s find the set of values that can replace the digit a.
Since the given number is divisible by 12, and since \(12 = 3 \cdot 4\) where 3 and 4 are coprime, it must be divisible by both 3 and 4. Accordingly, the two-digit number formed by the last two digits of this number must be either 52 or 56 (for it to be divisible by 4). Since the number is divisible by 3, the sum of its digits must be a multiple of 3.
Therefore, for the number a2352:
\(a+2+3+5+2= 3\cdot k \quad (k\in Z) \)
\(\Rightarrow a+ 12= 3\cdot k \Rightarrow a + 0 = 3\cdot k’\) holds.
The digits that can replace a are 0, 3, 6, and 9. However, if 0 is written for a, the number would not be a 5-digit number. In this case, the values a can take are 3, 6, and 9.
For the number a2356:
\(a+2+3+5+6= 3\cdot k \quad (k \in Z)\)
\(\Rightarrow a+19= 3\cdot k \Rightarrow a+1 = 3\cdot k”\) holds.
The digits that can replace a are 2, 5, and 8. Accordingly, the set of values that can replace the digit a is found to be { 2, 3, 5, 6, 8, 9 }.
Example:
Given that the 5-digit number a235b is divisible by 12, let’s find the set of values that can replace the digit a.
\(\to\) Since the given number is divisible by 12,
since \(12 = 3 \cdot 4\) and 3 and 4 are coprime, it must also be divisible by 3 and 4. Accordingly, the two-digit number formed by the last two digits of this number must be either 52 or 56 (for it to be divisible by 4). Since the number is divisible by 3, the sum of its digits must be a multiple of 3.
Therefore, for the number a2352:
\(a+2+3+5+2= 3\cdot k \quad (k \in Z) \quad \Rightarrow a+12= 3k\) holds.
The digits that can replace a are 0, 3, 6, and 9. However, if 0 is written for a, the number would not be a 5-digit number. In this case, the values a can take are 3, 6, and 9.
For the number a2356:
\(a+2+3+5+6= 3\cdot k \quad (k \in Z) \quad \Rightarrow a+19= 3\cdot k \) holds. The digits that can replace a are 2, 5, and 8. Accordingly, the set of values that can replace the digit a is found to be { 2, 3, 5, 6, 8, 9 }.
Divisibility by 25:
Numbers whose last two digits (tens and units positions) form a two-digit number that is a multiple of 25 are divisible by 25.
For example, 300, 1425, 26750, and 1975 are divisible by 25.
Question 32:
Let a and b be digits, where ab is a two-digit number.
\[
\begin{array}{c,@{\hspace{2cm}}c,c,c}
\begin{array}{c}
\quad &ab \;\;\\
\quad &\vdots\\
-\;\; \\
\hline
&\quad 2 \;\;
\end{array}
\begin{array}{|c}
\quad b \\
\hline
\quad 3
\\
\\
\end{array}
\end{array}
\]
Based on this, what is the sum of all possible values that the number ab can take?
\[ \text{A)} 29 \quad \text{B) } 41 \quad \text{C) } 43 \quad \text{D) } 55 \quad \text{E) } 64 \]
Solution:
According to the given division process, the remainder must be less than the divisor, so b > 2. Writing the division identity, we get:
\[
ab=3\cdot b +2 \Rightarrow 10\cdot a + b = 3\cdot b+ 2
\Rightarrow 10\cdot a = 2\cdot b + 2 \Rightarrow 5\cdot a= b+1
\]
Let’s determine the digits a and b that satisfy this equation to find the values of ab.
\[
\text{For } a= 1 \Rightarrow b= 4 \quad \text{and} \quad ab \rightarrow 14
\]
\[
\text{For } a= 2 \Rightarrow b= 9 \quad \text{and} \quad ab \rightarrow 29
\]
\[
\text{For } a= 3 \Rightarrow b= 14 \quad \text{(is not a single digit)}
\]
Therefore, the sum of all possible values that ab can take is \(14 + 29 = 43\).
\({\textbf{Answer: C}}\)
Question 33:
\[
\begin{array}{c,@{\hspace{2cm}}c,c,c}
\begin{array}{c}
\quad &x \;\;\\
\quad &\vdots\\
-\;\; \\
\hline
&\quad y \;\;
\end{array}
\begin{array}{|c}
\quad 11 \\
\hline
\quad 13
\\
\\
\end{array}
\end{array}
\]
In the division operation given above, the remainder when the natural number x is divided by 10 is 8. Based on this, what is the remainder when the product x $\cdot$ y is divided by 9?
\[ \text{A)} 6 \quad \text{B) } 5 \quad \text{C) } 4 \quad \text{D) } 3 \quad \text{E) } 2 \]
Solution:
Since the remainder when x is divided by 10 is 8, the units digit of the natural number x must be 8. Furthermore, the remainder y must be less than the divisor 11. Writing the division identity for this operation, we get:
\(x=11\cdot 13 + y \Rightarrow\) \( x = 143+ y \)
For the units digit of x to be 8, y must be equal to 5. Therefore, x = 148. The remainder when the product x $\cdot$ y = 740 is divided by 9 is equal to the remainder when the sum of its digits is divided by 9. Thus, the remainder when 7 + 4 + 0 = 11 is divided by 9 is 2.
\({\textbf{Answer: E}}\)
Question 34:
\[
\begin{array}{c,@{\hspace{2cm}}c,c,c}
\begin{array}{c}
\quad &65\dots \;\;\\
\quad &\vdots\\
-\;\; \\
\hline
&\quad .. \;\;
\end{array}
\begin{array}{|c}
\quad 3x \\
\hline
\quad 1\dots
\\
\\
\end{array}
\end{array}
\]
In the division operation above, x represents a single digit. Accordingly, which of the following cannot be the value of x?
\[ \text{A)} 2 \quad \text{B) } 3 \quad \text{C) } 4 \quad \text{D) } 5 \quad \text{E) } 6 \]
Solution:
Let’s substitute 2 for x and investigate the quotient.
\[
\begin{array}{c,@{\hspace{2cm}}c,c,c}
\begin{array}{c}
\quad &65\dots \;\;\\
\quad &64\;\;\;\;\;\;\; \\
-\;\; \\
\hline
&\quad 1.. \;\;
\end{array}
\begin{array}{|c}
\quad 32 \\
\hline
\quad 2.
\\
\\
\end{array}
\end{array}
\]
As seen here, when 2 is written for x, the first digit of the quotient (the leftmost digit found first) becomes 2. However, in the given division operation, the first digit of the quotient is 1. Therefore, x must be a number greater than 2. Consequently, x cannot be 2.
\({\textbf{Answer: A}}\)
Question 35:
Given that B1 is a two-digit number, the following division operation is provided:
\[
\begin{array}{c,c}
\begin{array}{c}
\quad A \;\;\\
-\quad \vdots \;\; \\
\hline
\quad 4 \;\;
\end{array}
\begin{array}{|c}
\quad B1 \\
\hline
\quad 6
\\
\\
\end{array}
\end{array}
\]
Based on this, what is the remainder when the natural number A is divided by 12?
\[ \text{A)} 7 \quad \text{B) } 8 \quad \text{C) } 9 \quad \text{D) } 10 \quad \text{E) } 11 \]
Solution:
Writing the division identity from the given operation:
\(A=6\cdot B1 +4 \Rightarrow A=6\cdot (10\cdot B+ 1)+4\)
\(A= 60\cdot B+10 \) is obtained.
Since \(60\cdot B\) is exactly divisible by 12, the remainder when the natural number A is divided by 12 is 10.
\({\textbf{Answer: D}}\)
Question 36:
\[
\begin{array}{c,@{\hspace{2cm}}c,c,c}
\begin{array}{c}
\quad &A \;\;\\
-\quad &\vdots \;\; \\
\hline
&\quad 2 \;\;
\end{array}
\begin{array}{|c}
\quad B+1 \\
\hline
\quad 3
\\
\\
\end{array}
\begin{array}{c}
\quad \text{and} \;\; \;\; \;\; \;\; \;\;
\end{array}
\begin{array}{C}
\quad &B \;\;\\
-\quad &\vdots \;\; \\
\hline
&\quad 1 \;\;
\end{array}
\begin{array}{|c}
\quad 5 \\
\hline
\quad C-1
\\
\\
\end{array}
\end{array} \]
According to the division operations given above, what is C expressed in terms of A?
\[ \text{A)} \frac{A-7}{15} \quad \text{B) } \frac{A+7}{15} \quad \text{C) } \frac{A-5}{7} \quad \text{D) } \frac{A+11}{15} \quad \text{E) } \frac{A-3}{15} \]
Solution:
Writing the division identities for the given operations:
\[
A=3\cdot (B+1)+2 \quad \text{and} \quad B=5\cdot (C-1)+1
\]
\[
A=3\cdot B +5 \quad \text{and} \quad B=5\cdot C-4
\]
Substituting the expression for B, \(B=5\cdot C-4\), into the equation \(A=3\cdot B +5\):
\[
A=3\cdot (5\cdot C-4) +5 \Rightarrow A=15\cdot C-7
\]
From here, solving for C gives:
\[
C= \frac{A+7}{15}
\]
\({\textbf{Answer: B}}\)
Question 37:
The three-digit number a2b is exactly divisible by 12. Accordingly, how many different values can a take?
\[ \text{A)} 3 \quad \text{B) } 5 \quad \text{C) } 7 \quad \text{D) } 8 \quad \text{E) } 9 \]
Solution:
Since \(12 = 3 \cdot 4\) and 3 and 4 are coprime, numbers divisible by 12 must also be divisible by both 3 and 4. Accordingly, for the number a2b to be divisible by 4, the digit b can be replaced by 0, 4, or 8. For the number a2b to be divisible by 3, the sum of its digits a + 2 + b must be a multiple of 3. Let’s find the possible values for a under these conditions:
For \(b = 0 \Rightarrow a \in \{1, 4, 7\}\)
For \(b = 4 \Rightarrow a \in \{3, 6, 9\}\)
For \(b = 8 \Rightarrow a \in \{2, 5, 8\}\)
Therefore, the set of values that a can take is \(\{ 1, 2, 3, 4, 5, 6, 7, 8, 9 \}\). That means 9 different values can be substituted for a.
\({\textbf{Answer: E}}\)
Question 38:
The three-digit number 3ab, whose digits are distinct from each other, is divisible by 15. Accordingly, what is the sum of the largest and smallest possible values that the number 3ab can take?
\[ \text{A)} 665 \quad \text{B) } 675 \quad \text{C) } 690 \quad \text{D) } 705 \quad \text{E) } 735 \]
Solution:
Since \(15 = 3 \cdot 5\) and 3 and 5 are coprime, numbers divisible by 15 must also be divisible by both 3 and 5. Accordingly, for the number 3ab to be divisible by 5, it must satisfy either b = 0 or b = 5.
For this number to be divisible by 3, the sum of its digits 3 + a + b must be a multiple of 3. Let’s find the largest and smallest values of a that satisfy these conditions while ensuring all digits are distinct:
For b = 0: the largest number is 390, the smallest number is 360
For b = 5: the largest number is 375, the smallest number is 315
Therefore, the sum of the absolute largest and smallest among these four numbers is 390 + 315 = 705
\({\textbf{Answer: D}}\)
Question 39:
The four-digit number 53ab leaves a remainder of 2 when divided by both 4 and 5. Accordingly, what is the sum of the values that can replace a?
\[ \text{A)} 11 \quad \text{B) } 14 \quad \text{C) } 15 \quad \text{D) } 18 \quad \text{E) } 20 \]
Solution:
Since the number 53ab leaves a remainder of 2 when divided by 4 and 5, subtracting 2 from this number makes it exactly divisible by both 4 and 5.
Given that the remainder when 53ab is divided by 5 is 2, the value of b can be either 2 or 7. Since the number minus 2 is divisible by both 4 and 5, this resulting number must be an even number. Therefore, the value of b can only be 2. In this case, the given number is 53a2 and the number minus 2 is 53a0.
Accordingly, for the number 53a0 to be divisible by 4, the values that can replace a are 0, 2, 4, 6, and 8, and the sum of these values is 20.
\({\textbf{Answer: E}}\)
Question 40:
What is the difference between the largest three-digit number with distinct digits that is divisible by 6, and the smallest three-digit number with distinct digits that is divisible by 4?
\[ \text{A)} 878 \quad \text{B) } 880 \quad \text{C) } 882 \quad \text{D) } 884 \quad \text{E) } 886 \]
Solution:
The two numbers matching the required conditions are 984 and 104, so the difference between these two numbers is 880.
\({\textbf{Answer: B}}\)
Question 41:
The five-digit number 7a0b4, whose digits are distinct from each other, leaves a remainder of 2 when divided by 8. Accordingly, for the maximum possible value of the number 7a0b4, what is the sum of a + b equal to?
\[ \text{A)} 17 \quad \text{B) } 16 \quad \text{C) } 15 \quad \text{D) } 14 \quad \text{E) } 12 \]
Solution:
Based on the information given in the question, subtracting 2 from the number means that 7a0b2 would be a number exactly divisible by 8. (Note: Alternatively, if 7a0b4 leaves a remainder of 2, then the number formed by its last three digits, 0b4, leaves a remainder of 2 when divided by 8, meaning \(0b4 – 2 = 0b2\) must be a multiple of 8).
For this number to be divisible by 8, the three-digit number 0b2 must be a multiple of 8. Therefore, b can be replaced by 3 or 7. Since the digits of the number must be distinct from each other, b cannot be 7 (as 7 is already used as the first digit). Thus, the number is of the form 7a034.
For this number to take its maximum value, we must choose a = 9. Accordingly, the sum of a + b matching the given conditions is 9 + 3 = 12.
\({\textbf{Answer: E}}\)
Question 42:
Let a and b be digits. The six-digit number 672a5b is an even number that leaves a remainder of 1 when divided by both 5 and 9. Accordingly, what is the value of a?
\[ \text{A)} 6 \quad \text{B) } 5 \quad \text{C) } 3 \quad \text{D) } 2 \quad \text{E) } 1 \]
Solution:
Since the given number is an even number that leaves a remainder of 1 when divided by 5, the value of b must be 6. Because the remainder when this number is divided by 9 is also 1, the sum of its digits must be 1 more than a multiple of 9. Therefore, where \(k \in Z \),
\(6 + 7 + 2 + a + 5 + 6 \equiv 9k+1 \Rightarrow 26 + a \equiv 9k + 1 \Rightarrow 25 + a \equiv 9k \Rightarrow 7+a \equiv 9k’ \)
Thus, for k’ = 1, we find a = 2.
\({\textbf{Answer: D}}\)
Question 43:
The five-digit number baa4b leaves a remainder of a when divided by 5. Given that this number is divisible by 4, what is the sum of the values that a can take?
\[ \text{A)} 12 \quad \text{B) } 10 \quad \text{C) } 7 \quad \text{D) } 6 \quad \text{E) } 4 \]
Solution:
Since the number baa4b is divisible by 4, the values 0, 4, and 8 can be written in place of b. However, since the number would not be five-digit if b = 0, b can only be 4 or 8.
Since the values that can replace a are the remainders when this number is divided by 5, the values that a can take based on the values of b are: a = 4 for b = 4, and a = 3 for b = 8 (since the units digit is 8, the remainder when divided by 5 is 3). Accordingly, the sum of the values that a can take is 4 + 3 = 7.
\({\textbf{Answer: C}}\)
Question 44:
Since an integer A is divisible by 111, which of the following is it always divisible by?
\[ \text{A)} 2 \quad \text{B) } 3 \quad \text{C) } 4 \quad \text{D) } 5 \quad \text{E) } 6 \]
Solution:
Let the quotient of A divided by 111 be x.
\[\frac{A}{111} = x \in Z \Rightarrow A = 111 \cdot x\]
Since the number 111 is always divisible by 3, the number A = 111 $\cdot$ x is also always divisible by 3.
\({\textbf{Answer: B}}\)
Question 45:
The two-digit number xy is divisible by 9. Accordingly, what is the remainder when the four-digit number 7x6y is divided by 9?
\[ \text{A)} 4 \quad \text{B) } 5 \quad \text{C) } 6 \quad \text{D) } 7 \quad \text{E) } 8 \]
Solution:
Since the number xy is divisible by 9, the sum of its digits x + y is a multiple of 9. Accordingly, since the remainder when 7x6y is divided by 9 is equal to the remainder when its digit sum is divided by 9:
7 + 6 + x + y = 13 + (x + y) = 4 + 9 + (x + y). Therefore, the remainder when this number is divided by 9 is 4.
\({\textbf{Answer: A}}\)
Question 46:
The number 2a55a is a five-digit even number that leaves a remainder of 2 when divided by 3. Based on this, what is the remainder when the twenty-digit number aaaaaaaaaaaaaaaaaaaa is divided by 9?
\[ \text{A)} 4 \quad \text{B) } 5 \quad \text{C) } 6 \quad \text{D) } 7 \quad \text{E) } 8 \]
Solution:
Since the remainder when 2a55a is divided by 3 is 2:
\(2+a+5+5+a = 3\cdot k +2 \Rightarrow 12+2\cdot a =3\cdot k +2 \Rightarrow 10+2a= 3\cdot k \quad (k \in Z) \) holds.
Accordingly, the values that can replace a are 1, 4, and 7. Since the given number is an even number, a must be 4. Therefore, the remainder when the twenty-digit number
44444444444444444444 is divided by 9 (which is equal to the remainder when the sum of its digits is divided by 9) corresponds to the remainder when the product 20 $\cdot$ 4 is divided by 9. According to this, 20 $\cdot$ 4 = 80, and the sum of its digits is 8 + 0 = 8 (or 80 = 9 $\cdot$ 8 + 8), which is the remainder when this number is divided by 9.
\({\textbf{Answer: E}}\)
Question 47:
The 7-digit number a25b38c, which is divisible by 11, leaves a remainder of 4 when divided by 10.
Accordingly, how many different values can the difference a – b take?
\[ \text{A)} 6 \quad \text{B) } 5 \quad \text{C) } 4 \quad \text{D) } 3 \quad \text{E) } 2 \]
Solution:
Since the remainder when the given number is divided by 10 is 4, the units digit (c) of this number is 4. Since the number a25b384 is divisible by 11, applying the rule for divisibility by 11 gives:
\[
\begin{array}{l l l l l l l l}
a & 2 & 5 & b & 3 & 8 & 4 & \\
\downarrow & \downarrow & \downarrow & \downarrow & \downarrow & \downarrow & \downarrow & \\
+ & – & + & – & + & – & + \\
\end{array}
\]
\[
\to (a+5+3+4)-(2+b+8)= 11\cdot k\Rightarrow a-b+2=11\cdot k \quad (k \in Z)
\] holds.
For \(k = -1 \quad \Rightarrow a-b= -13 \rightarrow \) impossible.
For \(k = 0 \quad \Rightarrow a-b= -2 \rightarrow \) possible.
For \(k = 1 \quad \Rightarrow a-b= 9 \rightarrow \) possible.
For \(k = 2 \quad \Rightarrow a-b= 20 \rightarrow \) impossible.
It should be noted that the minimum possible value for the difference between two digits is -9, and the maximum possible value is 9. Therefore, there are exactly two different values that the difference a – b can take.
\({\textbf{Answer: E}}\)
Question 48:
The five-digit number abcd8 leaves a remainder of 5 when divided by 11, and d – a = 3. Accordingly, what is the value of the difference b – c?
\[ \text{A)} -2 \quad \text{B) } -1 \quad \text{C) } 0 \quad \text{D) } 1 \quad \text{E) } 2 \]
Solution:
Since the number abcd8 leaves a remainder of 5 when divided by 11, subtracting 5 from this number (the number abcd3) makes it exactly divisible by 11.
Therefore, performing the operation according to the divisibility rule for 11:
\[
\begin{array}{l l l l l l l l}
a & b & c & d & 3 \\
\downarrow & \downarrow & \downarrow & \downarrow & \downarrow \\
+ & – & + & – & + \\
\end{array}
\]
\[
\begin{array}{ll}
\to (a+c+3)-(b+d)= 11\cdot k \quad (k \in Z)\\
\Rightarrow a-d+3+c-b=11\cdot k \\
\Rightarrow -(d-a)+3+c-b= 11\cdot k \\
\Rightarrow -3+3+c-b= 11\cdot k \\
\Rightarrow c-b = 11\cdot k \Rightarrow b-c= -11 \cdot k
\end{array}
\]
For \(k = 1 \quad \Rightarrow b-c = -11 \rightarrow \) impossible \\
For \(k = 0 \quad \Rightarrow b-c = 0 \rightarrow \) possible \\
For \(k = -1 \quad \Rightarrow b-c = 11 \rightarrow \) impossible
Accordingly, the value of the difference b – c is 0.
\({\textbf{Answer: C}}\)
Question 49:
Where a and b are digits,
\[\frac{a0b}{30}+ \frac{3}{5}\]
given that this expression is equal to a natural number, what is the value of b?
\[ \text{A)} 6 \quad \text{B) } 5 \quad \text{C) } 4 \quad \text{D) } 3 \quad \text{E) } 2 \]
Solution:
\[\frac{a0b}{30}+ \frac{3}{5} = \frac{a0b+18}{30} \in N\]
Therefore, the number a0b + 18 must be a number divisible by 30. Since \(30 = 3 \cdot 10\), this number must be divisible by both 3 and 10. Accordingly, the units digit of the number a0b + 18 must be 0. For this to happen, b must be equal to 2.
\({\textbf{Answer: E}}\)
Question 50:
The four-digit number \(aaa0\) is always divisible by which of the following?
\[ \text{A)} 8 \quad \text{B) } 12 \quad \text{C) } 15 \quad \text{D) } 18 \quad \text{E) } 20 \]
Solution:
Since the last digit of the number \(aaa0\) is 0, this number is always divisible by 5 and 10. Given that the sum of the digits of this number is 3a, it is also always divisible by 3. Since a number divisible by two coprime numbers is also divisible by their product (and since 3 and 5 are coprime numbers), the number aaa0 is also always divisible by 15.
\({\textbf{Answer: C}}\)