Products and sum of cubes in FibonacciPrincipal term of the Dirichlet Divisor problem, from the work of A.F....



Products and sum of cubes in Fibonacci


Principal term of the Dirichlet Divisor problem, from the work of A.F. Lavrik?Mean number of $n$-simplices per $(n-2)$-simplex in a triangulated $n$-manifold determinant of fibonacci-sum graphssum of three cubes and parametric solutionsSum of consecutive cubesDistinctness of products of Fibonacci numbersFive cubes, Hadamard and ShklyarskiyGcd of Fibonacci and CatalanLarge cubes in sum/difference setsA link between hooks and contents: Part II













1












$begingroup$


Consider the familiar sequence of Fibonacci numbers: $F_0=0, F_1=1, F_n=F_{n-1}+F_{n-2}$.



Although it is rather easy to furnish an algebraic verification of the below identity, I wish to see a different approach. Hence,




QUESTION. Is there a combinatorial or more conceptual reason for this "pretty" identity?
$$F_nF_{n-1}F_{n-2}=frac{F_n^3-F_{n-1}^3-F_{n-2}^3}3.$$




Caveat. I'm open to as many alternative replies, of course.



Remark. The motivation comes as follows. Define $F_n!=F_1cdots F_n$ and $F_0!=1$. Further, $binom{n}k_F:=frac{F_n!}{F_k!cdot F_{n-k}!}$. Then, I was studying these coefficients and was lead to
$$binom{n}3_F=frac{F_n^3-F_{n-1}^3-F_{n-2}^3}{3!}.$$






nt.number-theory reference-request co.combinatorics elementary-proofs combinatorial-identities







share|cite|improve this question











$endgroup$












  • $begingroup$
    I get a different left hand side. Rewrite the n+2 term as the sum of n+1 and n terms, and then compute the difference of cubes and divide by three. Algebraically you get the product of the n term and the n+1 term and (the sum of n+1 and n terms). This seems to have more to do with (a+b)^n - a^n - b^n than with Fibonacci. Gerhard "Unsure Of Any Combinatorial Interpretation" Paseman, 2019.03.26.
    $endgroup$
    – Gerhard Paseman
    5 hours ago












  • $begingroup$
    Thanks, edited accordingly.
    $endgroup$
    – T. Amdeberhan
    5 hours ago






  • 1




    $begingroup$
    $(a+b)^3 - a^3 - b^3 = 3ab(a+b)$. If $a,b$ are consecutive Fibonacci numbers then $a+b$ is the next.
    $endgroup$
    – Noam D. Elkies
    4 hours ago
















1












$begingroup$


Consider the familiar sequence of Fibonacci numbers: $F_0=0, F_1=1, F_n=F_{n-1}+F_{n-2}$.



Although it is rather easy to furnish an algebraic verification of the below identity, I wish to see a different approach. Hence,




QUESTION. Is there a combinatorial or more conceptual reason for this "pretty" identity?
$$F_nF_{n-1}F_{n-2}=frac{F_n^3-F_{n-1}^3-F_{n-2}^3}3.$$




Caveat. I'm open to as many alternative replies, of course.



Remark. The motivation comes as follows. Define $F_n!=F_1cdots F_n$ and $F_0!=1$. Further, $binom{n}k_F:=frac{F_n!}{F_k!cdot F_{n-k}!}$. Then, I was studying these coefficients and was lead to
$$binom{n}3_F=frac{F_n^3-F_{n-1}^3-F_{n-2}^3}{3!}.$$






nt.number-theory reference-request co.combinatorics elementary-proofs combinatorial-identities







share|cite|improve this question











