Lessons 43–60: reference arithmetic, powers, division, divisibility, and decimal methods in the new Vedic Math course.

Lesson 60 — Turn a Recurring Decimal Back into a Fraction

Technique explanation

Recurring decimals can be converted back to fractions using a subtraction-normalization method. For pure recurring decimals, the denominator consists of as many 9s as there are digits in the period. For mixed recurring decimals, the numerator is the (whole part) minus (non-recurring part), and the denominator uses 9s for recurring digits and 0s for non-recurring decimal digits. The algebraic method remains the standard fallback.

Standard fallback: The algebraic method: let x = 0.3636..., then 100x = 36.3636..., so 99x = 36, giving x = 36/99.

Module
Vedic Math — Reference Arithmetic and Powers
Worked examples

Example 1: Convert 0.36 recurring to a fraction.

1. The recurring part is 36 (2 digits).

2. The denominator is 99 (two 9s).

3. Fraction: 36/99. Simplify by 9: 4/11.

Check: 4 ÷ 11 = 0.3636...

Check: Perform division: 4 ÷ 11 = 0.3636...

Result: 4/11.

Example 2: Convert 0.16 recurring (only 6 repeats) to a fraction.

1. Non-recurring: 1. Recurring: 6.

2. Numerator: 16 - 1 = 15.

3. Denominator: One 9 (for 6) and one 0 (for 1) = 90.

4. Fraction: 15/90. Simplify by 15: 1/6.

Check: 1 ÷ 6 = 0.1666...

Check: Perform division: 1 ÷ 6 = 0.1666...

Result: 1/6.

Academy Course
Vedic Math: Foundations to Reference Applications

Lesson 59 — Auxiliary Fractions for Denominators Ending 1, 3, 7, or 9

Technique explanation

Auxiliary fractions simplify the calculation of recurring decimals by using a 'one more' divisor. For a denominator ending in 9, like 29, we use the auxiliary divisor 3 (from 30). We divide by 3 and prefix the remainder to the next quotient digit. Denominators ending in 1, 3, or 7 are first multiplied to end in 9 (e.g., 1/7 becomes 7/49, using divisor 5). Standard long division remains the fallback.

Standard fallback: Standard long division of the fraction to verify the quotient digits.

Module
Vedic Math — Reference Arithmetic and Powers
Worked examples

Example 1: Find the first few digits of 1/19 using an auxiliary fraction.

1. 19 is near 20. The auxiliary divisor is 2.

2. 1 ÷ 2 = 0 remainder 1. (Digit 0, next is 10).

3. 10 ÷ 2 = 5 remainder 0. (Digit 5, next is 05).

4. 05 ÷ 2 = 2 remainder 1. (Digit 2, next is 12).

5. 12 ÷ 2 = 6 remainder 0. (Digit 6, next is 06).

Check: Multiply the divisor by the approximation: 19 × 0.0526 = 0.9994 (close to 1).

Result: 1/19 ≈ 0.0526...

Example 2: Find the first few digits of 1/13 using an auxiliary fraction.

1. Multiply by 3/3 to get 3/39. 39 is near 40. The auxiliary divisor is 4.

2. 3 ÷ 4 = 0 remainder 3. (Digit 0, next is 30).

3. 30 ÷ 4 = 7 remainder 2. (Digit 7, next is 27).

4. 27 ÷ 4 = 6 remainder 3. (Digit 6, next is 36).

5. 36 ÷ 4 = 9 remainder 0. (Digit 9, next is 09).

Check: Verify the first four digits via standard division: 1 ÷ 13 = 0.0769...

Result: 1/13 ≈ 0.0769...

Academy Course
Vedic Math: Foundations to Reference Applications

Lesson 58 — Recurring Decimals from Remainders

Technique explanation

The recurring decimal digits of a fraction can be generated directly from its remainder cycle. For a divisor ending in 7, multiply each remainder by 7 and take the units digit to find the next decimal digit. The cycle closes when the starting remainder returns. This method requires establishing the remainder cycle first, often via ordinary division, which serves as the standard fallback.

Standard fallback: Conventional long division (1 ÷ d) to generate the decimal digits sequentially.

Module
Vedic Math — Reference Arithmetic and Powers
Worked examples

Example 1: Build 1/7 from its remainder cycle (3, 2, 6, 4, 5, 1).

