How to understand this recursive definition?How to solve this recursive equation?Solve this...
HP P840 HDD RAID 5 many strange drive failures
Synchronized implementation of a bank account in Java
How do hiring committees for research positions view getting "scooped"?
Deletion of copy-ctor & copy-assignment - public, private or protected?
Probably overheated black color SMD pads
How difficult is it to simply disable/disengage the MCAS on Boeing 737 Max 8 & 9 Aircraft?
gerund and noun applications
Hausdorff dimension of the boundary of fibres of Lipschitz maps
Do I need to be arrogant to get ahead?
Should I use acronyms in dialogues before telling the readers what it stands for in fiction?
Violin - Can double stops be played when the strings are not next to each other?
Have the tides ever turned twice on any open problem?
Is there a hypothetical scenario that would make Earth uninhabitable for humans, but not for (the majority of) other animals?
Suggestions on how to spend Shaabath (constructively) alone
What favor did Moody owe Dumbledore?
Writing in a Christian voice
In Aliens, how many people were on LV-426 before the Marines arrived?
Existence of a celestial body big enough for early civilization to be thought of as a second moon
Can other pieces capture a threatening piece and prevent a checkmate?
Is it true that good novels will automatically sell themselves on Amazon (and so on) and there is no need for one to waste time promoting?
Why didn't Héctor fade away after this character died in the movie Coco?
Do I need to consider instance restrictions when showing a language is in P?
Do US professors/group leaders only get a salary, but no group budget?
Can you move over difficult terrain with only 5 feet of movement?
How to understand this recursive definition?
How to solve this recursive equation?Solve this recursionRecursive definition of sequences inverse/equivalency.Prove by induction of recursive sequenceRecursive Definition of a SeriesFactorial Series Written As Recursive DefinitionNot sure if minimization is needed for definition of function 'half', or if primitive recursive definition possibleRecursive sequence is sequence of integersHow to write a recursive definition in a mathematical notation?Recursive definition of Wallis product.
$begingroup$
My question is:
Now know through my Discrete-Mathematics course what recursion is, but this notation confuses me.
$$
mathbf a_n =
begin{cases}
n, & text{for $ 0le n le 2 $ } \
a_{n-3}+a_{n-2}+a_{n-1}, & text{for $ n ge 3 $}
end{cases}
$$
So this is an example of my problem.
discrete-mathematics recursion
New contributor
$endgroup$
add a comment |
$begingroup$
My question is:
Now know through my Discrete-Mathematics course what recursion is, but this notation confuses me.
$$
mathbf a_n =
begin{cases}
n, & text{for $ 0le n le 2 $ } \
a_{n-3}+a_{n-2}+a_{n-1}, & text{for $ n ge 3 $}
end{cases}
$$
So this is an example of my problem.
discrete-mathematics recursion
New contributor
$endgroup$
$begingroup$
What exactly is your problem? Can you say what $a_2$ is? What about $a_4?$
$endgroup$
– saulspatz
Mar 11 at 20:10
$begingroup$
Thanks, I understand it now....
$endgroup$
– bite_Over3ide
Mar 11 at 21:34
$begingroup$
Glad to hear it. Now that I read the accepted answer, I see that your problem was just with the notation. I didn't realize that before.
$endgroup$
– saulspatz
Mar 11 at 21:52
add a comment |
$begingroup$
My question is:
Now know through my Discrete-Mathematics course what recursion is, but this notation confuses me.
$$
mathbf a_n =
begin{cases}
n, & text{for $ 0le n le 2 $ } \
a_{n-3}+a_{n-2}+a_{n-1}, & text{for $ n ge 3 $}
end{cases}
$$
So this is an example of my problem.
discrete-mathematics recursion
New contributor
$endgroup$
My question is:
Now know through my Discrete-Mathematics course what recursion is, but this notation confuses me.
$$
mathbf a_n =
begin{cases}
n, & text{for $ 0le n le 2 $ } \
a_{n-3}+a_{n-2}+a_{n-1}, & text{for $ n ge 3 $}
end{cases}
$$
So this is an example of my problem.
discrete-mathematics recursion
discrete-mathematics recursion
New contributor
New contributor
New contributor
asked Mar 11 at 20:06
bite_Over3idebite_Over3ide
31
31
New contributor
New contributor
$begingroup$
What exactly is your problem? Can you say what $a_2$ is? What about $a_4?$
$endgroup$
– saulspatz
Mar 11 at 20:10
$begingroup$
Thanks, I understand it now....
$endgroup$
– bite_Over3ide
Mar 11 at 21:34
$begingroup$
Glad to hear it. Now that I read the accepted answer, I see that your problem was just with the notation. I didn't realize that before.
$endgroup$
– saulspatz
Mar 11 at 21:52
add a comment |
$begingroup$
What exactly is your problem? Can you say what $a_2$ is? What about $a_4?$
$endgroup$
– saulspatz
Mar 11 at 20:10
$begingroup$
Thanks, I understand it now....
$endgroup$
– bite_Over3ide
Mar 11 at 21:34
$begingroup$
Glad to hear it. Now that I read the accepted answer, I see that your problem was just with the notation. I didn't realize that before.
$endgroup$
– saulspatz
Mar 11 at 21:52
$begingroup$
What exactly is your problem? Can you say what $a_2$ is? What about $a_4?$
$endgroup$
– saulspatz
Mar 11 at 20:10
$begingroup$
What exactly is your problem? Can you say what $a_2$ is? What about $a_4?$
$endgroup$
– saulspatz
Mar 11 at 20:10
$begingroup$
Thanks, I understand it now....
$endgroup$
– bite_Over3ide
Mar 11 at 21:34
$begingroup$
Thanks, I understand it now....
$endgroup$
– bite_Over3ide
Mar 11 at 21:34
$begingroup$
Glad to hear it. Now that I read the accepted answer, I see that your problem was just with the notation. I didn't realize that before.
$endgroup$
– saulspatz
Mar 11 at 21:52
$begingroup$
Glad to hear it. Now that I read the accepted answer, I see that your problem was just with the notation. I didn't realize that before.
$endgroup$
– saulspatz
Mar 11 at 21:52
add a comment |
3 Answers
3
active
oldest
votes
$begingroup$
When an author uses the left-brace and conditions sort of notation you present here, the way to interpret it is to look at the right-hand column first. In this case, the first line says $0leq nleq 2$ so whatever it is saying applies to only $n$ values in that range, namely (if $n$ is assumed to be an integer) to $n=0$, $n=1$ and $n=2$. So the first line tells you that
$$
a_0 = 0
\ a_1 = 1
\a_2 = 2
$$
but it tells you nothing about $a_3$ or $a_4$ or $a_n$ for any other values of the index $n$.
The second line, on the right, says "Now I'm going to tell you about $n_n$ when $n geq 3$," which fortunately comprises all the other values of $n$ not covered by the first line. So for example,
$$
a_3 = a_2 + a_1 + a_0 = 2+1+0 = 3 \
a_4 = a_3+a_2+a_1 = 3+2+1 = 6
$$
but that second line does not apply if you wanted to find $a_2 = a_1 + a_0 + a_{-1}$. (In fact, $a_{-1}$ is left undefined in this definition of the $a_k$.)
$endgroup$
$begingroup$
Thanks, now it make sense...
$endgroup$
– bite_Over3ide
Mar 11 at 21:33
add a comment |
$begingroup$
That means that $a_0=0,a_1=1,a_2=2$ and then you use the definition $a_n =a_{n-3} +a_{n-2}+a_{n-1}$
$endgroup$
$begingroup$
Thank you, I understand it now...
$endgroup$
– bite_Over3ide
Mar 11 at 21:34
add a comment |
$begingroup$
It means what it says. $a_0 = 0; a_1 = 1, a_2 = 2$.
And $a_3 = a_0 + a_1 + a_2$.
And $a_4 = a_1 + a_2 + a_3$.
And $a_5 = a_2 + a_3 + a_4$.
And $a_6 = a_3 + a_4 + a_5$ and so on.
In general: $a_n = a_{n-3} + a_{n-2} + a_{n-1}$.
Would it have made more sense if we had written
$a_{n+3} =a_{n} + a_{n+1} + a_{n+2}$?
$endgroup$
$begingroup$
Yes both make sense now, thank you...
$endgroup$
– bite_Over3ide
Mar 11 at 21:35
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
});
}
});
bite_Over3ide is a new contributor. Be nice, and check out our Code of Conduct.
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%2f3144171%2fhow-to-understand-this-recursive-definition%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
3 Answers
3
active
oldest
votes
3 Answers
3
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
When an author uses the left-brace and conditions sort of notation you present here, the way to interpret it is to look at the right-hand column first. In this case, the first line says $0leq nleq 2$ so whatever it is saying applies to only $n$ values in that range, namely (if $n$ is assumed to be an integer) to $n=0$, $n=1$ and $n=2$. So the first line tells you that
$$
a_0 = 0
\ a_1 = 1
\a_2 = 2
$$
but it tells you nothing about $a_3$ or $a_4$ or $a_n$ for any other values of the index $n$.
The second line, on the right, says "Now I'm going to tell you about $n_n$ when $n geq 3$," which fortunately comprises all the other values of $n$ not covered by the first line. So for example,
$$
a_3 = a_2 + a_1 + a_0 = 2+1+0 = 3 \
a_4 = a_3+a_2+a_1 = 3+2+1 = 6
$$
but that second line does not apply if you wanted to find $a_2 = a_1 + a_0 + a_{-1}$. (In fact, $a_{-1}$ is left undefined in this definition of the $a_k$.)
$endgroup$
$begingroup$
Thanks, now it make sense...
$endgroup$
– bite_Over3ide
Mar 11 at 21:33
add a comment |
$begingroup$
When an author uses the left-brace and conditions sort of notation you present here, the way to interpret it is to look at the right-hand column first. In this case, the first line says $0leq nleq 2$ so whatever it is saying applies to only $n$ values in that range, namely (if $n$ is assumed to be an integer) to $n=0$, $n=1$ and $n=2$. So the first line tells you that
$$
a_0 = 0
\ a_1 = 1
\a_2 = 2
$$
but it tells you nothing about $a_3$ or $a_4$ or $a_n$ for any other values of the index $n$.
The second line, on the right, says "Now I'm going to tell you about $n_n$ when $n geq 3$," which fortunately comprises all the other values of $n$ not covered by the first line. So for example,
$$
a_3 = a_2 + a_1 + a_0 = 2+1+0 = 3 \
a_4 = a_3+a_2+a_1 = 3+2+1 = 6
$$
but that second line does not apply if you wanted to find $a_2 = a_1 + a_0 + a_{-1}$. (In fact, $a_{-1}$ is left undefined in this definition of the $a_k$.)
$endgroup$
$begingroup$
Thanks, now it make sense...
$endgroup$
– bite_Over3ide
Mar 11 at 21:33
add a comment |
$begingroup$
When an author uses the left-brace and conditions sort of notation you present here, the way to interpret it is to look at the right-hand column first. In this case, the first line says $0leq nleq 2$ so whatever it is saying applies to only $n$ values in that range, namely (if $n$ is assumed to be an integer) to $n=0$, $n=1$ and $n=2$. So the first line tells you that
$$
a_0 = 0
\ a_1 = 1
\a_2 = 2
$$
but it tells you nothing about $a_3$ or $a_4$ or $a_n$ for any other values of the index $n$.
The second line, on the right, says "Now I'm going to tell you about $n_n$ when $n geq 3$," which fortunately comprises all the other values of $n$ not covered by the first line. So for example,
$$
a_3 = a_2 + a_1 + a_0 = 2+1+0 = 3 \
a_4 = a_3+a_2+a_1 = 3+2+1 = 6
$$
but that second line does not apply if you wanted to find $a_2 = a_1 + a_0 + a_{-1}$. (In fact, $a_{-1}$ is left undefined in this definition of the $a_k$.)
$endgroup$
When an author uses the left-brace and conditions sort of notation you present here, the way to interpret it is to look at the right-hand column first. In this case, the first line says $0leq nleq 2$ so whatever it is saying applies to only $n$ values in that range, namely (if $n$ is assumed to be an integer) to $n=0$, $n=1$ and $n=2$. So the first line tells you that
$$
a_0 = 0
\ a_1 = 1
\a_2 = 2
$$
but it tells you nothing about $a_3$ or $a_4$ or $a_n$ for any other values of the index $n$.
The second line, on the right, says "Now I'm going to tell you about $n_n$ when $n geq 3$," which fortunately comprises all the other values of $n$ not covered by the first line. So for example,
$$
a_3 = a_2 + a_1 + a_0 = 2+1+0 = 3 \
a_4 = a_3+a_2+a_1 = 3+2+1 = 6
$$
but that second line does not apply if you wanted to find $a_2 = a_1 + a_0 + a_{-1}$. (In fact, $a_{-1}$ is left undefined in this definition of the $a_k$.)
answered Mar 11 at 20:16
Mark FischlerMark Fischler
33.5k12452
33.5k12452
$begingroup$
Thanks, now it make sense...
$endgroup$
– bite_Over3ide
Mar 11 at 21:33
add a comment |
$begingroup$
Thanks, now it make sense...
$endgroup$
– bite_Over3ide
Mar 11 at 21:33
$begingroup$
Thanks, now it make sense...
$endgroup$
– bite_Over3ide
Mar 11 at 21:33
$begingroup$
Thanks, now it make sense...
$endgroup$
– bite_Over3ide
Mar 11 at 21:33
add a comment |
$begingroup$
That means that $a_0=0,a_1=1,a_2=2$ and then you use the definition $a_n =a_{n-3} +a_{n-2}+a_{n-1}$
$endgroup$
$begingroup$
Thank you, I understand it now...
$endgroup$
– bite_Over3ide
Mar 11 at 21:34
add a comment |
$begingroup$
That means that $a_0=0,a_1=1,a_2=2$ and then you use the definition $a_n =a_{n-3} +a_{n-2}+a_{n-1}$
$endgroup$
$begingroup$
Thank you, I understand it now...
$endgroup$
– bite_Over3ide
Mar 11 at 21:34
add a comment |
$begingroup$
That means that $a_0=0,a_1=1,a_2=2$ and then you use the definition $a_n =a_{n-3} +a_{n-2}+a_{n-1}$
$endgroup$
That means that $a_0=0,a_1=1,a_2=2$ and then you use the definition $a_n =a_{n-3} +a_{n-2}+a_{n-1}$
answered Mar 11 at 20:09
JoseSquareJoseSquare
867116
867116
$begingroup$
Thank you, I understand it now...
$endgroup$
– bite_Over3ide
Mar 11 at 21:34
add a comment |
$begingroup$
Thank you, I understand it now...
$endgroup$
– bite_Over3ide
Mar 11 at 21:34
$begingroup$
Thank you, I understand it now...
$endgroup$
– bite_Over3ide
Mar 11 at 21:34
$begingroup$
Thank you, I understand it now...
$endgroup$
– bite_Over3ide
Mar 11 at 21:34
add a comment |
$begingroup$
It means what it says. $a_0 = 0; a_1 = 1, a_2 = 2$.
And $a_3 = a_0 + a_1 + a_2$.
And $a_4 = a_1 + a_2 + a_3$.
And $a_5 = a_2 + a_3 + a_4$.
And $a_6 = a_3 + a_4 + a_5$ and so on.
In general: $a_n = a_{n-3} + a_{n-2} + a_{n-1}$.
Would it have made more sense if we had written
$a_{n+3} =a_{n} + a_{n+1} + a_{n+2}$?
$endgroup$
$begingroup$
Yes both make sense now, thank you...
$endgroup$
– bite_Over3ide
Mar 11 at 21:35
add a comment |
$begingroup$
It means what it says. $a_0 = 0; a_1 = 1, a_2 = 2$.
And $a_3 = a_0 + a_1 + a_2$.
And $a_4 = a_1 + a_2 + a_3$.
And $a_5 = a_2 + a_3 + a_4$.
And $a_6 = a_3 + a_4 + a_5$ and so on.
In general: $a_n = a_{n-3} + a_{n-2} + a_{n-1}$.
Would it have made more sense if we had written
$a_{n+3} =a_{n} + a_{n+1} + a_{n+2}$?
$endgroup$
$begingroup$
Yes both make sense now, thank you...
$endgroup$
– bite_Over3ide
Mar 11 at 21:35
add a comment |
$begingroup$
It means what it says. $a_0 = 0; a_1 = 1, a_2 = 2$.
And $a_3 = a_0 + a_1 + a_2$.
And $a_4 = a_1 + a_2 + a_3$.
And $a_5 = a_2 + a_3 + a_4$.
And $a_6 = a_3 + a_4 + a_5$ and so on.
In general: $a_n = a_{n-3} + a_{n-2} + a_{n-1}$.
Would it have made more sense if we had written
$a_{n+3} =a_{n} + a_{n+1} + a_{n+2}$?
$endgroup$
It means what it says. $a_0 = 0; a_1 = 1, a_2 = 2$.
And $a_3 = a_0 + a_1 + a_2$.
And $a_4 = a_1 + a_2 + a_3$.
And $a_5 = a_2 + a_3 + a_4$.
And $a_6 = a_3 + a_4 + a_5$ and so on.
In general: $a_n = a_{n-3} + a_{n-2} + a_{n-1}$.
Would it have made more sense if we had written
$a_{n+3} =a_{n} + a_{n+1} + a_{n+2}$?
answered Mar 11 at 20:10
fleabloodfleablood
72.7k22788
72.7k22788
$begingroup$
Yes both make sense now, thank you...
$endgroup$
– bite_Over3ide
Mar 11 at 21:35
add a comment |
$begingroup$
Yes both make sense now, thank you...
$endgroup$
– bite_Over3ide
Mar 11 at 21:35
$begingroup$
Yes both make sense now, thank you...
$endgroup$
– bite_Over3ide
Mar 11 at 21:35
$begingroup$
Yes both make sense now, thank you...
$endgroup$
– bite_Over3ide
Mar 11 at 21:35
add a comment |
bite_Over3ide is a new contributor. Be nice, and check out our Code of Conduct.
bite_Over3ide is a new contributor. Be nice, and check out our Code of Conduct.
bite_Over3ide is a new contributor. Be nice, and check out our Code of Conduct.
bite_Over3ide is a new contributor. Be nice, and check out our Code of Conduct.
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%2f3144171%2fhow-to-understand-this-recursive-definition%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$
What exactly is your problem? Can you say what $a_2$ is? What about $a_4?$
$endgroup$
– saulspatz
Mar 11 at 20:10
$begingroup$
Thanks, I understand it now....
$endgroup$
– bite_Over3ide
Mar 11 at 21:34
$begingroup$
Glad to hear it. Now that I read the accepted answer, I see that your problem was just with the notation. I didn't realize that before.
$endgroup$
– saulspatz
Mar 11 at 21:52