An alternative way to find the sum of this series?
$begingroup$
$displaystyle frac{4}{20}$+$displaystyle frac{4.7}{20.30}$+$displaystyle frac{4.7.10}{20.30.40}$+...
Now I have tried to solve this in a usual way, first find the nth term $t_n$.
$t_n$= $displaystyle frac{1}{10}$($displaystyle frac{1+3}{2}$) + $displaystyle frac{1}{10^2}$($displaystyle frac{1+3}{2}$)($displaystyle frac{1+6}{3}$) + ...+ $displaystyle frac{1}{10^n}$($displaystyle frac{1+3}{2}$)($displaystyle frac{1+6}{3}$)...($displaystyle frac{1+3n}{n+1}$)
=$displaystyle frac{1}{10^n}prod$(1+$displaystyle frac{2r}{r+1}$) , $r=1,2,..,n$
=$displaystyle prod$($displaystyle frac{3}{10}-displaystyle frac{1}{5(r+1)}$)
thus, $t_n=$ (x-$displaystyle frac{a}{2}$)(x-$displaystyle frac{a}{3}$)...(x-$displaystyle frac{a}{n+1}$), x=$displaystyle frac{3}{10}$, a=$displaystyle frac{1}{5}$
Now to calculate $S_n$, I have to find the product $t_n$, and then take sum over it. But this seems to be a very tedious job. Is there any elegant method(may be using the expansions of any analytic functions) to do this?
real-analysis sequences-and-series
$endgroup$
add a comment |
$begingroup$
$displaystyle frac{4}{20}$+$displaystyle frac{4.7}{20.30}$+$displaystyle frac{4.7.10}{20.30.40}$+...
Now I have tried to solve this in a usual way, first find the nth term $t_n$.
$t_n$= $displaystyle frac{1}{10}$($displaystyle frac{1+3}{2}$) + $displaystyle frac{1}{10^2}$($displaystyle frac{1+3}{2}$)($displaystyle frac{1+6}{3}$) + ...+ $displaystyle frac{1}{10^n}$($displaystyle frac{1+3}{2}$)($displaystyle frac{1+6}{3}$)...($displaystyle frac{1+3n}{n+1}$)
=$displaystyle frac{1}{10^n}prod$(1+$displaystyle frac{2r}{r+1}$) , $r=1,2,..,n$
=$displaystyle prod$($displaystyle frac{3}{10}-displaystyle frac{1}{5(r+1)}$)
thus, $t_n=$ (x-$displaystyle frac{a}{2}$)(x-$displaystyle frac{a}{3}$)...(x-$displaystyle frac{a}{n+1}$), x=$displaystyle frac{3}{10}$, a=$displaystyle frac{1}{5}$
Now to calculate $S_n$, I have to find the product $t_n$, and then take sum over it. But this seems to be a very tedious job. Is there any elegant method(may be using the expansions of any analytic functions) to do this?
real-analysis sequences-and-series
$endgroup$
$begingroup$
This is just binomial series.
$endgroup$
– Nemo
Jan 19 '18 at 17:19
add a comment |
$begingroup$
$displaystyle frac{4}{20}$+$displaystyle frac{4.7}{20.30}$+$displaystyle frac{4.7.10}{20.30.40}$+...
Now I have tried to solve this in a usual way, first find the nth term $t_n$.
$t_n$= $displaystyle frac{1}{10}$($displaystyle frac{1+3}{2}$) + $displaystyle frac{1}{10^2}$($displaystyle frac{1+3}{2}$)($displaystyle frac{1+6}{3}$) + ...+ $displaystyle frac{1}{10^n}$($displaystyle frac{1+3}{2}$)($displaystyle frac{1+6}{3}$)...($displaystyle frac{1+3n}{n+1}$)
=$displaystyle frac{1}{10^n}prod$(1+$displaystyle frac{2r}{r+1}$) , $r=1,2,..,n$
=$displaystyle prod$($displaystyle frac{3}{10}-displaystyle frac{1}{5(r+1)}$)
thus, $t_n=$ (x-$displaystyle frac{a}{2}$)(x-$displaystyle frac{a}{3}$)...(x-$displaystyle frac{a}{n+1}$), x=$displaystyle frac{3}{10}$, a=$displaystyle frac{1}{5}$
Now to calculate $S_n$, I have to find the product $t_n$, and then take sum over it. But this seems to be a very tedious job. Is there any elegant method(may be using the expansions of any analytic functions) to do this?
real-analysis sequences-and-series
$endgroup$
$displaystyle frac{4}{20}$+$displaystyle frac{4.7}{20.30}$+$displaystyle frac{4.7.10}{20.30.40}$+...
Now I have tried to solve this in a usual way, first find the nth term $t_n$.
$t_n$= $displaystyle frac{1}{10}$($displaystyle frac{1+3}{2}$) + $displaystyle frac{1}{10^2}$($displaystyle frac{1+3}{2}$)($displaystyle frac{1+6}{3}$) + ...+ $displaystyle frac{1}{10^n}$($displaystyle frac{1+3}{2}$)($displaystyle frac{1+6}{3}$)...($displaystyle frac{1+3n}{n+1}$)
=$displaystyle frac{1}{10^n}prod$(1+$displaystyle frac{2r}{r+1}$) , $r=1,2,..,n$
=$displaystyle prod$($displaystyle frac{3}{10}-displaystyle frac{1}{5(r+1)}$)
thus, $t_n=$ (x-$displaystyle frac{a}{2}$)(x-$displaystyle frac{a}{3}$)...(x-$displaystyle frac{a}{n+1}$), x=$displaystyle frac{3}{10}$, a=$displaystyle frac{1}{5}$
Now to calculate $S_n$, I have to find the product $t_n$, and then take sum over it. But this seems to be a very tedious job. Is there any elegant method(may be using the expansions of any analytic functions) to do this?
real-analysis sequences-and-series
real-analysis sequences-and-series
edited Jan 18 '18 at 23:22
Mephlip
2121211
2121211
asked Jan 18 '18 at 21:17
Rio DuttaRio Dutta
186111
186111
$begingroup$
This is just binomial series.
$endgroup$
– Nemo
Jan 19 '18 at 17:19
add a comment |
$begingroup$
This is just binomial series.
$endgroup$
– Nemo
Jan 19 '18 at 17:19
$begingroup$
This is just binomial series.
$endgroup$
– Nemo
Jan 19 '18 at 17:19
$begingroup$
This is just binomial series.
$endgroup$
– Nemo
Jan 19 '18 at 17:19
add a comment |
2 Answers
2
active
oldest
votes
$begingroup$
Through Euler's Beta function and the reflection formula for the $Gamma$ function:
$$sum_{ngeq 1}frac{prod_{k=1}^{n}(3k+1)}{10^n(n+1)!}=sum_{ngeq 1}frac{3^nGammaleft(n+frac{4}{3}right)}{10^n Gamma(n+2)Gammaleft(frac{4}{3}right)}=frac{3sqrt{3}}{2pi}sum_{ngeq 1}left(tfrac{3}{10}right)^n Bleft(tfrac{2}{3},n+tfrac{4}{3}right) $$
where
$$ sum_{ngeq 1}left(tfrac{3}{10}right)^n Bleft(tfrac{2}{3},n+tfrac{4}{3}right) = int_{0}^{1}sum_{ngeq 1}left(tfrac{3}{10}right)^n(1-x)^{-1/3}x^{n+1/3},dx=int_{0}^{1}frac{3x^{4/3},dx}{(1-x)^{1/3}(10-3x)} $$
and the last integral can be computed in a explicit way with a bit of patience. The final outcome is
$$sum_{ngeq 1}frac{prod_{k=1}^{n}(3k+1)}{10^n(n+1)!}=color{red}{10sqrt[3]{frac{10}{7}}-11} $$
which can also be proved by invoking Lagrange's inversion theorem or the extended binomial theorem.
$endgroup$
add a comment |
$begingroup$
$newcommand{bbx}[1]{,bbox[15px,border:1px groove navy]{displaystyle{#1}},}
newcommand{braces}[1]{leftlbrace,{#1},rightrbrace}
newcommand{bracks}[1]{leftlbrack,{#1},rightrbrack}
newcommand{dd}{mathrm{d}}
newcommand{ds}[1]{displaystyle{#1}}
newcommand{expo}[1]{,mathrm{e}^{#1},}
newcommand{ic}{mathrm{i}}
newcommand{mc}[1]{mathcal{#1}}
newcommand{mrm}[1]{mathrm{#1}}
newcommand{pars}[1]{left(,{#1},right)}
newcommand{partiald}[3]{frac{partial^{#1} #2}{partial #3^{#1}}}
newcommand{root}[2]{,sqrt[#1]{,{#2},},}
newcommand{totald}[3]{frac{mathrm{d}^{#1} #2}{mathrm{d} #3^{#1}}}
newcommand{verts}[1]{leftvert,{#1},rightvert}$
begin{align}
&bbox[10px,#ffd]{sum_{n = 1}^{infty}{prod_{k = 1}^{n}pars{3k + 1} over 10^{n}pars{n + 1}!}} =
sum_{n = 2}^{infty}{3^{n - 1}
prod_{k = 1}^{n - 1}pars{k + 1/3} over 10^{n - 1},n!}
\[5mm] = &
{10 over 3}sum_{n = 2}^{infty}pars{3 over 10}^{n},
{Gammapars{4/3 + bracks{n - 1}}/Gammapars{4/3} over n!}
\[5mm] = &
{10 over 3},{pars{-2/3}! over Gammapars{4/3}}
sum_{n = 2}^{infty}pars{3 over 10}^{n},
{pars{n - 2/3}! over n!pars{-2/3}!}
\[5mm] = &
{10 over 3},{Gammapars{1/3} over pars{1/3}Gammapars{1/3}}
sum_{n = 2}^{infty}pars{3 over 10}^{n},{n - 2/3 choose n}
\[5mm] = &
10sum_{n = 2}^{infty}pars{3 over 10}^{n}
bracks{{-1/3 choose n}pars{-1}^{n}}
\[5mm] = &
10bracks{%
sum_{n = 0}^{infty}{-1/3 choose n}pars{-,{3 over 10}}^{n}
- overbrace{-1/3 choose 0}^{ds{= 1}} -
overbrace{-1/3 choose 1}^{ds{= -,{1 over 3}}}
pars{-,{3 over 10}}}
\[5mm] = &
10braces{bracks{1 + pars{-,{3 over 10}}}^{-1/3} - 1 - {1 over 10}}
=
bbx{10pars{10 over 7}^{1/3} - 11}
\[5mm] approx & 0.2625
end{align}
$endgroup$
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%2f2611305%2fan-alternative-way-to-find-the-sum-of-this-series%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$
Through Euler's Beta function and the reflection formula for the $Gamma$ function:
$$sum_{ngeq 1}frac{prod_{k=1}^{n}(3k+1)}{10^n(n+1)!}=sum_{ngeq 1}frac{3^nGammaleft(n+frac{4}{3}right)}{10^n Gamma(n+2)Gammaleft(frac{4}{3}right)}=frac{3sqrt{3}}{2pi}sum_{ngeq 1}left(tfrac{3}{10}right)^n Bleft(tfrac{2}{3},n+tfrac{4}{3}right) $$
where
$$ sum_{ngeq 1}left(tfrac{3}{10}right)^n Bleft(tfrac{2}{3},n+tfrac{4}{3}right) = int_{0}^{1}sum_{ngeq 1}left(tfrac{3}{10}right)^n(1-x)^{-1/3}x^{n+1/3},dx=int_{0}^{1}frac{3x^{4/3},dx}{(1-x)^{1/3}(10-3x)} $$
and the last integral can be computed in a explicit way with a bit of patience. The final outcome is
$$sum_{ngeq 1}frac{prod_{k=1}^{n}(3k+1)}{10^n(n+1)!}=color{red}{10sqrt[3]{frac{10}{7}}-11} $$
which can also be proved by invoking Lagrange's inversion theorem or the extended binomial theorem.
$endgroup$
add a comment |
$begingroup$
Through Euler's Beta function and the reflection formula for the $Gamma$ function:
$$sum_{ngeq 1}frac{prod_{k=1}^{n}(3k+1)}{10^n(n+1)!}=sum_{ngeq 1}frac{3^nGammaleft(n+frac{4}{3}right)}{10^n Gamma(n+2)Gammaleft(frac{4}{3}right)}=frac{3sqrt{3}}{2pi}sum_{ngeq 1}left(tfrac{3}{10}right)^n Bleft(tfrac{2}{3},n+tfrac{4}{3}right) $$
where
$$ sum_{ngeq 1}left(tfrac{3}{10}right)^n Bleft(tfrac{2}{3},n+tfrac{4}{3}right) = int_{0}^{1}sum_{ngeq 1}left(tfrac{3}{10}right)^n(1-x)^{-1/3}x^{n+1/3},dx=int_{0}^{1}frac{3x^{4/3},dx}{(1-x)^{1/3}(10-3x)} $$
and the last integral can be computed in a explicit way with a bit of patience. The final outcome is
$$sum_{ngeq 1}frac{prod_{k=1}^{n}(3k+1)}{10^n(n+1)!}=color{red}{10sqrt[3]{frac{10}{7}}-11} $$
which can also be proved by invoking Lagrange's inversion theorem or the extended binomial theorem.
$endgroup$
add a comment |
$begingroup$
Through Euler's Beta function and the reflection formula for the $Gamma$ function:
$$sum_{ngeq 1}frac{prod_{k=1}^{n}(3k+1)}{10^n(n+1)!}=sum_{ngeq 1}frac{3^nGammaleft(n+frac{4}{3}right)}{10^n Gamma(n+2)Gammaleft(frac{4}{3}right)}=frac{3sqrt{3}}{2pi}sum_{ngeq 1}left(tfrac{3}{10}right)^n Bleft(tfrac{2}{3},n+tfrac{4}{3}right) $$
where
$$ sum_{ngeq 1}left(tfrac{3}{10}right)^n Bleft(tfrac{2}{3},n+tfrac{4}{3}right) = int_{0}^{1}sum_{ngeq 1}left(tfrac{3}{10}right)^n(1-x)^{-1/3}x^{n+1/3},dx=int_{0}^{1}frac{3x^{4/3},dx}{(1-x)^{1/3}(10-3x)} $$
and the last integral can be computed in a explicit way with a bit of patience. The final outcome is
$$sum_{ngeq 1}frac{prod_{k=1}^{n}(3k+1)}{10^n(n+1)!}=color{red}{10sqrt[3]{frac{10}{7}}-11} $$
which can also be proved by invoking Lagrange's inversion theorem or the extended binomial theorem.
$endgroup$
Through Euler's Beta function and the reflection formula for the $Gamma$ function:
$$sum_{ngeq 1}frac{prod_{k=1}^{n}(3k+1)}{10^n(n+1)!}=sum_{ngeq 1}frac{3^nGammaleft(n+frac{4}{3}right)}{10^n Gamma(n+2)Gammaleft(frac{4}{3}right)}=frac{3sqrt{3}}{2pi}sum_{ngeq 1}left(tfrac{3}{10}right)^n Bleft(tfrac{2}{3},n+tfrac{4}{3}right) $$
where
$$ sum_{ngeq 1}left(tfrac{3}{10}right)^n Bleft(tfrac{2}{3},n+tfrac{4}{3}right) = int_{0}^{1}sum_{ngeq 1}left(tfrac{3}{10}right)^n(1-x)^{-1/3}x^{n+1/3},dx=int_{0}^{1}frac{3x^{4/3},dx}{(1-x)^{1/3}(10-3x)} $$
and the last integral can be computed in a explicit way with a bit of patience. The final outcome is
$$sum_{ngeq 1}frac{prod_{k=1}^{n}(3k+1)}{10^n(n+1)!}=color{red}{10sqrt[3]{frac{10}{7}}-11} $$
which can also be proved by invoking Lagrange's inversion theorem or the extended binomial theorem.
answered Jan 18 '18 at 21:29
Jack D'AurizioJack D'Aurizio
288k33280659
288k33280659
add a comment |
add a comment |
$begingroup$
$newcommand{bbx}[1]{,bbox[15px,border:1px groove navy]{displaystyle{#1}},}
newcommand{braces}[1]{leftlbrace,{#1},rightrbrace}
newcommand{bracks}[1]{leftlbrack,{#1},rightrbrack}
newcommand{dd}{mathrm{d}}
newcommand{ds}[1]{displaystyle{#1}}
newcommand{expo}[1]{,mathrm{e}^{#1},}
newcommand{ic}{mathrm{i}}
newcommand{mc}[1]{mathcal{#1}}
newcommand{mrm}[1]{mathrm{#1}}
newcommand{pars}[1]{left(,{#1},right)}
newcommand{partiald}[3]{frac{partial^{#1} #2}{partial #3^{#1}}}
newcommand{root}[2]{,sqrt[#1]{,{#2},},}
newcommand{totald}[3]{frac{mathrm{d}^{#1} #2}{mathrm{d} #3^{#1}}}
newcommand{verts}[1]{leftvert,{#1},rightvert}$
begin{align}
&bbox[10px,#ffd]{sum_{n = 1}^{infty}{prod_{k = 1}^{n}pars{3k + 1} over 10^{n}pars{n + 1}!}} =
sum_{n = 2}^{infty}{3^{n - 1}
prod_{k = 1}^{n - 1}pars{k + 1/3} over 10^{n - 1},n!}
\[5mm] = &
{10 over 3}sum_{n = 2}^{infty}pars{3 over 10}^{n},
{Gammapars{4/3 + bracks{n - 1}}/Gammapars{4/3} over n!}
\[5mm] = &
{10 over 3},{pars{-2/3}! over Gammapars{4/3}}
sum_{n = 2}^{infty}pars{3 over 10}^{n},
{pars{n - 2/3}! over n!pars{-2/3}!}
\[5mm] = &
{10 over 3},{Gammapars{1/3} over pars{1/3}Gammapars{1/3}}
sum_{n = 2}^{infty}pars{3 over 10}^{n},{n - 2/3 choose n}
\[5mm] = &
10sum_{n = 2}^{infty}pars{3 over 10}^{n}
bracks{{-1/3 choose n}pars{-1}^{n}}
\[5mm] = &
10bracks{%
sum_{n = 0}^{infty}{-1/3 choose n}pars{-,{3 over 10}}^{n}
- overbrace{-1/3 choose 0}^{ds{= 1}} -
overbrace{-1/3 choose 1}^{ds{= -,{1 over 3}}}
pars{-,{3 over 10}}}
\[5mm] = &
10braces{bracks{1 + pars{-,{3 over 10}}}^{-1/3} - 1 - {1 over 10}}
=
bbx{10pars{10 over 7}^{1/3} - 11}
\[5mm] approx & 0.2625
end{align}
$endgroup$
add a comment |
$begingroup$
$newcommand{bbx}[1]{,bbox[15px,border:1px groove navy]{displaystyle{#1}},}
newcommand{braces}[1]{leftlbrace,{#1},rightrbrace}
newcommand{bracks}[1]{leftlbrack,{#1},rightrbrack}
newcommand{dd}{mathrm{d}}
newcommand{ds}[1]{displaystyle{#1}}
newcommand{expo}[1]{,mathrm{e}^{#1},}
newcommand{ic}{mathrm{i}}
newcommand{mc}[1]{mathcal{#1}}
newcommand{mrm}[1]{mathrm{#1}}
newcommand{pars}[1]{left(,{#1},right)}
newcommand{partiald}[3]{frac{partial^{#1} #2}{partial #3^{#1}}}
newcommand{root}[2]{,sqrt[#1]{,{#2},},}
newcommand{totald}[3]{frac{mathrm{d}^{#1} #2}{mathrm{d} #3^{#1}}}
newcommand{verts}[1]{leftvert,{#1},rightvert}$
begin{align}
&bbox[10px,#ffd]{sum_{n = 1}^{infty}{prod_{k = 1}^{n}pars{3k + 1} over 10^{n}pars{n + 1}!}} =
sum_{n = 2}^{infty}{3^{n - 1}
prod_{k = 1}^{n - 1}pars{k + 1/3} over 10^{n - 1},n!}
\[5mm] = &
{10 over 3}sum_{n = 2}^{infty}pars{3 over 10}^{n},
{Gammapars{4/3 + bracks{n - 1}}/Gammapars{4/3} over n!}
\[5mm] = &
{10 over 3},{pars{-2/3}! over Gammapars{4/3}}
sum_{n = 2}^{infty}pars{3 over 10}^{n},
{pars{n - 2/3}! over n!pars{-2/3}!}
\[5mm] = &
{10 over 3},{Gammapars{1/3} over pars{1/3}Gammapars{1/3}}
sum_{n = 2}^{infty}pars{3 over 10}^{n},{n - 2/3 choose n}
\[5mm] = &
10sum_{n = 2}^{infty}pars{3 over 10}^{n}
bracks{{-1/3 choose n}pars{-1}^{n}}
\[5mm] = &
10bracks{%
sum_{n = 0}^{infty}{-1/3 choose n}pars{-,{3 over 10}}^{n}
- overbrace{-1/3 choose 0}^{ds{= 1}} -
overbrace{-1/3 choose 1}^{ds{= -,{1 over 3}}}
pars{-,{3 over 10}}}
\[5mm] = &
10braces{bracks{1 + pars{-,{3 over 10}}}^{-1/3} - 1 - {1 over 10}}
=
bbx{10pars{10 over 7}^{1/3} - 11}
\[5mm] approx & 0.2625
end{align}
$endgroup$
add a comment |
$begingroup$
$newcommand{bbx}[1]{,bbox[15px,border:1px groove navy]{displaystyle{#1}},}
newcommand{braces}[1]{leftlbrace,{#1},rightrbrace}
newcommand{bracks}[1]{leftlbrack,{#1},rightrbrack}
newcommand{dd}{mathrm{d}}
newcommand{ds}[1]{displaystyle{#1}}
newcommand{expo}[1]{,mathrm{e}^{#1},}
newcommand{ic}{mathrm{i}}
newcommand{mc}[1]{mathcal{#1}}
newcommand{mrm}[1]{mathrm{#1}}
newcommand{pars}[1]{left(,{#1},right)}
newcommand{partiald}[3]{frac{partial^{#1} #2}{partial #3^{#1}}}
newcommand{root}[2]{,sqrt[#1]{,{#2},},}
newcommand{totald}[3]{frac{mathrm{d}^{#1} #2}{mathrm{d} #3^{#1}}}
newcommand{verts}[1]{leftvert,{#1},rightvert}$
begin{align}
&bbox[10px,#ffd]{sum_{n = 1}^{infty}{prod_{k = 1}^{n}pars{3k + 1} over 10^{n}pars{n + 1}!}} =
sum_{n = 2}^{infty}{3^{n - 1}
prod_{k = 1}^{n - 1}pars{k + 1/3} over 10^{n - 1},n!}
\[5mm] = &
{10 over 3}sum_{n = 2}^{infty}pars{3 over 10}^{n},
{Gammapars{4/3 + bracks{n - 1}}/Gammapars{4/3} over n!}
\[5mm] = &
{10 over 3},{pars{-2/3}! over Gammapars{4/3}}
sum_{n = 2}^{infty}pars{3 over 10}^{n},
{pars{n - 2/3}! over n!pars{-2/3}!}
\[5mm] = &
{10 over 3},{Gammapars{1/3} over pars{1/3}Gammapars{1/3}}
sum_{n = 2}^{infty}pars{3 over 10}^{n},{n - 2/3 choose n}
\[5mm] = &
10sum_{n = 2}^{infty}pars{3 over 10}^{n}
bracks{{-1/3 choose n}pars{-1}^{n}}
\[5mm] = &
10bracks{%
sum_{n = 0}^{infty}{-1/3 choose n}pars{-,{3 over 10}}^{n}
- overbrace{-1/3 choose 0}^{ds{= 1}} -
overbrace{-1/3 choose 1}^{ds{= -,{1 over 3}}}
pars{-,{3 over 10}}}
\[5mm] = &
10braces{bracks{1 + pars{-,{3 over 10}}}^{-1/3} - 1 - {1 over 10}}
=
bbx{10pars{10 over 7}^{1/3} - 11}
\[5mm] approx & 0.2625
end{align}
$endgroup$
$newcommand{bbx}[1]{,bbox[15px,border:1px groove navy]{displaystyle{#1}},}
newcommand{braces}[1]{leftlbrace,{#1},rightrbrace}
newcommand{bracks}[1]{leftlbrack,{#1},rightrbrack}
newcommand{dd}{mathrm{d}}
newcommand{ds}[1]{displaystyle{#1}}
newcommand{expo}[1]{,mathrm{e}^{#1},}
newcommand{ic}{mathrm{i}}
newcommand{mc}[1]{mathcal{#1}}
newcommand{mrm}[1]{mathrm{#1}}
newcommand{pars}[1]{left(,{#1},right)}
newcommand{partiald}[3]{frac{partial^{#1} #2}{partial #3^{#1}}}
newcommand{root}[2]{,sqrt[#1]{,{#2},},}
newcommand{totald}[3]{frac{mathrm{d}^{#1} #2}{mathrm{d} #3^{#1}}}
newcommand{verts}[1]{leftvert,{#1},rightvert}$
begin{align}
&bbox[10px,#ffd]{sum_{n = 1}^{infty}{prod_{k = 1}^{n}pars{3k + 1} over 10^{n}pars{n + 1}!}} =
sum_{n = 2}^{infty}{3^{n - 1}
prod_{k = 1}^{n - 1}pars{k + 1/3} over 10^{n - 1},n!}
\[5mm] = &
{10 over 3}sum_{n = 2}^{infty}pars{3 over 10}^{n},
{Gammapars{4/3 + bracks{n - 1}}/Gammapars{4/3} over n!}
\[5mm] = &
{10 over 3},{pars{-2/3}! over Gammapars{4/3}}
sum_{n = 2}^{infty}pars{3 over 10}^{n},
{pars{n - 2/3}! over n!pars{-2/3}!}
\[5mm] = &
{10 over 3},{Gammapars{1/3} over pars{1/3}Gammapars{1/3}}
sum_{n = 2}^{infty}pars{3 over 10}^{n},{n - 2/3 choose n}
\[5mm] = &
10sum_{n = 2}^{infty}pars{3 over 10}^{n}
bracks{{-1/3 choose n}pars{-1}^{n}}
\[5mm] = &
10bracks{%
sum_{n = 0}^{infty}{-1/3 choose n}pars{-,{3 over 10}}^{n}
- overbrace{-1/3 choose 0}^{ds{= 1}} -
overbrace{-1/3 choose 1}^{ds{= -,{1 over 3}}}
pars{-,{3 over 10}}}
\[5mm] = &
10braces{bracks{1 + pars{-,{3 over 10}}}^{-1/3} - 1 - {1 over 10}}
=
bbx{10pars{10 over 7}^{1/3} - 11}
\[5mm] approx & 0.2625
end{align}
edited Dec 29 '18 at 18:39
answered Feb 1 '18 at 20:00
Felix MarinFelix Marin
67.3k7107141
67.3k7107141
add a comment |
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%2f2611305%2fan-alternative-way-to-find-the-sum-of-this-series%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
$begingroup$
This is just binomial series.
$endgroup$
– Nemo
Jan 19 '18 at 17:19