Proving that equality is applicable to any N number
up vote
0
down vote
favorite
$a_{n}$ is a sequence of numbers defined by:
$a_{0}$ = −1
$a_{1}$ = 3
$a_{n+2}$ = 6$a_{n}$ − $a_{n+1}$ + 4n + 1
I have to prove that for every natural number n this equality is applicable:
$a_{n}$ = $2^{n}$ − $(-3)^{n}$ − n − 1
Any ideas/hints how to proceed? I have no idea what to do with that.
Sorry for bad English. That is not my first language.
sequences-and-series proof-explanation
asked Nov 21 at 15:10
dfps12
11
add a comment |
up vote
0
down vote
favorite
$a_{n}$ is a sequence of numbers defined by:
$a_{0}$ = −1
$a_{1}$ = 3
$a_{n+2}$ = 6$a_{n}$ − $a_{n+1}$ + 4n + 1
I have to prove that for every natural number n this equality is applicable:
$a_{n}$ = $2^{n}$ − $(-3)^{n}$ − n − 1
Any ideas/hints how to proceed? I have no idea what to do with that.
Sorry for bad English. That is not my first language.
sequences-and-series proof-explanation
asked Nov 21 at 15:10
dfps12
11
If $b_n=2^n-(-3)^n-n-1$ then it would suffice to show that $b_0=a_0, b_1=a_1$ and that $b_n$ also satisfies the recursion $b_{n+2}=6b_n-b_{n+1}+4n+1$ (since that recursion defines a sequence uniquely up to initial conditions).
– lulu
Nov 21 at 15:18
The comment from @lulu is correct, but it might be useful to mention that the parenthetical point at the end of that comment would be proved by strong induction on $n$. Alternatively, without introducing a separate notation like $b_n$, you could directly prove the desired equation by strong induction on $n$.
– Andreas Blass
Nov 21 at 15:54
add a comment |
up vote
0
down vote
favorite
up vote
0
down vote
favorite
$a_{n}$ is a sequence of numbers defined by:
$a_{0}$ = −1
$a_{1}$ = 3
$a_{n+2}$ = 6$a_{n}$ − $a_{n+1}$ + 4n + 1
I have to prove that for every natural number n this equality is applicable:
$a_{n}$ = $2^{n}$ − $(-3)^{n}$ − n − 1
Any ideas/hints how to proceed? I have no idea what to do with that.
Sorry for bad English. That is not my first language.
sequences-and-series proof-explanation
asked Nov 21 at 15:10
dfps12
11
$a_{n}$ is a sequence of numbers defined by:
$a_{0}$ = −1
$a_{1}$ = 3
$a_{n+2}$ = 6$a_{n}$ − $a_{n+1}$ + 4n + 1
I have to prove that for every natural number n this equality is applicable:
$a_{n}$ = $2^{n}$ − $(-3)^{n}$ − n − 1
Any ideas/hints how to proceed? I have no idea what to do with that.
Sorry for bad English. That is not my first language.
sequences-and-series proof-explanation
sequences-and-series proof-explanation
asked Nov 21 at 15:10
dfps12
11
asked Nov 21 at 15:10
dfps12
11
asked Nov 21 at 15:10
dfps12
11
asked Nov 21 at 15:10
dfps12
11
asked Nov 21 at 15:10
dfps12
11
11
If $b_n=2^n-(-3)^n-n-1$ then it would suffice to show that $b_0=a_0, b_1=a_1$ and that $b_n$ also satisfies the recursion $b_{n+2}=6b_n-b_{n+1}+4n+1$ (since that recursion defines a sequence uniquely up to initial conditions).
– lulu
Nov 21 at 15:18
The comment from @lulu is correct, but it might be useful to mention that the parenthetical point at the end of that comment would be proved by strong induction on $n$. Alternatively, without introducing a separate notation like $b_n$, you could directly prove the desired equation by strong induction on $n$.
– Andreas Blass
Nov 21 at 15:54
add a comment |
If $b_n=2^n-(-3)^n-n-1$ then it would suffice to show that $b_0=a_0, b_1=a_1$ and that $b_n$ also satisfies the recursion $b_{n+2}=6b_n-b_{n+1}+4n+1$ (since that recursion defines a sequence uniquely up to initial conditions).
– lulu
Nov 21 at 15:18
The comment from @lulu is correct, but it might be useful to mention that the parenthetical point at the end of that comment would be proved by strong induction on $n$. Alternatively, without introducing a separate notation like $b_n$, you could directly prove the desired equation by strong induction on $n$.
– Andreas Blass
Nov 21 at 15:54
If $b_n=2^n-(-3)^n-n-1$ then it would suffice to show that $b_0=a_0, b_1=a_1$ and that $b_n$ also satisfies the recursion $b_{n+2}=6b_n-b_{n+1}+4n+1$ (since that recursion defines a sequence uniquely up to initial conditions).
– lulu
Nov 21 at 15:18
If $b_n=2^n-(-3)^n-n-1$ then it would suffice to show that $b_0=a_0, b_1=a_1$ and that $b_n$ also satisfies the recursion $b_{n+2}=6b_n-b_{n+1}+4n+1$ (since that recursion defines a sequence uniquely up to initial conditions).
– lulu
Nov 21 at 15:18
The comment from @lulu is correct, but it might be useful to mention that the parenthetical point at the end of that comment would be proved by strong induction on $n$. Alternatively, without introducing a separate notation like $b_n$, you could directly prove the desired equation by strong induction on $n$.
– Andreas Blass
Nov 21 at 15:54
The comment from @lulu is correct, but it might be useful to mention that the parenthetical point at the end of that comment would be proved by strong induction on $n$. Alternatively, without introducing a separate notation like $b_n$, you could directly prove the desired equation by strong induction on $n$.
– Andreas Blass
Nov 21 at 15:54
add a comment |
1 Answer
1
active
oldest
votes
up vote
0
down vote
Let's see three consecutive terms of the series and suppose that n is even:
$a_n=2^n - 3^n-n-1$
$a_{n+1}=2^{n+1} + 3^{n+1}-(n+1)-1$
$a_{n+2}=2^{n+2} -3^{n+2}-(n+2)-1$
Form the sum of $a_{n+1}$ and $a_{n+2}$:
$a_{n+1}+a_{n+2}=(2+4)2^n+(3-9)3^n-2n-5=6overbrace{{(2^n-3^n-n-1)}}^{a_n}+4n+1$
$a_{n+2}=6a_n-a_{n+1}+4n+1$
We can do this for odd n, the result is same.
answered Nov 25 at 7:17
JV.Stalker
51139
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
Let's see three consecutive terms of the series and suppose that n is even:
$a_n=2^n - 3^n-n-1$
$a_{n+1}=2^{n+1} + 3^{n+1}-(n+1)-1$
$a_{n+2}=2^{n+2} -3^{n+2}-(n+2)-1$
Form the sum of $a_{n+1}$ and $a_{n+2}$:
$a_{n+1}+a_{n+2}=(2+4)2^n+(3-9)3^n-2n-5=6overbrace{{(2^n-3^n-n-1)}}^{a_n}+4n+1$
$a_{n+2}=6a_n-a_{n+1}+4n+1$
We can do this for odd n, the result is same.
answered Nov 25 at 7:17
JV.Stalker
51139
add a comment |
up vote
0
down vote
Let's see three consecutive terms of the series and suppose that n is even:
$a_n=2^n - 3^n-n-1$
$a_{n+1}=2^{n+1} + 3^{n+1}-(n+1)-1$
$a_{n+2}=2^{n+2} -3^{n+2}-(n+2)-1$
Form the sum of $a_{n+1}$ and $a_{n+2}$:
$a_{n+1}+a_{n+2}=(2+4)2^n+(3-9)3^n-2n-5=6overbrace{{(2^n-3^n-n-1)}}^{a_n}+4n+1$
$a_{n+2}=6a_n-a_{n+1}+4n+1$
We can do this for odd n, the result is same.
answered Nov 25 at 7:17
JV.Stalker
51139
add a comment |
up vote
0
down vote
up vote
0
down vote
Let's see three consecutive terms of the series and suppose that n is even:
$a_n=2^n - 3^n-n-1$
$a_{n+1}=2^{n+1} + 3^{n+1}-(n+1)-1$
$a_{n+2}=2^{n+2} -3^{n+2}-(n+2)-1$
Form the sum of $a_{n+1}$ and $a_{n+2}$:
$a_{n+1}+a_{n+2}=(2+4)2^n+(3-9)3^n-2n-5=6overbrace{{(2^n-3^n-n-1)}}^{a_n}+4n+1$
$a_{n+2}=6a_n-a_{n+1}+4n+1$
We can do this for odd n, the result is same.
answered Nov 25 at 7:17
JV.Stalker
51139
Let's see three consecutive terms of the series and suppose that n is even:
$a_n=2^n - 3^n-n-1$
$a_{n+1}=2^{n+1} + 3^{n+1}-(n+1)-1$
$a_{n+2}=2^{n+2} -3^{n+2}-(n+2)-1$
Form the sum of $a_{n+1}$ and $a_{n+2}$:
$a_{n+1}+a_{n+2}=(2+4)2^n+(3-9)3^n-2n-5=6overbrace{{(2^n-3^n-n-1)}}^{a_n}+4n+1$
$a_{n+2}=6a_n-a_{n+1}+4n+1$
We can do this for odd n, the result is same.
answered Nov 25 at 7:17
JV.Stalker
51139
answered Nov 25 at 7:17
JV.Stalker
51139
answered Nov 25 at 7:17
JV.Stalker
51139
answered Nov 25 at 7:17
JV.Stalker
51139
51139
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%2f3007833%2fproving-that-equality-is-applicable-to-any-n-number%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
If $b_n=2^n-(-3)^n-n-1$ then it would suffice to show that $b_0=a_0, b_1=a_1$ and that $b_n$ also satisfies the recursion $b_{n+2}=6b_n-b_{n+1}+4n+1$ (since that recursion defines a sequence uniquely up to initial conditions).
– lulu
Nov 21 at 15:18
The comment from @lulu is correct, but it might be useful to mention that the parenthetical point at the end of that comment would be proved by strong induction on $n$. Alternatively, without introducing a separate notation like $b_n$, you could directly prove the desired equation by strong induction on $n$.
– Andreas Blass
Nov 21 at 15:54