Mixing
Induction with two unknown variables
$begingroup$
I have been at this problem for a while now, and I cannot wrap my head around it. Any kind of help would be greatly appreciated!
The runtime for a sorting algorithm can be described by $a_{1} = 3$ and
I need to prove, that
For all $n, k in Z^{+}$
I've tried to do the basestep, but even here I'm not sure if it's correct. I hope someone can help with the induction step as well.
Basecase:
$n, k = 2$
$a_{2} =a_{2/2} + a_{2/2} + 3*2+1 = 13 $
$3* 2 * 2^2 + 4 * 2^2 -1 = 39$
$a_n leq 3 * k * 2^k + 4 * 2^k - 1$ applies for the basebase, since $13 leq 39$ is true.
Inductionstep:
?
induction
asked Jan 7 at 14:39
jubibannajubibanna
1293
$endgroup$
add a comment |
$begingroup$
I have been at this problem for a while now, and I cannot wrap my head around it. Any kind of help would be greatly appreciated!
The runtime for a sorting algorithm can be described by $a_{1} = 3$ and
I need to prove, that
For all $n, k in Z^{+}$
I've tried to do the basestep, but even here I'm not sure if it's correct. I hope someone can help with the induction step as well.
Basecase:
$n, k = 2$
$a_{2} =a_{2/2} + a_{2/2} + 3*2+1 = 13 $
$3* 2 * 2^2 + 4 * 2^2 -1 = 39$
$a_n leq 3 * k * 2^k + 4 * 2^k - 1$ applies for the basebase, since $13 leq 39$ is true.
Inductionstep:
?
induction
asked Jan 7 at 14:39
jubibannajubibanna
1293
$endgroup$
$begingroup$
We just saw this one, but I can't find the duplicate.
$endgroup$
– Ross Millikan
Jan 7 at 15:05
$begingroup$
You just need to induct on $k$. The base case should be $k=1$ Then note that $nle2^kimpliesleftlceil{ nover2}rightrceille2^{k-1}$
$endgroup$
– saulspatz
Jan 7 at 15:16
add a comment |
$begingroup$
I have been at this problem for a while now, and I cannot wrap my head around it. Any kind of help would be greatly appreciated!
The runtime for a sorting algorithm can be described by $a_{1} = 3$ and
I need to prove, that
For all $n, k in Z^{+}$
I've tried to do the basestep, but even here I'm not sure if it's correct. I hope someone can help with the induction step as well.
Basecase:
$n, k = 2$
$a_{2} =a_{2/2} + a_{2/2} + 3*2+1 = 13 $
$3* 2 * 2^2 + 4 * 2^2 -1 = 39$
$a_n leq 3 * k * 2^k + 4 * 2^k - 1$ applies for the basebase, since $13 leq 39$ is true.
Inductionstep:
?
induction
asked Jan 7 at 14:39
jubibannajubibanna
1293
$endgroup$
I have been at this problem for a while now, and I cannot wrap my head around it. Any kind of help would be greatly appreciated!
The runtime for a sorting algorithm can be described by $a_{1} = 3$ and
I need to prove, that
For all $n, k in Z^{+}$
I've tried to do the basestep, but even here I'm not sure if it's correct. I hope someone can help with the induction step as well.
Basecase:
$n, k = 2$
$a_{2} =a_{2/2} + a_{2/2} + 3*2+1 = 13 $
$3* 2 * 2^2 + 4 * 2^2 -1 = 39$
$a_n leq 3 * k * 2^k + 4 * 2^k - 1$ applies for the basebase, since $13 leq 39$ is true.
Inductionstep:
?
induction
induction
asked Jan 7 at 14:39
jubibannajubibanna
1293
asked Jan 7 at 14:39
jubibannajubibanna
1293
asked Jan 7 at 14:39
jubibannajubibanna
1293
asked Jan 7 at 14:39
jubibannajubibanna
1293
asked Jan 7 at 14:39
jubibannajubibanna
1293
1293
$begingroup$
We just saw this one, but I can't find the duplicate.
$endgroup$
– Ross Millikan
Jan 7 at 15:05
$begingroup$
You just need to induct on $k$. The base case should be $k=1$ Then note that $nle2^kimpliesleftlceil{ nover2}rightrceille2^{k-1}$
$endgroup$
– saulspatz
Jan 7 at 15:16
add a comment |
$begingroup$
We just saw this one, but I can't find the duplicate.
$endgroup$
– Ross Millikan
Jan 7 at 15:05
$begingroup$
You just need to induct on $k$. The base case should be $k=1$ Then note that $nle2^kimpliesleftlceil{ nover2}rightrceille2^{k-1}$
$endgroup$
– saulspatz
Jan 7 at 15:16
$begingroup$
We just saw this one, but I can't find the duplicate.
$endgroup$
– Ross Millikan
Jan 7 at 15:05
$begingroup$
We just saw this one, but I can't find the duplicate.
$endgroup$
– Ross Millikan
Jan 7 at 15:05
$begingroup$
You just need to induct on $k$. The base case should be $k=1$ Then note that $nle2^kimpliesleftlceil{ nover2}rightrceille2^{k-1}$
$endgroup$
– saulspatz
Jan 7 at 15:16
$begingroup$
You just need to induct on $k$. The base case should be $k=1$ Then note that $nle2^kimpliesleftlceil{ nover2}rightrceille2^{k-1}$
$endgroup$
– saulspatz
Jan 7 at 15:16
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
Try to prove by induction over $k$ that for all $1 leq n leq 2^k$, $a_n leq 3k2^k+2^{k+2}-1$.
answered Jan 7 at 14:47
MindlackMindlack
3,27717
$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%2f3065077%2finduction-with-two-unknown-variables%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
$begingroup$
Try to prove by induction over $k$ that for all $1 leq n leq 2^k$, $a_n leq 3k2^k+2^{k+2}-1$.
answered Jan 7 at 14:47
MindlackMindlack
3,27717
$endgroup$
add a comment |
$begingroup$
Try to prove by induction over $k$ that for all $1 leq n leq 2^k$, $a_n leq 3k2^k+2^{k+2}-1$.
answered Jan 7 at 14:47
MindlackMindlack
3,27717
$endgroup$
add a comment |
$begingroup$
Try to prove by induction over $k$ that for all $1 leq n leq 2^k$, $a_n leq 3k2^k+2^{k+2}-1$.
answered Jan 7 at 14:47
MindlackMindlack
3,27717
$endgroup$
Try to prove by induction over $k$ that for all $1 leq n leq 2^k$, $a_n leq 3k2^k+2^{k+2}-1$.
answered Jan 7 at 14:47
MindlackMindlack
3,27717
answered Jan 7 at 14:47
MindlackMindlack
3,27717
answered Jan 7 at 14:47
MindlackMindlack
3,27717
answered Jan 7 at 14:47
MindlackMindlack
3,27717
3,27717
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%2f3065077%2finduction-with-two-unknown-variables%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$
We just saw this one, but I can't find the duplicate.
$endgroup$
– Ross Millikan
Jan 7 at 15:05
$begingroup$
You just need to induct on $k$. The base case should be $k=1$ Then note that $nle2^kimpliesleftlceil{ nover2}rightrceille2^{k-1}$
$endgroup$
– saulspatz
Jan 7 at 15:16