Vedic Math Method: Prove Conjecture Inspired by a Math Trick

  • Topic:
  • Thread starter RLBrown
  • Start date
  • Tags Tags
    Method
2 replies · 2K views · last reply
RLBrown
Messages
59
Reaction score
0
Below is a conjecture that I can't prove.
It was inspired by a math trick for division when the (base 10) denominator ends in the digit 9.

Can anyone help me out with a proof?

View attachment 6284

- - - Updated - - -

Here is an excell example,

View attachment 6285
 
Attachments
  • Typeset math statement: given natural numbers n and d, sequences a_k and b_k defined by b_1 = n, a_k = floor(b_k / d), and b_k = 10 (b_{k-1} mod d) + a_{k-1}; to prove n / (10d-1) = sum from k=1 to infinity of a_k 10^(-k).
    Capture.JPG
    21.4 KB · Views: 164
  • Spreadsheet table with d = 2 and n = 5 highlighted, listing k from 1 to 13 with columns n and a, ending with a result of 0.263157894736842 next to 19 and 5.
    Captur1e.JPG
    35.3 KB · Views: 173
Last edited:
These numbers are the same that arise in the standard division algorithm (as taught in elementary school), like so:
[TIKZ]\draw (0,0) node {$5\,. {}^50{}^{12}0{}^60{}^30{}^{11}0\ldots$} ;\draw (0,-0.5) node{$0\,. {}^{\phantom5}2 {}^{\phantom{12}}6 {}^{\phantom6}3 {}^{\phantom3}1 {}^{\phantom{11}} 5 \ldots$} ;\draw (-2,-0.05) node {$19$} ;\draw (-1.7,0.3) -- (-1.7,-0.3) -- (1.6,-0.3) ;[/TIKZ]
At each stage of that algorithm, you carry forward a remainder $r_{k-1}$, multiply it by 10 and then divide by $10d-1$, getting a quotient $q_{k-1}$ and a remainder $r_k$, so that $$10r_{k-1} = (10d-1)q_{k-1} + r_k.$$ If you write that as $$r_k = 10(r_{k-1}- dq_{k-1}) + q_{k-1},$$ you see that it is exactly the same as the recurrence relation $$b_k = 10(b_{k-1} - da_{k-1}) + a_{k-1}$$ from the Vedic algorithm. (It also has the same initial condition $r_1 = n$.)

So if you believe the standard division algorithm, then you should also believe the Vedic algorithm.