00:01
Okay, this question wants us to approximate the value of this integral using remand sums of increasing value of n.
00:09
So, we say that this integral is approximated by the sum from k equals 1 to n, the number of rectangles, of our function sampled at specific values of x times the partition width, where that delta x, is just the length of the interval divided by the number of rectangles, which in our case is just 1 divided by n.
00:50
So our integral expression is approximately equal to 1 over n times the sum from k equals 1 to n of x sub star k squared plus 1.
01:10
And it doesn't matter if we use a right -hand sum or a left -hand sum.
01:14
You'll get the same answer as we go towards infinity, but i'll use the right -hand sum.
01:23
So we're taking the right side of every rectangle.
01:28
So we start at 0, and then we add k -delta -x, take it the right side of the k -th rectangle.
01:46
So that means x -sub -star k -squared is just sum of k -squared times delta -x squared plus 1.
02:00
Or if we want to substitute for delta x, we know that's just 1 over n.
02:08
So we get 1 over n times the sum from k equals 1 to n of k squared over n squared times, or sorry, plus 1.
02:23
And we could evaluate this completely if we wanted to, which i might go ahead and do that...