Methodology for Solving Recursive Functions Problems :
up vote
0
down vote
favorite
Given that $f(x) = f(x+3)+ x^2 +x -3$ for all real numbers ,
and $f(1)=2$. Find $f(400)$ .
What would be the general approach for these sorts of problems ?
sequences-and-series algebra-precalculus functions arithmetic recursion
asked Nov 22 at 10:21
A.S.O
32
New contributor
A.S.O is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
add a comment |
up vote
0
down vote
favorite
Given that $f(x) = f(x+3)+ x^2 +x -3$ for all real numbers ,
and $f(1)=2$. Find $f(400)$ .
What would be the general approach for these sorts of problems ?
sequences-and-series algebra-precalculus functions arithmetic recursion
asked Nov 22 at 10:21
A.S.O
32
New contributor
A.S.O is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
Did you invent this problem ? I doubt there is a closed-form solution...
– Yves Daoust
Nov 23 at 9:47
@YvesDaoust No, It was in a Russian Math. Olympiad .
– A.S.O
Nov 23 at 9:48
@YvesDaoust I Checked it again. and corrected $+x^2$ instead of $-x^2$ .
– A.S.O
Nov 23 at 9:53
My bad, it is an easy recurrence.
– Yves Daoust
Nov 23 at 9:55
add a comment |
up vote
0
down vote
favorite
up vote
0
down vote
favorite
Given that $f(x) = f(x+3)+ x^2 +x -3$ for all real numbers ,
and $f(1)=2$. Find $f(400)$ .
What would be the general approach for these sorts of problems ?
sequences-and-series algebra-precalculus functions arithmetic recursion
asked Nov 22 at 10:21
A.S.O
32
New contributor
A.S.O is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
Given that $f(x) = f(x+3)+ x^2 +x -3$ for all real numbers ,
and $f(1)=2$. Find $f(400)$ .
What would be the general approach for these sorts of problems ?
sequences-and-series algebra-precalculus functions arithmetic recursion
sequences-and-series algebra-precalculus functions arithmetic recursion
asked Nov 22 at 10:21
A.S.O
32
New contributor
A.S.O is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
asked Nov 22 at 10:21
A.S.O
32
New contributor
A.S.O is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
edited Nov 23 at 9:51
asked Nov 22 at 10:21
A.S.O
32
New contributor
A.S.O is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
asked Nov 22 at 10:21
A.S.O
32
asked Nov 22 at 10:21
A.S.O
32
32
New contributor
A.S.O is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
New contributor
A.S.O is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
A.S.O is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
Did you invent this problem ? I doubt there is a closed-form solution...
– Yves Daoust
Nov 23 at 9:47
@YvesDaoust No, It was in a Russian Math. Olympiad .
– A.S.O
Nov 23 at 9:48
@YvesDaoust I Checked it again. and corrected $+x^2$ instead of $-x^2$ .
– A.S.O
Nov 23 at 9:53
My bad, it is an easy recurrence.
– Yves Daoust
Nov 23 at 9:55
add a comment |
Did you invent this problem ? I doubt there is a closed-form solution...
– Yves Daoust
Nov 23 at 9:47
@YvesDaoust No, It was in a Russian Math. Olympiad .
– A.S.O
Nov 23 at 9:48
@YvesDaoust I Checked it again. and corrected $+x^2$ instead of $-x^2$ .
– A.S.O
Nov 23 at 9:53
My bad, it is an easy recurrence.
– Yves Daoust
Nov 23 at 9:55
Did you invent this problem ? I doubt there is a closed-form solution...
– Yves Daoust
Nov 23 at 9:47
Did you invent this problem ? I doubt there is a closed-form solution...
– Yves Daoust
Nov 23 at 9:47
@YvesDaoust No, It was in a Russian Math. Olympiad .
– A.S.O
Nov 23 at 9:48
@YvesDaoust No, It was in a Russian Math. Olympiad .
– A.S.O
Nov 23 at 9:48
@YvesDaoust I Checked it again. and corrected $+x^2$ instead of $-x^2$ .
– A.S.O
Nov 23 at 9:53
@YvesDaoust I Checked it again. and corrected $+x^2$ instead of $-x^2$ .
– A.S.O
Nov 23 at 9:53
My bad, it is an easy recurrence.
– Yves Daoust
Nov 23 at 9:55
My bad, it is an easy recurrence.
– Yves Daoust
Nov 23 at 9:55
add a comment |
1 Answer
1
active
oldest
votes
up vote
0
down vote
accepted
Hint:
From the given equation,
$$f(x+3)=f(x)-(x^2+x-3)$$
and by induction,
$$f(400)=f(1)-sum_{n=0}^{132}((3n+1)^2+(3n+1)-3)=f(1)-sum_{n=0}^{132}(9n^2+9n-1).$$
The terms of the summation are easily found using the Faulhaber formulas.
edited Nov 23 at 10:24
Yannick Neyt
33
answered Nov 23 at 10:01
Yves Daoust
122k668217
@yannickneyt: right, thanks for the fix.
– Yves Daoust
Nov 23 at 10:25
One needs to know $f(x)$ for all $xin[0,3)$ (or some equivalent set mod $3$) to know the values for all $mathbb{R}$. Since the question only asked for $f(400)$ given $f(1)$ and $400equiv1pmod3$, we're okay.
– robjohn♦
Nov 23 at 14:26
add a comment |
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
up vote
0
down vote
accepted
Hint:
From the given equation,
$$f(x+3)=f(x)-(x^2+x-3)$$
and by induction,
$$f(400)=f(1)-sum_{n=0}^{132}((3n+1)^2+(3n+1)-3)=f(1)-sum_{n=0}^{132}(9n^2+9n-1).$$
The terms of the summation are easily found using the Faulhaber formulas.
edited Nov 23 at 10:24
Yannick Neyt
33
answered Nov 23 at 10:01
Yves Daoust
122k668217
@yannickneyt: right, thanks for the fix.
– Yves Daoust
Nov 23 at 10:25
One needs to know $f(x)$ for all $xin[0,3)$ (or some equivalent set mod $3$) to know the values for all $mathbb{R}$. Since the question only asked for $f(400)$ given $f(1)$ and $400equiv1pmod3$, we're okay.
– robjohn♦
Nov 23 at 14:26
add a comment |
up vote
0
down vote
accepted
Hint:
From the given equation,
$$f(x+3)=f(x)-(x^2+x-3)$$
and by induction,
$$f(400)=f(1)-sum_{n=0}^{132}((3n+1)^2+(3n+1)-3)=f(1)-sum_{n=0}^{132}(9n^2+9n-1).$$
The terms of the summation are easily found using the Faulhaber formulas.
edited Nov 23 at 10:24
Yannick Neyt
33
answered Nov 23 at 10:01
Yves Daoust
122k668217
@yannickneyt: right, thanks for the fix.
– Yves Daoust
Nov 23 at 10:25
One needs to know $f(x)$ for all $xin[0,3)$ (or some equivalent set mod $3$) to know the values for all $mathbb{R}$. Since the question only asked for $f(400)$ given $f(1)$ and $400equiv1pmod3$, we're okay.
– robjohn♦
Nov 23 at 14:26
add a comment |
up vote
0
down vote
accepted
up vote
0
down vote
accepted
Hint:
From the given equation,
$$f(x+3)=f(x)-(x^2+x-3)$$
and by induction,
$$f(400)=f(1)-sum_{n=0}^{132}((3n+1)^2+(3n+1)-3)=f(1)-sum_{n=0}^{132}(9n^2+9n-1).$$
The terms of the summation are easily found using the Faulhaber formulas.
edited Nov 23 at 10:24
Yannick Neyt
33
answered Nov 23 at 10:01
Yves Daoust
122k668217
Hint:
From the given equation,
$$f(x+3)=f(x)-(x^2+x-3)$$
and by induction,
$$f(400)=f(1)-sum_{n=0}^{132}((3n+1)^2+(3n+1)-3)=f(1)-sum_{n=0}^{132}(9n^2+9n-1).$$
The terms of the summation are easily found using the Faulhaber formulas.
edited Nov 23 at 10:24
Yannick Neyt
33
answered Nov 23 at 10:01
Yves Daoust
122k668217
edited Nov 23 at 10:24
Yannick Neyt
33
edited Nov 23 at 10:24
Yannick Neyt
33
edited Nov 23 at 10:24
Yannick Neyt
33
33
answered Nov 23 at 10:01
Yves Daoust
122k668217
answered Nov 23 at 10:01
Yves Daoust
122k668217
answered Nov 23 at 10:01
Yves Daoust
122k668217
122k668217
@yannickneyt: right, thanks for the fix.
– Yves Daoust
Nov 23 at 10:25
One needs to know $f(x)$ for all $xin[0,3)$ (or some equivalent set mod $3$) to know the values for all $mathbb{R}$. Since the question only asked for $f(400)$ given $f(1)$ and $400equiv1pmod3$, we're okay.
– robjohn♦
Nov 23 at 14:26
add a comment |
@yannickneyt: right, thanks for the fix.
– Yves Daoust
Nov 23 at 10:25
One needs to know $f(x)$ for all $xin[0,3)$ (or some equivalent set mod $3$) to know the values for all $mathbb{R}$. Since the question only asked for $f(400)$ given $f(1)$ and $400equiv1pmod3$, we're okay.
– robjohn♦
Nov 23 at 14:26
@yannickneyt: right, thanks for the fix.
– Yves Daoust
Nov 23 at 10:25
@yannickneyt: right, thanks for the fix.
– Yves Daoust
Nov 23 at 10:25
One needs to know $f(x)$ for all $xin[0,3)$ (or some equivalent set mod $3$) to know the values for all $mathbb{R}$. Since the question only asked for $f(400)$ given $f(1)$ and $400equiv1pmod3$, we're okay.
– robjohn♦
Nov 23 at 14:26
One needs to know $f(x)$ for all $xin[0,3)$ (or some equivalent set mod $3$) to know the values for all $mathbb{R}$. Since the question only asked for $f(400)$ given $f(1)$ and $400equiv1pmod3$, we're okay.
– robjohn♦
Nov 23 at 14:26
add a comment |
A.S.O is a new contributor. Be nice, and check out our Code of Conduct.
draft saved
draft discarded
A.S.O is a new contributor. Be nice, and check out our Code of Conduct.
A.S.O is a new contributor. Be nice, and check out our Code of Conduct.
A.S.O is a new contributor. Be nice, and check out our Code of Conduct.
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%2f3008953%2fmethodology-for-solving-recursive-functions-problems%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
Did you invent this problem ? I doubt there is a closed-form solution...
– Yves Daoust
Nov 23 at 9:47
@YvesDaoust No, It was in a Russian Math. Olympiad .
– A.S.O
Nov 23 at 9:48
@YvesDaoust I Checked it again. and corrected $+x^2$ instead of $-x^2$ .
– A.S.O
Nov 23 at 9:53
My bad, it is an easy recurrence.
– Yves Daoust
Nov 23 at 9:55