$endgroup$












  • $begingroup$
    I get a different left hand side. Rewrite the n+2 term as the sum of n+1 and n terms, and then compute the difference of cubes and divide by three. Algebraically you get the product of the n term and the n+1 term and (the sum of n+1 and n terms). This seems to have more to do with (a+b)^n - a^n - b^n than with Fibonacci. Gerhard "Unsure Of Any Combinatorial Interpretation" Paseman, 2019.03.26.
    $endgroup$
    – Gerhard Paseman
    5 hours ago












  • $begingroup$
    Thanks, edited accordingly.
    $endgroup$
    – T. Amdeberhan
    5 hours ago






  • 1




    $begingroup$
    $(a+b)^3 - a^3 - b^3 = 3ab(a+b)$. If $a,b$ are consecutive Fibonacci numbers then $a+b$ is the next.
    $endgroup$
    – Noam D. Elkies
    4 hours ago














1












1








1





$begingroup$


Consider the familiar sequence of Fibonacci numbers: $F_0=0, F_1=1, F_n=F_{n-1}+F_{n-2}$.



Although it is rather easy to furnish an algebraic verification of the below identity, I wish to see a different approach. Hence,




QUESTION. Is there a combinatorial or more conceptual reason for this "pretty" identity?
$$F_nF_{n-1}F_{n-2}=frac{F_n^3-F_{n-1}^3-F_{n-2}^3}3.$$




Caveat. I'm open to as many alternative replies, of course.



Remark. The motivation comes as follows. Define $F_n!=F_1cdots F_n$ and $F_0!=1$. Further, $binom{n}k_F:=frac{F_n!}{F_k!cdot F_{n-k}!}$. Then, I was studying these coefficients and was lead to
$$binom{n}3_F=frac{F_n^3-F_{n-1}^3-F_{n-2}^3}{3!}.$$






nt.number-theory reference-request co.combinatorics elementary-proofs combinatorial-identities







share|cite|improve this question











$endgroup$




Consider the familiar sequence of Fibonacci numbers: $F_0=0, F_1=1, F_n=F_{n-1}+F_{n-2}$.



Although it is rather easy to furnish an algebraic verification of the below identity, I wish to see a different approach. Hence,




QUESTION. Is there a combinatorial or more conceptual reason for this "pretty" identity?
$$F_nF_{n-1}F_{n-2}=frac{F_n^3-F_{n-1}^3-F_{n-2}^3}3.$$




Caveat. I'm open to as many alternative replies, of course.



Remark. The motivation comes as follows. Define $F_n!=F_1cdots F_n$ and $F_0!=1$. Further, $binom{n}k_F:=frac{F_n!}{F_k!cdot F_{n-k}!}$. Then, I was studying these coefficients and was lead to
$$binom{n}3_F=frac{F_n^3-F_{n-1}^3-F_{n-2}^3}{3!}.$$






nt.number-theory reference-request co.combinatorics elementary-proofs combinatorial-identities




nt.number-theory reference-request co.combinatorics elementary-proofs combinatorial-identities






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited 5 hours ago







T. Amdeberhan

















asked 6 hours ago









T. AmdeberhanT. Amdeberhan

18k229131




18k229131












  • $begingroup$
    I get a different left hand side. Rewrite the n+2 term as the sum of n+1 and n terms, and then compute the difference of cubes and divide by three. Algebraically you get the product of the n term and the n+1 term and (the sum of n+1 and n terms). This seems to have more to do with (a+b)^n - a^n - b^n than with Fibonacci. Gerhard "Unsure Of Any Combinatorial Interpretation" Paseman, 2019.03.26.
    $endgroup$
    – Gerhard Paseman
    5 hours ago












  • $begingroup$
    Thanks, edited accordingly.
    $endgroup$
    – T. Amdeberhan
    5 hours ago






  • 1




    $begingroup$
    $(a+b)^3 - a^3 - b^3 = 3ab(a+b)$. If $a,b$ are consecutive Fibonacci numbers then $a+b$ is the next.
    $endgroup$
    – Noam D. Elkies
    4 hours ago


















  • $begingroup$
    I get a different left hand side. Rewrite the n+2 term as the sum of n+1 and n terms, and then compute the difference of cubes and divide by three. Algebraically you get the product of the n term and the n+1 term and (the sum of n+1 and n terms). This seems to have more to do with (a+b)^n - a^n - b^n than with Fibonacci. Gerhard "Unsure Of Any Combinatorial Interpretation" Paseman, 2019.03.26.
    $endgroup$
    – Gerhard Paseman
    5 hours ago












  • $begingroup$
    Thanks, edited accordingly.
    $endgroup$
    – T. Amdeberhan
    5 hours ago






  • 1




    $begingroup$
    $(a+b)^3 - a^3 - b^3 = 3ab(a+b)$. If $a,b$ are consecutive Fibonacci numbers then $a+b$ is the next.
    $endgroup$
    – Noam D. Elkies
    4 hours ago
















