N = 2 0 2 1 1 + j = 0 ∑ 2 0 2 0 4 0 2 1 j 2 0 2 1 1 + j = 0 ∑ 2 0 2 0 4 0 2 0 j 2 0 2 1 1 + j = 0 ∑ 2 0 2 0 4 0 1 9 j 2 0 2 1 1 + … 2 0 2 1 1 + j = 0 ∑ 2 0 2 0 2 0 2 3 j 2 0 2 1 1 + 2 0 2 1 j = 0 ∑ 2 0 2 0 2 0 2 2 j
Evaluate ⌊ 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.
Hi Chris! Plz revisit the discussion about the integral. I have some questions!
Problem Loading...
Note Loading...
Set Loading...
Start with the formula for the sum of a finite geometric series: j = 0 ∑ k n j = n − 1 n k + 1 − 1
Manipulating this, ( n − 1 ) j = 0 ∑ k n j 1 + ( n − 1 ) j = 0 ∑ k n j k + 1 1 + ( n − 1 ) j = 0 ∑ k n j = n k + 1 − 1 = n k + 1 = n
In the expression in the question, the final root is 2 0 2 1 1 + 2 0 2 1 j = 0 ∑ 2 0 2 0 2 0 2 2 j
So setting k = 2 0 2 0 , n = 2 0 2 2 and using the formula above, this works out to be 2 0 2 2 . Now N = 2 0 2 1 1 + j = 0 ∑ 2 0 2 0 4 0 2 1 j 2 0 2 1 1 + j = 0 ∑ 2 0 2 0 4 0 2 0 j 2 0 2 1 1 + j = 0 ∑ 2 0 2 0 4 0 1 9 j 2 0 2 1 1 + ⋯ 2 0 2 1 1 + 2 0 2 2 j = 0 ∑ 2 0 2 0 2 0 2 3 j
This process continues, and we find N = 2 0 2 1 1 + 4 0 2 0 j = 0 ∑ 2 0 2 0 4 0 2 1 j = 4 0 2 1