Math Lab
Home/Class VIII/Chapter 5

Chapter 5: Number Play

The whole numbers 1,2,3,4,1, 2, 3, 4, \dots look ordinary at first glance. Once you start playing with them, they turn out to be full of surprises , secret shortcuts that tell you instantly whether a number is divisible by 1111, magic patterns where every row and column adds to the same total, and codes built on nothing but remainders.

This chapter is about playing with numbers. You will pick up a small toolkit of divisibility tests that work without long division. You will meet modular arithmetic , the way of thinking about remainders that runs everything from calendars to credit-card check digits. You will also peek at famous puzzles such as magic squares, cyclic numbers, and digit-sum tricks that astonish friends.

The real reason for all this play is that it builds mathematical intuition. The patterns you find here will help you spot factorisations, simplify fractions in your head, and check your arithmetic for blunders. Mathematicians sometimes say that "playing with numbers" is mathematics; everything else is just writing it down.

By the end you will be able to test divisibility by 2,3,4,5,6,8,9,10,112, 3, 4, 5, 6, 8, 9, 10, 11 at a glance, use remainders to solve clock-style problems, and explain why certain digit tricks always work.

What's inside

  1. Divisibility tests , quick checks for 2,3,4,5,6,8,9,10,112, 3, 4, 5, 6, 8, 9, 10, 11.
  2. Remainders and modular thinking , clocks, calendars, and check digits.
  3. Digit puzzles , magic squares, palindromes, and cyclic numbers.
  4. Number sequences and patterns , arithmetic, geometric, Fibonacci.
  5. Cryptarithms and challenges , solve letter-for-digit puzzles.

Key results

Divisibility byTest
22last digit is even
33digit sum divisible by 33
44last two digits form a multiple of 44
55last digit is 00 or 55
66divisible by both 22 and 33
88last three digits form a multiple of 88
99digit sum divisible by 99
1010last digit is 00
1111alternating digit sum divisible by 1111

Modular notation. "ab(modm)a \equiv b \pmod{m}" means aa and bb leave the same remainder when divided by mm. For example, 175(mod12)17 \equiv 5 \pmod{12} because both leave remainder 55 when divided by 1212.

How to read this chapter

Keep a pencil and paper. Try every test on a few numbers of your own before reading the next one. The puzzles in the last subtopic are the best part , try them with a friend.

Sub-topics

5 pages

Practice quiz

Answer the questions; explanations appear after each.

Quiz
Chapter 5 : Mixed practice: Number Play
8 questions · pick the best answer
Q1

Which is divisible by 99?

Q2

Today is Monday. What day is it 100100 days later?

Q3

Last digit of 7507^{50}

Q4

Magic sum of a 3×33 \times 3 magic square using 11-99

Q5

1010-th Fibonacci number (starting 1,11,1) is

Q6

Divisibility by 1111 test: alternating digit sum of 1,3,2,11{,}3,2{,}1 is

Q7

Common ratio of geometric sequence 4,12,36,4, 12, 36, \dots

Q8

17\dfrac{1}{7} as a decimal is