n = 1 ∑ ∞ ( 1 0 0 0 n ) ! m n ( ( 5 0 0 n ) ! ) 2 If the series above is to converge, we must have ∣ m ∣ < a . If a is of the form s r , where s is a prime number, find s + r .
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.
same way...good solution..(+1)!!!!
Relevant wiki: Convergence - Ratio Test
n = 0 ∑ ∞ a n = n = 0 ∑ ∞ ( 1 0 0 0 n ) ! m n ( ( 5 0 0 n ) ! ) 2 = n = 0 ∑ ∞ ( 1 0 0 0 n ) 1 0 0 0 n + 1 / 2 m n 2 π ( 5 0 0 n ) 1 0 0 0 n + 1 Stirling’s formula: n ! ≈ 2 π n n + 1 / 2 e − n
Consider the ratio text, for the sum to converge, we have L = n → ∞ lim ∣ ∣ ∣ ∣ a n a n + 1 ∣ ∣ ∣ ∣ < 1 . Therefore,
L = n → ∞ lim ( 1 0 0 0 ( n + 1 ) ) 1 0 0 0 ( n + 1 ) + 1 / 2 ∣ m ∣ n + 1 2 π ( 5 0 0 ( n + 1 ) ) 1 0 0 0 ( n + 1 ) + 1 ⋅ ∣ m ∣ n 2 π ( 5 0 0 n ) 1 0 0 0 n + 1 ( 1 0 0 0 n ) 1 0 0 0 n + 1 / 2 = ( 1 0 0 0 n ) 1 0 0 0 ( n + 1 ) + 1 / 2 ( 1 + n 1 ) 1 0 0 0 ( n + 1 ) + 1 / 2 ( 5 0 0 n ) 1 0 0 0 n + 1 ∣ m ∣ ( 5 0 0 n ) 1 0 0 0 ( n + 1 ) + 1 ( 1 + n 1 ) 1 0 0 0 ( n + 1 ) + 1 ( 1 0 0 0 n ) 1 0 0 0 n + 1 / 2 = ( 1 0 0 0 n ) 1 0 0 0 e 1 0 0 0 ∣ m ∣ ( 5 0 0 n ) 1 0 0 0 e 1 0 0 0 = 2 1 0 0 0 ∣ m ∣
For L < 1 ⟹ 2 1 0 0 0 ∣ m ∣ < 1 ⟹ ∣ m ∣ < 2 1 0 0 0 . Therefore, s + r = 2 + 1 0 0 0 = 1 0 0 2 .
References:
Problem Loading...
Note Loading...
Set Loading...
Relevant wiki: Convergence - Ratio Test
The question asks about the convergence of n = 1 ∑ ∞ ( 1 0 0 0 n ) ! m n ( ( 5 0 0 n ) ! ) 2 so we can proceed by the ratio test. n → ∞ lim m n ( ( 5 0 0 n ) ! ) 2 ( 1 0 0 0 n + 1 0 0 0 ) ! m n + 1 ( ( 5 0 0 n + 5 0 0 ) ! ) 2 ( 1 0 0 0 n ) ! = m n → ∞ lim ( 1 0 0 0 n + 1 ) × ( 1 0 0 0 n + 2 ) × ( 1 0 0 0 n + 3 ) × ⋯ × ( 1 0 0 0 n + 1 0 0 0 ) ( ( 5 0 0 n + 1 ) × ( 5 0 0 n + 2 ) × ( 5 0 0 n + 3 ) × ⋯ × ( 5 0 0 n + 5 0 0 ) ) 2
Since each factor in the numerator is repeated once, we note that there are 1 0 0 0 factors in the numerator and the denominator of the fraction. Since n → ∞ lim ∏ k = 1 5 0 0 ( 1 0 0 0 n + k ) ∏ k = 1 5 0 0 ( 5 0 0 n + k ) = 2 5 0 0 1 we have 2 5 0 0 m n → ∞ lim ∏ k = 5 0 1 1 0 0 0 ( 1 0 0 0 n + k ) ∏ k = 1 5 0 0 ( 5 0 0 n + k )
Once again, since n → ∞ lim ∏ k = 5 0 1 1 0 0 0 ( 1 0 0 0 n + k ) ∏ k = 1 5 0 0 ( 5 0 0 n + k ) = 2 5 0 0 1 we have 2 5 0 0 m n → ∞ lim ∏ k = 5 0 1 1 0 0 0 ( 1 0 0 0 n + k ) ∏ k = 1 5 0 0 ( 5 0 0 n + k ) = 2 5 0 0 m × 2 5 0 0 1 = 2 1 0 0 0 m Since we used a ratio test to determine the convergence of the series, we conclude that since 2 1 0 0 0 ∣ m ∣ must be less than 1 , then m < 2 1 0 0 0 .
Hence, s + r = 1 0 0 0 + 2 = 1 0 0 2 .
Furthermore, if we replace 5 0 0 with k and 1 0 0 0 with 2 k we see that a series of the form n = 1 ∑ ∞ ( 2 k n ) ! m n ( ( k n ) ! ) 2 is convergent if ∣ m ∣ < 2 2 k .