Here's another way to see this.......
The cumulative sum of the total entries of n rows is given by.....n( n + 1)
And we can always figure out the row of the entry we're looking for by taking the ceiling function answer of the positive root of n^2 + n - k = 0 where k = the nth entry .... so
n2+n−40=0⇒{n=−(√161+1)2n=(√161−1)2}⇒{n=−6.8442887702247602n=5.8442887702247602}
So ceiling(5.8) = 6 ...so the 40th entry will be in row 6
And the value of each entry on row n = 2n......so....the 40th entry will be 2(6) = 12
Row 1 has 2 numbers; row 2 has 4 numbers; row 3 has 6 numbers; row 4 has 8 numbers; row 5 has 10 numbers.
So far, we have 2 + 4 + 6 + 8 + 10 = 30 numbers. The next row has 12 numbers, so this row (the 6th row) contains the 40th number.
Row 1 contain 2's, row 2 contains 4's, row 3 contains 6's, row 4 contains 8's, row 5 contains 10's, and row 6 contains 12's.
Here's another way to see this.......
The cumulative sum of the total entries of n rows is given by.....n( n + 1)
And we can always figure out the row of the entry we're looking for by taking the ceiling function answer of the positive root of n^2 + n - k = 0 where k = the nth entry .... so
n2+n−40=0⇒{n=−(√161+1)2n=(√161−1)2}⇒{n=−6.8442887702247602n=5.8442887702247602}
So ceiling(5.8) = 6 ...so the 40th entry will be in row 6
And the value of each entry on row n = 2n......so....the 40th entry will be 2(6) = 12