AP 6th Maths Unit 3 Number Play Answers

AP 6th Maths Unit 3 Number Play Answers: About this Unit: Number Play (Class 6 Maths Chapter 3) is an exciting and activity-based chapter that introduces students to the fun and logical side of numbers. This unit covers key topics such as palindromic numbers, the Kaprekar constant (6174), supercells, number line patterns, digit sums, clock and calendar number patterns, simple estimation, mental math strategies, number patterns, the famous unsolved Collatz Conjecture, and winning strategies in number games


AP 6th Maths Unit 3 Number Play Answers: This chapter builds logical reasoning, pattern recognition, computational thinking, and estimation skills in young learners. Below you will find complete step-by-step solutions for every "Figure it Out," "Math Talk," "Let's Explore," and "Chapter Mastery" question from this Class 6 Maths Number Play chapter — perfect for exam preparation, homework help, and revision. Class 6 Maths Chapter 3 solutions, Number Play answers, Kaprekar constant 6174, palindromic numbers Class 6, supercells maths, Collatz Conjecture explained, AP SCERT Class 6 Maths.

AP 6th Maths Unit 3 Number Play Answers

AP 6th Maths Unit 3 Number Play Answers

📘 Class 6 Maths Chapter 3 – Number Play

Complete Question & Answer Guide (AP SCERT / CBSE Class 6 Mathematics)

3.0 Introduction

This section introduces the theme of the chapter through Ravi and Raju, two friends who play a number game using vehicle plate numbers by adding digits repeatedly. It is a narrative introduction with no direct questions — it sets the stage for exploring number patterns, palindromes, increasing/decreasing numbers, and repeated digits that are studied throughout the chapter.

3.1 Numbers Can Tell Us Things

🔴 What do you think these numbers mean?

Each child in the line is saying a number that tells us how many of their standing neighbours are taller than them. A child says '1' if only one neighbour is taller, '2' if both neighbours are taller, and '0' if neither neighbour is taller. Hint check: Yes, the children's heights are playing the deciding role here.

🗣️ Math Talk — Try answering these questions:

1. Can the children rearrange themselves so that the children standing at the ends say '2'?

No, this is not possible. A child standing at either end of the line has only one neighbour, not two. To say '2', a child must have both neighbours taller. Since end children have only one neighbour, the maximum they can ever say is '1' (if that one neighbour is taller).

2. Can we arrange the children in a line so that all would say only 0s?

No, not possible for 3 or more children. To say '0', an interior child must be taller than both their neighbours (a "local maximum"). But two children standing next to each other cannot both be taller than each other at the same time — between any two such "peaks" there must be a shorter child (a "dip") who will say '1' or '2', not '0'. So all children cannot say '0' together.

3. Can two children standing next to each other say the same number?

Yes, it is possible. Example: Arrange 5 children by height (shortest to tallest ranked 1–5) in the order 3, 5, 4, 2, 1. Their numbers become 1, 0, 1, 1, 1 — the 3rd, 4th and 5th children are all next to each other and all say '1'.

4. There are 5 children of different heights. Can they stand such that four say '1' and the last says '0'? Why or why not?

Yes, it is possible! Arrange the 5 children in strictly increasing order of height (shortest to tallest), left to right. Then: each child (except the tallest) has exactly one taller neighbour (the next, taller child) → says '1'. The tallest child, standing at the end, has only a shorter neighbour → says '0'. Resulting sequence: 1, 1, 1, 1, 0.

5. For this group of 5 children, is the sequence 1, 1, 1, 1, 1 possible?

No, this is never possible. Consider the tallest child in the group — no one can be taller than them, so they can never have a taller neighbour. This means the tallest child must always say '0', no matter how the children are arranged. So all five children can never say '1' at the same time.

6. Is the sequence 0, 1, 2, 1, 0 possible? Why or why not?

Yes, it is possible. Arrange the 5 children by height-rank (1=shortest, 5=tallest) as: 3, 2, 1, 4, 5.
  • Child 1 (height 3): neighbour is height 2 (shorter) → says 0
  • Child 2 (height 2): neighbours 3 (taller) & 1 (shorter) → says 1
  • Child 3 (height 1): neighbours 2 & 4, both taller → says 2
  • Child 4 (height 4): neighbours 1 (shorter) & 5 (taller) → says 1
  • Child 5 (height 5): neighbour is height 4 (shorter) → says 0
This gives exactly the sequence 0, 1, 2, 1, 0 — a "valley" shaped height arrangement.

7. How would you rearrange the five children so that the maximum number say '2'?

Maximum possible is 2 children saying '2'. Only middle (interior) children can say '2' (end children have only 1 neighbour). Also, two children standing next to each other can never both say '2' (each would need to be shorter than the other — impossible). So in a line of 5, only the 2nd and 4th positions can both be "local minima" together. Example arrangement (by height-rank): 4, 1, 5, 2, 3 → the 2nd child (height 1) and 4th child (height 2) each have two taller neighbours and say '2'. Sequence: 1, 2, 1, 2, 0 — two children say '2', which is the maximum possible.
3.2 Patterns of Numbers on the Number Line

