Mixing
Solving the reccurence method by using substitution
0
$begingroup$
I am having trouble in understanding this example(as the attached the picture below). I basically have 2 questions which these questions are related to each other.
- Is T(N) for N = 1 must equal to 1 for any reccurences case in substitution method by using induction(in basis step)?
- If it is not, then why in the example is equal to 1?
Because if I put N = 1 to the
>> T(N)=2T(N/2)+N the result is not equal to 1 instead of 2.
Can someone explain? Example of attached picture
induction computational-complexity substitution
asked Jan 25 at 3:05
Marfin. FMarfin. F
134
$endgroup$
add a comment |
0
$begingroup$
I am having trouble in understanding this example(as the attached the picture below). I basically have 2 questions which these questions are related to each other.
- Is T(N) for N = 1 must equal to 1 for any reccurences case in substitution method by using induction(in basis step)?
- If it is not, then why in the example is equal to 1?
Because if I put N = 1 to the
>> T(N)=2T(N/2)+N the result is not equal to 1 instead of 2.
Can someone explain? Example of attached picture
induction computational-complexity substitution
asked Jan 25 at 3:05
Marfin. FMarfin. F
134
$endgroup$
$begingroup$
No, it doesn't have to be $1.$ This is the problem statement. It might be anything.
$endgroup$
– saulspatz
Jan 25 at 3:26
$begingroup$
@saulspatz I just noticed it was a problem statement. So is it somekind of hint to guess the answer quicker?
$endgroup$
– Marfin. F
Jan 25 at 3:45
$begingroup$
No, not at all. This is the data for the problem to be solved. We have a function $T$ that obeys the two equations equations given, and we want to find an explicit formula for $T$.
$endgroup$
– saulspatz
Jan 25 at 3:47
$begingroup$
@saulspatz Ah I see. I am actually use this example to solve other reccurence problem which only has 1 equation with similar problem. That is why I am confused by this example but thanks for your explanation, indeed.
$endgroup$
– Marfin. F
Jan 25 at 3:55
add a comment |
0
0
0
$begingroup$
I am having trouble in understanding this example(as the attached the picture below). I basically have 2 questions which these questions are related to each other.
- Is T(N) for N = 1 must equal to 1 for any reccurences case in substitution method by using induction(in basis step)?
- If it is not, then why in the example is equal to 1?
Because if I put N = 1 to the
>> T(N)=2T(N/2)+N the result is not equal to 1 instead of 2.
Can someone explain? Example of attached picture
induction computational-complexity substitution
asked Jan 25 at 3:05
Marfin. FMarfin. F
134
$endgroup$
I am having trouble in understanding this example(as the attached the picture below). I basically have 2 questions which these questions are related to each other.
- Is T(N) for N = 1 must equal to 1 for any reccurences case in substitution method by using induction(in basis step)?
- If it is not, then why in the example is equal to 1?
Because if I put N = 1 to the
>> T(N)=2T(N/2)+N the result is not equal to 1 instead of 2.
Can someone explain? Example of attached picture
induction computational-complexity substitution
induction computational-complexity substitution
asked Jan 25 at 3:05
Marfin. FMarfin. F
134
asked Jan 25 at 3:05
Marfin. FMarfin. F
134
edited Jan 25 at 3:24
Marfin. F
asked Jan 25 at 3:05
Marfin. FMarfin. F
134
asked Jan 25 at 3:05
Marfin. FMarfin. F
134
asked Jan 25 at 3:05
Marfin. FMarfin. F
134
134
$begingroup$
No, it doesn't have to be $1.$ This is the problem statement. It might be anything.
$endgroup$
– saulspatz
Jan 25 at 3:26
$begingroup$
@saulspatz I just noticed it was a problem statement. So is it somekind of hint to guess the answer quicker?
$endgroup$
– Marfin. F
Jan 25 at 3:45
$begingroup$
No, not at all. This is the data for the problem to be solved. We have a function $T$ that obeys the two equations equations given, and we want to find an explicit formula for $T$.
$endgroup$
– saulspatz
Jan 25 at 3:47
$begingroup$
@saulspatz Ah I see. I am actually use this example to solve other reccurence problem which only has 1 equation with similar problem. That is why I am confused by this example but thanks for your explanation, indeed.
$endgroup$
– Marfin. F
Jan 25 at 3:55
add a comment |
$begingroup$
No, it doesn't have to be $1.$ This is the problem statement. It might be anything.
$endgroup$
– saulspatz
Jan 25 at 3:26
$begingroup$
@saulspatz I just noticed it was a problem statement. So is it somekind of hint to guess the answer quicker?
$endgroup$
– Marfin. F
Jan 25 at 3:45
$begingroup$
No, not at all. This is the data for the problem to be solved. We have a function $T$ that obeys the two equations equations given, and we want to find an explicit formula for $T$.
$endgroup$
– saulspatz
Jan 25 at 3:47
$begingroup$
@saulspatz Ah I see. I am actually use this example to solve other reccurence problem which only has 1 equation with similar problem. That is why I am confused by this example but thanks for your explanation, indeed.
$endgroup$
– Marfin. F
Jan 25 at 3:55
$begingroup$
No, it doesn't have to be $1.$ This is the problem statement. It might be anything.
$endgroup$
– saulspatz
Jan 25 at 3:26
$begingroup$
No, it doesn't have to be $1.$ This is the problem statement. It might be anything.
$endgroup$
– saulspatz
Jan 25 at 3:26
$begingroup$
@saulspatz I just noticed it was a problem statement. So is it somekind of hint to guess the answer quicker?
$endgroup$
– Marfin. F
Jan 25 at 3:45
$begingroup$
@saulspatz I just noticed it was a problem statement. So is it somekind of hint to guess the answer quicker?
$endgroup$
– Marfin. F
Jan 25 at 3:45
$begingroup$
No, not at all. This is the data for the problem to be solved. We have a function $T$ that obeys the two equations equations given, and we want to find an explicit formula for $T$.
$endgroup$
– saulspatz
Jan 25 at 3:47
$begingroup$
No, not at all. This is the data for the problem to be solved. We have a function $T$ that obeys the two equations equations given, and we want to find an explicit formula for $T$.
$endgroup$
– saulspatz
Jan 25 at 3:47
$begingroup$
@saulspatz Ah I see. I am actually use this example to solve other reccurence problem which only has 1 equation with similar problem. That is why I am confused by this example but thanks for your explanation, indeed.
$endgroup$
– Marfin. F
Jan 25 at 3:55
$begingroup$
@saulspatz Ah I see. I am actually use this example to solve other reccurence problem which only has 1 equation with similar problem. That is why I am confused by this example but thanks for your explanation, indeed.
$endgroup$
– Marfin. F
Jan 25 at 3:55
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
});
}
});
draft saved
draft discarded
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%2f3086654%2fsolving-the-reccurence-method-by-using-substitution%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
draft saved
draft discarded
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.
draft saved
draft discarded
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%2f3086654%2fsolving-the-reccurence-method-by-using-substitution%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$
No, it doesn't have to be $1.$ This is the problem statement. It might be anything.
$endgroup$
– saulspatz
Jan 25 at 3:26
$begingroup$
@saulspatz I just noticed it was a problem statement. So is it somekind of hint to guess the answer quicker?
$endgroup$
– Marfin. F
Jan 25 at 3:45
$begingroup$
No, not at all. This is the data for the problem to be solved. We have a function $T$ that obeys the two equations equations given, and we want to find an explicit formula for $T$.
$endgroup$
– saulspatz
Jan 25 at 3:47
$begingroup$
@saulspatz Ah I see. I am actually use this example to solve other reccurence problem which only has 1 equation with similar problem. That is why I am confused by this example but thanks for your explanation, indeed.
$endgroup$
– Marfin. F
Jan 25 at 3:55