2 ! 1 + 3 ! 2 + 4 ! 3 + 5 ! 4 + ⋯ = ?
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.
@Chew-Seong Cheong There is a mistake at second last line
n doesn't make sense outside the context of the summation, second to last line could be: n = 1 ∑ 1 n ! 1 or 1 ! 1
It is not valid to split a series into two unless you have first proven that the series converges. Counterexamples can be taken from the series 1 + 1 - 1 + 1 - 1 ..., you can split into two series in various ways and obtain different results for the "sum".
Several of the other answers make the same mistake... the answer by Richard Farrer avoids the problem (showing that the sequence of partial sums converges is one way of showing that the series converges) .
Fortunately it is an easy thing to show ... as well as Richard's proof, another way is to note that each term in the series is strictly less than the corresponding term in exp(1) which is known to converge.
n = 1 ∑ ∞ ( n + 1 ) ! n = n = 1 ∑ ∞ ( n + 1 ) ! ( n + 1 ) − 1 = n = 1 ∑ ∞ n ! 1 − n = 1 ∑ ∞ ( n + 1 ) ! 1 = ( e − 1 ) − ( e − 2 ) = 1 .
Can you explain the second last step and how you got 1
Log in to reply
Yeah, I edited it again.
Log in to reply
'e' as in natural logarithm?
Log in to reply
@Aman Thegreat – Yes, it's the base of natural logarithm.
Can you explain the second last step and how you got e-1 and e-2 ?
Log in to reply
The Taylor series for e x at 0 is ∑ n = 0 ∞ n ! x n . Set x = 1 , we have e = ∑ n = 0 ∞ n ! 1 .
Very nice solution!
Recall the series of e e = 1 + 1 ! 1 + 2 ! 1 + 3 ! 1 + 4 ! 1 + 5 ! 1 + ⋯ Now note down the given infinite series S = 2 ! 1 + 3 ! 2 + 4 ! 3 + 5 ! 4 + 6 ! 5 + 7 ! 6 + ⋯
Can the given series be formed like that the expansion of e ? Yes, the thing is to remember is not to break(split) denominator part. . S = 2 ! 2 − 1 + 3 ! 3 − 1 + 4 ! 4 − 1 + 5 ! 5 − 1 + 6 ! 6 − 1 + ⋯ S = ( 2 ! 2 + 3 ! 3 + 4 ! 4 + ⋯ ) − ( 2 ! 1 + 3 ! 1 + 4 ! 1 + ⋯ ) S = ( 1 ! 1 + 2 ! 1 + 3 ! 1 + ⋯ ) − ( 1 + 1 ! 1 + 1 ! 1 + 2 ! 1 + 3 ! 1 + ⋯ − − 1 − 1 ! 1 ) S = ( 1 + 1 ! 1 + 2 ! 1 + 3 ! 1 + ⋯ − 1 ) − ( e − 2 ) S = ( e − 1 ) − ( e − 2 ) = 1
Try similar problem here .
Explain the second last step
Log in to reply
Just try to match with the series of e . Since there we can see missing of 1 and on adding 1 it looks like the series of e.
the last third and second lines need some editing :)
Log in to reply
Yes an extra term in the third last line and a missing term in the second last line.
Log in to reply
I see. I didn't notice. I have fixed it now. (in second last line).Thank you :)
I didn't notice !! I have fixed it . Thank you !! :)
Penultimate step should be revised.
e = [1 + 1/1!] + 1/2! + 1/3! + 1/4! + ...
e = 2 + 1/2! + 1/3! + 1/4! + ...
S = (1/1! + 1/2! + 1/3! + ... ) - ({1 + 1/1!} + 1/1! + 1/2! + 1/3! + ... {- 1 - 1/1!})
S = (1 + 1/2! + 1/3! + ... ) - (e + {- 1 - 1/1!})
S = (1 + 1/2! + 1/3! + ... ) - (e-2)
S = (2 + 1/2! + 1/3! + 1/4! + ... - 1) - (e-2)
S = (e - 1) - (e-2) = 1
Log in to reply
In the third line there is an extra 1/1! term - ({1 + 1/1!} + 1/1!(<—this one)+ 1/2! + 1/3! + ... {- 1 - 1/1!})
I have fixed it . Thank you !! :)
Observer that each term can be written as n ! 1 − ( n + 1 ) ! 1 .
Thus the partial sums are just 1 − ( n + 1 ) ! 1 and so tend to 1.
Excellent and elegant solution. I admit that I merely worked out the sum of the first few fractions, looked at the rate of which the fractions decreased and concluded from that evidence that the only one of the values given on which the series could converge was 1, because all the pothers were too large.
The Taylor series for e x is 1 + x + 2 ! x 2 + 3 ! x 3 + 4 ! x 4 + . . . .
Divide everything by x to get x e x = x 1 + 1 + 2 ! x + 3 ! x 2 + 4 ! x 3 + . . . .
Differentiate both sides to get d x d x e x = x 2 e x ( x − 1 ) = x 2 − 1 + 0 + 2 ! 1 + 3 ! 2 x + 4 ! 3 x 2 + . . . .
Plug in x = 1 to obtain 0 = − 1 + 2 ! 1 + 3 ! 2 + 4 ! 3 + . . . .
Moving the -1 over allows us to obtain the result 1 = 2 ! 1 + 3 ! 2 + 4 ! 3 + . . . .
You can solve this without knowing anything about Taylor series or e . Instead, we can solve it by induction.
Let's start by calculating the sum at each step:
We might notice the pattern here. Each step seems to be equal to n ! n ! − 1 . To prove that this is the pattern, let's use induction.
Our base case is the first element in the series: 2 ! 1 . Since that's equal to 2 ! 2 ! − 1 , our base case matches the pattern we're trying to prove. So we can move on to the induction step.
We could also choose to make the base case 1 ! 0 and observe that 1 0 matches our expected pattern as well. To make the inductive step easier, I will assume that the first term in this series is 1 ! 0 , and that 2 ! 1 is the second term.
A 1 = 1 ! 0
A 2 = 2 ! 1
...
A n = n ! n − 1
A n + 1 = n + 1 ! n
...
Let's assume that the sum of the first n terms in the series is S n = n ! n ! − 1 . Now we need to show that the sum of the first n + 1 terms is equal to ( n + 1 ) ! ( n + 1 ) ! − 1 .
Let's add A n + 1 to our assumed sum:
S n + 1 = S n + A n + 1 S n + 1 = S n + ( n + 1 ) ! n S n + 1 = n ! n ! − 1 + ( n + 1 ) ! n = ( n + 1 ) ! ( n ! − 1 ) ∗ ( n + 1 ) + ( n + 1 ) ! n = ( n + 1 ) ! n ! ∗ ( n + 1 ) − ( n + 1 ) + n = ( n + 1 ) ! ( n + 1 ) ! − n − 1 + n = ( n + 1 ) ! ( n + 1 ) ! − 1
Thus the first n + 1 terms in our series sums to: S n + 1 = ( n + 1 ) ! ( n + 1 ) ! − 1 and we have proven our induction step to be true.
Since our base case and induction step are both true, we conclude that S n = n ! n ! − 1 . We can simplify this to S n = 1 − n ! 1 . So as n goes to infinite, the sum becomes S ∞ = 1 − ∞ 1 = 1 − 0 = 1 .
Thus our series converges to 1 .
Another solution (maybe less elegant, but that requires less knowledge) is:
It can easily be shown that:
i = 1 ∑ n ( i + 1 ) ! i = 2 1 + 2 1 ( 3 2 + 3 1 ( 4 3 + 4 1 ( . . . ( n + 1 n ) ) ) )
Hence, when n → ∞ , the inner bracket becomes 1 , hence the one around it... and so on. The sum then becomes:
2 1 + 2 1 ⋅ 1 = 1
Impressive reasoning!
I would like your solution if you would show how "it can easily be shown"
Log in to reply
Sure! The sum is equivalent to:
i = 1 ∑ n ( i + 1 ) ! i = 2 1 + 3 1 + 2 ⋅ 4 1 + 2 ⋅ 3 ⋅ 5 1 + 2 ⋅ 3 ⋅ 4 ⋅ 6 1 + . . .
This last sum, strongly looks like:
1 + 2 1 + 2 ⋅ 3 1 + 2 ⋅ 3 ⋅ 4 1 + 2 ⋅ 3 ⋅ 4 ⋅ 5 1 + . . .
Which, I hope you can see why, can be written as:
1 + 2 1 ( 1 + 3 1 ( 1 + 4 1 ( . . . ) ) )
The terms of the series here are actually the "1" multiplied by all the fractions outside their bracket. To make it equal to our series, you only need to change the largest factor of the denominator of every term, to do that, you only need to change the "1's" by n + 1 n , by doing so the n-th term become ( i = 1 ∏ n i 1 ) ⋅ n + 1 n , exactly like in our series.
Observe that S 1 = 2 ! 2 ! − 1 and that generally S n = ( n + 1 ) ! ( n + 1 ) ! − 1 (where S n is the sum of the n first elements)
Prove it using induction if you like to. (I left it out)
Conclude that lim n → ∞ S n = 1
The basic approch with differentiation, Write expansion of e^x To match the question, divide e^x/ x and take differentiation then substitute x = 1
We will use that:
e x = n = 0 ∑ ∞ n ! x n
We will look at the function f below (the idea is to plug x = 1 ):
f ( x ) = n = 1 ∑ ∞ ( n − 1 ) n ! x n f ( x ) = x × n = 1 ∑ ∞ ( n − 1 ) ! x n − 1 + n = 1 ∑ ∞ n ! x n f ( x ) = x e x + e x − 1
Plugging x = 1 :
n = 1 ∑ ∞ n ! n − 1 = 1 × e 1 − e 1 + 1 = 1
Note: the absolute convergence for all real x of all the series used can be easily proved using comparison with Riemann series.
e^x=1+x+x^2/2!+... therefore (e^x-1)/x=1+x/2!+x^2/3!... suppose x=1 after derivation of equation’s two sides, we got the answer!
Define f(x) = x^2/2! + 2x^3/3! + 3x^4/4! +......... Then f'(x) =x + x^2 + x^3/2! + x^4/3! +....... = X(1 + x + x^2/2! + x^3/3! + ......) =xe^x. Then f(x) = integral of xe^x(dx). Integrating by parts, f(x) = xe^x - e^x + C. Since f(0) =0, C= 1, and f(x) = 1 + xe^x - e^x, and f(1) = 1. Ed Gray
use e x = ( 1 + x / 1 ! + x 2 / 2 ! + x 3 / 3 ! + . . . ) then divide whole equation by x and differentiate wrt to x . now put x = 1 . the answer comes out to be as 1
Problem Loading...
Note Loading...
Set Loading...
S = n = 1 ∑ ∞ ( n + 1 ) ! n = n = 1 ∑ ∞ ( n + 1 ) ! ( n + 1 ) − 1 = n = 1 ∑ ∞ n ! 1 − n = 1 ∑ ∞ ( n + 1 ) ! 1 = n = 1 ∑ ∞ n ! 1 − n = 2 ∑ ∞ n ! 1 = 1 ! 1 = 1 Note that both n = 1 ∑ ∞ n ! 1 and n = 1 ∑ ∞ ( n + 1 ) ! 1 converge.