$begingroup$
I get a different left hand side. Rewrite the n+2 term as the sum of n+1 and n terms, and then compute the difference of cubes and divide by three. Algebraically you get the product of the n term and the n+1 term and (the sum of n+1 and n terms). This seems to have more to do with (a+b)^n - a^n - b^n than with Fibonacci. Gerhard "Unsure Of Any Combinatorial Interpretation" Paseman, 2019.03.26.
$endgroup$
– Gerhard Paseman
5 hours ago






$begingroup$
I get a different left hand side. Rewrite the n+2 term as the sum of n+1 and n terms, and then compute the difference of cubes and divide by three. Algebraically you get the product of the n term and the n+1 term and (the sum of n+1 and n terms). This seems to have more to do with (a+b)^n - a^n - b^n than with Fibonacci. Gerhard "Unsure Of Any Combinatorial Interpretation" Paseman, 2019.03.26.
$endgroup$
– Gerhard Paseman
5 hours ago














$begingroup$
Thanks, edited accordingly.
$endgroup$
– T. Amdeberhan
5 hours ago




$begingroup$
Thanks, edited accordingly.
$endgroup$
– T. Amdeberhan
5 hours ago




1




1




$begingroup$
$(a+b)^3 - a^3 - b^3 = 3ab(a+b)$. If $a,b$ are consecutive Fibonacci numbers then $a+b$ is the next.
$endgroup$
– Noam D. Elkies
4 hours ago




$begingroup$
$(a+b)^3 - a^3 - b^3 = 3ab(a+b)$. If $a,b$ are consecutive Fibonacci numbers then $a+b$ is the next.
$endgroup$
– Noam D. Elkies
4 hours ago










2 Answers
2






active

oldest

votes


















3












$begingroup$

This is just the following identity:
$$a^3+b^3+c^3-3abc=(a+b+c)(a^2+b^2+c^2-ab-bc-ca).$$ Since $$F_n+(-F_{n-1})+(-F_{n-2})=0,$$ your formula follows.






share|cite|improve this answer









$endgroup$









  • 4




    $begingroup$
    Simpler yet: since $F_n = F_{n-1} + F_{n+2}$ it's enough to use the two-variable identity $(a+b)^3 - a^3 - b^3 = 3ab(a+b)$ which is a quick consequence of the binomial expansion of $(a+b)^3$.
    $endgroup$
    – Noam D. Elkies
    4 hours ago



















2












$begingroup$

$F_n$ is the number of compositions (ordered partitions) of $n-1$ into
parts equal to 1 or 2. The number of triples $(a,b,c)$ of such
compositions is $F_n^3$. The number such that $a,b,c$ all begin with 1
is $F_{n-1}^3$. The number such that $a,b,c$ all begin with 2 is
$F_{n-2}^3$. Otherwise either one of $a,b,c$ begins with 1 and the
others begin with 2, or vice versa. There are $3F_{n-1}F_{n-2}^2$ such
triples of the first type. Similarly there are $3F_{n-1}^2F_{n-2}$
of the second type, i.e., one of
$a,b,c$ begins with 2 and the others begin with 1. Hence
begin{eqnarray*} F_n^3 & = & F_{n-1}^3 + F_{n-2}^3
+3(F_{n-1}^2F_{n-2}+F_{n-1}F_{n-2}^2)\ & = &
F_{n-1}^3 + F_{n-2}^3 +3F_{n-1}F_{n-2}(F_{n-1}+F_{n-2})\ & = &
F_{n-1}^3 + F_{n-2}^3 + F_nF_{n-1}F_{n-2}. end{eqnarray*}