1. Multiply each remainder by the last digit 7 and take the units digit.

2. 3 × 7 = 21 (1); 2 × 7 = 14 (4); 6 × 7 = 42 (2); 4 × 7 = 28 (8); 5 × 7 = 35 (5); 1 × 7 = 07 (7).

3. Check: The resulting sequence is 142857. 0.142857 × 7 = 0.999999.

Check: Multiply the result by the divisor: 0.142857 × 7 = 0.999999, which represents the recurring fraction 1/7.

Result: 1/7 = 0.142857 recurring.

Example 2: Build the first four digits of 1/17 from remainders (10, 15, 14, 4).

1. The last digit of the divisor 17 is 7.

2. Multiply remainders by 7: 10 × 7 = 70 (0); 15 × 7 = 105 (5); 14 × 7 = 98 (8); 4 × 7 = 28 (8).

3. Check: The digits generated are 0, 5, 8, 8.

Check: Perform standard division for the first four places: 1 ÷ 17 = 0.0588...

Result: The first four digits of 1/17 are 0.0588...

Academy Course
Vedic Math: Foundations to Reference Applications

Lesson 57 — Block Osculators and Composite Divisors

Technique explanation

For larger divisors near powers of ten, we use block osculation by chopping groups of digits. If a divisor d = 10^n * k ± 1, the n-digit osculator is k. For composite divisors, factor them into coprime parts (GCD = 1) and test each part independently. For example, to test 28, test 4 and 7. Standard divisibility rules for simple factors serve as the fallback.

Standard fallback: Direct long division by the large divisor or testing each coprime factor using standard rules.

Module
Vedic Math — Reference Arithmetic and Powers
Worked examples

Example 1: Is 8,358 divisible by 199?

1. 199 is 200 - 1. The two-digit positive osculator is 2.

2. Chop two digits: 83 | 58. Apply P=2: 83 + 58(2) = 83 + 116 = 199.

3. Check: 199 is divisible by 199.

Check: Verify by multiplication: 199 × 42 = 8,358.

Result: 8,358 is divisible by 199.

Example 2: Is 1,512 divisible by 28?

1. Factor 28 into coprime parts: 4 and 7.

2. Test 4: The last two digits (12) are divisible by 4. (4 × 3 = 12).

3. Test 7: Use Q=2. 151 - 2(2) = 147. 14 - 7(2) = 0. Zero is divisible by 7.

Check: Verify by multiplication: 28 × 54 = 1,512.

Result: 1,512 is divisible by 28.

Academy Course
Vedic Math: Foundations to Reference Applications

Lesson 56 — Osculation: Divisibility by 17, 19, 29, and 31

Technique explanation

Osculation (Vestanam) is a recursive method to test divisibility by reducing the size of a number. For a divisor d, we split a number N into 10a + b. A positive osculator P satisfies 10P - 1 as a multiple of d, checking a + Pb. A negative osculator Q satisfies 10Q + 1 as a multiple of d, checking a - Qb. This is most effective for divisors like 19 (P=2), 29 (P=3), and 31 (Q=3). Trial division remains the fallback for other cases.

Standard fallback: Trial division or standard long division by the specific prime divisor.

Module
Vedic Math — Reference Arithmetic and Powers
Worked examples

Example 1: Is 247 divisible by 19?

1. The positive osculator for 19 is P = (19+1)/10 = 2.

2. Split 247 into 24 and 7. Apply P=2: 24 + 7(2) = 24 + 14 = 38.

3. Repeat for 38: Split into 3 and 8. 3 + 8(2) = 3 + 16 = 19.

4. Check: 19 is divisible by 19.

Check: Verify by multiplication: 19 × 13 = 247.

Result: 247 is divisible by 19.

Example 2: Is 8118 divisible by 31?

1. The negative osculator for 31 is Q = (31-1)/10 = 3.

2. Split 8118 into 811 and 8. Apply Q=3: 811 - 8(3) = 811 - 24 = 787.

3. Repeat for 787: Split into 78 and 7. 78 - 7(3) = 78 - 21 = 57.

4. Check: 31 × 1 = 31, 31 × 2 = 62. 57 is not a multiple of 31.

Check: Standard division: 8118 ÷ 31 = 261 remainder 27.

Result: 8118 is not divisible by 31.

Academy Course
Vedic Math: Foundations to Reference Applications

