Review the key concepts, formulae, and examples before starting your quiz.
🔑Concepts
Numbers in General Form: A two-digit number with tens digit and units digit is written as . A three-digit number with digits is written as .
Reversing Digits: If a two-digit number is reversed, it becomes . The sum of a two-digit number and its reverse is always divisible by because .
Differences in Reversed Numbers: The difference between a two-digit number and its reverse is always divisible by because .
Letters for Digits (Cryptarithmetic): In these puzzles, each letter represents a unique digit from to . The leading digit of a number cannot be .
Divisibility by and : A number is divisible by (or ) if and only if the sum of its digits is divisible by (or ). This is derived from the fact that is always divisible by .
Winning Strategies in Sum Games: In a game where players add numbers from to to reach a target sum , the winning strategy involves reaching 'target positions' that are for integers .
📐Formulae
💡Examples
Problem 1:
Find the values of and in the following addition:
Solution:
From the units column: (since it ends in and must be greater than ). This gives . Carry over to the tens column. Tens column: . This gives in the result and a carry of . Hundreds column: , which matches. Thus, .
Explanation:
We use the rules of vertical addition. Since results in a units digit of , must be . We then verify the carry-over for the subsequent columns.
Problem 2:
If is a multiple of , where is a digit, what is the value of ?
Solution:
For a number to be divisible by , the sum of its digits must be a multiple of . Sum of digits . For to be a multiple of , could be . Since is a single digit, is the only possibility. Therefore, .
Explanation:
We applied the divisibility rule for : the sum of digits must be divisible by . The nearest multiple of is itself.
Problem 3:
Two players are playing a game where they add or to a running total. The player who reaches exactly wins. If the current total is , what should the next player add to ensure a win?
Solution:
The winning positions are calculated by subtracting from the target, where . The target is . The steps are , , . Since the current total is , the current player is in a 'losing position' if the opponent plays correctly. However, if the player wants to reach the next target of , they should add . But the max they can add is . The strategy is to always aim for the sequence . If the total is , the next player cannot reach in one move.
Explanation:
In games with steps to , the winning strategy involves controlling the remainder of the sum modulo .