Finding the explicit formula for the recursion $a_n = 2a_{n-1} + a_{n-2}$ with $a_0 = 1$ and $a_1 = 3$?
$begingroup$
I'm trying to find the explicit formula for the recursion $a_n = 2a_{n-1} + a_{n-2}$ with $a_0 = 1$ and $a_1 = 3$. I already found the generating function: $f(x) = frac{1+x}{1-2x-x^2}$, and the characteristic polynomial: $x^2 - 2x + 1 = 0$, which has the roots $1+√2$ and $1-√2$. What is the explicit formula for this recursion, and how do I find it?
generating-functions
$endgroup$
|
show 2 more comments
$begingroup$
I'm trying to find the explicit formula for the recursion $a_n = 2a_{n-1} + a_{n-2}$ with $a_0 = 1$ and $a_1 = 3$. I already found the generating function: $f(x) = frac{1+x}{1-2x-x^2}$, and the characteristic polynomial: $x^2 - 2x + 1 = 0$, which has the roots $1+√2$ and $1-√2$. What is the explicit formula for this recursion, and how do I find it?
generating-functions
$endgroup$
1
$begingroup$
You have done almost everything. Roots of the characteristic polynomial are solutions of the recursion. Your solution is of the form $$a_n = c_1(1+sqrt{2})^n + c_2(1-sqrt{2})^n$$ Plug in the initial values of $a_0$ and $a_1$ to get the values of the constants $c_1$ and $c_2$
$endgroup$
– Sauhard Sharma
Jan 14 at 7:35
$begingroup$
@SauhardSharma Why are you answering in a comment?
$endgroup$
– Arthur
Jan 14 at 7:36
$begingroup$
@Arthur Because I thought that he had done most of the work and required only a small nudge to get to the solution.
$endgroup$
– Sauhard Sharma
Jan 14 at 7:38
$begingroup$
@SauhardSharma Thank you so much!!!
$endgroup$
– Drew Weisserman
Jan 14 at 7:38
1
$begingroup$
@Arthur Mea Culpa then. I won't do this from now on. Thanks for the advice !!!
$endgroup$
– Sauhard Sharma
Jan 14 at 7:42
|
show 2 more comments
$begingroup$
I'm trying to find the explicit formula for the recursion $a_n = 2a_{n-1} + a_{n-2}$ with $a_0 = 1$ and $a_1 = 3$. I already found the generating function: $f(x) = frac{1+x}{1-2x-x^2}$, and the characteristic polynomial: $x^2 - 2x + 1 = 0$, which has the roots $1+√2$ and $1-√2$. What is the explicit formula for this recursion, and how do I find it?
generating-functions
$endgroup$
I'm trying to find the explicit formula for the recursion $a_n = 2a_{n-1} + a_{n-2}$ with $a_0 = 1$ and $a_1 = 3$. I already found the generating function: $f(x) = frac{1+x}{1-2x-x^2}$, and the characteristic polynomial: $x^2 - 2x + 1 = 0$, which has the roots $1+√2$ and $1-√2$. What is the explicit formula for this recursion, and how do I find it?
generating-functions
generating-functions
asked Jan 14 at 7:31
Drew WeissermanDrew Weisserman
205
205
1
$begingroup$
You have done almost everything. Roots of the characteristic polynomial are solutions of the recursion. Your solution is of the form $$a_n = c_1(1+sqrt{2})^n + c_2(1-sqrt{2})^n$$ Plug in the initial values of $a_0$ and $a_1$ to get the values of the constants $c_1$ and $c_2$
$endgroup$
– Sauhard Sharma
Jan 14 at 7:35
$begingroup$
@SauhardSharma Why are you answering in a comment?
$endgroup$
– Arthur
Jan 14 at 7:36
$begingroup$
@Arthur Because I thought that he had done most of the work and required only a small nudge to get to the solution.
$endgroup$
– Sauhard Sharma
Jan 14 at 7:38
$begingroup$
@SauhardSharma Thank you so much!!!
$endgroup$
– Drew Weisserman
Jan 14 at 7:38
1
$begingroup$
@Arthur Mea Culpa then. I won't do this from now on. Thanks for the advice !!!
$endgroup$
– Sauhard Sharma
Jan 14 at 7:42
|
show 2 more comments
1
$begingroup$
You have done almost everything. Roots of the characteristic polynomial are solutions of the recursion. Your solution is of the form $$a_n = c_1(1+sqrt{2})^n + c_2(1-sqrt{2})^n$$ Plug in the initial values of $a_0$ and $a_1$ to get the values of the constants $c_1$ and $c_2$
$endgroup$
– Sauhard Sharma
Jan 14 at 7:35
$begingroup$
@SauhardSharma Why are you answering in a comment?
$endgroup$
– Arthur
Jan 14 at 7:36
$begingroup$
@Arthur Because I thought that he had done most of the work and required only a small nudge to get to the solution.
$endgroup$
– Sauhard Sharma
Jan 14 at 7:38
$begingroup$
@SauhardSharma Thank you so much!!!
$endgroup$
– Drew Weisserman
Jan 14 at 7:38
1
$begingroup$
@Arthur Mea Culpa then. I won't do this from now on. Thanks for the advice !!!
$endgroup$
– Sauhard Sharma
Jan 14 at 7:42
1
1
$begingroup$
You have done almost everything. Roots of the characteristic polynomial are solutions of the recursion. Your solution is of the form $$a_n = c_1(1+sqrt{2})^n + c_2(1-sqrt{2})^n$$ Plug in the initial values of $a_0$ and $a_1$ to get the values of the constants $c_1$ and $c_2$
$endgroup$
– Sauhard Sharma
Jan 14 at 7:35
$begingroup$
You have done almost everything. Roots of the characteristic polynomial are solutions of the recursion. Your solution is of the form $$a_n = c_1(1+sqrt{2})^n + c_2(1-sqrt{2})^n$$ Plug in the initial values of $a_0$ and $a_1$ to get the values of the constants $c_1$ and $c_2$
$endgroup$
– Sauhard Sharma
Jan 14 at 7:35
$begingroup$
@SauhardSharma Why are you answering in a comment?
$endgroup$
– Arthur
Jan 14 at 7:36
$begingroup$
@SauhardSharma Why are you answering in a comment?
$endgroup$
– Arthur
Jan 14 at 7:36
$begingroup$
@Arthur Because I thought that he had done most of the work and required only a small nudge to get to the solution.
$endgroup$
– Sauhard Sharma
Jan 14 at 7:38
$begingroup$
@Arthur Because I thought that he had done most of the work and required only a small nudge to get to the solution.
$endgroup$
– Sauhard Sharma
Jan 14 at 7:38
$begingroup$
@SauhardSharma Thank you so much!!!
$endgroup$
– Drew Weisserman
Jan 14 at 7:38
$begingroup$
@SauhardSharma Thank you so much!!!
$endgroup$
– Drew Weisserman
Jan 14 at 7:38
1
1
$begingroup$
@Arthur Mea Culpa then. I won't do this from now on. Thanks for the advice !!!
$endgroup$
– Sauhard Sharma
Jan 14 at 7:42
$begingroup$
@Arthur Mea Culpa then. I won't do this from now on. Thanks for the advice !!!
$endgroup$
– Sauhard Sharma
Jan 14 at 7:42
|
show 2 more comments
1 Answer
1
active
oldest
votes
$begingroup$
Since the characteristic function has roots $1+sqrt{2}$ and $1-sqrt{2}$, the formula for the general term is $$a_n = A(1+sqrt{2})^n+B(1-sqrt{2})^n$$ for some constants $A$ and $B$.
Using the initial conditions $a_0 = 1$ and $a_1 = 3$, you get $$1 = a_0 = A+B$$ $$3 = a_1 = (1+sqrt{2})A+(1-sqrt{2})B$$ You simply need to solve this system of equations for $A$ and $B$.
In general, if the characteristic polynomial has distinct roots $r_1, r_2, cdots, r_k$ each with multiplicity $1$, then the general term will be $a_n = C_1r_1^n+C_2r_2^n+cdots+C_kr_k^n$.
If the roots $r_1,ldots,r_n$ have multiplicities $m_1,ldots,m_k$, then the formula is a bit more complicated: $a_n = p_1(n)r_1^n+cdots+p_k(n)r_k^n$ where $p_i(n)$ is a polynomial with degree $le m_i-1$.
$endgroup$
$begingroup$
Thank you so much!!! I'll accept the answer as soon as the timer allows it!
$endgroup$
– Drew Weisserman
Jan 14 at 7:38
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
});
}
});
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%2f3072948%2ffinding-the-explicit-formula-for-the-recursion-a-n-2a-n-1-a-n-2-with%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
Since the characteristic function has roots $1+sqrt{2}$ and $1-sqrt{2}$, the formula for the general term is $$a_n = A(1+sqrt{2})^n+B(1-sqrt{2})^n$$ for some constants $A$ and $B$.
Using the initial conditions $a_0 = 1$ and $a_1 = 3$, you get $$1 = a_0 = A+B$$ $$3 = a_1 = (1+sqrt{2})A+(1-sqrt{2})B$$ You simply need to solve this system of equations for $A$ and $B$.
In general, if the characteristic polynomial has distinct roots $r_1, r_2, cdots, r_k$ each with multiplicity $1$, then the general term will be $a_n = C_1r_1^n+C_2r_2^n+cdots+C_kr_k^n$.
If the roots $r_1,ldots,r_n$ have multiplicities $m_1,ldots,m_k$, then the formula is a bit more complicated: $a_n = p_1(n)r_1^n+cdots+p_k(n)r_k^n$ where $p_i(n)$ is a polynomial with degree $le m_i-1$.
$endgroup$
$begingroup$
Thank you so much!!! I'll accept the answer as soon as the timer allows it!
$endgroup$
– Drew Weisserman
Jan 14 at 7:38
add a comment |
$begingroup$
Since the characteristic function has roots $1+sqrt{2}$ and $1-sqrt{2}$, the formula for the general term is $$a_n = A(1+sqrt{2})^n+B(1-sqrt{2})^n$$ for some constants $A$ and $B$.
Using the initial conditions $a_0 = 1$ and $a_1 = 3$, you get $$1 = a_0 = A+B$$ $$3 = a_1 = (1+sqrt{2})A+(1-sqrt{2})B$$ You simply need to solve this system of equations for $A$ and $B$.
In general, if the characteristic polynomial has distinct roots $r_1, r_2, cdots, r_k$ each with multiplicity $1$, then the general term will be $a_n = C_1r_1^n+C_2r_2^n+cdots+C_kr_k^n$.
If the roots $r_1,ldots,r_n$ have multiplicities $m_1,ldots,m_k$, then the formula is a bit more complicated: $a_n = p_1(n)r_1^n+cdots+p_k(n)r_k^n$ where $p_i(n)$ is a polynomial with degree $le m_i-1$.
$endgroup$
$begingroup$
Thank you so much!!! I'll accept the answer as soon as the timer allows it!
$endgroup$
– Drew Weisserman
Jan 14 at 7:38
add a comment |
$begingroup$
Since the characteristic function has roots $1+sqrt{2}$ and $1-sqrt{2}$, the formula for the general term is $$a_n = A(1+sqrt{2})^n+B(1-sqrt{2})^n$$ for some constants $A$ and $B$.
Using the initial conditions $a_0 = 1$ and $a_1 = 3$, you get $$1 = a_0 = A+B$$ $$3 = a_1 = (1+sqrt{2})A+(1-sqrt{2})B$$ You simply need to solve this system of equations for $A$ and $B$.
In general, if the characteristic polynomial has distinct roots $r_1, r_2, cdots, r_k$ each with multiplicity $1$, then the general term will be $a_n = C_1r_1^n+C_2r_2^n+cdots+C_kr_k^n$.
If the roots $r_1,ldots,r_n$ have multiplicities $m_1,ldots,m_k$, then the formula is a bit more complicated: $a_n = p_1(n)r_1^n+cdots+p_k(n)r_k^n$ where $p_i(n)$ is a polynomial with degree $le m_i-1$.
$endgroup$
Since the characteristic function has roots $1+sqrt{2}$ and $1-sqrt{2}$, the formula for the general term is $$a_n = A(1+sqrt{2})^n+B(1-sqrt{2})^n$$ for some constants $A$ and $B$.
Using the initial conditions $a_0 = 1$ and $a_1 = 3$, you get $$1 = a_0 = A+B$$ $$3 = a_1 = (1+sqrt{2})A+(1-sqrt{2})B$$ You simply need to solve this system of equations for $A$ and $B$.
In general, if the characteristic polynomial has distinct roots $r_1, r_2, cdots, r_k$ each with multiplicity $1$, then the general term will be $a_n = C_1r_1^n+C_2r_2^n+cdots+C_kr_k^n$.
If the roots $r_1,ldots,r_n$ have multiplicities $m_1,ldots,m_k$, then the formula is a bit more complicated: $a_n = p_1(n)r_1^n+cdots+p_k(n)r_k^n$ where $p_i(n)$ is a polynomial with degree $le m_i-1$.
edited Jan 14 at 7:43
answered Jan 14 at 7:36
JimmyK4542JimmyK4542
41.3k245107
41.3k245107
$begingroup$
Thank you so much!!! I'll accept the answer as soon as the timer allows it!
$endgroup$
– Drew Weisserman
Jan 14 at 7:38
add a comment |
$begingroup$
Thank you so much!!! I'll accept the answer as soon as the timer allows it!
$endgroup$
– Drew Weisserman
Jan 14 at 7:38
$begingroup$
Thank you so much!!! I'll accept the answer as soon as the timer allows it!
$endgroup$
– Drew Weisserman
Jan 14 at 7:38
$begingroup$
Thank you so much!!! I'll accept the answer as soon as the timer allows it!
$endgroup$
– Drew Weisserman
Jan 14 at 7:38
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.
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%2f3072948%2ffinding-the-explicit-formula-for-the-recursion-a-n-2a-n-1-a-n-2-with%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
1
$begingroup$
You have done almost everything. Roots of the characteristic polynomial are solutions of the recursion. Your solution is of the form $$a_n = c_1(1+sqrt{2})^n + c_2(1-sqrt{2})^n$$ Plug in the initial values of $a_0$ and $a_1$ to get the values of the constants $c_1$ and $c_2$
$endgroup$
– Sauhard Sharma
Jan 14 at 7:35
$begingroup$
@SauhardSharma Why are you answering in a comment?
$endgroup$
– Arthur
Jan 14 at 7:36
$begingroup$
@Arthur Because I thought that he had done most of the work and required only a small nudge to get to the solution.
$endgroup$
– Sauhard Sharma
Jan 14 at 7:38
$begingroup$
@SauhardSharma Thank you so much!!!
$endgroup$
– Drew Weisserman
Jan 14 at 7:38
1
$begingroup$
@Arthur Mea Culpa then. I won't do this from now on. Thanks for the advice !!!
$endgroup$
– Sauhard Sharma
Jan 14 at 7:42