Lesson 55 — The 1001 Test for 7, 11, and 13

Technique explanation

The number 1001 is the product of 7, 11, and 13. In modular arithmetic, 1000 is congruent to -1 modulo 1001. This allows us to test for divisibility by 7, 11, or 13 by splitting a number into three-digit groups and calculating their alternating sum. If the result is divisible by the target factor, the original number is as well. This method is most effective for large numbers with six or more digits. For smaller numbers, standard tests or division remain the fallback.

Standard fallback: Long division by 7, 11, or 13, or the individual standard divisibility rules for each prime factor.

Module
Vedic Math — Reference Arithmetic and Powers
Worked examples

Example 1: Is 1,095,465 divisible by 7?

1. Split into three-digit groups from the right: 1 | 095 | 465.

2. Calculate the alternating sum: 465 - 095 + 1.

3. 465 - 95 = 370; 370 + 1 = 371.

4. Check 371 for 7: 371 = 7 × 53. Check: 7 × 50 = 350, 7 × 3 = 21, 350 + 21 = 371.

Check: Standard division: 1,095,465 ÷ 7 = 156,495 exactly, confirming divisibility.

Result: 1,095,465 is divisible by 7.

Example 2: Is 2,876,544 divisible by 13?

1. Split into three-digit groups: 2 | 876 | 544.

2. Calculate the alternating sum: 544 - 876 + 2.

3. 544 - 876 = -332; -332 + 2 = -330.

4. Check 330 for 13: 330 = 13 × 25 + 5. Check: 13 × 20 = 260, 13 × 5 = 65, 260 + 65 = 325. Remainder is 5.

Check: Standard division: 2,876,544 ÷ 13 = 221,272 remainder 8. Since the remainder is not zero, it is not divisible.

Result: 2,876,544 is not divisible by 13.

Academy Course
Vedic Math: Foundations to Reference Applications

Lesson 54 — Straight Division with a Flag Digit

Technique explanation

Flag division (Dhwajanka) splits the divisor into a 'main divisor' (first digit) and a 'flag' (remaining digits). Divide by the main divisor, then adjust the next dividend by subtracting (Flag * Latest Quotient Digit). If the result is negative, 'back off' by reducing the previous quotient digit.

This is a general method for any divisor. Standard fallback: Conventional long division.

Module
Vedic Math — Reference Arithmetic and Powers
Worked examples

Example 1: 38982 divided by 73

  • Divisor: 7 (main), 3 (flag).
  • Step 1: 38 / 7 = 5, rem 3. Adjusted: 39 - (53) = 24.
  • Step 2: 24 / 7 = 3, rem 3. Adjusted: 38 - (33) = 29.
  • Step 3: 29 / 7 = 4, rem 1. Adjusted: 12 - (43) = 0.
  • Result: 534.
  • Check: 534 × 73 = 38,982.

Example 2: 1234 divided by 32

  • Divisor: 3 (main), 2 (flag).
  • Step 1: 12 / 3 = 4, rem 0. Adjusted: 03 - (42) = -5 (Negative! Back off).
  • Back off: 12 / 3 = 3, rem 3. Adjusted: 33 - (32) = 27.
  • Step 2: 27 / 3 = 9, rem 0. Adjusted: 04 - (92) = -14 (Negative! Back off).
  • Back off: 27 / 3 = 8, rem 3. Adjusted: 34 - (8*2) = 18.
  • Result: Quotient 38, Remainder 18.
  • Check: (38 × 32) + 18 = 1216 + 18 = 1234.
Academy Course
Vedic Math: Foundations to Reference Applications

Lesson 53 — Divide by a Divisor Just Above a Base

Technique explanation

To divide by 1 + d (where d is small), use the Paravartya Yojayet (Transpose and Adjust) method with -d as the multiplier. Separate the remainder digits equal to the number of digits in d. Bring down the first quotient digit, multiply by the transposed digits, and add to subsequent columns.

This method is best for divisors where digits after the leading '1' are small. Standard fallback: Conventional long division.

Module
Vedic Math — Reference Arithmetic and Powers
Worked examples

