In the above tree diagram, numbers are presented as shown. If we continue assorting the numbers in rows in the same procedure, then what is the number that is in the twelfth row from the most left?
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
If we look at the first of left-most number of the first four rows, we note that they are 1, 2, 4, and 8, indicating that the first number of row r is given by n r , 1 = 2 r − 1 . Therefore, n 1 2 , 1 = 2 1 2 − 1 = 2 1 1 = 2 0 4 8 .
To prove that the claim n r , 1 = 2 r − 1 is true for all r ≥ 1 . We consider as follows. Let the number of elements (or numbers) in r th row be N r . We note that N 1 = 1 and N r = 2 N r − 1 = 2 r − 1 . The total number of elements for the first r rows is then S r = k = 1 ∑ r N k = k = 1 ∑ r 2 k − 1 = 2 r − 1 . We also that S r = n r , l the last number of row r . Therefore, the first number of ( r + 1 ) th row is n r + 1 . 1 = 2 r − 1 + 1 = 2 r , ⟹ n r , 1 = 2 r − 1 ■ .