Could someone explain the proof of Cake Numbers?
$begingroup$
Is there a graphical, or visual, proof of the Cake Numbers? And if so, could someone explain it to me? I am looking for an explanation similar to that for the Lazy Caterer's sequence on Wikipedia: https://en.wikipedia.org/wiki/Lazy_caterer%27s_sequence
Thanks
sequences-and-series proof-explanation
asked Jan 12 at 11:52
BanchettiBanchetti
1
$endgroup$
add a comment |
$begingroup$
Is there a graphical, or visual, proof of the Cake Numbers? And if so, could someone explain it to me? I am looking for an explanation similar to that for the Lazy Caterer's sequence on Wikipedia: https://en.wikipedia.org/wiki/Lazy_caterer%27s_sequence
Thanks
sequences-and-series proof-explanation
asked Jan 12 at 11:52
BanchettiBanchetti
1
$endgroup$
$begingroup$
The Cake Numbers $1,2,4,8,15,26,...$ describe how many pieces can be formed by making $nge 0$ straight cuts into a cake or a ball. The formula is $binom{n}{0}+binom{n}{1}+binom{n}{2}+binom{n}{3}$, with terms being zero of course when the second argument exceeds the first.
$endgroup$
– Oscar Lanzi
Jan 12 at 14:34
add a comment |
$begingroup$
Is there a graphical, or visual, proof of the Cake Numbers? And if so, could someone explain it to me? I am looking for an explanation similar to that for the Lazy Caterer's sequence on Wikipedia: https://en.wikipedia.org/wiki/Lazy_caterer%27s_sequence
Thanks
sequences-and-series proof-explanation
asked Jan 12 at 11:52
BanchettiBanchetti
1
$endgroup$
Is there a graphical, or visual, proof of the Cake Numbers? And if so, could someone explain it to me? I am looking for an explanation similar to that for the Lazy Caterer's sequence on Wikipedia: https://en.wikipedia.org/wiki/Lazy_caterer%27s_sequence
Thanks
sequences-and-series proof-explanation
sequences-and-series proof-explanation
asked Jan 12 at 11:52
BanchettiBanchetti
1
asked Jan 12 at 11:52
BanchettiBanchetti
1
asked Jan 12 at 11:52
BanchettiBanchetti
1
asked Jan 12 at 11:52
BanchettiBanchetti
1
asked Jan 12 at 11:52
BanchettiBanchetti
1
1
$begingroup$
The Cake Numbers $1,2,4,8,15,26,...$ describe how many pieces can be formed by making $nge 0$ straight cuts into a cake or a ball. The formula is $binom{n}{0}+binom{n}{1}+binom{n}{2}+binom{n}{3}$, with terms being zero of course when the second argument exceeds the first.
$endgroup$
– Oscar Lanzi
Jan 12 at 14:34
add a comment |
$begingroup$
The Cake Numbers $1,2,4,8,15,26,...$ describe how many pieces can be formed by making $nge 0$ straight cuts into a cake or a ball. The formula is $binom{n}{0}+binom{n}{1}+binom{n}{2}+binom{n}{3}$, with terms being zero of course when the second argument exceeds the first.
$endgroup$
– Oscar Lanzi
Jan 12 at 14:34
$begingroup$
The Cake Numbers $1,2,4,8,15,26,...$ describe how many pieces can be formed by making $nge 0$ straight cuts into a cake or a ball. The formula is $binom{n}{0}+binom{n}{1}+binom{n}{2}+binom{n}{3}$, with terms being zero of course when the second argument exceeds the first.
$endgroup$
– Oscar Lanzi
Jan 12 at 14:34
$begingroup$
The Cake Numbers $1,2,4,8,15,26,...$ describe how many pieces can be formed by making $nge 0$ straight cuts into a cake or a ball. The formula is $binom{n}{0}+binom{n}{1}+binom{n}{2}+binom{n}{3}$, with terms being zero of course when the second argument exceeds the first.
$endgroup$
– Oscar Lanzi
Jan 12 at 14:34
add a comment |
0
active
oldest
votes
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%2f3070827%2fcould-someone-explain-the-proof-of-cake-numbers%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
0
active
oldest
votes
0
active
oldest
votes
active
oldest
votes
active
oldest
votes
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%2f3070827%2fcould-someone-explain-the-proof-of-cake-numbers%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$
The Cake Numbers $1,2,4,8,15,26,...$ describe how many pieces can be formed by making $nge 0$ straight cuts into a cake or a ball. The formula is $binom{n}{0}+binom{n}{1}+binom{n}{2}+binom{n}{3}$, with terms being zero of course when the second argument exceeds the first.
$endgroup$
– Oscar Lanzi
Jan 12 at 14:34