Let a sequence exist with the first term being 3 . The consecutive multiplication factor of this sequence is one plus thrice the reciprocal of the term that this consecutive multiplication factor is being multiplied to to obtain the next term.
What is the sum of the first 100 terms?
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.
Let us call any arbitrary term x . Let the next term of x be y . Then, from the rule, consecutive multiplication factor from x to y (i.e. the ratio of the next term y to this term x ) will be 1 + 3 × x 1 = 1 + x 3 . But this ratio is also equivalent to x y . Therefore, x y = 1 + x 3 . Multiplying both sides by x , x × x y = x + x × x 3 . Now let us carry out induction. Base Case: The first term (namely 3 ) is positive. Induction step: If x is positive, then in the previous equation, we can safely cancel the x in the numerator and the x in the denominator, in the left-hand side, and also cancel out x in the numerator and the x in the denominator, in the second term of the right-hand side, which leads to y = x + 3 , which shows that a positive 3 added to a positive x leads a positive y . Therefore, by induction we have proved that all terms are positive (and therefore non-zero). Therefore, the consequent of induction step, is also true, implying that y = x + 3 , where x was any arbitrary term, where y was the next term of x , implies that, any term except for the first one, is the previous term plus 3 . Therefore the 100th term will be the first term plus ninety-nine threes, which is equal to 3 + 9 9 × 3 = 1 0 0 × 3 = 3 0 0 . Therefore, the sum of the first 300 terms is equal to 3 + 6 + 9 + 1 2 + … 2 9 1 + 2 9 4 + 2 9 7 + 3 0 0 = 3 × ( 1 + 2 + 3 + 4 + … 9 7 + 9 8 + 9 9 + 1 0 0 ) . Using the n th Triangular Number Formula, a special case of the n th term of an arithmetic series formula, 1 + 2 + 3 + 4 + … 9 7 + 9 8 + 9 9 + 1 0 0 = 2 1 × 1 0 1 × 1 0 0 . Substituting this for 1 + 2 + 3 + 4 + … 9 7 + 9 8 + 9 9 + 1 0 0 in this expression: 3 × ( 1 + 2 + 3 + 4 + … 9 7 + 9 8 + 9 9 + 1 0 0 ) = 2 1 × 3 × 1 0 1 × 1 0 0 = 1 5 1 5 0 .
Problem Loading...
Note Loading...
Set Loading...
It might be easier to write the general term like
a n { a n } a 1 + . . . + a 1 0 0 = a n − 1 ( 1 + a n − 1 3 ) = a n − 1 + 3 a n > 1 as a 1 and ( 1 + a n − 1 3 ) > 1 = 3 , 6 , 9 , . . . . = 3 × ( 1 + 2 + . . . + 1 0 0 ) = 1 5 1 5 0