The Sequence India Found First Number Play

Splitting Kishor's puzzle -- fill five boxes so their total is 30 -- always comes back to a single question underneath: does a chosen set of numbers land on an even total or an odd one? Pairing up objects visually settles this without any calculation at all: an even number of objects can always be split into pairs with nothing left over, while an odd number always leaves exactly one object unpaired. This picture proves, on sight, that two even numbers always sum to an even number, two odd numbers always sum to an even number too (since each leftover single object pairs up with the other), and an even number plus an odd number always sums to an odd number.

Martin and Maria are siblings whose ages are consecutive whole numbers summing to 112 -- an impossible puzzle, since one sibling's age must be even and the other odd (consecutive numbers always alternate parity), making their sum always odd, never 112. The same reasoning extends to algebraic expressions: plugging whole numbers into 3n+4 and checking parity for n=3, n=8, and n=10 reveals the expression's own parity depends entirely on n's parity, not on the specific value of n itself -- a pattern worth testing rather than assuming.

A magic square arranges numbers in a grid so every row, every column, and both diagonals sum to the exact same total. Using the numbers 1 through 9 exactly once, that magic sum is always forced to be 15, the centre cell is always forced to be 5, and the corners can never be 1 or 9 -- all three facts provable through careful reasoning about which cells appear in the most overlapping rows, columns, and diagonals at once, rather than needing to be taken purely on faith. The legendary Lo Shu Square, said to have appeared on a turtle's shell from the Lo River in ancient China, is one of the oldest known magic squares; centuries later, the Chautisa Yantra at the Parshvanath Jain temple in Khajuraho (10th century) is among the earliest known 4x4 magic squares, its own magic sum reaching 34.

Long before Fibonacci, Sanskrit poets analysed metre using short (1-beat) and long (2-beat) syllables, and counting exactly how many different rhythmic patterns can fill a line of a given total beat-length produces the sequence 1, 1, 2, 3, 5, 8, 13, 21, 34..., each number the sum of the two before it. Piṅgala first hinted at this counting problem around 300 BCE; Virahanka worked it out explicitly around 700 CE; Gopala (around 1135 CE) and Hemachandra (around 1150 CE) refined it further -- all roughly 500 years before Fibonacci wrote about the same numbers in Europe in 1202 CE, where they became linked to a famous rabbit-breeding puzzle instead of poetic rhythm. The same sequence resurfaces in nature, in the petal counts of many flowers -- 13, 21, and 34 petals appear again and again across different species.

A cryptarithm replaces a normal arithmetic sum's digits with letters, and the puzzle is to find which digit each letter secretly represents so the whole sum works out consistently. Solving T+T+T=UT: since three copies of a single digit T are being added, and the result is a 2-digit number UT ending in that same digit T, testing T=5 gives 5+5+5=15, matching perfectly (U=1, and the units digit of 15 is indeed 5 again) -- confirming T=5, U=1.