Show that $sumlimits_{k=1}^infty frac{1}{k(k+1)(k+2)cdots (k+p)}=frac{1}{p!p} $ for every positive integer...
$begingroup$
I have to prove that
$$sum_{k=1}^infty frac{1}{k(k+1)(k+2)cdots (k+p)}=dfrac{1}{p!p}$$
How can I do that?
real-analysis sequences-and-series analysis convergence summation
$endgroup$
|
show 1 more comment
$begingroup$
I have to prove that
$$sum_{k=1}^infty frac{1}{k(k+1)(k+2)cdots (k+p)}=dfrac{1}{p!p}$$
How can I do that?
real-analysis sequences-and-series analysis convergence summation
$endgroup$
2
$begingroup$
what is it? i or k?
$endgroup$
– Jasser
Nov 3 '14 at 12:07
$begingroup$
Sorry, it is k=1 to infinity.
$endgroup$
– Juliane
Nov 3 '14 at 12:08
1
$begingroup$
Are you sure that the result is not $frac{1}{(p-1) p!}$ ?
$endgroup$
– Claude Leibovici
Nov 3 '14 at 12:14
$begingroup$
Im sorry again, I forgot a k in the denominator, so probably your solution is right :D
$endgroup$
– Juliane
Nov 3 '14 at 12:16
$begingroup$
Did you mean 'series'?
$endgroup$
– 0112
Nov 3 '14 at 19:00
|
show 1 more comment
$begingroup$
I have to prove that
$$sum_{k=1}^infty frac{1}{k(k+1)(k+2)cdots (k+p)}=dfrac{1}{p!p}$$
How can I do that?
real-analysis sequences-and-series analysis convergence summation
$endgroup$
I have to prove that
$$sum_{k=1}^infty frac{1}{k(k+1)(k+2)cdots (k+p)}=dfrac{1}{p!p}$$
How can I do that?
real-analysis sequences-and-series analysis convergence summation
real-analysis sequences-and-series analysis convergence summation
edited Jan 1 at 18:36
Did
247k23222458
247k23222458
asked Nov 3 '14 at 12:05
JulianeJuliane
186111
186111
2
$begingroup$
what is it? i or k?
$endgroup$
– Jasser
Nov 3 '14 at 12:07
$begingroup$
Sorry, it is k=1 to infinity.
$endgroup$
– Juliane
Nov 3 '14 at 12:08
1
$begingroup$
Are you sure that the result is not $frac{1}{(p-1) p!}$ ?
$endgroup$
– Claude Leibovici
Nov 3 '14 at 12:14
$begingroup$
Im sorry again, I forgot a k in the denominator, so probably your solution is right :D
$endgroup$
– Juliane
Nov 3 '14 at 12:16
$begingroup$
Did you mean 'series'?
$endgroup$
– 0112
Nov 3 '14 at 19:00
|
show 1 more comment
2
$begingroup$
what is it? i or k?
$endgroup$
– Jasser
Nov 3 '14 at 12:07
$begingroup$
Sorry, it is k=1 to infinity.
$endgroup$
– Juliane
Nov 3 '14 at 12:08
1
$begingroup$
Are you sure that the result is not $frac{1}{(p-1) p!}$ ?
$endgroup$
– Claude Leibovici
Nov 3 '14 at 12:14
$begingroup$
Im sorry again, I forgot a k in the denominator, so probably your solution is right :D
$endgroup$
– Juliane
Nov 3 '14 at 12:16
$begingroup$
Did you mean 'series'?
$endgroup$
– 0112
Nov 3 '14 at 19:00
2
2
$begingroup$
what is it? i or k?
$endgroup$
– Jasser
Nov 3 '14 at 12:07
$begingroup$
what is it? i or k?
$endgroup$
– Jasser
Nov 3 '14 at 12:07
$begingroup$
Sorry, it is k=1 to infinity.
$endgroup$
– Juliane
Nov 3 '14 at 12:08
$begingroup$
Sorry, it is k=1 to infinity.
$endgroup$
– Juliane
Nov 3 '14 at 12:08
1
1
$begingroup$
Are you sure that the result is not $frac{1}{(p-1) p!}$ ?
$endgroup$
– Claude Leibovici
Nov 3 '14 at 12:14
$begingroup$
Are you sure that the result is not $frac{1}{(p-1) p!}$ ?
$endgroup$
– Claude Leibovici
Nov 3 '14 at 12:14
$begingroup$
Im sorry again, I forgot a k in the denominator, so probably your solution is right :D
$endgroup$
– Juliane
Nov 3 '14 at 12:16
$begingroup$
Im sorry again, I forgot a k in the denominator, so probably your solution is right :D
$endgroup$
– Juliane
Nov 3 '14 at 12:16
$begingroup$
Did you mean 'series'?
$endgroup$
– 0112
Nov 3 '14 at 19:00
$begingroup$
Did you mean 'series'?
$endgroup$
– 0112
Nov 3 '14 at 19:00
|
show 1 more comment
2 Answers
2
active
oldest
votes
$begingroup$
Note that
$$
frac{1}{k(k!+!1)(k!+!2)cdots (k!+!p)}=frac{1}{p}!left(frac{1}{k(k!+!1)cdots (k!+!p!-!1)}-frac{1}{(k!+!1)(k!+!2)cdots (k!+!p)}right)
$$
Hence
$$
sum_{k=1}^nfrac{1}{k(k+1)(k+2)cdots (k+p)}=\=frac{1}{p}left(frac{1}{p!}-frac{1}{(n+1)(n+2)(n+3)cdots (n+p)}right) to frac{1}{p!p}
$$
as $ntoinfty$.
Similarly,
$$
sum_{k=1}^nfrac{1}{(k+1)(k+2)cdots (k+p)}=\=frac{1}{p-1}left(frac{1}{p!}--frac{1}{(n+2)(n+2)(n+3)cdots (n+p)}right) to frac{1}{p!(p-1)}
$$
$endgroup$
add a comment |
$begingroup$
Simpler answer: Telescope
for fixed $pinBbb N$ If we let
$u_n =frac1{n(n+1)cdots(n+p-1)}$
then,
$u_n -u_{n+1} = frac1{n(n+1)cdots(n+p-1)}-frac1{(n+1)(n+2)cdots(n+p)}
=frac p{n(n+1)cdots(n+p)}$
Hence By Telescoping sum we get, $$ u_1 = u_1-lim_{nto infty}u_{n+1}=sum_{n=1}^{infty} (u_n -u_{n+1}) = psum_{n=1}^{infty} frac{1}{n(n+1)(n+2)cdots (n+p)}$$
But $u_1 = frac1{1(1+1)cdots(1+p-1)} = frac{1}{p!}$
Hence $$ color{red}{sum_{n=1}^{infty} frac{1}{n(n+1)(n+2)cdots (n+p)} = frac{1}{p!p}}$$
$endgroup$
$begingroup$
Why a Down vote please?
$endgroup$
– Guy Fsone
Oct 30 '17 at 19:45
2
$begingroup$
I did not downvote but your answer is very similar to the first answer, which seems to be quite older then your answer. If the first answer was not correct you should have commented on that instead if giving a new answer.
$endgroup$
– MrYouMath
Oct 30 '17 at 19:55
add a comment |
Your Answer
StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
});
});
}, "mathjax-editing");
StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "69"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});
function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});
}
});
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f1004004%2fshow-that-sum-limits-k-1-infty-frac1kk1k2-cdots-kp-frac1p%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
2 Answers
2
active
oldest
votes
2 Answers
2
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
Note that
$$
frac{1}{k(k!+!1)(k!+!2)cdots (k!+!p)}=frac{1}{p}!left(frac{1}{k(k!+!1)cdots (k!+!p!-!1)}-frac{1}{(k!+!1)(k!+!2)cdots (k!+!p)}right)
$$
Hence
$$
sum_{k=1}^nfrac{1}{k(k+1)(k+2)cdots (k+p)}=\=frac{1}{p}left(frac{1}{p!}-frac{1}{(n+1)(n+2)(n+3)cdots (n+p)}right) to frac{1}{p!p}
$$
as $ntoinfty$.
Similarly,
$$
sum_{k=1}^nfrac{1}{(k+1)(k+2)cdots (k+p)}=\=frac{1}{p-1}left(frac{1}{p!}--frac{1}{(n+2)(n+2)(n+3)cdots (n+p)}right) to frac{1}{p!(p-1)}
$$
$endgroup$
add a comment |
$begingroup$
Note that
$$
frac{1}{k(k!+!1)(k!+!2)cdots (k!+!p)}=frac{1}{p}!left(frac{1}{k(k!+!1)cdots (k!+!p!-!1)}-frac{1}{(k!+!1)(k!+!2)cdots (k!+!p)}right)
$$
Hence
$$
sum_{k=1}^nfrac{1}{k(k+1)(k+2)cdots (k+p)}=\=frac{1}{p}left(frac{1}{p!}-frac{1}{(n+1)(n+2)(n+3)cdots (n+p)}right) to frac{1}{p!p}
$$
as $ntoinfty$.
Similarly,
$$
sum_{k=1}^nfrac{1}{(k+1)(k+2)cdots (k+p)}=\=frac{1}{p-1}left(frac{1}{p!}--frac{1}{(n+2)(n+2)(n+3)cdots (n+p)}right) to frac{1}{p!(p-1)}
$$
$endgroup$
add a comment |
$begingroup$
Note that
$$
frac{1}{k(k!+!1)(k!+!2)cdots (k!+!p)}=frac{1}{p}!left(frac{1}{k(k!+!1)cdots (k!+!p!-!1)}-frac{1}{(k!+!1)(k!+!2)cdots (k!+!p)}right)
$$
Hence
$$
sum_{k=1}^nfrac{1}{k(k+1)(k+2)cdots (k+p)}=\=frac{1}{p}left(frac{1}{p!}-frac{1}{(n+1)(n+2)(n+3)cdots (n+p)}right) to frac{1}{p!p}
$$
as $ntoinfty$.
Similarly,
$$
sum_{k=1}^nfrac{1}{(k+1)(k+2)cdots (k+p)}=\=frac{1}{p-1}left(frac{1}{p!}--frac{1}{(n+2)(n+2)(n+3)cdots (n+p)}right) to frac{1}{p!(p-1)}
$$
$endgroup$
Note that
$$
frac{1}{k(k!+!1)(k!+!2)cdots (k!+!p)}=frac{1}{p}!left(frac{1}{k(k!+!1)cdots (k!+!p!-!1)}-frac{1}{(k!+!1)(k!+!2)cdots (k!+!p)}right)
$$
Hence
$$
sum_{k=1}^nfrac{1}{k(k+1)(k+2)cdots (k+p)}=\=frac{1}{p}left(frac{1}{p!}-frac{1}{(n+1)(n+2)(n+3)cdots (n+p)}right) to frac{1}{p!p}
$$
as $ntoinfty$.
Similarly,
$$
sum_{k=1}^nfrac{1}{(k+1)(k+2)cdots (k+p)}=\=frac{1}{p-1}left(frac{1}{p!}--frac{1}{(n+2)(n+2)(n+3)cdots (n+p)}right) to frac{1}{p!(p-1)}
$$
edited Jan 1 at 20:30
answered Nov 3 '14 at 12:15
Yiorgos S. SmyrlisYiorgos S. Smyrlis
63k1384163
63k1384163
add a comment |
add a comment |
$begingroup$
Simpler answer: Telescope
for fixed $pinBbb N$ If we let
$u_n =frac1{n(n+1)cdots(n+p-1)}$
then,
$u_n -u_{n+1} = frac1{n(n+1)cdots(n+p-1)}-frac1{(n+1)(n+2)cdots(n+p)}
=frac p{n(n+1)cdots(n+p)}$
Hence By Telescoping sum we get, $$ u_1 = u_1-lim_{nto infty}u_{n+1}=sum_{n=1}^{infty} (u_n -u_{n+1}) = psum_{n=1}^{infty} frac{1}{n(n+1)(n+2)cdots (n+p)}$$
But $u_1 = frac1{1(1+1)cdots(1+p-1)} = frac{1}{p!}$
Hence $$ color{red}{sum_{n=1}^{infty} frac{1}{n(n+1)(n+2)cdots (n+p)} = frac{1}{p!p}}$$
$endgroup$
$begingroup$
Why a Down vote please?
$endgroup$
– Guy Fsone
Oct 30 '17 at 19:45
2
$begingroup$
I did not downvote but your answer is very similar to the first answer, which seems to be quite older then your answer. If the first answer was not correct you should have commented on that instead if giving a new answer.
$endgroup$
– MrYouMath
Oct 30 '17 at 19:55
add a comment |
$begingroup$
Simpler answer: Telescope
for fixed $pinBbb N$ If we let
$u_n =frac1{n(n+1)cdots(n+p-1)}$
then,
$u_n -u_{n+1} = frac1{n(n+1)cdots(n+p-1)}-frac1{(n+1)(n+2)cdots(n+p)}
=frac p{n(n+1)cdots(n+p)}$
Hence By Telescoping sum we get, $$ u_1 = u_1-lim_{nto infty}u_{n+1}=sum_{n=1}^{infty} (u_n -u_{n+1}) = psum_{n=1}^{infty} frac{1}{n(n+1)(n+2)cdots (n+p)}$$
But $u_1 = frac1{1(1+1)cdots(1+p-1)} = frac{1}{p!}$
Hence $$ color{red}{sum_{n=1}^{infty} frac{1}{n(n+1)(n+2)cdots (n+p)} = frac{1}{p!p}}$$
$endgroup$
$begingroup$
Why a Down vote please?
$endgroup$
– Guy Fsone
Oct 30 '17 at 19:45
2
$begingroup$
I did not downvote but your answer is very similar to the first answer, which seems to be quite older then your answer. If the first answer was not correct you should have commented on that instead if giving a new answer.
$endgroup$
– MrYouMath
Oct 30 '17 at 19:55
add a comment |
$begingroup$
Simpler answer: Telescope
for fixed $pinBbb N$ If we let
$u_n =frac1{n(n+1)cdots(n+p-1)}$
then,
$u_n -u_{n+1} = frac1{n(n+1)cdots(n+p-1)}-frac1{(n+1)(n+2)cdots(n+p)}
=frac p{n(n+1)cdots(n+p)}$
Hence By Telescoping sum we get, $$ u_1 = u_1-lim_{nto infty}u_{n+1}=sum_{n=1}^{infty} (u_n -u_{n+1}) = psum_{n=1}^{infty} frac{1}{n(n+1)(n+2)cdots (n+p)}$$
But $u_1 = frac1{1(1+1)cdots(1+p-1)} = frac{1}{p!}$
Hence $$ color{red}{sum_{n=1}^{infty} frac{1}{n(n+1)(n+2)cdots (n+p)} = frac{1}{p!p}}$$
$endgroup$
Simpler answer: Telescope
for fixed $pinBbb N$ If we let
$u_n =frac1{n(n+1)cdots(n+p-1)}$
then,
$u_n -u_{n+1} = frac1{n(n+1)cdots(n+p-1)}-frac1{(n+1)(n+2)cdots(n+p)}
=frac p{n(n+1)cdots(n+p)}$
Hence By Telescoping sum we get, $$ u_1 = u_1-lim_{nto infty}u_{n+1}=sum_{n=1}^{infty} (u_n -u_{n+1}) = psum_{n=1}^{infty} frac{1}{n(n+1)(n+2)cdots (n+p)}$$
But $u_1 = frac1{1(1+1)cdots(1+p-1)} = frac{1}{p!}$
Hence $$ color{red}{sum_{n=1}^{infty} frac{1}{n(n+1)(n+2)cdots (n+p)} = frac{1}{p!p}}$$
edited Oct 30 '17 at 19:45
answered Oct 30 '17 at 19:37
Guy FsoneGuy Fsone
17.2k42873
17.2k42873
$begingroup$
Why a Down vote please?
$endgroup$
– Guy Fsone
Oct 30 '17 at 19:45
2
$begingroup$
I did not downvote but your answer is very similar to the first answer, which seems to be quite older then your answer. If the first answer was not correct you should have commented on that instead if giving a new answer.
$endgroup$
– MrYouMath
Oct 30 '17 at 19:55
add a comment |
$begingroup$
Why a Down vote please?
$endgroup$
– Guy Fsone
Oct 30 '17 at 19:45
2
$begingroup$
I did not downvote but your answer is very similar to the first answer, which seems to be quite older then your answer. If the first answer was not correct you should have commented on that instead if giving a new answer.
$endgroup$
– MrYouMath
Oct 30 '17 at 19:55
$begingroup$
Why a Down vote please?
$endgroup$
– Guy Fsone
Oct 30 '17 at 19:45
$begingroup$
Why a Down vote please?
$endgroup$
– Guy Fsone
Oct 30 '17 at 19:45
2
2
$begingroup$
I did not downvote but your answer is very similar to the first answer, which seems to be quite older then your answer. If the first answer was not correct you should have commented on that instead if giving a new answer.
$endgroup$
– MrYouMath
Oct 30 '17 at 19:55
$begingroup$
I did not downvote but your answer is very similar to the first answer, which seems to be quite older then your answer. If the first answer was not correct you should have commented on that instead if giving a new answer.
$endgroup$
– MrYouMath
Oct 30 '17 at 19:55
add a comment |
Thanks for contributing an answer to Mathematics Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f1004004%2fshow-that-sum-limits-k-1-infty-frac1kk1k2-cdots-kp-frac1p%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
2
$begingroup$
what is it? i or k?
$endgroup$
– Jasser
Nov 3 '14 at 12:07
$begingroup$
Sorry, it is k=1 to infinity.
$endgroup$
– Juliane
Nov 3 '14 at 12:08
1
$begingroup$
Are you sure that the result is not $frac{1}{(p-1) p!}$ ?
$endgroup$
– Claude Leibovici
Nov 3 '14 at 12:14
$begingroup$
Im sorry again, I forgot a k in the denominator, so probably your solution is right :D
$endgroup$
– Juliane
Nov 3 '14 at 12:16
$begingroup$
Did you mean 'series'?
$endgroup$
– 0112
Nov 3 '14 at 19:00