Introduction to Vedic Mathematics
Dr. Goutam Mukherjee
98300 23972
goutam.kv2@gmail.com
Origin of Counting and Mathematics
Cardinal and Ordinal Numbers
Positional Number system of India
Use of Zero as part of Calculation
Concept of Base in a Place Value System
Concept of Place Value and Face Value
Numerical Symbols of World with Codes
Numeric Symbols used in India
| First Three Digits | Fourth Digit of Hex-Code | |||||||||
Language | of Hex-Code | 6 | 7 | 8 | 9 | A | B | C | D | E | F |
Hindi | 096 | ० | १ | २ | ३ | ४ | ५ | ६ | ७ | ८ | ९ |
Bengali | 09E | ০ | ১ | ২ | ৩ | ৪ | ৫ | ৬ | ৭ | ৮ | ৯ |
Punjabi | 0A6 | ੦ | ੧ | ੨ | ੩ | ੪ | ੫ | ੬ | ੭ | ੮ | ੯ |
Gujarati | 0AE | ૦ | ૧ | ૨ | ૩ | ૪ | ૫ | ૬ | ૭ | ૮ | ૯ |
Odia | 0B6 | ୦ | ୧ | ୨ | ୩ | ୪ | ୫ | ୬ | ୭ | ୮ | ୯ |
Tamil | 0BE | 0 | ௧ | ௨ | ௩ | ௪ | ௫ | ௬ | ௭ | ௮ | ௯ |
Telugu | 0C6 | ౦ | ౧ | ౨ | ౩ | ౪ | ౫ | ౬ | ౭ | ౮ | ౯ |
Kannada | 0CE | ೦ | ೧ | ೨ | ೩ | ೪ | ೫ | ೬ | ೭ | ೮ | ೯ |
Malayalam | 0D6 | ൦ | ൧ | ൨ | ൩ | ൪ | ൫ | ൬ | ൭ | ൮ | ൯ |
English | | 0 | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 |
Numeric Symbols used in other Countries
| Hex- Code of 0 | | | | | | | | | | | Hex Code �of 9 |
English | 0030 | 0 | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 0039 |
Arabic | 0660 | ٠ | ١ | ٢ | ٣ | ٤ | ٥ | ٦ | ٧ | ٨ | ٩ | 0669 |
Thai | 0E50 | ๐ | ๑ | ๒ | ๓ | ๔ | ๕ | ๖ | ๗ | ๘ | ๙ | 0E59 |
Lao | 0ED0 | ໐ | ໑ | ໒ | ໓ | ໔ | ໕ | ໖ | ໗ | ໘ | ໙ | 0ED9 |
Tibetan | 0F20 | ༠ | ༡ | ༢ | ༣ | ༤ | ༥ | ༦ | ༧ | ༨ | ༩ | 0F29 |
Myanmar | 1040 | ၀ | ၁ | ၂ | ၃ | ၄ | ၅ | ၆ | ၇ | ၈ | ၉ | 1049 |
Ethiopic | 1369 (1) | ፨ | ፩ | ፪ | ፫ | ፬ | ፭ | ፮ | ፯ | ፰ | ፱ | 1371 |
Khmer | 17E0 | ០ | ១ | ២ | ៣ | ៤ | ៥ | ៦ | ៧ | ៨ | ៩ | 17E9 |
Mongolian | 1810 | ᠐ | ᠑ | ᠒ | ᠓ | ᠔ | ᠕ | ᠖ | ᠗ | ᠘ | ᠙ | 1819 |
What is Vedic Mathematics
Vedic Mathematics by Bharati Krshnaji Tirthaji
The Vedic Sutras – Meaning in English
Vedic Sutras – Meaning (contd.)
Vedic Sutras – Meaning (contd.)
Vedic Sutras – Meaning (contd.)
Important Sub-sutras with Meaning
Sub-sutras – some Meaning (contd.)
Scope of Vedic Mathematics
Arithmetical Computation
Concept of Vinculum:
A number with a Bar above a number is called Vinculum notation in Vedic Mathematics. They denote Negative Face Value of numbers.
(Because of Technical Difficulty in writing a Bar above a number by using Character U+305, in this Presentation we shall write it with a graphic line instead. So, 2̅ = -2.)
General Number Conversion with Vinculum number and vice versa:
6 = 10 – 4, so in Vinculum notation 6 can be written as 14
97 = 100 – 3, thus it is 103 1431̅4̅3 = 142857
289 = 300 – 11, so it is 311 etc. 313244 = 286756
The sutras ‘Nikhilam Navatascharamam Dasatah’ (All from nine, last from ten) and ‘Ekanyunena purvena’ (One less than the previous)are useful for this conversion.
Vinculum : Application and Purpose
Addition using Nikhilam Sutra & Vinculum
Numbers to Add Vinculums Explanation
39678 🡪 40322 40000 - 0322
27689 🡪 32311 30000 - 2311
18567 🡪 21433 20000 - 1433
47598 🡪 52402 50000 - 2402
------- ---------------- --------------------
13 3532 🡨 146468 140000 – 6468 = 133532
Addition using Nikhilam Sutra & Vinculum
Numbers to Add Vinculums Explanation
39274 🡪 4 1 3 3 4 40304 – 0301 = 4 0 0 0 3
53749 🡪 5 4 3 5 1 54050 – 1030 = 5 3 0 2 0
28362 🡪 3 2 4 4 2 30402 – 0204 = 3 0 2 0 2
43826 🡪 4 4 2 3 4 44030 – 2040 = 4 2 0 1 0
--------- ---------------- -----------------------------------
165211 🡨 16 5 2 1 1 16 5 5 1 1
Squaring Numbers ending with 5
Therefore Ekadhikena Purvena is applied.
Examples: 152 = 1x2 25 = 225 252 = 2 x 3 25 = 625
352 = 3x4 25 = 1225 452 = 4x5 25 =2025 552 = 5x6 25 = 3025
1252 = 12x13 25 = 15625 3052 = 30x31 25 = 93025
12252 = 122 x 123 25 = 1500 625 30252 = 302x303 25 = 9150 625
Multiplication near a Base (below)-1
97 -03 : Here, 97 is 3 short of Base, we write 03, maintaining the number of digits.
x 93 -07 : 93 is 7 short of Base.
‾‾‾‾‾‾‾‾‾
90 21 : Here, 90 is obtained by 97-7 or 93-3, i.e. Cross subtraction. 21 is (-7)x(-3)
Thus, 97 x 93 = 9021.
Multiplication near a Base (below)-2
Base 1000 Base 10000 Base 10000
997 -003 9997 -0003 9876 -0124
993 -007 9993 -0007 9987 -0013
‾‾‾‾‾‾‾‾ ‾‾‾‾‾‾‾‾‾‾ ‾‾‾‾‾‾‾‾‾‾
990 021 9990 0021 9863 1612
Thus it is seen that, increasing more 9’s in both multiplicands results in addition of same no. of 9-s in the first part and same no. of 0-s in the second part.
(N – a) (N – b) = N (N – a – b) + ab
Here, Cross subtraction is (N – a – b) and ab is the Multiplication in second part.
Multiplication near a Base (above)-1
103 +03 : as 103 is 3 more than the base, 03 maintains no. of digts
107 +07 : 107 is 7 more than base
‾‾‾‾‾‾‾
110 21 : Here 110 = 103 +07 or 107 +03 (cross addition) and 21 = (+03)x(+07)
Thus, 103 x 107 = 11021
Multiplication near a Base (above)-2
Base 1000 Base 10000 Base 10000
1007 +007 10007 +0007 10123 +0123
1003 +003 10003 +0003 10005 +0005
---------------- ------------------ -------------------
1010 021 10010 0021 10128 0615
Thus it is seen that, increasing more 0’s in both multiplicands results in addition of same no. of 0-s in the first part and same no. of 0-s in the second part.
(N + a) (N + b) = N (N + a + b) + ab
Here, Cross addition is (N + a + b) and ab is the Multiplication in second part.
Multiplication near a Base (Misc)-1
93 -07 : as 93 is 7 less than the base, 07 maintains no. of digts
107 +07 : 107 is 7 more than base
-----------
100 49 : Here 100 = 93 +07 or 107 -07 (cross result) and � -49 (written as 49) = (-07)x(+07). 100 00 – 49 makes it 99 51
Thus, 93 x 107 = 10049 = 9951.
Multiplication near a Base (Misc)-2
Base 1000 Base 10000
1013 +013 10003 +0003
993 -007 9993 -0007
-------------- ------------------
1006 091 9996 0021 (becomes 1005 909 and 9995 9979 resp.)
Thus it is seen that, increasing more 0’s & 9’s in multiplicands results in addition of same no. of 0-s or 9-s in the first part and same no. of 0-s in the second part.
(N + a) (N – b) = N (N + a – b) – ab
Here, Cross result is (N + a – b) and ab is the Multiplication in second part.
Multiplication near Sub-base
Here we may consider Base 1000, and sub-base 500.
Alternatively, if we consider Base as 100, sub-base will still be 500.
Procedures will be different in these two cases, pl see below.
Base 1000 Base 100 (both sub-base 500)
483 -017 483 -17 According to Base, we have to write the difference.
497 -003 497 -03 Procedure is similar to earlier. But, at the last, we have to
------------ ----------- Divide by 2 (500=1000/2) for first, and Multiply by 5 in the
2) 480 051 5x 480 51 second case (500 = 100 x 5). Ultimately, result becomes
240 051 2400 51 the same, as is supposed to be.
Multiplication near Sub-base (contd.)
Base 1000, Base 100,
Sub-base 1000 /4 = 250 Sub-base 100/2 = 50
235 -015 18 -32
247 -003 45 -05
4)232 045 2)13 160 (Carry is written in small)
58 045 6½ 160 = 6 210 (50 + 160 = 210)
8 10 (Carry 2 is added to 6 to get 8)
Note: A half (½) in hundred position means 5 in 10’s position.
Algebra: (mN – a) (mN – b) = mN (mN – a – b) + ab
General Multiplication by Tiryag method (2x2)
43 Left most 4x2 =8. Middle 4x5 + 3x2 =26. Right 3x5 =15
25
------
865 The Unit digits are written in this row
21 The Carry-s are written in this row below left.
------
1075 Final answer is obtained by adding those Carry-s.
General Multiplication by Tiryag method (3x3)
= 10000ap + 1000(aq+bp) + 100(ar+bq+cp) + 10(br+cq) + cr
Example: Digits are calculated like this:
314 3x3 =9, 3x5+1x3=18, 3x2+1x5+4x3=23, 1x2+4x5=22, 4x2=8
X 352
--------
98328 Unit’s digits are placed here.
122 Carry-s were written below one digit left
---------
110528 Carry-s are added to get the final Product
General Multiplication by Tiryag method (5x5)
23431 Left most digit 2x3 =6, Left but one 2x5+3x3 =19
x 35642 Next 2x6+3x5+4x3 =39, Next 2x4+3x6+4x5+3x3=55
--------- Middle 2x2+3x4+4x6+3x5+1x3 =4+12+24+15+3 =58,
699585602 Next, 3x2+4x4+3x6+1x5 =45, Next, 4x2+3x4+1x6 =26
1355421 Last but one 3x2+1x4=10. Right most 1x2=2
--------------- The “Carry”-s were written below and left. Finally,
835127702 respective “Carry”-s were added to above to get the Product.
General Multiplication by Tiryag method (5x5)
2 3 4 3 1 2 3 4 3 1
3 5 6 4 2 4 4 4 4 2
⚊⚊⚊⚊⚊⚊⚊⚊ ―――――――
6 9 9 5 8 5 6 0 2 8 4 4 8 8 6 6 0 2
1 3 5 5 4 2 1 1 1
--------------------- ---------------------
8 3 5 1 2 7 7 0 2 8 4 4 8 8 7 7 0 2
8 3 5 1 2 7 7 0 2
Comparison between Multiplication Methods
Urdhva Tirjagabhyam Nikhilam Navatah …
8 8 9 1 1 1 1 889 -111 111 +11
8 9 8 1 1 0 2 898 -102 102 +02
--------------- ---------------- ------------ ------------
64 6 8 5 2 1 2 0 2 3 2 2 787 322 113 22
13 0 4 7 ⇩ 11
2 1 7 9 8 3 2 2 -------------
--------------- 798 322
79 8 3 2 2
Comparing with conventional method
8 8 9 1 1 1 1
8 9 8 1 1 0 2
------------- -----------------
7 1 1 2 2 2 2 2
8 0 0 1 1 1 1 1
71 1 2 1 1 1 1
----------------- ----------------------
7 9 8 3 2 2 1 2 0 2 3 2 2 = 798 322
Conventional … but using Vinculum
Comparison of Multiplication Algebrae
(100a+10b+c)r is written on first line, then
(100a+10b+c)q is written on 2nd line, one place shifted left, then
(100a+10b+c)p is written on 3rd line, one place further shifted left
Then all added.
10000ap+1000(aq+bp)+100(ar+bq+cp)+10(br+cq)+cr
Units are written on top line, carries down-left, finally added.
Tiryag method has been proved to be more efficient through research.
Division : by Nikhilam Method
9 ) 3 / 4 9 ) 6 / 1 9 ) 12 / 3 9 ) 25 / 3
1 3 6 1 3 2 7
3 / 7 6 / 7 13 6 27 / 1 / 0
q r q r q r 1 1
28 / 1
q r
Division : by Nikhilam Method (contd.)
9 ) 1231 / 2 9 ) 120021 / 2 9 ) 101164 / 9
1 136 / 7 13335 / 6 11239 / 13
1367 / 9 133356 / 8 112403 / 22
1368 / 0 q r 9) 2 / 2
q r 2
112403 2 / 4
112405 / 4
q r
Division : by Nikhilam Method (contd.)
8 ) 2 / 3 8 ) 3 / 1 7 ) 1 / 2 7 ) 2 / 0 6 ) 1 / 1
2 4 2 6 3 3 3 6 4 4
2 / 7 3 / 7 1 / 5 2 / 6 1 / 5 (q / r)
8 ) 23 / 4 8 ) 34 / 5
2 4 2 6
/ 14 / 20
27 / 18 = 29 / 2 40 / 25 = 43 / 1
Division : by Nikhilam Method (contd.)
89 ) 1 / 11 87 ) 2 / 22 88) 3 / 33
11 11 13 / 26 12 / 36
1 / 22 2 / 48 3 / 69
888 ) 1 / 234 789 ) 2 / 345
112 112 211 422
1 / 346 2 / 767
Division : by Nikhilam Method (contd.)
89 ) 11 / 11 789 ) 21 / 456 789 ) 1 / 731
11 1 / 1 211 4 / 22 211 / 211
/ 22 1055 1 / 942 = 2 / 153
12 / 43 25/1731 🡪 27 / 153
789 ) 121 / 456 789 ) 3 / 106 789 ) 231 / 456 789 ) 5 / 013
211 21 / 1 211 633 211 42 / 2 211 1055
8 / 44 3 / 739 14 / 77 5 / 1068
2110 3587 789 ) 1 / 068
150 / 3106 🡪 153 / 739 287 / 5013 / 211
🡪 293 / 279 1 / 279
Division : by Nikhilam Method (contd.)
654) 341 / 567 654 ) 19 / 799 654 ) 5 / 411 654 ) 2 / 141
346 103 / 8 346 3 / 46 346 / 1730 346 692
48 / 44 / 4152 5/ 2141 2 / 833
/ 17992 22 / 5411 = 3 / 179
492 / 19799 🡪 522 / 179 (Remainder is 179)
Adding quotients of all steps, Quotient = 492 + 22 + 5 + 3 = 522
Division : by Nikhilam… special case
Consider 1011 ÷ 23 : 23 x 4 = 92 is near a power of 10.
23 x 4 = 92 ) 10 / 11
08 0 / 8
10 / 91 91 – 3 x 23 = 22
x 4 (Remainder will not be affected by this multiplication)
40 / 91 🡪 43 / 22
Division : Paravartya Method
112 ) 12 / 3 4 1123 ) 13 / 4 5 6
-1 -2 -1 -2 -1-2-3 -1 -2 -3
-1 -2 -2 -4 -6
11 / 0 2 12 / 0 -2 0 🡪 11 / 1103
Division : Paravartya Method
123 ) 2 3 4 / 5 6 882 ) 4 / 0 0 9
-2-3 -4 -6 118 4 +8 -8
2 3 1 +2 -2 4 / 4 8 1
0 0 q = 4, r = 481
2 -1 0 / 8 6
q = 190 , r = 86
Division : Paravartya Method – Special cases
2) 224 2 6 / 9 9 2) 223 1 6 / 9 9
112 -2 -4 111½ -1 -1½
-1 -2 -4 -8 -1 -1½ -5 -7½
2) 2 4 / 1 1 2) 1 5 / 2½ 1½
Q= 12, R=11 7½ / 2½ 1½
Q=7, R=111½ + 25 + 1½=138
Note: Remainder(R) remains constant while dividing Quotient by 2.
And : Presence of ½ in Quotient will contribute half of dividend to R.
Division, Rational Fraction and Decimal form
E = D x Q + R or E/D = Q + R/D, where R < D
15 ÷ 4 🡪 Q = 3, R=3, or 15/4 = 3¾ = 3.75
Fraction : N/D (N<D) to Decimal form
Ex. ½= 0.5, ¼= 0.25, ¾=0.75, 1/₈=0.125, 3/₈=0.375, ⁵/₈=0.675,
1/₅=0.2, 3/₅=0.6, 1/₂₅=0.04, 1/₅₀=0.02, 1/₁₀₀=0.01 etc.
Ex. 1/3=0.333… 1/7=0.142857…142857… , 1/11=0.0909… etc.
Ex. 1/6=0.1666… 8/15=0.5333… 9/14=0.6428571…428571…
Fraction : N/D (N<D) - Transformation
Ex. 1/6=5/30= (1/10) 5/3=(1+2/3)/10= 1.666…/10 =0.1666…
Thus, basically the non-terminating part results from a Whole part and the recurring part from a fraction of 2nd type, viz. D ending in 1,3,7 or 9.
More example: 29/74=145/370=(1/10) (145/37) = (3+34/37)/10 = 0.3+(34/37)/10
Thus, 0.3 + 0.918…918…/10 = 0.3918…918…
29/75=116/300=0.01 x (116/3) = 0.01x(38+2/3)=0.38 + 0.01x 0.666… = 0.38666…
Finding Decimal expression using Nikhilam
8 ) 3 / 0 …
2 6
3. 6 / 0
12 ( 12-8 = 4)
3. 7 4 / 0
8 (8 – 8 = 0)
3. 7 5 / 0
Once 0 remainder is obtained, the process ends. Ans. 30 ÷ 8 = 3.75
Finding Decimal expression using Nikhilam
7 ) 2 / 2 3.1428 4 / 0
3 6 12
2 / 8 = 3 / 1 3.14285 5 / 0
3. 1 / 0 3.14285 15
3. 3 3.142857 1 / 0
3.1 3 / 0 3.142857 3
3.1 9 3.142857 1 3 / 0
3.1 3 / 9 repeats
3.14 2 / 0
3.14 / 6
3.142 6 / 0
3.142 18
3.1428 4 / 0
Finding Decimal expression using Nikhilam
89 ) 4 / 20 Thus, 42 ÷ 89 = 0.4719101…
11 44
. 4 6 / 40
.4 66
.4 6 106 (106 – 89 = 17)
. 4 7 1 / 70
.4 7 11
.4 7 1 8 / 10
.4 7 1 88
.4 7 1 8 98 ( 98 – 89 = 09)
.4 7 1 9 09 / 00
.4 7 1 9 99 (99 – 89 = 10)
.4 7 1 9 10 1 / 00
Decimal form to Fraction (N/D) form
0.125 = 125/1000 = 1/8. 5.48 = 548/100 = 137/25.
0.3333… = 3/9 = 1/3. 0.4545..= 45/99 = 5/11
0.142857142857… = 142857/999999 = 1/7
Decimal form to Fraction (N/D) form
0.1666… = (16-1)/90 = 15/90 = 1/6
0.6818181… = (681-6)/990 = 675/990 = 15/22 (45 was common)
Recurring Decimal : Vedic One Line Method
D | dd | N | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | |
| | | ⦁ | | | | | | | | | | | | | | | | | ⦁ | | | | | | | | | | | | | | Digit Divisor (dd) = (D+1)/10 | | ||||||||||||||||||
19 | 2 | 1 | 0 | 5 | 2 | 6 | 3 | 1 | 5 | 7 | 8 | 9 | 4 | 7 | 3 | 6 | 8 | 4 | 2 | 1 | 0 | 5 | 2 | 6 | 3 | 1 | 5 | | | | | <-- | Successive Quotients starting from N/dd | | |||||||||||||||||||
| | | 1 | 0 | 1 | 0 | 0 | 1 | 1 | 1 | 1 | 0 | 1 | 0 | 1 | 1 | 0 | 0 | 0 | 0 | 1 | 0 | 1 | 0 | 0 | 1 | 1 | | | | | <-- | Successive Remainders starting N/dd | | |||||||||||||||||||
| | | ⦁ | | | | | | | | | | | | | | | | | ⦁ | | | | | | | |
19 | 2 | 9 | 4 | 7 | 3 | 6 | 8 | 4 | 2 | 1 | 0 | 5 | 2 | 6 | 3 | 1 | 5 | 7 | 8 | 9 | 4 | 7 | 3 | 6 | 8 | 4 | 2 |
| | | 1 | 0 | 1 | 1 | 0 | 0 | 0 | 0 | 1 | 0 | 1 | 0 | 0 | 1 | 1 | 1 | 1 | 0 | 1 | 0 | 1 | 1 | 0 | 0 | 0 |
| | | ⦁ | | | | | | | | | | | | | | | | | | | | | | | | | | | ⦁ | | | | | | | | | |
29 | 3 | 1 | 0 | 3 | 4 | 4 | 8 | 2 | 7 | 5 | 8 | 6 | 2 | 0 | 6 | 8 | 9 | 6 | 5 | 5 | 1 | 7 | 2 | 4 | 1 | 3 | 7 | 9 | 3 | 1 | 0 | 3 | 4 | 4 | 8 | 2 | 7 | 5 | 8 |
| | | 1 | 1 | 1 | 2 | 0 | 2 | 1 | 2 | 1 | 0 | 0 | 2 | 2 | 2 | 1 | 1 | 1 | 0 | 2 | 0 | 1 | 0 | 1 | 2 | 2 | 0 | 0 | 0 | 1 | 1 | 1 | 2 | 0 | 2 | 1 | 2 | 1 |
| | | ⦁ | | | | | | | | | | | | | | | | | | | | | | | | | | | ⦁ | | | | | | | | | |
29 | 3 | 15 | 5 | 1 | 7 | 2 | 4 | 1 | 3 | 7 | 9 | 3 | 1 | 0 | 3 | 4 | 4 | 8 | 2 | 7 | 5 | 8 | 6 | 2 | 0 | 6 | 8 | 9 | 6 | 5 | 5 | 1 | 7 | 2 | 4 | 1 | 3 | 7 | 9 |
| | | 0 | 2 | 0 | 1 | 0 | 1 | 2 | 2 | 0 | 0 | 0 | 1 | 1 | 1 | 2 | 0 | 2 | 1 | 2 | 1 | 0 | 0 | 2 | 2 | 2 | 1 | 1 | 1 | 0 | 2 | 0 | 1 | 0 | 1 | 2 | 2 | 0 |
| | | ⦁ | | | | | ⦁ | | | | | | | |
39 | 4 | 3 | 0 | 7 | 6 | 9 | 2 | 3 | 0 | 7 | 6 | 9 | 2 | 3 | 0 |
| | | 3 | 2 | 3 | 0 | 1 | 0 | 3 | 2 | 3 | 0 | 1 | 0 | 3 |
Recurring Decimal : Vedic One Line Method
Vedic One Line Method : case 1/19
Vedic One Line Method (contd.) : case 1/19
⦁ ⦁
Vedic One Line Method (contd.) : case N/19
Vedic One Line Method (contd.) : case 1/29
10 13 14 24 08 22 17 25 18 06 02 20 26 28
19 16 15 05 21 07 12 04 11 23 27 09 03 01 thereafter 10 13 … repeats.
⦁ ⦁
Thus, 1/29 = 0.03448275862068 96551724137931… recurs after 28.
For 29, this recurrence length being 29-1=28, is also a full cycle.
Vedic One Line Method (contd.) : case N/29
Sequence being 03448275862068 96551724137931, we can guess for say 15/29 as starting from the first 5 in 55, where the remainder was 1. Thus, it was 15, and next will be the first digit.
i.e. 15/29 = 0. 51724137931034 48275862068965…
Vedic One Line Method (contd.) : N/a9
D | dd | N | ⦁ | | | | | | | | | | | | | | | | | | | | | | | | | | | | |
59 | 6 | 1 | 0 | 1 | 6 | 9 | 4 | 9 | 1 | 5 | 2 | 5 | 4 | 2 | 3 | 7 | 2 | 8 | 8 | 1 | 3 | 5 | 5 | 9 | 3 | 2 | 2 | 0 | 3 | 3 | 8 |
| | | 1 | 4 | 5 | 2 | 5 | 0 | 3 | 1 | 3 | 2 | 1 | 2 | 4 | 1 | 5 | 4 | 0 | 2 | 3 | 3 | 5 | 1 | 1 | 1 | 0 | 2 | 2 | 5 | 5 |
| | | | | | | | | | | | | | | | | | | | | | | | | | | | ⦁ |
9 | 8 | 3 | 0 | 5 | 0 | 8 | 4 | 7 | 4 | 5 | 7 | 6 | 2 | 7 | 1 | 1 | 8 | 6 | 4 | 4 | 0 | 6 | 7 | 7 | 9 | 6 | 6 | 1 |
4 | 1 | 0 | 3 | 0 | 5 | 2 | 4 | 2 | 3 | 4 | 3 | 1 | 4 | 0 | 1 | 5 | 3 | 2 | 2 | 0 | 4 | 4 | 4 | 5 | 3 | 3 | 0 | 0 |
Algebraic Proof of the Procedure
(1-x)-1= 1+x+x2+x3+x4+… …
=1+x(1+x(1+x(1+…)…)), where x < 1
Again, 1/(10n-1) = (1/10n) [ 1-(1/10n)] -1
= 1/(10n) [ 1+ (10n)-1 + (10n)-2 + (10n)-3 + … ]
= (10n)-1 [ 1 + (10n)-1 [ 1 + (10n)-1 [ 1 + (10n)-1 [ 1 + … ]…]]]
More clearly, in the next slide :
Binomial Expansion of 1/(10n-1)
∴
Vedic One Line Method (contd.) : Other D
7÷5 🡪 21 14 42 28 35 07 thereafter repeats. Thus, 1/7=0.142857…
3÷4 🡪 30 27 36 09 12 03 thereafter repeats. Thus, 1/13=0.076923…
D | dd | N | ⦁ | | | | | | | | | | | | | | | ⦁ | | | |
119 | 12 | 7 | 0 | 5 | 8 | 8 | 2 | 3 | 5 | 2 | 9 | 4 | 1 | 1 | 7 | 6 | 4 | 7 | 0 | 5 | 8 |
| | | 7 | 10 | 9 | 2 | 4 | 6 | 3 | 11 | 4 | 1 | 2 | 9 | 7 | 5 | 8 | 0 | 7 | 10 | 9 |
Vedic One Line Method (contd.) : N/a1
(1+x)-1= 1-x+x2-x3+x4+… … =1-x(1-x(1-x(1-…)…)), where x < 1
Therefore, 1/(10n+1) = (1/10n) [ 1+(1/10n)] -1
= 1/(10n) [ 1 - (10n)-1 + (10n)-2 - (10n)-3 + … ]
= (10n)-1 [ 1 - (10n)-1 [ 1 - (10n)-1 [ 1 - (10n)-1 [ 1 - … ]…]]]. More clearly,
Binomial Expansion of 1/(10n+1)
∴
Vedic One Line Method (contd.) : 1/21
Comparison of Positive and Negative methods
dd=Digit Divisor
We started dividing 9 by 19, in
Positive method.
We started dividing 1 by 2, in
Negative method.
Both gives same result for 1/21, after clearing the Negative digits, equivalent to Vinculum in second (5 3 = 47 and 2 1 = 19). It is up to an individual to choose which is suitable for oneself.
D | dd | N | | | | | | | | | | | | |
| | | ⦁ | | | | | ⦁ | | | | | | |
189 | 19 | 9 | 0 | 4 | 7 | 6 | 1 | 9 | 0 | 4 | 7 | 6 | 1 | 9 |
| | | 9 | 14 | 11 | 3 | 17 | 0 | 9 | 14 | 11 | 3 | 17 | 0 |
| | | ⦁ | | | | | ⦁ | | | | | | |
21 | 2 | 1 | 0 | 5 | -3 | 6 | 2 | -1 | 0 | 5 | -3 | 6 | 2 | -1 |
| | | 1 | 0 | 1 | 1 | 0 | 0 | 1 | 0 | 1 | 1 | 0 | 0 |
More example of Negative method
14÷4🡪 23 (17) 14 (06) 21 (19) 34 (26) 26 (14), back to 14, so repeats.
Thus 14/41 = 0.34146…
3 1 = 29, 6 2 = 58
7 2 = 68, 1 1 = 09
| | | ⦁ | | | | | | | | | | | | | | ⦁ | | |
31 | 3 | 14 | 4 | 5 | 1 | 6 | 1 | 3 | -1 | 0 | 3 | 2 | 2 | 6 | -2 | 0 | 6 | 4 | 5 |
| | | 2 | 1 | 2 | 1 | 1 | 0 | 0 | 1 | 1 | 1 | 2 | 0 | 0 | 2 | 2 | 2 | 1 |
| | | ⦁ | | | | | | | | | | | | | | | ⦁ | | |
51 | 5 | 35 | 7 | -2 | 6 | 2 | 7 | 4 | 5 | 1 | -1 | 8 | 0 | 4 | -1 | 2 | 1 | 5 | 7 | -2 |
| | | 0 | 3 | 2 | 4 | 3 | 3 | 1 | 0 | 4 | 1 | 2 | 0 | 1 | 1 | 3 | 4 | 0 | 3 |
Vedic One Line Method (contd.) : N/a7
6 2 = 58, 3 1 = 29
| | | ⦁ | | | | | | | | | | | | | | | ⦁ | | | |
119 | 12 | 56 | 4 | 7 | 0 | 5 | 8 | 8 | 2 | 3 | 5 | 2 | 9 | 4 | 1 | 1 | 7 | 6 | 4 | 7 | 0 |
| | | 8 | 0 | 7 | 10 | 9 | 2 | 4 | 6 | 3 | 11 | 4 | 1 | 2 | 9 | 7 | 5 | 8 | 0 | 7 |
| | | ⦁ | | | | | | | | | | | | | | | ⦁ | | | |
51 | 5 | 24 | 4 | 7 | 0 | 6 | -2 | 8 | 2 | 3 | 5 | 3 | -1 | 4 | 1 | 1 | 7 | 6 | 4 | 7 | 0 |
| | | 4 | 1 | 3 | 0 | 4 | 2 | 2 | 3 | 2 | 0 | 2 | 1 | 1 | 4 | 4 | 3 | 4 | 1 | 3 |
Exercise on Recurring Decimals
Periodicity of Recurring Decimals
Periodicity of Recurring Decimals
Perio-dicity | RepNine nos. | Relevant R or H nos. | Relevant Prime Factors / imp. composites |
1 | 9🡪3🡪 | R₁ | 3 |
2 | 99🡪33🡪11 | R₂ = H₁ | 11 |
3 | 999🡪333🡪... | R₃ | 37, 27 |
4 | 9999🡪... | H₂ | 101 |
5 | 99999🡪... | R₅ | 41, 271, 123 |
6 | 999999🡪... | H₃ | 7, 13, 21, 39, 63, 117, 259 |
7 | 9999999🡪... | R₇ | 239, 4649 |
8 | 99999999🡪... | H₄ | 73, 137 |
9 | 999999999🡪 | R₉ | 333667, 81 |
10 | (10^10-1) | H₅ | 9091 |
11 | (10^11-1) | R₁₁ | 21649, 513239 |
12 | (10^12-1) | H₆ | 9901 |
13 | (10^13-1) | R₁₃ | 53, 79, >2e8 |
14 | (10^14-1) | H₇ | 909091 |
15 | (10^15-1) | R₁₅ | 31, 2906161, 279 |
16 | (10^16-1) | H₈ | 17, 5882353 |
17 | (10^17-1) | R₁₇ | 2071723, >5e9 |
18 | (10^18-1) | H₉ | 19, 52579, 57, 171 |
19 | (10^19-1) | R₁₉ | R, i.e. >1e18 |
20 | (10^20-1) | H₁₀ | 3541, 27961 |
Divisibility Rules : without actual division
e.g. 57356 is divisible by 4, because 56 is divisible by 4, etc.
e.g. 543275 is divisible by 25, since 75 is divisible by 25, etc.
Divisibility Rules (contd.)
Divisibility : Osculation Method
N = 10R + U, where U is the Unit’s digit and R is the Rest (Comprising of Ten’s digit and beyond).
Osculation is a Vedic Method to create a smaller Integer T = R + mU, where this multiplier m is also called the Osculator. It is being said that, the Integer N is Osculated by m, to get T. The process can be recursive with the same Osculator m, i.e. the Unit’s digit of T can be multiplied by m and added to Rest digits of T.
Osculation is an efficient method for testing Divisibility. It is a matter to determine the required m, given a number N and a divisor D (ending in 1,3,7 or 9). The Osculator m can be found with the following consideration :
Divisibility : Osculation Method : Algebra
mN – T = m(10R + U) – (R + mU) = 10mR + mU – R – mU
Or mN – T = (10m – 1)R … (1)
Let’s now consider the case of Divisibility by a number, i.e. Divisor D.
If we can find an Osculator m, such that,
(10m – 1) mod D = 0 …(2), that will mean, from Eq. 1:
(mN – T) mod D = 0 …(3)
Thus, once a proper Osculator m is found, our job will be to test T for divisibility by D. Because, T mod D = 0 will imply mN mod D = 0 from Eq. (3), and in turn will lead to N mod D = 0, because, m mod D # 0.
Divisibility : Osculation Method : Example
Example, Lets test whether 343 is divisible by 7. First we find Osculator for 7. We see, that (10x5 – 1), i.e. 49 is divisible by 7. Thus, Osculator m = 5. Once found m, we execute the following process:� 343 🡪 34 + 3x5 = 49, which is divisible by 7, so 343 is divisible by 7.
Take 64724: 64724 🡪 6472 + 4x5 = 6492 🡪 649 + 2x5 = 659 🡪 �65 + 9x5 = 110 🡪 11 + 0x5 = 11, not divisible by 7. So, by back tracking, 110, 659, 6492 and 64724 : none will be divisible by 7.
Divisibility : Osculation Method : Example
We find, (10x4 – 1) i.e. 39 is divisible by 13. So, m=4 for 13. We do:
11635 🡪 1163 + 5x4 = 1183 🡪 118 + 3x4 = 130 🡪 13 + 0x4 = 13.
Since it is 13, therefore 130, 1183 and 11635 are divisible by 13.
41285 🡪 4128 + 5x7 = 4163 🡪 416 + 3x7 = 437 🡪 43 + 7x7 = 92 🡪
9 + 2x7 = 23. Thus, 92, 437, 4163 and 41285 are divisible by 23.
Positive, Negative and Minimum Osculator
Table of Positive and Negative Osculators
n | Numbers whose Positive | | | | | | Numbers whose Negative | ||||||
Osculator is +n | | 10n-1 | 10n | 10n+1 | | Osculator is -n | |||||||
1 | | | 3 | 9 | | 9 | 10 | 11 | | 11 | | | |
2 | | | | 19 | | 19 | 20 | 21 | | 21 | 7 | 3 | |
3 | | | | 29 | | 29 | 30 | 31 | | 31 | | | |
4 | | | 13 | 39 | | 39 | 40 | 41 | | 41 | | | |
5 | | | 7 | 49 | | 49 | 50 | 51 | | 51 | 17 | | |
6 | | | | 59 | | 59 | 60 | 61 | | 61 | | | |
7 | | | 23 | 69 | | 69 | 70 | 71 | | 71 | | | |
8 | | | | 79 | | 79 | 80 | 81 | | 81 | 27 | | |
9 | | | | 89 | | 89 | 90 | 91 | | 91 | 13 | | |
10 | | 11 | 33 | 99 | | 99 | 100 | 101 | | 101 | | | |
11 | | | | 109 | | 109 | 110 | 111 | | 111 | 37 | | |
12 | | | 17 | 119 | | 119 | 120 | 121 | | 121 | | | |
13 | | | 43 | 129 | | 129 | 130 | 131 | | 131 | | | |
14 | | | | 139 | | 139 | 140 | 141 | | 141 | 47 | | |
15 | | | | 149 | | 149 | 150 | 151 | | 151 | | | |
16 | | | 53 | 159 | | 159 | 160 | 161 | | 161 | 23 | | |
17 | | | | 169 | | 169 | 170 | 171 | | 171 | 57 | | |
18 | | | | 179 | | 179 | 180 | 181 | | 181 | | | |
19 | | 21 | 63 | 189 | | 189 | 190 | 191 | | 191 | | | |
20 | | | | 199 | | 199 | 200 | 201 | | 201 | 67 | | |
Divisibility : using Negative Osculator
Exercises on Divisibility
Divisibility : Multiplex Osculation Method
N = 10ⁿR + Uₙ, where Uₙ is a Block of n nos. of digits towards Unit’s digit and R is the Rest, comprising of (n+1)th digit and beyond.
Multiplex Osculation is the Vedic Method to create a smaller Integer �T = R + mUₙ, here this multiplier m is now called the n-th order Multiplex Osculator. The process can be recursive with the same Multiplex Osculator m.
Osculation is an efficient method for testing Divisibility. It is a matter to determine the required m, given a number N and a divisor D (ending in 1,3,7 or 9). The n-th order Multiplex Osculator m can be found with the following consideration :
Divisibility : Multiplex Osculation: Algebra
mN – T = m(10ⁿR + Uₙ) – (R + mUₙ) = 10ⁿmR + mUₙ – R – mUₙ
Or mN – T = (10ⁿm – 1)R … (1)
Let’s now consider the case of Divisibility by a number, i.e. Divisor D.
If we can find an Multiplex Osculator m, such that,
(10ⁿm – 1) mod D = 0 …(2), that will mean, from Eq. 1:
(mN – T) mod D = 0 …(3)
Thus, once a proper Osculator m is found, our job will be to test T for divisibility by D. Because, T mod D = 0 will imply mN mod D = 0 from Eq. (3), and in turn will lead to N mod D = 0, because, m mod D # 0.
Divisibility : Multiplex Osculators : Examples
First we write dividend in groups of 2, from right : 2 19 61 55
🡪 2 19 61 + 55 x 3 = 2 21 26 🡪 2 21 + 26 x 3= 2 99. Thus divisible.
Divisibility : Multiplex Osculators
🡪 1 931 + 678 x 6 = 5999. Thus divisible.
Divisibility by Rep-Nine (10ⁿ – 1) Numbers
30 + 10 + 21 + 30 + 06 + 02 = 99. Divisible
2 + 130 + 110 + 211 + 434 + 112 = 999. Divisible
2037 + 7600 + 0321 + 0041 = 9999. Divisible
Note: Rep-nine numbers are special cases where n-th order Multiplex Osculators are 1, which leads to simple addition in groups of n digits.
Divisibility by Hollow (10ⁿ + 1) numbers
– 524 + 676 – 648 + 016 – 201 + 452 = 229 , thus not divisible.
– 524 + 476 – 648 + 716 – 321 + 301 = 0 , thus divisible.
Note: Hollow numbers are special cases, where n-th order Multiplex Osculators are -1. Thus the process leads to alternate sign addition of digits grouped in n.
Divisibility : Multiplex Osculator: others
Is 98300 23972 divisible by any of 7, 13, 17, 21, 29 or 31 ?
Applicability of Vedic methods for Hex-nos.
Thank you
Thank You