share|cite|improve this answer









$endgroup$









  • 1




    $begingroup$
    With the greatest respect, and mostly out of curiosity, would you really prefer such a bijective proof to the algebra in e.g. Elkies's comment?
    $endgroup$
    – Lucia
    30 mins ago






  • 1




    $begingroup$
    If it's simply a matter of proving the identity, then I prefer Elkies. If you want to understand it combinatorially, then a bijective proof is better.
    $endgroup$
    – Richard Stanley
    18 mins ago






  • 1




    $begingroup$
    The OP specified a desire for "combinatorial" or "conceptual" explanations. But the distinction between combinatorics and algebra is blurry here. You have to choose one ball from each of three urns, each containing $a$ amaranth and $b$ blue balls. How many choices don't have all three balls the same color? On the one hand, $(a+b)^3-a^3-b^3$. On the other, choose any cyclic permutation of (amaranth, blue, either) to get $3ab(a+b)$.
    $endgroup$
    – Noam D. Elkies
    17 mins ago











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: "504"
};
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
});


}
});














draft saved

draft discarded


















StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmathoverflow.net%2fquestions%2f326414%2fproducts-and-sum-of-cubes-in-fibonacci%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









3












$begingroup$

This is just the following identity:
$$a^3+b^3+c^3-3abc=(a+b+c)(a^2+b^2+c^2-ab-bc-ca).$$ Since $$F_n+(-F_{n-1})+(-F_{n-2})=0,$$ your formula follows.






share|cite|improve this answer









$endgroup$









  • 4




    $begingroup$
    Simpler yet: since $F_n = F_{n-1} + F_{n+2}$ it's enough to use the two-variable identity $(a+b)^3 - a^3 - b^3 = 3ab(a+b)$ which is a quick consequence of the binomial expansion of $(a+b)^3$.
    $endgroup$
    – Noam D. Elkies
    4 hours ago
















3












$begingroup$

This is just the following identity:
$$a^3+b^3+c^3-3abc=(a+b+c)(a^2+b^2+c^2-ab-bc-ca).$$ Since $$F_n+(-F_{n-1})+(-F_{n-2})=0,$$ your formula follows.






share|cite|improve this answer









$endgroup$









  • 4




    $begingroup$
    Simpler yet: since $F_n = F_{n-1} + F_{n+2}$ it's enough to use the two-variable identity $(a+b)^3 - a^3 - b^3 = 3ab(a+b)$ which is a quick consequence of the binomial expansion of $(a+b)^3$.
    $endgroup$
    – Noam D. Elkies
    4 hours ago














3












3








3





$begingroup$

This is just the following identity:
$$a^3+b^3+c^3-3abc=(a+b+c)(a^2+b^2+c^2-ab-bc-ca).$$ Since $$F_n+(-F_{n-1})+(-F_{n-2})=0,$$ your formula follows.






share|cite|improve this answer









$endgroup$



This is just the following identity:
$$a^3+b^3+c^3-3abc=(a+b+c)(a^2+b^2+c^2-ab-bc-ca).$$ Since $$F_n+(-F_{n-1})+(-F_{n-2})=0,$$ your formula follows.







share|cite|improve this answer












share|cite|improve this answer



share|cite|improve this answer










answered 4 hours ago









Cherng-tiao PerngCherng-tiao Perng

660147




