Number Play · Lesson 8 of 8
Chapter Summary and Practice
“Connect the chapter’s comparison rules, digit puzzles, estimates, patterns, and game strategies.”
• Choose a suitable method for a mixed problem about numbers and explain the choice. • Connect neighbour rules, place value, digit patterns, and repeated procedures. • Use examples, bounds, and general reasoning for their different purposes. • Check numerical investigations for overlooked conditions or double counting. • Solve substantial mixed chapter problems and justify the results.
Choose the method that fits the question
Numbers can identify something, measure a quantity, describe a relationship, or encode a pattern. The first useful question is therefore what the numbers mean in the situation. A height puzzle asks about neighbours, a digit-sum puzzle asks about individual digits, and a game asks what each move allows. Starting with a familiar calculation before reading the rule may solve a different problem from the one posed.
The chapter develops a way of thinking as well as a collection of answers. Break a task into clear steps, use the same rule consistently, check intermediate results, and explain why a conclusion follows. This is often called computational thinking. It does not require a computer: constructing a supercell row, following Kaprekar’s procedure, estimating a population, and planning game replies all use it.
Breaking a task into manageable, clearly defined steps or rules so that its solution can be carried out and checked.
| Chapter idea | What to ask | Reliable method or check |
|---|---|---|
| Uses of numbers | Is this a quantity, a measurement, a label, or a clue? | Interpret the context before calculating. |
| Taller-neighbour counts | Which immediate neighbours are taller? | Check each existing neighbour; end positions have one. |
| Supercells | Does this value exceed every specified neighbour? | Use left/right in a row and four directions in a grid; exclude diagonals. |
| Maximum supercells | Can the intended peaks sit next to each other? | Alternate high and low values and explain the neighbour restriction. |
| Number lines | What increase does one interval represent? | Use labelled differences and count intervals. |
| Counts by digit length | What are the first and last positive numbers? | Count inclusively: last − first + 1. |
| Digit sums and digit occurrences | Am I adding digits or counting their appearances? | Ignore place values for sums; separate positions for occurrence counts. |
| Palindromes and reverse-and-add | Which positions must match, and when should I stop? | Match outside pairs or reverse and add until a palindrome appears. |
| Kaprekar’s procedure | Have I kept the required number of digit positions? | Descending arrangement minus ascending arrangement; retain leading zeros. |
| Clock times and dates | Is the format consistent and the value valid? | Check hours, minutes, actual dates, and any leading zeros. |
| Calendar reuse | Do both complete year layouts match? | Check the starting weekday and leap-year status. |
| Mental arithmetic and bounds | Can allowed numbers reach this target? | Build convenient parts; use extreme values to rule out impossible results. |
| Visual patterned sums | What repeats without overlap? | Count equal values, rows, rings, or repeated regions. |
| Collatz investigation | Which rule applies to the current positive number? | Halve even values; use three times plus one for odd values. Examples do not prove the conjecture. |
| Estimation | What assumptions connect the sample and whole? | Use representative information, state uncertainty, and avoid double counting. |
| Games | Which totals can I force after every reply? | Work backwards from the target and use complementary moves. |
Connect local comparisons with place value
A supercell is decided locally by neighbours, while changing a digit changes the value of a whole number. Combining these ideas creates a puzzle in which one carefully chosen digit swap changes several supercells at once. To solve it, first identify what blocks the neighbouring cells from becoming peaks, then use place value to remove that obstacle.
Problem
In the shown grid, swap two digits of one number to change the number of supercells from one to four.
- 1.Initially the centre, 62,871, exceeds every surrounding entry, so it is the only supercell. Each directly neighbouring cell is blocked by that centre value.
- 2.Swap the 6 and 1 in 62,871 to get 12,876. No other number is changed.
- 3.The directly neighbouring 39,344, 23,609, 45,306, and 50,319 now all exceed their existing left, right, above, and below neighbours.
- 4.The corners still have a larger neighbour, and 12,876 is not a supercell. Thus there are exactly four, not merely at least four.
Problem
Among five-digit numbers between 35,000 and 75,000 with all digits odd and repetition allowed, find the smallest, largest, and closest to 50,000.
- 1.For the smallest, use the smallest valid initial pair, 35, and fill the remaining places with the smallest odd digit, 1. The answer is 35,111.
- 2.For the largest, the first digit can be 7, but the next odd digit must be below 5 to stay below 75,000. Choose 3 and then all 9s: 73,999.
- 3.The smallest eligible number above 50,000 is 51,111, a distance of 1111. The largest below it is 39,999, a distance of 10,001.
- 4.Therefore 51,111 is closest. Compare distances on both sides rather than assuming the first candidate is nearest.
Repeated procedures and efficient totals
A repeated procedure specifies the next step from the current result. Reverse-and-add stops at a palindrome; Kaprekar’s routine reaches a number that returns to itself; Collatz sequences are recorded until the first 1. These are different stopping or repeating behaviours. State which one the task asks about before counting rounds.
Problem
Use the four digits of 1980 and count the rounds to first reach 6174.
- 1.9810 − 0189 = 9621. The ascending arrangement of 1, 9, 8, 0 is 0189, not 1089.
- 2.9621 − 1269 = 8352.
- 3.8532 − 2358 = 6174. This example reaches the constant after three subtraction rounds.
- 4.For your own year, rearrange all four positions afresh in every round. Count the first arrival at 6174; later repetitions are not extra rounds needed to reach it.
Problem
Write one five-digit number and two three-digit numbers totalling 18,670. Then create a patterned sum of 250.
- 1.Choose the five-digit number 18,000. The remainder is 18,670 − 18,000 = 670.
- 2.Split 670 into two three-digit numbers: 300 + 370. Thus 18,000 + 300 + 370 = 18,670, and all three digit-length conditions are satisfied.
- 3.For 250, use three 50s and four 25s: 3 × 50 + 4 × 25 = 150 + 100 = 250.
- 4.Arrange the three 50s in a middle row and two 25s in each of a top and bottom row. The picture expresses a grouping, and the grouped sum checks its total.
A visual pattern can be designed by reversing the counting process: choose a total, split it into contributions, and organise those contributions into repeated rows or shapes. Remember that the shape by itself does not determine the sum. Count every written value once. Two different-looking arrangements can have the same total.
Know what your evidence establishes
One successful construction proves that an arrangement is possible. One counterexample can show that a claim is not always true. A bound can prove that a target is impossible, and a rule that covers a whole family can prove a statement for that family. These kinds of evidence should not be confused. A long list of successes does not automatically supply a reason covering all cases.
Problem
Check the start 100, then explain what is known from that check.
- 1.100, 50, 25, 76, 38, 19, 58, 29, 88, 44, 22, 11, 34, 17, 52, 26, 13, 40, 20, 10, 5, 16, 8, 4, 2, 1 follows the even/odd rule and reaches 1.
- 2.This establishes the outcome for the particular starting number 100. Meeting an earlier sequence allows its remaining steps to be reused.
- 3.Powers of 2 have a separate general explanation: each halving removes one factor of 2 until 1 remains. The conjecture for all positive whole numbers is still a broader claim.
A supercell needs strict inequality and the correct neighbours. A five-digit maximum needs a fixed digit-length restriction. A Kaprekar round needs leading zeros. A date needs a stated valid format. An estimate needs assumptions. A game strategy needs a reply to every legal move. Dropping one condition can invalidate an otherwise convincing answer.
Use assumptions and strategy deliberately
Estimation and games may feel different, but both require you to identify the rule or assumption that makes the next step reasonable. A population estimate uses similar group sizes; a travel estimate uses a comparable pace. A target game uses a fixed complementary pair total. You should be able to explain why your next calculation fits the situation.
For estimation, improve the information or compare with an actual count when useful. Do not count a Sunday twice if it also falls in a vacation. For a game, improve the plan by working backwards and checking every possible reply. The target 22 with additions 1–3 needs the landmarks 2, 6, 10, 14, 18, 22, while the target 21 uses 1, 5, 9, 13, 17, 21. Small changes in a condition can change the answer.
Quiz
A grid supercell exceeds the cells directly above, below, left, and right. Which statement is correct?
A number line has labels 1000 and 3000 four equal intervals apart. What is one interval?
How many appearances of 7 are written in 707?
Which number has digit sum 14 but is not a palindrome?
What is the numerical value of the ascending four-position arrangement 0378?
Which argument proves that two five-digit numbers cannot sum to 18,670?
Which estimation method handles overlapping holidays correctly?
In a game to 22 with moves 1–3, you announce 10 and the opponent adds 3. What reply preserves your strategy?
Practice Problems
- Explain five different roles of numbers in everyday life. Include a label, a count, and a measurement.
- For five children of different heights, explain why 1, 1, 1, 1, 1 is impossible but 0, 1, 2, 1, 0 is possible.
- Use the mixed three-by-three grid above to explain every supercell before and after the digit swap.
- A number line has ten positions beginning with 83,705 and increasing by 1000. Label it and identify its smallest and largest values.
- Count positive four-digit numbers and construct the smallest number with digit sum 14. Explain both methods.
- Find the smallest, largest, and nearest-to-50,000 all-odd-digit numbers between 35,000 and 75,000. State whether repeated digits are allowed.
- Construct palindromes using 1, 2, 3; then test a reverse-and-add start of your choice. Distinguish your tested result from a general claim.
- Apply the correct four-position Kaprekar procedure to your birth year and to 5683. Show all ascending arrangements and count rounds.
- From 10:01 on an HH:MM twelve-hour display, find the next two palindromic times. Then give two conditions for matching yearly calendars.
- Write one five-digit number and two three-digit numbers whose sum is 18,670. Explain why two five-digit addends cannot have that total.
- Choose a total from 210 to 390 and design a repeated-row or shape pattern of numbers that sums to it. Show a quick grouped calculation.
- Estimate annual holidays including weekends, festivals, and vacations, then compare with an actual calendar. Avoid overlap.
- Estimate the capacities in litres of a mug, bucket, and overhead tank. State a reference quantity or evidence for each.
- Check the Collatz start 100 and explain why every power of 2 reaches 1. Say why these results do not prove all positive starts.
- Starting at 0 with moves 1–3, explain the full winning strategy for target 22. Compare it with targets 21 and 99, the latter using moves 1–10.
Examples include a route number as a label, a class size as a count, and a height as a measurement. For distinct heights, the tallest has no taller neighbour, preventing all 1s. Relative heights 4, 3, 1, 2, 5 produce 0, 1, 2, 1, 0.
Key Takeaways
• Interpret the number and its rule before choosing an operation. • Use neighbour comparisons, place value, digit structure, or grouping to match the task. • Repeated procedures need exact instructions, consistent conventions, and a clear stopping check. • Examples show possibility; counterexamples reject always; bounds and general reasoning justify wider conclusions. • Estimates need stated assumptions and overlap checks; winning strategies need all possible replies covered. • Computational thinking connects the chapter through clear steps, careful checking, and explained reasoning.
Previous · Lesson 7
Games and Winning Strategies
Next
End of chapter