SutraFlow
Back to Ekadhikena Pūrveṇa

एकाधिकेन पूर्वेण

Why it works: Ekadhikena Pūrveṇa

For numbers ending in 5: n=1n = 10a+50a + 5. Then n2=(10a+5)n^2 = (10a+5)² =10= 100a2+100a^2+100a+25=100a+25 = 100a(a+1a+1)+25. The last two digits are always 25; the left part is a×(a+1)a\times (a+1) — prefix times one-more-than-prefix. For recurring decimals of 1/(10n+9)1/(10n+9): the multiplier is (n+1n+1), and repeatedly multiplying from the right generates the full repeating cycle.

Example Problems

25225^2=625= 625
35235^2=1225= 1225
65265^2=4225= 4225
85285^2=7225= 7225
1252125^2=15625= 15625
9952995^2=990025= 990025