A Fibonacci convolution
A Fibonacci convolution. Recall that $$F(x)=sum_{n=0}^infty F_n x^n =frac{x}{1-x-x^2} =frac{1}{sqrt{5}} left(frac{1}{1-Phi x} -frac{1}{1-bar{Phi}x}right).$$
(a) Prove that $displaystyle sum_{n=0}^infty F_{n+1} x^n =frac{1}{1-x-x^2}$.
(b) Prove that $displaystyle sum_{n=0}^infty (2F_{n+1} -F_n)x^n =frac{2-x}{1-x-x^2} =sum_{n=0}^infty (Phi^n +bar{Phi}^n) x^n$.
(c) Prove that $displaystyle 5F(x)^2 =sum_{n=0}^infty binom{n+1}{1} Phi^n x^n -2sum_{n=0}^infty F_{n+1} x^n +sum_{n=0}^infty binom{n+1}{1} bar{Phi}^n x^n$.
(d) Prove that $boldsymbol{displaystyle sum_{k=0}^n F_k F_{n-k} =frac{2n F_{n+1} -(n+1)F_n}{5}}$.
I've gotten through (a)-(c) but I don't know how to start (d).
combinatorics generating-functions convolution fibonacci-numbers
add a comment |
A Fibonacci convolution. Recall that $$F(x)=sum_{n=0}^infty F_n x^n =frac{x}{1-x-x^2} =frac{1}{sqrt{5}} left(frac{1}{1-Phi x} -frac{1}{1-bar{Phi}x}right).$$
(a) Prove that $displaystyle sum_{n=0}^infty F_{n+1} x^n =frac{1}{1-x-x^2}$.
(b) Prove that $displaystyle sum_{n=0}^infty (2F_{n+1} -F_n)x^n =frac{2-x}{1-x-x^2} =sum_{n=0}^infty (Phi^n +bar{Phi}^n) x^n$.
(c) Prove that $displaystyle 5F(x)^2 =sum_{n=0}^infty binom{n+1}{1} Phi^n x^n -2sum_{n=0}^infty F_{n+1} x^n +sum_{n=0}^infty binom{n+1}{1} bar{Phi}^n x^n$.
(d) Prove that $boldsymbol{displaystyle sum_{k=0}^n F_k F_{n-k} =frac{2n F_{n+1} -(n+1)F_n}{5}}$.
I've gotten through (a)-(c) but I don't know how to start (d).
combinatorics generating-functions convolution fibonacci-numbers
1
Start by noting that the convolution is the generating function for $F(x)^2$.
– rogerl
Nov 27 '18 at 21:58
That, or bash it by strong induction on $n$ (as usual for Fibonacci-number identities, going down by $1$ and $2$ in the induction step).
– darij grinberg
Nov 28 '18 at 3:30
add a comment |
A Fibonacci convolution. Recall that $$F(x)=sum_{n=0}^infty F_n x^n =frac{x}{1-x-x^2} =frac{1}{sqrt{5}} left(frac{1}{1-Phi x} -frac{1}{1-bar{Phi}x}right).$$
(a) Prove that $displaystyle sum_{n=0}^infty F_{n+1} x^n =frac{1}{1-x-x^2}$.
(b) Prove that $displaystyle sum_{n=0}^infty (2F_{n+1} -F_n)x^n =frac{2-x}{1-x-x^2} =sum_{n=0}^infty (Phi^n +bar{Phi}^n) x^n$.
(c) Prove that $displaystyle 5F(x)^2 =sum_{n=0}^infty binom{n+1}{1} Phi^n x^n -2sum_{n=0}^infty F_{n+1} x^n +sum_{n=0}^infty binom{n+1}{1} bar{Phi}^n x^n$.
(d) Prove that $boldsymbol{displaystyle sum_{k=0}^n F_k F_{n-k} =frac{2n F_{n+1} -(n+1)F_n}{5}}$.
I've gotten through (a)-(c) but I don't know how to start (d).
combinatorics generating-functions convolution fibonacci-numbers
A Fibonacci convolution. Recall that $$F(x)=sum_{n=0}^infty F_n x^n =frac{x}{1-x-x^2} =frac{1}{sqrt{5}} left(frac{1}{1-Phi x} -frac{1}{1-bar{Phi}x}right).$$
(a) Prove that $displaystyle sum_{n=0}^infty F_{n+1} x^n =frac{1}{1-x-x^2}$.
(b) Prove that $displaystyle sum_{n=0}^infty (2F_{n+1} -F_n)x^n =frac{2-x}{1-x-x^2} =sum_{n=0}^infty (Phi^n +bar{Phi}^n) x^n$.
(c) Prove that $displaystyle 5F(x)^2 =sum_{n=0}^infty binom{n+1}{1} Phi^n x^n -2sum_{n=0}^infty F_{n+1} x^n +sum_{n=0}^infty binom{n+1}{1} bar{Phi}^n x^n$.
(d) Prove that $boldsymbol{displaystyle sum_{k=0}^n F_k F_{n-k} =frac{2n F_{n+1} -(n+1)F_n}{5}}$.
I've gotten through (a)-(c) but I don't know how to start (d).
combinatorics generating-functions convolution fibonacci-numbers
combinatorics generating-functions convolution fibonacci-numbers
edited Nov 28 '18 at 3:29
Rócherz
2,7762721
2,7762721
asked Nov 27 '18 at 21:50
H.BH.B
203
203
1
Start by noting that the convolution is the generating function for $F(x)^2$.
– rogerl
Nov 27 '18 at 21:58
That, or bash it by strong induction on $n$ (as usual for Fibonacci-number identities, going down by $1$ and $2$ in the induction step).
– darij grinberg
Nov 28 '18 at 3:30
add a comment |
1
Start by noting that the convolution is the generating function for $F(x)^2$.
– rogerl
Nov 27 '18 at 21:58
That, or bash it by strong induction on $n$ (as usual for Fibonacci-number identities, going down by $1$ and $2$ in the induction step).
– darij grinberg
Nov 28 '18 at 3:30
1
1
Start by noting that the convolution is the generating function for $F(x)^2$.
– rogerl
Nov 27 '18 at 21:58
Start by noting that the convolution is the generating function for $F(x)^2$.
– rogerl
Nov 27 '18 at 21:58
That, or bash it by strong induction on $n$ (as usual for Fibonacci-number identities, going down by $1$ and $2$ in the induction step).
– darij grinberg
Nov 28 '18 at 3:30
That, or bash it by strong induction on $n$ (as usual for Fibonacci-number identities, going down by $1$ and $2$ in the induction step).
– darij grinberg
Nov 28 '18 at 3:30
add a comment |
1 Answer
1
active
oldest
votes
Since you have already mastered a.) to c.) we can conveniently use the results to prove d.).
We obtain
begin{align*}
color{blue}{5F(x)^2}&=sum_{n=0}^{infty}(n+1)left(Phi^n+bar{Phi}^nright)x^n-2sum_{n=0}^infty F_{n+1}x^ntag{1}\
&=sum_{n=0}^infty(n+1)left(2F_{n+1}-F_nright)x^n-2sum_{n=0}^infty F_{n+1}x^ntag{2}\
&,,color{blue}{=sum_{n=0}^inftyleft(2nF_{n+1}-(n+1)F_nright)x^n}
end{align*}
and d.) follows.
Comment:
In (1) we apply c.) by using $binom{n+1}{1}=n+1$ and collecting the first and the last sum.
In (2) we use from b.) the identity $2F_{n+1}-F_n=Phi^n+bar{Phi}^n$.
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%2f3016349%2fa-fibonacci-convolution%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
Since you have already mastered a.) to c.) we can conveniently use the results to prove d.).
We obtain
begin{align*}
color{blue}{5F(x)^2}&=sum_{n=0}^{infty}(n+1)left(Phi^n+bar{Phi}^nright)x^n-2sum_{n=0}^infty F_{n+1}x^ntag{1}\
&=sum_{n=0}^infty(n+1)left(2F_{n+1}-F_nright)x^n-2sum_{n=0}^infty F_{n+1}x^ntag{2}\
&,,color{blue}{=sum_{n=0}^inftyleft(2nF_{n+1}-(n+1)F_nright)x^n}
end{align*}
and d.) follows.
Comment:
In (1) we apply c.) by using $binom{n+1}{1}=n+1$ and collecting the first and the last sum.
In (2) we use from b.) the identity $2F_{n+1}-F_n=Phi^n+bar{Phi}^n$.
add a comment |
Since you have already mastered a.) to c.) we can conveniently use the results to prove d.).
We obtain
begin{align*}
color{blue}{5F(x)^2}&=sum_{n=0}^{infty}(n+1)left(Phi^n+bar{Phi}^nright)x^n-2sum_{n=0}^infty F_{n+1}x^ntag{1}\
&=sum_{n=0}^infty(n+1)left(2F_{n+1}-F_nright)x^n-2sum_{n=0}^infty F_{n+1}x^ntag{2}\
&,,color{blue}{=sum_{n=0}^inftyleft(2nF_{n+1}-(n+1)F_nright)x^n}
end{align*}
and d.) follows.
Comment:
In (1) we apply c.) by using $binom{n+1}{1}=n+1$ and collecting the first and the last sum.
In (2) we use from b.) the identity $2F_{n+1}-F_n=Phi^n+bar{Phi}^n$.
add a comment |
Since you have already mastered a.) to c.) we can conveniently use the results to prove d.).
We obtain
begin{align*}
color{blue}{5F(x)^2}&=sum_{n=0}^{infty}(n+1)left(Phi^n+bar{Phi}^nright)x^n-2sum_{n=0}^infty F_{n+1}x^ntag{1}\
&=sum_{n=0}^infty(n+1)left(2F_{n+1}-F_nright)x^n-2sum_{n=0}^infty F_{n+1}x^ntag{2}\
&,,color{blue}{=sum_{n=0}^inftyleft(2nF_{n+1}-(n+1)F_nright)x^n}
end{align*}
and d.) follows.
Comment:
In (1) we apply c.) by using $binom{n+1}{1}=n+1$ and collecting the first and the last sum.
In (2) we use from b.) the identity $2F_{n+1}-F_n=Phi^n+bar{Phi}^n$.
Since you have already mastered a.) to c.) we can conveniently use the results to prove d.).
We obtain
begin{align*}
color{blue}{5F(x)^2}&=sum_{n=0}^{infty}(n+1)left(Phi^n+bar{Phi}^nright)x^n-2sum_{n=0}^infty F_{n+1}x^ntag{1}\
&=sum_{n=0}^infty(n+1)left(2F_{n+1}-F_nright)x^n-2sum_{n=0}^infty F_{n+1}x^ntag{2}\
&,,color{blue}{=sum_{n=0}^inftyleft(2nF_{n+1}-(n+1)F_nright)x^n}
end{align*}
and d.) follows.
Comment:
In (1) we apply c.) by using $binom{n+1}{1}=n+1$ and collecting the first and the last sum.
In (2) we use from b.) the identity $2F_{n+1}-F_n=Phi^n+bar{Phi}^n$.
answered Nov 28 '18 at 21:37
Markus ScheuerMarkus Scheuer
60.3k455144
60.3k455144
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.
Some of your past answers have not been well-received, and you're in danger of being blocked from answering.
Please pay close attention to the following guidance:
- 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.
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%2f3016349%2fa-fibonacci-convolution%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
1
Start by noting that the convolution is the generating function for $F(x)^2$.
– rogerl
Nov 27 '18 at 21:58
That, or bash it by strong induction on $n$ (as usual for Fibonacci-number identities, going down by $1$ and $2$ in the induction step).
– darij grinberg
Nov 28 '18 at 3:30