Solving non-homogeneous recurrence relationships with exponents
up vote
0
down vote
favorite
Find all solutions of the recurrence relation $a_n = 2a_{n-1} + 2n^2$.
I am having trouble with coming up with a guess for $2n^2$. Would it just be $an^2 + bn + c$?
I feel like there's an easier way based on ways to solve other recurrances.
recurrence-relations
add a comment |
up vote
0
down vote
favorite
Find all solutions of the recurrence relation $a_n = 2a_{n-1} + 2n^2$.
I am having trouble with coming up with a guess for $2n^2$. Would it just be $an^2 + bn + c$?
I feel like there's an easier way based on ways to solve other recurrances.
recurrence-relations
add a comment |
up vote
0
down vote
favorite
up vote
0
down vote
favorite
Find all solutions of the recurrence relation $a_n = 2a_{n-1} + 2n^2$.
I am having trouble with coming up with a guess for $2n^2$. Would it just be $an^2 + bn + c$?
I feel like there's an easier way based on ways to solve other recurrances.
recurrence-relations
Find all solutions of the recurrence relation $a_n = 2a_{n-1} + 2n^2$.
I am having trouble with coming up with a guess for $2n^2$. Would it just be $an^2 + bn + c$?
I feel like there's an easier way based on ways to solve other recurrances.
recurrence-relations
recurrence-relations
asked Nov 25 at 21:24
Jersey Fonseca
356
356
add a comment |
add a comment |
1 Answer
1
active
oldest
votes
up vote
0
down vote
If you're familiar with the $Z$-transform you can find a systematic way to solve these kind of relations. Otherwise, a guess of the form
$$
a_n = alpha + beta n + gamma n^2 + delta 2^{n}
$$
The actual solution is
$$
a_n = left(frac{a_1}{2} + 11right) 2^n - 2 n^2 - 8 n -12
$$
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
If you're familiar with the $Z$-transform you can find a systematic way to solve these kind of relations. Otherwise, a guess of the form
$$
a_n = alpha + beta n + gamma n^2 + delta 2^{n}
$$
The actual solution is
$$
a_n = left(frac{a_1}{2} + 11right) 2^n - 2 n^2 - 8 n -12
$$
add a comment |
up vote
0
down vote
If you're familiar with the $Z$-transform you can find a systematic way to solve these kind of relations. Otherwise, a guess of the form
$$
a_n = alpha + beta n + gamma n^2 + delta 2^{n}
$$
The actual solution is
$$
a_n = left(frac{a_1}{2} + 11right) 2^n - 2 n^2 - 8 n -12
$$
add a comment |
up vote
0
down vote
up vote
0
down vote
If you're familiar with the $Z$-transform you can find a systematic way to solve these kind of relations. Otherwise, a guess of the form
$$
a_n = alpha + beta n + gamma n^2 + delta 2^{n}
$$
The actual solution is
$$
a_n = left(frac{a_1}{2} + 11right) 2^n - 2 n^2 - 8 n -12
$$
If you're familiar with the $Z$-transform you can find a systematic way to solve these kind of relations. Otherwise, a guess of the form
$$
a_n = alpha + beta n + gamma n^2 + delta 2^{n}
$$
The actual solution is
$$
a_n = left(frac{a_1}{2} + 11right) 2^n - 2 n^2 - 8 n -12
$$
answered Nov 25 at 22:51
caverac
12.5k21027
12.5k21027
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.
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%2f3013423%2fsolving-non-homogeneous-recurrence-relationships-with-exponents%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