Show that $F^2_{n+2} – F^2_{n-2}$ is not a multiple of a Fibonacci number.
up vote
0
down vote
favorite
For $F_n$ as n-th Fibonacci number, I tried for a few first numbers $n=2,3,4,5$ the numerical value of $F^2_{n+2} – F^2_{n-2}$. Unlike the previous exercises of the book, when the r.h.s. was another Fibonacci number, in this case I can't find a relation between $24, 63, 165, dots$ with Fibonacci numbers. Any hint? Knowing the r.h.s of $F^2_{n+2} – F^2_{n-2} = ?$ proof will be straightforward but what is the r.h.s of $F^2_{n+2} – F^2_{n-2} = ?$
fibonacci-numbers
add a comment |
up vote
0
down vote
favorite
For $F_n$ as n-th Fibonacci number, I tried for a few first numbers $n=2,3,4,5$ the numerical value of $F^2_{n+2} – F^2_{n-2}$. Unlike the previous exercises of the book, when the r.h.s. was another Fibonacci number, in this case I can't find a relation between $24, 63, 165, dots$ with Fibonacci numbers. Any hint? Knowing the r.h.s of $F^2_{n+2} – F^2_{n-2} = ?$ proof will be straightforward but what is the r.h.s of $F^2_{n+2} – F^2_{n-2} = ?$
fibonacci-numbers
add a comment |
up vote
0
down vote
favorite
up vote
0
down vote
favorite
For $F_n$ as n-th Fibonacci number, I tried for a few first numbers $n=2,3,4,5$ the numerical value of $F^2_{n+2} – F^2_{n-2}$. Unlike the previous exercises of the book, when the r.h.s. was another Fibonacci number, in this case I can't find a relation between $24, 63, 165, dots$ with Fibonacci numbers. Any hint? Knowing the r.h.s of $F^2_{n+2} – F^2_{n-2} = ?$ proof will be straightforward but what is the r.h.s of $F^2_{n+2} – F^2_{n-2} = ?$
fibonacci-numbers
For $F_n$ as n-th Fibonacci number, I tried for a few first numbers $n=2,3,4,5$ the numerical value of $F^2_{n+2} – F^2_{n-2}$. Unlike the previous exercises of the book, when the r.h.s. was another Fibonacci number, in this case I can't find a relation between $24, 63, 165, dots$ with Fibonacci numbers. Any hint? Knowing the r.h.s of $F^2_{n+2} – F^2_{n-2} = ?$ proof will be straightforward but what is the r.h.s of $F^2_{n+2} – F^2_{n-2} = ?$
fibonacci-numbers
fibonacci-numbers
edited Nov 20 at 23:26
asked Nov 19 at 17:58
72D
50916
50916
add a comment |
add a comment |
1 Answer
1
active
oldest
votes
up vote
1
down vote
accepted
Maybe this helps:$$F_{n+2}^2-F_{n-2}^2=(F_{n+2}-F_{n-2})(F_{n+2}+F_{n-2})$$
$$ F_{n+2}-F_{n-2}=F_{n+1}+F_n-F_{n-2}=F_{n+1}+F_{n-1}=F_n+2F_{n-1}$$
$$ F_{n+2}+F_{n-2}=F_{n+1}+F_n+F_{n-2}=2F_n+F_{n-1}+F_{n-2}=3F_n$$
add a comment |
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
up vote
1
down vote
accepted
Maybe this helps:$$F_{n+2}^2-F_{n-2}^2=(F_{n+2}-F_{n-2})(F_{n+2}+F_{n-2})$$
$$ F_{n+2}-F_{n-2}=F_{n+1}+F_n-F_{n-2}=F_{n+1}+F_{n-1}=F_n+2F_{n-1}$$
$$ F_{n+2}+F_{n-2}=F_{n+1}+F_n+F_{n-2}=2F_n+F_{n-1}+F_{n-2}=3F_n$$
add a comment |
up vote
1
down vote
accepted
Maybe this helps:$$F_{n+2}^2-F_{n-2}^2=(F_{n+2}-F_{n-2})(F_{n+2}+F_{n-2})$$
$$ F_{n+2}-F_{n-2}=F_{n+1}+F_n-F_{n-2}=F_{n+1}+F_{n-1}=F_n+2F_{n-1}$$
$$ F_{n+2}+F_{n-2}=F_{n+1}+F_n+F_{n-2}=2F_n+F_{n-1}+F_{n-2}=3F_n$$
add a comment |
up vote
1
down vote
accepted
up vote
1
down vote
accepted
Maybe this helps:$$F_{n+2}^2-F_{n-2}^2=(F_{n+2}-F_{n-2})(F_{n+2}+F_{n-2})$$
$$ F_{n+2}-F_{n-2}=F_{n+1}+F_n-F_{n-2}=F_{n+1}+F_{n-1}=F_n+2F_{n-1}$$
$$ F_{n+2}+F_{n-2}=F_{n+1}+F_n+F_{n-2}=2F_n+F_{n-1}+F_{n-2}=3F_n$$
Maybe this helps:$$F_{n+2}^2-F_{n-2}^2=(F_{n+2}-F_{n-2})(F_{n+2}+F_{n-2})$$
$$ F_{n+2}-F_{n-2}=F_{n+1}+F_n-F_{n-2}=F_{n+1}+F_{n-1}=F_n+2F_{n-1}$$
$$ F_{n+2}+F_{n-2}=F_{n+1}+F_n+F_{n-2}=2F_n+F_{n-1}+F_{n-2}=3F_n$$
answered Nov 19 at 18:06
Hagen von Eitzen
274k21266494
274k21266494
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%2f3005265%2fshow-that-f2-n2-f2-n-2-is-not-a-multiple-of-a-fibonacci-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