h ( n ) = n 9 9 9 9 9 8 ( n 1 9 9 ( n n 2 ) 2 0 0 ) 1 0 0 0 0 0 0
For h ( n ) as defined above, find n = 1 ∑ 1 0 0 h ( n ) .
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.
First, we need to simplify that seemingly huge fraction in the function. We notice a pattern, so when we simplify it down, we get n 2 . Basically, the problem is asking us to find the sum of all terms up until 1 0 0 in the function h ( x ) = n 2 . We can create an equation to model this problem:
k = 1 ∑ 1 0 0 n 2 = 1 2 + 2 2 + 3 2 + 4 2 + 5 2 + ⋯ + 1 0 0 2 = 3 3 8 3 5 0
Problem Loading...
Note Loading...
Set Loading...
h ( n ) = n 9 9 9 9 9 8 ( n 1 9 9 ( n n 2 ) 2 0 0 ) 1 0 0 0 0 0 0 = n 9 9 9 9 9 8 ( n 1 9 9 n 2 0 0 ) 1 0 0 0 0 0 0 = n 9 9 9 9 9 8 n 1 0 0 0 0 0 0 = n 2
Therefore, n = 1 ∑ 1 0 0 h ( n ) = n = 1 ∑ 1 0 0 n 2 = 6 1 0 0 ( 1 0 1 ) ( 2 0 1 ) = 3 3 8 3 5 0 .