f ( n ) = n 1 + 2 + 3 + ⋯ + n
Consider the summation above for positive integer n .
Evaluate f ( 1 ) + f ( 2 ) + f ( 3 ) + ⋯ + f ( 9 9 ) + f ( 1 0 0 ) .
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.
Nice! That's what I hoped for. Actually, I think that looks nicer than my version of the solution.
f ( 1 ) = 1 1 = 1
f ( 2 ) = 2 1 + 2 = 2 3 = 1 . 5
f ( 3 ) = 3 1 + 2 + 3 = 3 6 = 2
=> 1 + 1 . 5 + 2 + .... + f ( 1 0 0 )
a = 1
d = 0 . 5
S n = 2 n [ 2 a + d ( n − 1 ) ]
S n = 2 1 0 0 [ 2 ∗ 1 + 0 . 5 ( 1 0 0 − 1 ) ]
S n = 2575
Quite good, but it would be even better if you first proved that all f(n) have the same pattern. Which means you have to show that f ( n ) = 1 + ( n − 1 ) 0 . 5 . Just assuming it is true, only by looking at the first three members, is not a sure way to solve this problem. It might get you a wrong result, but this time you were lucky.
By the way, you have put 2 below 6 by mistake. (After "f(3)")
Log in to reply
It seems you have edited it. "6/3" was fixed, but this needs a bit more work. Look at f(n) and simplify it. You can do that by using the arithmetic sum formula. If you don't catch the idea otherwise, look at other solutions.
And when you calculate f(1)+ f(2)+... you use the arithmetic sum formula again, of course, which is already done though.
Relevant wiki: Arithmetic Progression Sum
The formula
∑ k = 1 n ( a 1 + ( k − 1 ) d ) = 2 2 a 1 + ( k − 1 ) d
leads in the following result:
f ( n ) = n 1 + 2 + 3 + . . . + n = 2 n n ( n + 1 ) = 2 n + 1 = 2 n + 2 1
Which means:
f ( 1 ) + f ( 2 ) + f ( 3 ) + . . . + f ( 9 9 ) + f ( 1 0 0 ) = 2 1 + 2 1 + 2 2 + 2 1 + 2 3 + 2 1 + . . . + 2 1 0 0 + 2 1
= 2 1 + 2 + 3 + . . . + 9 9 + 1 0 0 + 1 0 0 × 2 1 = 4 1 0 0 × 1 0 1 + 5 0 = 2 5 7 5
Problem Loading...
Note Loading...
Set Loading...
Relevant wiki: Sum of n, n², or n³
f ( n ) = n 1 + 2 + 3 + ⋯ + n = n ∑ k = 1 n k = n 2 n ( n + 1 ) = 2 n + 1
S = f ( 1 ) + f ( 2 ) + f ( 3 ) + ⋯ + f ( 1 0 0 ) = n = 1 ∑ 1 0 0 2 n + 1 = 2 1 ( n = 1 ∑ 1 0 0 n + n = 1 ∑ 1 0 0 1 ) = 2 1 ( 2 1 0 0 ( 1 0 1 ) + 1 0 0 ) = 2 5 7 5