660147








  • 4




    $begingroup$
    Simpler yet: since $F_n = F_{n-1} + F_{n+2}$ it's enough to use the two-variable identity $(a+b)^3 - a^3 - b^3 = 3ab(a+b)$ which is a quick consequence of the binomial expansion of $(a+b)^3$.
    $endgroup$
    – Noam D. Elkies
    4 hours ago














  • 4




    $begingroup$
    Simpler yet: since $F_n = F_{n-1} + F_{n+2}$ it's enough to use the two-variable identity $(a+b)^3 - a^3 - b^3 = 3ab(a+b)$ which is a quick consequence of the binomial expansion of $(a+b)^3$.
    $endgroup$
    – Noam D. Elkies
    4 hours ago








4




4




$begingroup$
Simpler yet: since $F_n = F_{n-1} + F_{n+2}$ it's enough to use the two-variable identity $(a+b)^3 - a^3 - b^3 = 3ab(a+b)$ which is a quick consequence of the binomial expansion of $(a+b)^3$.
$endgroup$
– Noam D. Elkies
4 hours ago




$begingroup$
Simpler yet: since $F_n = F_{n-1} + F_{n+2}$ it's enough to use the two-variable identity $(a+b)^3 - a^3 - b^3 = 3ab(a+b)$ which is a quick consequence of the binomial expansion of $(a+b)^3$.
$endgroup$
– Noam D. Elkies
4 hours ago











2












$begingroup$

$F_n$ is the number of compositions (ordered partitions) of $n-1$ into
parts equal to 1 or 2. The number of triples $(a,b,c)$ of such
compositions is $F_n^3$. The number such that $a,b,c$ all begin with 1
is $F_{n-1}^3$. The number such that $a,b,c$ all begin with 2 is
$F_{n-2}^3$. Otherwise either one of $a,b,c$ begins with 1 and the
others begin with 2, or vice versa. There are $3F_{n-1}F_{n-2}^2$ such
triples of the first type. Similarly there are $3F_{n-1}^2F_{n-2}$
of the second type, i.e., one of
$a,b,c$ begins with 2 and the others begin with 1. Hence
begin{eqnarray*} F_n^3 & = & F_{n-1}^3 + F_{n-2}^3
+3(F_{n-1}^2F_{n-2}+F_{n-1}F_{n-2}^2)\ & = &
F_{n-1}^3 + F_{n-2}^3 +3F_{n-1}F_{n-2}(F_{n-1}+F_{n-2})\ & = &
F_{n-1}^3 + F_{n-2}^3 + F_nF_{n-1}F_{n-2}. end{eqnarray*}






share|cite|improve this answer









$endgroup$









  • 1




    $begingroup$
    With the greatest respect, and mostly out of curiosity, would you really prefer such a bijective proof to the algebra in e.g. Elkies's comment?
    $endgroup$
    – Lucia
    30 mins ago






  • 1




    $begingroup$
    If it's simply a matter of proving the identity, then I prefer Elkies. If you want to understand it combinatorially, then a bijective proof is better.
    $endgroup$
    – Richard Stanley
    18 mins ago






  • 1




    $begingroup$
    The OP specified a desire for "combinatorial" or "conceptual" explanations. But the distinction between combinatorics and algebra is blurry here. You have to choose one ball from each of three urns, each containing $a$ amaranth and $b$ blue balls. How many choices don't have all three balls the same color? On the one hand, $(a+b)^3-a^3-b^3$. On the other, choose any cyclic permutation of (amaranth, blue, either) to get $3ab(a+b)$.
    $endgroup$
    – Noam D. Elkies
    17 mins ago
















2












$begingroup$

