The67Sprint — LearningMap: Number Play

🔢 Positional Logic & Parity

Any person standing at the very front of a line calls out "0" — the count of people ahead of them, which is zero regardless of their own height
Parity means whether a number is Even (splits into perfect pairs) or Odd (leaves one unpaired)
Odd + Odd = Even, but an odd count of odd numbers (like 5) always sums to Odd
Multiplication: the product is Odd only if both numbers are Odd; any Even factor makes the product Even

➗ Parity as Algebra

The nth Even number is always 2n; the nth Odd number is always 2n − 1
Expressions like 3n + 4 change parity depending on n — test both an odd and even n before answering
Expressions like 100p or 48w − 2 are always Even, because their coefficient (100, 48) is Even regardless of the variable

🔲 Magic Squares

A 3×3 grid where every row, column, and both diagonals add to the same "Magic Sum"
For digits 1–9, the Magic Sum is exactly 15, and 5 must always sit at the centre
1 and 9 can never sit in a corner — they must occupy the middle-edge positions
Generalised: if the centre is m, the Magic Sum is always 3m
Add a constant k to every cell → Magic Sum increases by 3k. Multiply every cell by k → Magic Sum multiplies by k

🎼 Virahāṅka–Fibonacci Sequence

1, 2, 3, 5, 8, 13, 21, 34... — each number is the sum of the two before it
Discovered by Indian scholar Virahāṅka (c. 700 CE) while counting rhythms made of 1-beat (Laghu) and 2-beat (Guru) syllables in poetry
Its parity repeats every 3 terms: Odd, Even, Odd

🔐 Digits in Disguise

Cryptarithms replace digits (0–9) with letters — the same letter always hides the same digit; different letters hide different digits
The leading digit of any multi-digit number can never be zero

Memory Cheat Code

Find the centre first in any magic square — it's always Magic Sum ÷ 3. That one number anchors the whole grid.

Quick Recall — Sprint Facts

nth Even / Odd 2n and 2n − 1

1–9 Magic Square Sum = 15, Centre = 5

Magic Sum Formula Centre m → Sum = 3m

Virahāṅka Parity Cycle Repeats every 3: Odd, Even, Odd

First 4×4 Magic Square Chautīsā Yantra, Khajuraho — sums to 34

Add/Multiply Rule +k → Sum +3k · ×k → Sum ×k

🔑 Key Terms

Parity

Whether an integer is Even (perfect pairs) or Odd (one left over)

Magic Sum

The constant total in every row, column, and diagonal of a magic square

Virahāṅka Numbers

A sequence where each term is the sum of the two before it, from Sanskrit prosody

Cryptarithm

A puzzle where letters stand for unique digits 0–9 in an equation

Generalised Form

Using a variable like m to express a rule that holds for every case, not just one

Carry-Over

The extra digit passed to the next column when a column's sum reaches 10 or more

🏆 Olympiad & Challenger Edge

Modular Cryptarithms

Solve KP + KP = PRR using boundary logic: two 2-digit numbers can sum to at most 198, so P must be 1 — this reduces the puzzle before you even test digits.

Magic Square Transformations

Applying y = αx + β to every cell of a magic square keeps it magic — the new Magic Sum becomes S′ = αS + 3β.

Staircase Combinatorics

Climbing a staircase 1 or 2 steps at a time, the number of distinct ways to reach step n is exactly the nth Virahāṅka number — reaching step 8 has exactly 34 ways.

Rhythm Counting (Prosody)

Virahāṅka's original question — how many rhythms of total n beats can be built from 1-beat and 2-beat syllables — is a direct real-world combinatorics problem, not just abstract number theory.

❌ 5 odds summing to 30?

Impossible. An odd count of odd numbers always sums to Odd — never write a brute-force combination for this.

❌ Any number at the centre?

No. For a 1–9 magic square the centre is always 5; for a generalised square, centre = Magic Sum ÷ 3.

❌ Forgot to define n?

State what n represents (e.g. "where n is an integer") when writing 2n or 2n − 1 — examiners deduct marks otherwise.

❌ "False" with no reason?

A bare "False" for a parity claim loses marks — always give a counter-example, like substituting n = 2.

❌ Guessing cryptarithm digits?

Don't test digits randomly. Use boundary logic first — e.g. two 2-digit numbers can sum to at most 198, so a 3-digit answer's hundreds digit is locked to 1.

💡 The Light Switch Trick

Toggle a switch 77 times — an odd number of toggles always flips it to the opposite state, no need to count each press.

🌼 Petals & Pinecones

Daisy petal counts (13, 21, 34) and pinecone spirals follow the same Virahāṅka numbers found in this chapter.

🎮 Sudoku & Game Grids

Magic square balancing logic — anchoring a grid around its centre value — is the same logic behind Sudoku and game-map design.

🔒 Passwords & Puzzles

Solving cryptarithms trains constraint-satisfaction thinking — the same reasoning computer scientists use to crack codes and write software.

🚨 1 or 9 in a corner?

Never — placing 1 or 9 in a corner cell makes it impossible to reach the Magic Sum of 15.

🚨 Ignoring the carry-over

In cryptarithms like UT + TA = TAT, a hidden carry from the units column changes the tens-column equation — always track it algebraically.

🚨 Letters can equal zero

A letter can hide the digit 0, unless it's the leading digit of a multi-digit number — don't skip testing 0.

🚨 3n + 4 is "always odd"?

Wrong assumption. Its parity depends entirely on n — test both an odd and even value before concluding.

🚨 Same letter, different digit?

Never. In a cryptarithm, one letter always holds exactly one digit everywhere it appears — mixing this up invalidates the whole solution.

Logic Chain — How Parity Rules Out Impossible Sums

Step 1

Identifying the target sum's required parity connects directly to counting how many odd numbers are available in the set.

Step 2

Counting the odd numbers being combined leads to checking whether that count itself is odd or even.

Step 3

An odd count of odd numbers always produces an odd sum, which connects to comparing that result against the target's required parity.

Step 4

A mismatch between the two parities leads straight to declaring the combination mathematically impossible — no brute-force needed.

🦉

Mentor Byte

Numbers rarely need brute force — they need a key. Parity tells you instantly what's impossible before you calculate a single sum. In a magic square, find the centre first; it is always the Magic Sum divided by three, and it anchors everything else around it.

💛 Parent Tip

Ask your child to toggle a light switch 7 times with eyes closed, then predict ON or OFF before checking — this turns the abstract idea of parity into something they can feel and verify themselves.