"Part and whole."
43×11 → split digits 4,3 → sum 7 → place between: 473
Breaking complex problems into simpler parts. Especially powerful for multiplying by 11.
Decompose a problem into manageable sub-problems, solve each, then combine results. The "×11 trick" is the most famous application.
This sutra teaches the art of decomposition — breaking a calculation into parts that are easier to handle. The most famous application is multiplication by 11: for any 2-digit number ab, the answer is a_(a+b)_b — place the sum of the digits between them. For 72 × 11: 7_(7+2)_2 = 792. When the sum exceeds 9, carry: 86 × 11 → 8_(14)_6 = 946 (carry the 1). For 3-digit numbers like 234 × 11: work left to right: 2_(2+3)_(3+4)_4 = 2574. The general principle extends beyond ×11 — any large calculation can be split into manageable parts, solved independently, then recombined.
The part-and-whole principle is fundamental to Indian philosophical thought — the concept of "Vyashti" (individual/part) and "Samanashti" (collective/whole) appears in Vedantic philosophy. Mathematically, the ×11 trick was known to Indian mathematicians for centuries and was documented in the Lilavati of Bhaskara II (1150 CE). The technique of breaking problems into parts is also the foundation of the "Indian method" of long multiplication that was transmitted to Europe via Arabic translations. The modern concept of "divide and conquer" in computer science is a direct descendant of this ancient principle.
Multiplying by 11 using this method is based on: n × 11 = n × (10 + 1) = 10n + n. When you shift n left by one position and add n to itself, the overlapping digits produce the "sum of adjacent digits" pattern. This is a convolution of the digit sequence with [1,1]. In computer science, this principle becomes the divide-and-conquer paradigm — merge sort, quicksort, and the FFT all use this approach. In systems engineering, modular design (breaking a system into independent subsystems) is the engineering equivalent of this sutra.