$F_n$ is the number of compositions (ordered partitions) of $n-1$ into
parts equal to 1 or 2. The number of triples $(a,b,c)$ of such
compositions is $F_n^3$. The number such that $a,b,c$ all begin with 1
is $F_{n-1}^3$. The number such that $a,b,c$ all begin with 2 is
$F_{n-2}^3$. Otherwise either one of $a,b,c$ begins with 1 and the
others begin with 2, or vice versa. There are $3F_{n-1}F_{n-2}^2$ such
triples of the first type. Similarly there are $3F_{n-1}^2F_{n-2}$
of the second type, i.e., one of
$a,b,c$ begins with 2 and the others begin with 1. Hence
begin{eqnarray*} F_n^3 & = & F_{n-1}^3 + F_{n-2}^3
+3(F_{n-1}^2F_{n-2}+F_{n-1}F_{n-2}^2)\ & = &
F_{n-1}^3 + F_{n-2}^3 +3F_{n-1}F_{n-2}(F_{n-1}+F_{n-2})\ & = &
F_{n-1}^3 + F_{n-2}^3 + F_nF_{n-1}F_{n-2}. end{eqnarray*}






share|cite|improve this answer









$endgroup$









  • 1




    $begingroup$
    With the greatest respect, and mostly out of curiosity, would you really prefer such a bijective proof to the algebra in e.g. Elkies's comment?
    $endgroup$
    – Lucia
    30 mins ago






  • 1




    $begingroup$
    If it's simply a matter of proving the identity, then I prefer Elkies. If you want to understand it combinatorially, then a bijective proof is better.
    $endgroup$
    – Richard Stanley
    18 mins ago






  • 1




    $begingroup$
    The OP specified a desire for "combinatorial" or "conceptual" explanations. But the distinction between combinatorics and algebra is blurry here. You have to choose one ball from each of three urns, each containing $a$ amaranth and $b$ blue balls. How many choices don't have all three balls the same color? On the one hand, $(a+b)^3-a^3-b^3$. On the other, choose any cyclic permutation of (amaranth, blue, either) to get $3ab(a+b)$.
    $endgroup$
    – Noam D. Elkies
    17 mins ago














2












2








2





$begingroup$

$F_n$ is the number of compositions (ordered partitions) of $n-1$ into
parts equal to 1 or 2. The number of triples $(a,b,c)$ of such
compositions is $F_n^3$. The number such that $a,b,c$ all begin with 1
is $F_{n-1}^3$. The number such that $a,b,c$ all begin with 2 is
$F_{n-2}^3$. Otherwise either one of $a,b,c$ begins with 1 and the
others begin with 2, or vice versa. There are $3F_{n-1}F_{n-2}^2$ such
triples of the first type. Similarly there are $3F_{n-1}^2F_{n-2}$
of the second type, i.e., one of
$a,b,c$ begins with 2 and the others begin with 1. Hence
begin{eqnarray*} F_n^3 & = & F_{n-1}^3 + F_{n-2}^3
+3(F_{n-1}^2F_{n-2}+F_{n-1}F_{n-2}^2)\ & = &
F_{n-1}^3 + F_{n-2}^3 +3F_{n-1}F_{n-2}(F_{n-1}+F_{n-2})\ & = &
F_{n-1}^3 + F_{n-2}^3 + F_nF_{n-1}F_{n-2}. end{eqnarray*}






share|cite|improve this answer









$endgroup$



$F_n$ is the number of compositions (ordered partitions) of $n-1$ into
parts equal to 1 or 2. The number of triples $(a,b,c)$ of such
compositions is $F_n^3$. The number such that $a,b,c$ all begin with 1
is $F_{n-1}^3$. The number such that $a,b,c$ all begin with 2 is
$F_{n-2}^3$. Otherwise either one of $a,b,c$ begins with 1 and the
others begin with 2, or vice versa. There are $3F_{n-1}F_{n-2}^2$ such
triples of the first type. Similarly there are $3F_{n-1}^2F_{n-2}$
of the second type, i.e., one of
$a,b,c$ begins with 2 and the others begin with 1. Hence
begin{eqnarray*} F_n^3 & = & F_{n-1}^3 + F_{n-2}^3
+3(F_{n-1}^2F_{n-2}+F_{n-1}F_{n-2}^2)\ & = &
F_{n-1}^3 + F_{n-2}^3 +3F_{n-1}F_{n-2}(F_{n-1}+F_{n-2})\ & = &
F_{n-1}^3 + F_{n-2}^3 + F_nF_{n-1}F_{n-2}. end{eqnarray*}







