TADM2E 2.33

From Algorithm Wiki
Revision as of 14:43, 2 March 2015 by Ccamenares (Talk | contribs)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to: navigation, search

On careful observation , one can see that the sum of any row is just $ 3^{n-1} $ this is the sum for the series . This can even be computed using a series as shown below

1=a0
1 1 1 
a1 a0 a2

now a(mid) of the next line becomes the a(0) +a(1) +a(2) that it this mid element is always the sum of the middle three elements