Example 1: 1225 divided by 12

  • Divisor: 12. Transposed digit: -2.
  • Setup: 1 | 2 | 2 || 5. (One digit for remainder).
  • Step 1: Bring down 1. 1 (-2) = -2. 2 + (-2) = 0.
  • Step 2: Bring down 0. 0 (-2) = 0. 2 + 0 = 2.
  • Step 3: Bring down 2. 2 (-2) = -4. 5 + (-4) = 1.
  • Result: Quotient 102, Remainder 1.
  • Check: (102 × 12) + 1 = 1224 + 1 = 1225.

Example 2: 13456 divided by 113

  • Divisor: 113. Transposed digits: -1, -3.
  • Setup: 1 | 3 | 4 || 5 | 6. (Two digits for remainder).
  • Step 1: Bring down 1. 1 (-1, -3) = -1, -3. Col 2: 3-1=2. Col 3: 4-3=1.
  • Step 2: Bring down 2. 2 (-1, -3) = -2, -6. Col 3: 1-2=-1. Col 4: 5-6=-1.
  • Step 3: Bring down -1. -1 (-1, -3) = 1, 3. Col 4: -1+1=0. Col 5: 6+3=9.
  • Normalize: 1, 2, -1 -> 119. Remainder 0, 9 -> 9.
  • Result: Quotient 119, Remainder 9.
  • Check: (119 × 113) + 9 = 13447 + 9 = 13456.
Academy Course
Vedic Math: Foundations to Reference Applications

Lesson 52 — Cube Roots of Exact Three-Digit Cubes

Technique explanation

For a perfect cube, group digits in threes from the right. The last digit of the cube uniquely determines the last digit of the root. The leftmost group determines the first digit. For a three-digit root, use magnitude to bound the middle digit and verify with digit sums.

This method is only for perfect cubes. Standard fallback: Prime factorization or iterative estimation for non-perfect cubes.

Module
Vedic Math — Reference Arithmetic and Powers
Worked examples

Example 1: Cube root of 1860867

  • Group: 1 | 860 | 867. Three-digit root.
  • Last Digit: Cube ends in 7, so root ends in 3.
  • First Digit: Left group is 1. 1^3 = 1, so first digit is 1.
  • Middle Digit: Between 120^3 (1.72M) and 130^3 (2.19M), so middle digit is 2.
  • Result: 123.
  • Check: 123 × 123 × 123 = 1,860,867.

Example 2: Cube root of 13312053

  • Group: 13 | 312 | 053. Three-digit root.
  • Last Digit: Cube ends in 3, so root ends in 7.
  • First Digit: Left group is 13. 2^3=8, so first digit is 2.
  • Middle Digit: Between 230^3 (12.1M) and 240^3 (13.8M), so middle digit is 3.
  • Result: 237.
  • Check: 237 × 237 × 237 = 13,312,053.
Academy Course
Vedic Math: Foundations to Reference Applications

Lesson 51 — Cube Any Two-Digit Number by Place Value

Technique explanation

For a two-digit number ab (where a is tens and b is units), the cube is calculated using a geometric progression with ratio b/a: a^3 | a^2b | ab^2 | b^3. Write these four terms, double the two middle terms, add them, and resolve carries from right to left.

This method is limited to two-digit numbers for mental ease but can be extended. Standard fallback: Conventional long multiplication or the binomial expansion (10a + b)³.

Module
Vedic Math — Reference Arithmetic and Powers
Worked examples

Example 1: 23 cubed

  • Identify: a=2, b=3. Ratio b/a = 1.5.
  • GP Row: 8, 12, 18, 27.
  • Double Middle: 24, 36.
  • Sum: 8 | 36 | 54 | 27.
  • Carries: 27 -> 7 (carry 2); 54+2=56 -> 6 (carry 5); 36+5=41 -> 1 (carry 4); 8+4=12.
  • Result: 12167.
  • Check: 23 × 23 × 23 = 12,167.

Example 2: 34 cubed

  • Identify: a=3, b=4. Ratio 4/3.
  • GP Row: 27, 36, 48, 64.
  • Double Middle: 72, 96.
  • Sum: 27 | 108 | 144 | 64.
  • Carries: 64 -> 4 (carry 6); 144+6=150 -> 0 (carry 15); 108+15=123 -> 3 (carry 12); 27+12=39.
  • Result: 39304.
  • Check: 34 × 34 × 34 = 39,304.
Academy Course
Vedic Math: Foundations to Reference Applications
Vedic Math — Reference Arithmetic and Powers