share|cite|improve this answer












share|cite|improve this answer



share|cite|improve this answer










answered 37 mins ago









Richard StanleyRichard Stanley

29k9115189




29k9115189








  • 1




    $begingroup$
    With the greatest respect, and mostly out of curiosity, would you really prefer such a bijective proof to the algebra in e.g. Elkies's comment?
    $endgroup$
    – Lucia
    30 mins ago






  • 1




    $begingroup$
    If it's simply a matter of proving the identity, then I prefer Elkies. If you want to understand it combinatorially, then a bijective proof is better.
    $endgroup$
    – Richard Stanley
    18 mins ago






  • 1




    $begingroup$
    The OP specified a desire for "combinatorial" or "conceptual" explanations. But the distinction between combinatorics and algebra is blurry here. You have to choose one ball from each of three urns, each containing $a$ amaranth and $b$ blue balls. How many choices don't have all three balls the same color? On the one hand, $(a+b)^3-a^3-b^3$. On the other, choose any cyclic permutation of (amaranth, blue, either) to get $3ab(a+b)$.
    $endgroup$
    – Noam D. Elkies
    17 mins ago














  • 1




    $begingroup$
    With the greatest respect, and mostly out of curiosity, would you really prefer such a bijective proof to the algebra in e.g. Elkies's comment?
    $endgroup$
    – Lucia
    30 mins ago






  • 1




    $begingroup$
    If it's simply a matter of proving the identity, then I prefer Elkies. If you want to understand it combinatorially, then a bijective proof is better.
    $endgroup$
    – Richard Stanley
    18 mins ago






  • 1




    $begingroup$
    The OP specified a desire for "combinatorial" or "conceptual" explanations. But the distinction between combinatorics and algebra is blurry here. You have to choose one ball from each of three urns, each containing $a$ amaranth and $b$ blue balls. How many choices don't have all three balls the same color? On the one hand, $(a+b)^3-a^3-b^3$. On the other, choose any cyclic permutation of (amaranth, blue, either) to get $3ab(a+b)$.
    $endgroup$
    – Noam D. Elkies
    17 mins ago








1




1




$begingroup$
With the greatest respect, and mostly out of curiosity, would you really prefer such a bijective proof to the algebra in e.g. Elkies's comment?
$endgroup$
– Lucia
30 mins ago




$begingroup$
With the greatest respect, and mostly out of curiosity, would you really prefer such a bijective proof to the algebra in e.g. Elkies's comment?
$endgroup$
– Lucia
30 mins ago




1




1




$begingroup$
If it's simply a matter of proving the identity, then I prefer Elkies. If you want to understand it combinatorially, then a bijective proof is better.
$endgroup$
– Richard Stanley
18 mins ago




$begingroup$
If it's simply a matter of proving the identity, then I prefer Elkies. If you want to understand it combinatorially, then a bijective proof is better.
$endgroup$
– Richard Stanley
18 mins ago




1




1




$begingroup$
The OP specified a desire for "combinatorial" or "conceptual" explanations. But the distinction between combinatorics and algebra is blurry here. You have to choose one ball from each of three urns, each containing $a$ amaranth and $b$ blue balls. How many choices don't have all three balls the same color? On the one hand, $(a+b)^3-a^3-b^3$. On the other, choose any cyclic permutation of (amaranth, blue, either) to get $3ab(a+b)$.
$endgroup$
– Noam D. Elkies
17 mins ago




