Find the minimum value of non-negative integer such that converges.
You can try more of my fundamental problems here .
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.
Relevant wiki: Convergence Tests
Note: For reasons that should become obvious, I'm going to use q instead of p
For every non-negative integer q , k = q + 1 ∑ ∞ k ( q + 1 ) / 2 1 = k = 1 ∑ ∞ ( k + q ) ( q + 1 ) / 2 1 ≤ k = 1 ∑ ∞ k ( k + 1 ) ( k + 2 ) ⋯ ( k + q ) 1 ≤ k = 1 ∑ ∞ k ( q + 1 ) / 2 1
Therefore, the series in question is bounded on both sides by a p -series with p = 2 q + 1 . It follows that it will converge if and only if 2 q + 1 = p > 1 ⟺ q > 1
Since q is an integer, the smallest value is 2 .