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.
It can be treated as a Riemann sum, but you have to be a little careful due to the upper limit on the sum not being a scalar multiple of n . The way I like treating it, however, is by dominated convergence, as this allows us to completely ignore this complication.
That is, first define the functions f ( x ) = 1 + x 2 1 , f n ( x ) = { f ( n ⌈ n x ⌉ ) 0 0 < x ≤ n otherwise
and then by simply writing out the integral of f n and applying the Dominated Convergence Theorem (note 0 ≤ f n ≤ f = n → ∞ lim f n on ( 0 , ∞ ) ), n → ∞ lim k = 1 ∑ n 2 n 2 + k 2 n = n → ∞ lim ∫ 0 ∞ f n ( x ) d x = ∫ 0 ∞ f ( x ) d x = arctan ( x ) ∣ ∣ ∣ 0 ∞ = 2 1 π