$begingroup$
The OP specified a desire for "combinatorial" or "conceptual" explanations. But the distinction between combinatorics and algebra is blurry here. You have to choose one ball from each of three urns, each containing $a$ amaranth and $b$ blue balls. How many choices don't have all three balls the same color? On the one hand, $(a+b)^3-a^3-b^3$. On the other, choose any cyclic permutation of (amaranth, blue, either) to get $3ab(a+b)$.
$endgroup$
– Noam D. Elkies
17 mins ago


















draft saved

draft discarded




















































Thanks for contributing an answer to MathOverflow!


  • 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.




draft saved


draft discarded














StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmathoverflow.net%2fquestions%2f326414%2fproducts-and-sum-of-cubes-in-fibonacci%23new-answer', 'question_page');
}
);

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







-

Popular posts from this blog

What is the “three and three hundred thousand syndrome”?Who wrote the book Arena?What five creatures were...

Image
What happens when the centripetal force is equal and opposite to the centrifugal force? Why is "la Gestapo" feminine? Nested Dynamic SOQL Query How are passwords stolen from companies if they only store hashes? Exposing a company lying about themselves in a tightly knit industry: Is my career at risk on the long run? Can "few" be used as a subject? If so, what is the rule? Why are there no stars visible in cislunar space? categorizing a variable turns it from insignificant to significant Do I need an EFI partition for each 18.04 ubuntu I have on my HD? What are the consequences of changing the number of hours in ...
Read more

Gersau Kjelder | Navigasjonsmeny46°59′0″N 8°31′0″E46°59′0″N...

Image
Tidlegare republikkarSkipingar i 1433Kommunar i SchwyzDistrikt i SchwyzNedleggingar i 1798Stader ved Vierwaldstättersee kommunekantonenSchwyzSveitskm²VierwaldstätterseeLauerz Gersau Kommunevåpenet til Gersau Plassering Styresmakter Land   Sveits Kanton kantonen Schwyz Distrikt Gersau Språk tysk Geografi Flatevidd  - kommune 23,70 km² Innbyggjarar  - kommune (desember 2010)    - folketettleik 2 094   88,4 /km² Koordinatar 46°59′0″N 8°31′0″E  Koordinatar: 46°59′0″N 8°31′0″E  Høgd over havet 435 moh Diverse annan informasjon Postnummer 6442 Nettstad: www.gersau.ch Freistaat und Republik Gersau Fristaten og republikken Gersau By-republikk og alliert protektorat i Det gamle sveitsiske eidsforundet ←   ← 1433–1798 1814–1818 →   → Hovudstad Gersau Styreform Republikk Historisk periode Tidleg moderne tid  - Kjøpte fridom frå ...
Read more

Hestehale Innhaldsliste Hestehale på kvinner | Hestehale på menn | Galleri | Sjå òg |...

Image
Frisyrar frisyrehårhårstrikkhårklemmerøyrethesthovudverkeuropeisk motejobbtreningfletterparykkarungdomsopprørmotkulturmusikararmotorsykkelentusiastarpolitietpolitiskforretningverksemdfiskeflette Hestehale sett bakfrå. Hestehale på ein mannleg indianarleiar. Hestehale er ein frisyre der ein samlar det meste eller alt av langt hår [1] i bakhovudet med ein hårstrikk eller liknande. Avhengig av mote kan det òg vere vanleg å sette opp hestehalen med hårklemmer eller å ha hestehalen hengande på den eine sida av hovudet ved å samle håret ved øyret. Hestehale er ein vanleg frisyre for jenter og for gutar med langt hår. Han har fått namnet sitt etter likskapen med halen på ein hest. For stramme hestehaler kan føre til hårtap, [2] i nokre høve også hovudverk. [3] Innhaldsliste 1 Hestehale på kvinner 2 Hestehale på menn 3 Galleri 4 Sjå òg 5 Bakgrunnsstoff 6 Kjelder Hestehale på kvinner | Ungjente med hestehale som held håret unna ansiktet...
Read more