An endless series of rectangles is constructed each with a width 1 and height n 1 − n + 1 1 , where n = 1 , 2 , 3 , . . . Find the total areas of rectangles.
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.
The area is given by
A = 1 × ( 1 1 − 2 1 ) + 1 × ( 2 1 − 3 1 ) + 1 × ( 3 1 − 4 1 ) + ⋯ = 1 − 2 1 + 2 1 − 3 1 + 3 1 − 4 1 + 4 1 − ⋯ = 1
Problem Loading...
Note Loading...
Set Loading...
The area of the first k such rectangles is
1 ⋅ n = 1 ∑ k [ n 1 − n + 1 1 ] = 1 + ( − 2 1 + 2 1 ) + ( − 3 1 + 3 1 ) + . . . + k − 1 1 + ( − k 1 + k 1 ) − k + 1 1 = 1 − k + 1 1
As k → ∞ , k + 1 1 → 0 , so the total area of the rectangles is 1 − 0 = 1 .