🔴 Place the numbers 2180, 2754, 1500, 3600, 9950, 9590, 1050, 3050, 5030, 5300 and 8400 on the number line (1000 to 10,000).

Arranging the numbers in increasing order first helps us place them correctly:
1050 < 1500 < 2180 < 2754 < 3050 < 3600 < 5030 < 5300 < 8400 < 9590 < 9950
Between marksNumbers placed there
1000 – 20001050, 1500
2000 – 30002180, 2754
3000 – 40003050, 3600
5000 – 60005030, 5300
8000 – 90008400
9000 – 10,0009590, 9950
📝 Figure it Out – 3.1

Identify the numbers marked on the number lines below, and label the remaining positions.

a. Gap between marks = 2020 − 2010 = 10. Labelled points:
1970, 1980, 1990, 2000, 2010, 2020, 2030, 2040, 2050, 2060
Smallest number: 1970   Largest number: 2060
b. Gap between marks = 9997 − 9996 = 1. Labelled points:
9992, 9993, 9994, 9995, 9996, 9997, 9998, 9999, 10000, 10001
Smallest number: 9992   Largest number: 10001
c. Gap between marks = 15,078 − 15,077 = 1. Labelled points:
15,077, 15,078, 15,079, 15,080, 15,081, 15,082, 15,083, 15,084, 15,085, 15,086
Smallest number: 15,077   Largest number: 15,086
d. Gap between marks = 87,705 − 86,705 = 1000. Labelled points:
82,705, 83,705, 84,705, 85,705, 86,705, 87,705, 88,705, 89,705, 90,705, 91,705
Smallest number: 82,705   Largest number: 91,705

Note: The common gap in each line is found by subtracting the two given numbers and dividing by the number of intervals between them; then this gap is added/subtracted repeatedly to label every mark.

3.3 Supercells

🔴 Observe the numbers in the table. Why are some numbers coloured? Discuss.

A cell (number) is coloured — called a "Supercell" — when the number inside it is greater than all its adjacent (neighbouring) numbers in the row. For example, 626 is coloured because it is greater than both its neighbours 577 and 345, while 200 is not coloured since it is smaller than 577. The number 198 is coloured because it has only one neighbour (109) and is greater than it.
📝 Figure it Out – 3.2

1. Colour or mark the supercells in the table: 6828, 670, 9435, 3780, 3708, 7308, 8000, 5583, 52

6828 670 9435 3780 3708 7308 8000 5583 52
Supercells (green): 6828, 9435, 8000 — each is greater than its neighbour(s).

2. Fill the table with only 4-digit numbers so that the supercells are exactly the coloured cells (5346 → colour → blank → colour → blank → blank → blank → 9635 → colour):

5346 8500 3000 7000 2000 2500 4000 9635 9800
Check: 8500 > 5346 & 3000 ✓Supercell. 7000 > 3000 & 2000 ✓Supercell. 9800 > 9635 ✓Supercell (last cell). All other cells are smaller than at least one neighbour, so they stay uncoloured.

3. Fill a table (9 cells, numbers 100–1000, no repetition) to get as many supercells as possible.

900 150 850 200 800 250 750 300 700
(a) Out of 9 cells, 5 supercells (1st, 3rd, 5th, 7th, 9th positions) are obtained using a high-low-high-low ("zig-zag") pattern.
(b) For different row lengths: 3 cells → max 2 supercells; 5 cells → max 3; 7 cells → max 4; in general, for n cells the maximum possible supercells is the number of odd positions, i.e. about half the cells.
(c) Pattern: Place a large number, then a small number, then a large number, and so on alternately (zig-zag arrangement), always starting and ending with a "large" number. This gives the maximum number of supercells — roughly ⌈n/2⌉ for n cells.

4. Can you fill a supercell table without repeating numbers such that there are no supercells? Why or why not?

No, it is not possible. The cell containing the largest number in the whole row will always be bigger than each of its neighbours (since it is the biggest number of all), so it will always be a supercell. There will always be at least one supercell.

5. Will the cell having the largest number always be a supercell? Can the cell with the smallest number be a supercell?

Largest number: Yes, always a supercell — it is bigger than every other number, so it is automatically bigger than its neighbours too.
Smallest number: No, it can never be a supercell — it is smaller than every other number, so it will always be smaller than its neighbours.

6. Fill a table such that the cell having the second largest number is not a supercell.

100150200290300
Placing the second largest number (290) right next to the largest number (300) blocks it from being a supercell, since 290 < 300.

7. Fill a table such that the second largest number is NOT a supercell but the second smallest number IS a supercell. Is it possible?

Yes, it is possible.
20101009050
Here 20 (2nd smallest) is at the end next to 10 (smallest), so 20 > 10 → supercell. And 90 (2nd largest) sits right next to 100 (largest), so 90 < 100 → not a supercell. Both conditions are satisfied together!

8. Make other variations of this puzzle and challenge your classmates.

Open-ended activity — for example, try the puzzle on a bigger row of 11 cells, or challenge a friend to find the arrangement using numbers 1–9 that gives exactly 3 supercells.

