Is there a way to define a recursion such that the rules of the recursion are also subject to change?
up vote
0
down vote
favorite
Is it possible to use recursion to alter the rules of a sequence's own recursion in some way? In my mind it would look something like the composition of many generating functions.
recursion
asked Nov 18 at 7:27
Jayden Rivers
163
add a comment |
up vote
0
down vote
favorite
Is it possible to use recursion to alter the rules of a sequence's own recursion in some way? In my mind it would look something like the composition of many generating functions.
recursion
asked Nov 18 at 7:27
Jayden Rivers
163
You could use piecewise functions over the indices: $x_{n+1} := f(x_n)$ if $n$ is even; $g(x_n)$ if $n$ is odd. And such.
– Rócherz
Nov 18 at 8:11
Thank you very much
– Jayden Rivers
Nov 21 at 9:46
add a comment |
up vote
0
down vote
favorite
up vote
0
down vote
favorite
Is it possible to use recursion to alter the rules of a sequence's own recursion in some way? In my mind it would look something like the composition of many generating functions.
recursion
asked Nov 18 at 7:27
Jayden Rivers
163
Is it possible to use recursion to alter the rules of a sequence's own recursion in some way? In my mind it would look something like the composition of many generating functions.
recursion
recursion
asked Nov 18 at 7:27
Jayden Rivers
163
asked Nov 18 at 7:27
Jayden Rivers
163
asked Nov 18 at 7:27
Jayden Rivers
163
asked Nov 18 at 7:27
Jayden Rivers
163
asked Nov 18 at 7:27
Jayden Rivers
163
163
You could use piecewise functions over the indices: $x_{n+1} := f(x_n)$ if $n$ is even; $g(x_n)$ if $n$ is odd. And such.
– Rócherz
Nov 18 at 8:11
Thank you very much
– Jayden Rivers
Nov 21 at 9:46
add a comment |
You could use piecewise functions over the indices: $x_{n+1} := f(x_n)$ if $n$ is even; $g(x_n)$ if $n$ is odd. And such.
– Rócherz
Nov 18 at 8:11
Thank you very much
– Jayden Rivers
Nov 21 at 9:46
You could use piecewise functions over the indices: $x_{n+1} := f(x_n)$ if $n$ is even; $g(x_n)$ if $n$ is odd. And such.
– Rócherz
Nov 18 at 8:11
You could use piecewise functions over the indices: $x_{n+1} := f(x_n)$ if $n$ is even; $g(x_n)$ if $n$ is odd. And such.
– Rócherz
Nov 18 at 8:11
Thank you very much
– Jayden Rivers
Nov 21 at 9:46
Thank you very much
– Jayden Rivers
Nov 21 at 9:46
add a comment |
active
oldest
votes
active
oldest
votes
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.
Some of your past answers have not been well-received, and you're in danger of being blocked from answering.
Please pay close attention to the following guidance:
- 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.
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%2f3003233%2fis-there-a-way-to-define-a-recursion-such-that-the-rules-of-the-recursion-are-al%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
You could use piecewise functions over the indices: $x_{n+1} := f(x_n)$ if $n$ is even; $g(x_n)$ if $n$ is odd. And such.
– Rócherz
Nov 18 at 8:11
Thank you very much
– Jayden Rivers
Nov 21 at 9:46