🌟 Chapter at a Glance

This chapter is different from a routine calculation chapter. Here, numbers behave like clues. A sequence can tell us something about an arrangement; odd and even numbers can prove that a puzzle is impossible; a grid can reveal hidden structure; and letters can hide digits in a mathematical code.

1. 🔎 Numbers Can Tell Us Things

Imagine several children standing in a line. Instead of giving their heights, each child announces a number based on the people standing around them. The surprising idea is that the sequence of numbers can contain information about the arrangement even when the actual heights are unknown.

This is an important mathematical habit: look for the rule behind the data. A sequence is not merely a list of numbers; its pattern may describe a process or arrangement.

2. ⚫ Picking Parity — Odd and Even Numbers

Parity means whether a number is even or odd. An even number can be completely divided into pairs; an odd number leaves one item without a partner.

The power of parity is that we can often decide an answer without calculating the actual numbers.

🧠 Why does this work?

Write an even number as 2a and another even number as 2b. Their sum is 2a + 2b = 2(a+b), which is still even. For two odd numbers, write them as 2a+1 and 2b+1. Their sum is 2(a+b+1), also even. This turns a pattern into a mathematical explanation.

3. 🧩 Parity as a Puzzle-Solving Tool

Suppose five number cards must add to 30. Instead of trying every possible selection, first inspect parity. If all five available choices were odd, their sum would be odd because an odd number of odd numbers has an odd sum. Therefore five odd cards could never make 30, which is even.

This is the key lesson: a property such as parity can prove that a solution is impossible before we search for it.

4. 🟦 Exploring Grids

Parity can also be applied to rows and columns. If a row contains an odd number of odd entries, its sum is odd. If it contains an even number of odd entries, its sum is even. Even entries do not change the parity of the total.

This gives us a fast way to test whether a proposed grid can possibly satisfy its row and column conditions.

5. ✨ Magic Squares

A magic square is a square grid in which every row, every column and the two main diagonals have the same sum, called the magic sum.

For the familiar 3 × 3 magic square using the numbers 1 to 9 once each, the total of all numbers is 45. Since the three rows have equal sums, each row must total 45 ÷ 3 = 15. Thus the magic sum is 15.

The chapter also connects magic squares with historical mathematical traditions, including the Chautīśā Yantra. This shows that recreational mathematics has a long history in India.

6. 🔢 Generalising a Magic Square

Once a particular magic square is understood, we can ask a deeper question: what happens if every entry is changed in the same way? For example, adding the same number to each cell increases every row, column and diagonal by the same total amount. Multiplying every entry by the same number multiplies the magic sum by that number.

This is an example of generalisation: instead of solving one puzzle, we discover a rule that works for an entire family of puzzles.

7. 🌼 Virahāṅka–Fibonacci Numbers

The chapter introduces the sequence associated with the Indian mathematician Virahāṅka. Starting with 1 and 2, each new term is obtained by adding the previous two terms:

1, 2, 3, 5, 8, 13, 21, 34, 55, …

So if two consecutive terms are 987 and 1597, the next term is 987 + 1597 = 2584, followed by 1597 + 2584 = 4181.

🌱 A sequence can describe a process

The sequence is also connected with counting ways of making arrangements using steps of size 1 and 2. If a staircase has n steps and you can climb either one or two steps at a time, the number of possible ways follows the same recursive pattern. This is a beautiful example of one mathematical idea appearing in two different-looking problems.

8. 🔐 Digits in Disguise — Cryptarithms

A cryptarithm replaces digits with letters. Each letter stands for one digit, and the same letter must represent the same digit every time.

Consider the small puzzle:

T + T + T = UT

Here UT is a two-digit number. Since 3T must end in T, test the units digit. T = 5 works because 5 + 5 + 5 = 15. Therefore T = 5 and U = 1.

The important skill is not guessing. Look at place value, the units digit, possible carries and restrictions on repeated letters. Eliminate impossible possibilities systematically.

🧠 Worked Examples

Example 1 — Parity

Is the sum of 27 odd numbers always odd? Yes. The sum of two odd numbers is even; adding another odd makes it odd. Continuing this pattern, an odd number of odd terms has an odd sum.

Example 2 — Expression parity

What can we say about 4m − 1? Since 4m is even for every integer m, even − odd = odd. Therefore 4m − 1 is always odd.

Example 3 — Fibonacci-type sequence

If consecutive terms are 34 and 55, the next two are 89 and 144.

Example 4 — Staircase

For an 8-step staircase where one may climb 1 or 2 steps at a time, let W(n) be the number of ways. Every route ends with either a 1-step move from n−1 or a 2-step move from n−2, so W(n)=W(n−1)+W(n−2). This creates the same recursive structure as the Virahāṅka sequence.

🎯 Concept Check

1. Why is parity more useful than direct calculation in some puzzles?
2. Explain why the sum of two odd numbers is even.
3. Why does a 3 × 3 magic square using 1–9 have magic sum 15?
4. What rule generates the Virahāṅka sequence?
5. What makes a cryptarithm different from an ordinary arithmetic question?

🧩 Interactive MCQs

1. Which expression always represents an even number? A. 2n B. 2n+1 C. 2n−1 D. n+1
2. The sum of an odd number of odd numbers is: A. always odd B. always even C. always zero D. impossible to determine
3. The magic sum of the standard 3 × 3 square using 1–9 is: A. 12 B. 15 C. 18 D. 45
4. The next term after 21, 34 is: A. 42 B. 55 C. 56 D. 68
5. In a cryptarithm, the same letter must represent: A. different digits each time B. the same digit each time C. only even digits D. zero
6. If an even number is multiplied by an odd number, the result is: A. odd B. even C. always prime D. zero

Answers: 1-A, 2-A, 3-B, 4-B, 5-B, 6-B

📌 Case-Based Learning

Case: The Staircase Challenge

A student can climb a staircase by taking either 1 step or 2 steps at a time. For a 1-step staircase there is 1 way; for 2 steps there are 2 ways: 1+1 or 2.

1. How many ways are there for 3 steps?
2. Explain why the number of ways for n steps depends on the previous two cases.
3. Find the number of ways for 5 steps.
4. Which familiar number sequence does this remind you of?

🔥 HOTS / Competition Corner

1. Can five odd numbers ever have an even sum? Prove your answer without choosing specific numbers.
2. A number is written as 2n+3. Is it always odd? Explain.
3. Two consecutive Virahāṅka terms are 987 and 1597. Find the next two and the previous two.
4. Can a 3 × 3 grid filled with nine consecutive integers have a magic sum of 20? Investigate and justify.
5. Design a cryptarithm with at least two letters and provide a unique solution.

📝 Chapter Worksheet

🏆 Mastery Checklist

• ☐ I can explain what parity means.
• ☐ I can determine the parity of sums, differences and products without unnecessary calculation.
• ☐ I can use parity to show that a puzzle is impossible.
• ☐ I understand the structure of a magic square.
• ☐ I can generate and extend the Virahāṅka sequence.
• ☐ I can connect staircase problems with the same recursive pattern.
• ☐ I can solve a simple cryptarithm logically.
• ☐ I can explain my reasoning, not just give the answer.

🔁 One-Minute Revision

Parity: even = 2n; odd = 2n+1. Odd + odd = even. Odd × odd = odd. Magic squares have equal row, column and diagonal sums. The Virahāṅka sequence begins 1, 2, 3, 5, 8, 13… with each term formed from the previous two. Cryptarithms replace digits with letters and are solved through place value, parity, carries and logical elimination.

🏠 Class 7 Maths Main Page   |   ← Chapter 5   |   Chapter 7 →