🔴 Complete Table 2 with 5-digit numbers using digits '1','0','6','3','9' (in some order); only coloured cells should be greater than all their neighbours (left/right/top/bottom):

96,301 36,109 19,036
13,609 60,319 19,306
10,369 60,193 10,936
10,963 01,369 61,930
Every number uses only the digits 1, 0, 6, 3, 9 (each once). The coloured cells (96,301 / 60,319 / 10,963 / 61,930) are each greater than their immediate neighbours.
The biggest number in the table is 96,301.
The smallest even number in the table is 10,936.
The smallest number greater than 50,000 in the table is 60,193.
3.4 Playing with Digits

🔴 Find out how many numbers have two digits, three digits, four digits and five digits.

1-digit numbers
(From 1–9)
2-digit numbers 3-digit numbers 4-digit numbers 5-digit numbers
9 90 900 9000 90,000
Step-wise reasoning: 2-digit numbers run from 10 to 99 → 99 − 10 + 1 = 90. 3-digit numbers run from 100 to 999 → 999 − 100 + 1 = 900. 4-digit numbers run from 1000 to 9999 → 9999 − 1000 + 1 = 9000. 5-digit numbers run from 10,000 to 99,999 → 99,999 − 10,000 + 1 = 90,000.
📝 Figure it Out – 3.3 (Digit Sum 14)

1. Write other numbers whose digits add up to 14.

59 (5+9=14), 68 (6+8=14), 77 (7+7=14), 86 (8+6=14), 95 (9+5=14), 149 (1+4+9=14), 239 (2+3+9=14), 1409 (1+4+0+9=14), 2345 (2+3+4+5=14).

2. What is the smallest number whose digit sum is 14?

Step 1 (Concept): To make the smallest number for a fixed digit sum, use the fewest digits possible, and keep the leftmost digit as small as possible.
Step 2 (Task): With 1 digit, the max sum is 9 (too small). So we need 2 digits: units digit should be as large as possible (max 9) so that the tens digit is as small as possible: 14 − 9 = 5.
Step 3 (Answer): Smallest number = 59.

3. What is the largest 5-digit number whose digit sum is 14?

Step 1: To make the largest number, keep the leftmost digits as large as possible.
Step 2: First digit = 9 (largest possible); remaining sum = 14 − 9 = 5. Second digit = 5 (uses up remaining sum); rest = 0,0,0.
Step 3: Largest number = 95,000. Check: 9+5+0+0+0 = 14 ✓

4. How big a number can you form having digit sum 14? Can you make an even bigger number?

There is no limit — you can always make a bigger number! Simply keep adding zeros at the end (e.g. 95,000 → 950,000 → 9,500,000 ...). Since 0 doesn't add to the digit sum, the number keeps growing while the digit sum stays 14.

5. Find the digit sums of all numbers from 40 to 70. Share your observations.

40s: 4,5,6,7,8,9,10,11,12,13  |  50s: 5,6,7,8,9,10,11,12,13,14  |  60s: 6,7,8,9,10,11,12,13,14,15  |  70: 7
Observation: Within a decade (like 40–49), the digit sum increases by 1 each time. But when we cross a multiple of 10 (like 49→50), the digit sum suddenly drops (13→5), because the units digit resets from 9 to 0 while the tens digit increases by only 1.

6. Calculate the digit sums of 3-digit numbers whose digits are consecutive (e.g., 345). Do you see a pattern? Will it continue?

123→6, 234→9, 345→12, 456→15, 567→18, 678→21, 789→24
Pattern: The digit sum increases by 3 each time (an arithmetic sequence 6,9,12,15,18,21,24), because each of the three digits increases by 1, adding 1+1+1=3 to the total. This pattern continues only up to 789, since after that the digits can no longer be single-digit consecutive numbers (8,9,10 is not possible).
🔍 Digit Detectives

Among numbers 1–100, how many times will digit '7' occur? Among 1–1000, how many times?

1 to 100: Units place: 7,17,27,37,47,57,67,77,87,97 → 10 times. Tens place: 70–79 → 10 times. Total = 10 + 10 = 20 times.
1 to 1000: In every block of 100 numbers, digit 7 appears 20 times in units+tens place (as above) → 10 blocks × 20 = 200. Additionally, the hundreds digit is '7' for the whole range 700–799 → 100 more times. Total = 200 + 100 = 300 times.
3.5 Pretty Palindromic Patterns

🔴 Write all possible 3-digit palindromes using the digits '1', '2', '3'.

A 3-digit palindrome has the form XYX (first digit = last digit). Using digits 1, 2, 3 (repetition allowed since only 3 digits are given), all 9 palindromes are:
111, 121, 131, 212, 222, 232, 313, 323, 333

🔴 Let's Explore

1. Will reversing and adding numbers repeatedly, starting with a 2-digit number, always give a palindrome?

For nearly all 2-digit numbers, yes — you reach a palindrome quickly (usually within 1–4 steps, as in 34+43=77 or 48+84=132, 132+231=363). A few numbers take many more steps (e.g. 89 takes 24 steps to reach the palindrome 8,813,200,023,188!), but every 2-digit number that has been checked does eventually reach a palindrome.

