Review the key concepts, formulae, and examples before starting your quiz.
🔑Concepts
A two-digit number can be written in generalised form as . If the digits are reversed to , the number becomes .
A three-digit number is written as .
Sum of a 2-digit number and the number obtained by reversing its digits is always divisible by and the sum of the digits .
Difference of a 2-digit number and its reverse (where ) is always divisible by and the difference of the digits .
Difference between a 3-digit number and its reverse (where ) is always divisible by and .
Divisibility by 10: A number is divisible by 10 if its units digit is .
Divisibility by 5: A number is divisible by 5 if its units digit is either or .
Divisibility by 2: A number is divisible by 2 if its units digit is or .
Divisibility by 3 and 9: A number is divisible by 3 (or 9) if the sum of its digits is divisible by 3 (or 9).
Cryptarithmetic: In puzzles where letters replace digits, each letter must represent only one digit, and the first digit of a number cannot be .
📐Formulae
💡Examples
Problem 1:
Check if the number is divisible by .
Solution:
Sum of digits . Since is divisible by (), the original number is divisible by .
Explanation:
The divisibility rule for states that if the sum of the digits is a multiple of , the number itself is divisible by .
Problem 2:
Find the values of and in the following addition:
Solution:
In the units column, ends in . This means , so . We carry over to the tens column. In the tens column, . Therefore, . So, .
Explanation:
We use basic addition rules. Since results in a units digit of , must be (as ). The tens digit is then the sum of the carry and the digits in the tens place.
Problem 3:
If is a multiple of , where is a digit, what are the possible values of ?
Solution:
For to be divisible by , the sum of its digits must be divisible by . So, must be . If . If . If . If . Possible values of are .
Explanation:
We apply the divisibility rule for and solve for the single-digit variable such that the total sum remains a multiple of .