2. Will reversing and adding numbers repeatedly, starting with 196, always give a palindrome?

This is actually an unsolved mystery in mathematics! 196 is the smallest number for which, even after millions of reversal-and-addition steps tested by computers, no palindrome has ever been found. This is famously called the "196 problem" (such numbers are called Lychrel numbers), and whether it ever reaches a palindrome remains unknown.
🧩 Puzzle Time

I am a 5-digit palindrome. I am an odd number. My 'tens' digit is double my 'unit' digit. My 'hundreds' digit is double my 'tens' digit. Who am I?

Step 1 (Concept): A 5-digit palindrome has the form ABCBA. Since it is odd, the units digit (A) must be odd.
Step 2 (Task): Tens digit = 2 × units digit → B = 2A. Hundreds digit = 2 × tens digit → C = 2B = 4A. All digits must be single digits (0–9), and A must be odd and non-zero (it's also the leading digit).
Testing A = 1: B = 2, C = 4 — all valid single digits! (A=3 would give C=12, invalid.)
Step 3 (Answer): Number = 1 2 4 2 1
1 2 4 2 1
Who am I? 12,421 (Twelve thousand, four hundred and twenty-one). Check: palindrome ✓, odd ✓, tens(2)=2×units(1) ✓, hundreds(4)=2×tens(2) ✓
3.6 Clock and Calendar Numbers

🔴 Find all possible times on a 12-hour clock of these types: (i) 4:44 type, (ii) 10:10 type, (iii) 12:21 type (palindrome).

Type (i) — all digits same, like 4:44: Hour must equal both minute digits. Since minutes can only go up to 59, the tens-digit of minutes must be ≤5. Valid times: 1:11, 2:22, 3:33, 4:44, 5:55 (only 5 such times — 6:66 etc. are invalid since minutes can't exceed 59).

Type (ii) — hour number repeats as minutes, like 10:10: Minutes = Hour value. Valid times: 1:01, 2:02, 3:03, 4:04, 5:05, 6:06, 7:07, 8:08, 9:09, 10:10, 11:11, 12:12 — 12 such times in every 12-hour cycle.

Type (iii) — full palindrome, like 12:21: The complete string of digits reads the same forwards and backwards. Counting carefully for 1-digit hours (1–9): 6 palindromic times each (e.g. for hour 1: 1:01,1:11,1:21,1:31,1:41,1:51) = 54 times; for 2-digit hours (10,11,12): exactly 1 each (10:01, 11:11, 12:21) = 3 times. Total = 57 palindromic times in a 12-hour period.

🔴 The Mystery of the Mirror Dates — Gopi found 02/02/2020 and 14/02/2041. Can you find the next ones?

Rule discovered: In DD/MM/YYYY format for years 20__, a palindromic date needs Month = 02 (February) always, and the Day = the year's last two digits written in reverse order.
Next palindromic dates after 14/02/2041: 24/02/2042, then 05/02/2050, then 15/02/2051, then 25/02/2052.

🔴 Find all possible dates of this form from the past.

Using the same rule for years 2000–2019: 10/02/2001, 20/02/2002, 01/02/2010, 11/02/2011, 21/02/2012 (other years in this range give an invalid day, like day 30 or above, which February cannot have).

🔴 Will any year's calendar repeat again after some years? Will all dates and days match exactly with another year?

Yes! A calendar repeats exactly when both the day-of-week of 1 January AND the leap-year pattern match again. Since a common year has 365 days (52 weeks + 1 extra day), each date shifts forward by 1 weekday every year (2 days after a leap year). Calendars typically repeat after 6, 11, or 28 years, depending on how leap years fall in between.
🔍 Let's Explore

If the date format is DD/MM/YYYY, what is the next palindromic date after 03/02/2030?

Using our rule, the next one is 13/02/2031. Check: digits of "13022031" reversed = "13022031" — a perfect palindrome! ✓

Are there any palindromic dates in the year 2031? Why or why not?

Yes — exactly one: 13/02/2031 (as found above). This happens because the year's last two digits, reversed, give a valid February day (13).

Challenge: What is the last palindromic date of the 21st century (up to the year 2100)?

Step 1: We need the largest year Y (≤2099) such that "reverse of last two digits" gives a valid February day.
Step 2: To maximise the year, try the tens-digit of the last two digits = 9 (years 2090–2099). Day = (units digit)(tens digit) reversed = needs to be ≤29. Testing: units digit 2 gives day "29" (valid, and only in a leap year!). Year 2092 works (2092 ÷ 4 = 523, so it is a leap year — Feb 29 is valid).
Step 3 (Answer): The last palindromic date of the 21st century is 29/02/2092 — and remarkably, it lands exactly on a leap-year's Feb 29! (Year 2100 itself gives an invalid "day 00", so no palindromic date exists there.)
3.7 The Magic Number of Kaprekar

🔴 Let's Explore — Take different 4-digit numbers and carry out the Kaprekar steps. What happens?

No matter which 4-digit number you start with (as long as all its digits aren't identical), you always eventually reach 6174 — the famous Kaprekar constant — usually within 7 or fewer rounds. Once you reach 6174, applying the steps again just gives 6174 back (7641 − 1467 = 6174), so it keeps repeating forever.

🔴 Carry out the same steps with a few 3-digit numbers. What number will start repeating?

Example, starting with 521: Largest=521, Smallest=125, C=521−125=396. Next: Largest=963, Smallest=369, C=963−369=594. Next: Largest=954, Smallest=459, C=954−459=495. Next: Largest=954, Smallest=459, C=495 (repeats!).
The 3-digit Kaprekar constant is 495.
📝 Figure it Out – 3.4

1. Sarala uses digits 4,7,3,2 → smallest 2347, largest 7432, difference 5085, sum 9779. Choose 4 digits to make:

a. Difference greater than 5085: Digits 9,6,1,2 → largest=9621, smallest=1269, difference = 9621−1269 = 8352 (> 5085 ✓)
b. Difference less than 5085: Digits 1,1,2,2 → largest=2211, smallest=1122, difference = 2211−1122 = 1089 (< 5085 ✓)
c. Sum greater than 9779: Digits 9,8,7,6 → largest=9876, smallest=6789, sum = 9876+6789 = 16,665 (> 9779 ✓)
d. Sum less than 9779: Digits 1,2,3,4 → largest=4321, smallest=1234, sum = 4321+1234 = 5555 (< 9779 ✓)

2. What is the sum of the smallest and largest 5-digit palindrome? What is their difference?

Step 1 (Concept): A 5-digit palindrome has form ABCBA. Smallest: A=1 (can't be 0), B=0, C=0 → 10,001. Largest: A=9,B=9,C=9 → 99,999.
Step 2 (Task & Answer): Sum = 10,001 + 99,999 = 1,10,000. Difference = 99,999 − 10,001 = 89,998.

3. The time now is 10:01. How many minutes until the clock shows the next palindromic time? What about the one after that?

Step 1 (Concept): A palindromic time reads the same forwards/backwards, e.g. 10:01, 11:11, 12:21.
Step 2 (Task): After 10:01, the very next palindromic time is 11:11 — that is 1 hour 10 minutes = 70 minutes later.
Step 3 (Answer): The one after 11:11 is 12:21 — again exactly 70 minutes later.

4. How many rounds does the number 5683 take to reach the Kaprekar constant?

Step 1 (Concept): Repeatedly subtract (smallest arrangement) from (largest arrangement) of the digits.
Step 2 (Task – working):
RoundLargestSmallestDifference
1865335685085
2855005587992
3997227997173
4773113776354
5654334563087
6873003788352
7853223586174 ✓
Step 3 (Answer): It takes 7 rounds for 5683 to reach the Kaprekar constant 6174.
3.8 Simple Estimation
📝 Figure it Out – 3.5

(These are personal estimation exercises — sample reasonable answers for a Class 6 student are given below. Actual answers will vary from person to person and place to place — that is the nature of estimation!)

1. Steps you would take to walk:

a. From your seat to the classroom door — about 8–10 steps
b. Across the school ground, start to end — about 100–150 steps
c. From classroom door to school gate — about 40–60 steps
d. From school to home — varies; e.g. about 500–1000 steps depending on distance

2. Number of times you blink your eyes / breaths you take:

a. In a minute — about 15–20 blinks; about 15–18 breaths
b. In an hour — about 900–1200 blinks; about 900–1080 breaths
c. In a day — about 14,000–19,000 blinks (while awake); about 20,000–23,000 breaths

3. Name objects around you that are:

a. A few thousand in number — grains of rice in a small bowl, words in a story book
b. More than ten thousand in number — hair strands on a person's head (~1,00,000), grains of rice in a 1 kg bag

🎯 Estimate the answer (within 30 seconds):

4. Number of words in your maths textbook: (a) More than 5000 — a full textbook with many chapters usually has well over 5000 words.
5. Students who travel by bus: Answer depends on your school — for a mid-to-large school, typically (a) More than 200.
6. Achyuth estimates ₹100 for milk + 3 fruits for 5 people. Do you agree? No, ₹100 is too low. A litre of milk alone costs about ₹60–70, and 3 kinds of fruit for 5 people would cost at least ₹150–200 more. A more realistic estimate is around ₹250–300.
7. Estimated distance between Amaravati (AP) and Hyderabad (Telangana): about 275–290 km by road.
8. Amara says she spent ~13,000 hours in school till Grade 6. Agree? No. About 6 hours/day × 200 school days/year × 6 years ≈ 7200 hours — much less than 13,000. Her estimate seems too high.
9. Walking-time estimates: (a) to a favourite nearby place — 10–20 minutes; (b) to a neighbouring state's capital — many hours, spread over several days of walking; (c) southernmost to northernmost point of India (~3500 km) — roughly 2–3 months of continuous daily walking.
10. Make your own estimation questions — e.g., "Estimate the number of pages you read in a year" or "Estimate how many times your heart beats in a day." (open-ended activity)
3.9 Mental Math

🔴 Can we make 1,000 using the middle numbers (25000, 400, 13000, 1500, 60000)? Why not? What about 14000, 15000, 16000?

1,000 — Not possible. The smallest building block is 400. Using only 400s: 400+400=800 (too small), 400×3=1200 (too big) — nothing lands exactly on 1000, and mixing in 1500 or bigger numbers overshoots immediately.
14,000 — Possible! 400 × 35 = 14,000
15,000 — Possible! 13000 + 400+400+400+400+400 = 13000 + 2000 = 15,000
16,000 — Possible! 13000 + 1500 + 1500 = 16,000
What thousands cannot be made? Since our small building blocks are 400 and 1500 (whose HCF is 100), only certain small totals like 1000 cannot be reached exactly using them — most larger "thousands" values can be reached by combining 400s, 1500s and the bigger numbers cleverly.

🔴 Adding and Subtracting: fill in the blanks using the boxes 40000, 7000, 300, 1500, 12000, 800 (addition and subtraction both allowed):

39,800 = 40,000 − 800 + 300 + 300 (given example)
45,000 = 40,000 + 12,000 − 7,000  (Check: 40000+12000=52000−7000=45000 ✓)
5,900 = 7,000 − 800 − 300  (Check: 7000−800=6200−300=5900 ✓)
17,500 = 12,000 + 7,000 − 1,500  (Check: 19000−1500=17500 ✓)
21,400 = 40,000 − 7,000 − 12,000 + 1,500 − 800 − 300  (Check: 40000−7000=33000−12000=21000+1500=22500−800=21700−300=21400 ✓)
📝 Figure it Out – 3.6

1. Write an example for each scenario whenever possible:

ScenarioExample / Reason
5-digit + 5-digit → 5-digit sum > 90,25045,200 + 46,000 = 91,200
5-digit + 3-digit → 6-digit sum99,500 + 800 = 1,00,300
4-digit + 4-digit → 6-digit sumNot possible! Max 4-digit+4-digit = 9999+9999 = 19,998, which is only 5-digit at most — it can never reach 6 digits.
5-digit + 5-digit → 6-digit sum60,000 + 55,000 = 1,15,000
5-digit + 5-digit → exactly 18,500Not possible! The smallest 5-digit number is 10,000, so the smallest possible sum of two 5-digit numbers is 10,000+10,000=20,000, which already exceeds 18,500.
5-digit − 5-digit → difference < 56,50350,000 − 10,000 = 40,000
5-digit − 3-digit → 4-digit difference10,500 − 800 = 9,700
5-digit − 4-digit → 4-digit difference15,000 − 6,000 = 9,000
5-digit − 5-digit → 3-digit difference50,300 − 50,000 = 300
5-digit − 5-digit → exactly 91,500Not possible! The largest possible difference between two 5-digit numbers is 99,999 − 10,000 = 89,999, which is less than 91,500.
Could you find examples for all cases? No — three cases are mathematically impossible (marked above), because of the fixed minimum/maximum values that numbers with a given number of digits can take.

2. Always, Sometimes, Never? (with reasoning)

a. 5-digit + 5-digit gives a 5-digit number: Sometimes (10,000+10,000=20,000 is 5-digit, but 60,000+60,000=1,20,000 is 6-digit)
b. 4-digit + 2-digit gives a 4-digit number: Sometimes (1000+10=1010 is 4-digit, but 9999+99=10,098 is 5-digit)
c. 4-digit + 2-digit gives a 6-digit number: Never (maximum possible sum is 9999+99=10,098, which never reaches 6 digits)
d. 5-digit − 5-digit gives a 5-digit number: Sometimes (50,000−10,000=40,000 is 5-digit, but 10,005−10,000=5 is only 1-digit)
e. 5-digit − 2-digit gives a 3-digit number: Never (smallest possible result is 10,000−99=9,901, already 4-digit; it can never drop to 3 digits)
3.10 Playing with Number Patterns

🔴 Find the sum of numbers in each figure. Should we add them one by one, or is there a quicker way?

Quicker way: Instead of adding one by one, group the same numbers together and multiply (count × value), then add the group totals. This is much faster than adding term by term.

a. There are 12 boxes of "40" and 10 boxes of "50" → (12 × 40) + (10 × 50) = 480 + 500 = 980
c. There are 40 cells of "32" (4 rows × 10) and 20 cells of "64" (4 rows × 5) → (40 × 32) + (20 × 64) = 1280 + 1280 = 2560
b, d, e, f (dot / circle / hexagon patterns): Use the same strategy — identify each group of repeated numbers/dots, count how many are in each group, multiply, then add all group-totals together. For example, in figure (f) — the concentric circles — count how many "125"s are in the outer ring, how many "250"s, "500"s, and the single "1000" at the centre, then compute (count × value) for each ring and add them up, rather than counting every single dot individually.
3.11 An Unsolved Mystery — The Collatz Conjecture

🔴 Make some more Collatz sequences starting with your favourite whole numbers. Do you always reach 1? Do you believe the conjecture? Why or why not?

Rule recap: If the number is even, halve it; if odd, multiply by 3 and add 1. Repeat.

Example, starting with 7 (step-by-step):
7(odd)→22 → 22(even)→11 → 11(odd)→34 → 34(even)→17 → 17(odd)→52 → 52(even)→26 → 26(even)→13 → 13(odd)→40 → 40(even)→20 → 20(even)→10 → 10(even)→5 → 5(odd)→16 → 16(even)→8 → 8(even)→4 → 4(even)→2 → 2(even)→1
(Reaches 1 after 16 steps!)

Do you always reach 1? Every whole number tested so far (even extremely large ones, checked by powerful computers) eventually reaches 1. For example, starting from 27 takes a surprising 111 steps, but it still reaches 1 in the end.
Do you believe the conjecture? Based on the strong evidence (millions of numbers tested with no exception), it seems very likely to be true — but since it has never been mathematically proven for every possible whole number, it remains an open/unsolved problem.
3.12 Games and Winning Strategies

🏏 Game #1: Half-Century Chase (reach 50 first, adding 1–4 runs each turn). Which player always wins? What pattern should the winner follow?

Step 1 (Concept): Since each move adds 1 to 4, the key "control numbers" are multiples of 5 (because 1+4=5). Whoever reaches a multiple of 5 can always force the total back to the next multiple of 5, no matter what the opponent adds.
Step 2 (Task): Player A moves first and can only reach 1–4 (never exactly 5). This means Player B can always respond by adding just enough to make the total a multiple of 5 (5, 10, 15, ... 50).
Step 3 (Answer): Player B always wins with correct play, by always saying the numbers 5, 10, 15, 20, 25, 30, 35, 40, 45, 50.

🏏 Game #2: Century Clash (reach 100 first, adding 1–10 each turn). Which player always wins?

Step 1 (Concept): Here the key control numbers are multiples of 11 shifted by 1 (since 1+10=11, and 100 mod 11 = 1). The control sequence is 1, 12, 23, 34, 45, 56, 67, 78, 89, 100.
Step 2 (Task): Since '1' is a valid first move (within 1–10), Player A can grab control right at the start by saying '1'.
Step 3 (Answer): Player A always wins this game, by starting with 1 and then always adding enough to reach the next number in the sequence 1, 12, 23, 34, 45, 56, 67, 78, 89, 100.

🏏 Game #3: The Decrementer (start at 40, subtract 1, 3 or 5 each turn; reaching exactly 0 wins). Who wins?

Step 1 (Concept): All allowed moves (1, 3, 5) are odd numbers, so every move flips the score from even to odd or odd to even.
Step 2 (Task): Testing small cases shows that every even number is a "losing position" for whoever must move from it (they are forced to leave an odd number for the opponent, who can always win from an odd position). Since the game starts at 40 (even), Player A (who moves first) starts in a losing position.
Step 3 (Answer): Player B always wins, by always subtracting an amount that leaves an even number for Player A.
📝 Figure it Out – 3.7

1. There is only one supercell (62,871) in this grid. If you exchange two digits of one number, there will be 4 supercells. Which digits to swap?

16,20039,34429,765
23,60962,871→16,87245,306
19,38150,31938,408
Answer: Swap the first digit '6' with the last digit '1' in 62,871 → it becomes 16,872. This makes the centre cell much smaller, so all four of its neighbours (39,344 / 23,609 / 45,306 / 50,319) become greater than it — giving exactly 4 supercells in total!

2. How many rounds does your year of birth take to reach the Kaprekar constant?

Worked example for the year 2012 (try this method with your own birth year!):
2012 → Largest 2210, Smallest 0122 → C = 2210−122 = 2088 [Round 1]
2088 → Largest 8820, Smallest 0288 → C = 8820−288 = 8532 [Round 2]
8532 → Largest 8532, Smallest 2358 → C = 8532−2358 = 6174 [Round 3] ✓ Kaprekar constant reached!
So the year 2012 takes 3 rounds.

3. We are 5-digit numbers between 35,000 and 75,000, all digits odd. Who is largest? Smallest? Closest to 50,000?

Step 1 (Concept): All digits must be from {1,3,5,7,9}, and the number must lie between 35,000 and 75,000.
Step 2 (Task): Largest — first digit can be at most 7, but "75,xxx" with odd digits (min 75,111) already exceeds 75,000, so first digit = 5 doesn't work either — the best is first digit 7 with second digit 3: 73,999 is the biggest valid one. Smallest — first digit 3, second digit must be ≥5 (odd) to reach past 35,000: 35,111 is the smallest valid one. Closest to 50,000 — numbers starting with 3 max out at 39,999 (far from 50,000), while numbers starting with 5 begin at 51,111 (only 1,111 away) — much closer.
Step 3 (Answer): Largest = 73,999; Smallest = 35,111; Closest to 50,000 = 51,111.

4. Estimate the number of holidays you get in a year including weekends, festivals and vacation. Compare with the exact number.

Sample estimate: 52 Sundays + about 10 festival/national holidays + about 25 days of summer & other vacations ≈ about 85–90 holidays in a year. (Check your own school calendar for the exact number and compare!)

5. Estimate the number of litres a mug, a bucket, and an overhead tank can hold.

Mug ≈ 0.3 – 0.5 litres; Bucket ≈ 15 – 20 litres; Overhead tank ≈ 500 – 1000 litres

6. Write one 5-digit number and two 3-digit numbers such that their sum is 18,670.

18,000 + 400 + 270 = 18,670  (Check: 18000+400=18400+270=18670 ✓)

7. Choose a number between 210 and 390. Create a number pattern (like Section 3.10) that sums to this number.

Chosen number: 300. Arrange four boxes of 75 in a diamond pattern (top, bottom, left, right of a centre point), similar to the "40s and 50s" figure in Section 3.10: 4 × 75 = 300

8. Recall the Powers of 2 sequence from Chapter 1. Why is the Collatz Conjecture obviously correct for every number in this sequence?

Powers of 2 (1, 2, 4, 8, 16, 32, 64, 128, ...) are always even. The Collatz rule for even numbers is simply "divide by 2," so starting from any power of 2, we just keep halving: 2ⁿ → 2ⁿ⁻¹ → ... → 4 → 2 → 1. It reaches 1 directly, without ever needing the "odd number" rule — so the conjecture trivially holds for every power of 2.

9. Check if the Collatz Conjecture holds for the starting number 100.

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
Yes — it reaches 1 after 25 steps, confirming the conjecture holds for 100.

10. Starting with 0, players alternately add numbers between 1 and 3. First to reach 22 wins. What is the winning strategy now?

Step 1 (Concept): Moves are 1–3, so the key modulus is 4 (1+3=4). 22 mod 4 = 2.
Step 2 (Task): Since '2' is a valid first move (within 1–3), Player A can claim it immediately.
Step 3 (Answer): Player A wins by first saying '2', then always adding just enough (4 − opponent's move) to reach the sequence 2, 6, 10, 14, 18, 22.
🏆 CHAPTER MASTERY

A. True / False

1. 575 is a palindromic number. → True (575 reversed is 575)
2. 6174 is called the Kaprekar constant for 4-digit numbers. → True
3. In a supercell table, the smallest number can be a supercell. → False (the smallest number is always smaller than its neighbours, so it can never be a supercell)
4. Every Collatz sequence eventually reaches 1. → False (this is only a conjecture — true for every number tested so far, but never mathematically proven for all whole numbers)

B. Multiple Choice Questions

5. What is a palindromic number? → (b) A number read the same forwards and backwards
6. The final digit sum of 1729 is: (1+7+2+9=19 → 1+9=10 → 1+0=1) → (c) 1
7. The 3-digit Kaprekar constant is: → (a) 495

C. Fill in the Blanks

8. In the Collatz rule, if the number is even, we divide it by 2.

D. Assertion – Reason

9. Assertion (A): 1221 is a palindromic number. Reason (R): It reads the same from left to right and right to left.
Answer: (a) Both A and R are true, and R is the correct explanation of A — this is simply the definition of a palindrome, correctly applied to 1221.

E. Short & Long Answer Questions

10. In the "Supercells" activity, what specific condition must a number meet to be considered a Supercell? (Understand)
A number in a cell is a "Supercell" if it is strictly greater than all of its immediate neighbouring numbers — that is, the cell(s) directly to its left and right (and above/below, in a grid), depending on how many neighbours it has.
11. Explain the two rules used to generate a sequence in the Collatz Conjecture. (Understand)
Rule 1: If the number is even, divide it by 2.
Rule 2: If the number is odd, multiply it by 3 and add 1.
These two rules are applied again and again to each new number obtained, forming a sequence that (according to the conjecture) always eventually reaches 1.
12. Write an example for: (4-digit number) − (4-digit number) = 3-digit number.
Example: 5000 − 4300 = 700 (5000 and 4300 are both 4-digit numbers; 700 is a 3-digit number)
13. Compare the "Half-Century Chase" (reaching 50) and "Century Clash" (reaching 100). Identify the first player's strategy in Half-Century Chase if they can add 1, 2, 3, or 4 runs each turn. (Analysis)
In both games, the winning strategy relies on being the first to reach a "control number" — a number from which you can always force the total back to the next control number regardless of your opponent's move (control numbers being multiples of 5 in Half-Century, and the sequence 1,12,23,...,100 in Century Clash).
The key difference: in Century Clash, '1' (the first control number) is itself a legal first move (moves range 1–10), so Player A can seize control immediately and wins.
In Half-Century Chase, the first control number is 5, but the first move can only be 1–4 (never exactly 5) — so Player A can never grab the first control point. Instead, it is Player B who seizes control on their very first turn (by adding just enough to make the total 5), and B goes on to win.
Conclusion: The first player (A) actually has no guaranteed winning strategy in the Half-Century Chase — no matter what A does on the first move (1, 2, 3 or 4), Player B can always respond to make the total a multiple of 5, and B keeps control all the way to 50.
📌 SUMMARY
  • Numbers can be used for many different purposes — to convey information, make and discover patterns, estimate magnitudes, pose and solve puzzles, and play and win games.
  • Thinking about and formulating set procedures to use numbers for these purposes is a useful skill called 'computational thinking'.
  • Many problems about numbers are very easy to pose, but very difficult to solve — some, like the Collatz Conjecture, remain unsolved to this day!