Let α\alphaα and β\betaβ be two roots of the quadratic equation x2+mx−1=0x^{2}+mx-1 = 0x2+mx−1=0,where mmm is an odd integer.Let λn=αn+βn\lambda_n = \alpha^{n}+\beta^{n}λn=αn+βn for n≥0n\ge 0n≥0.Prove that for n≥0n \ge 0n≥0,
(a) λn\lambda_nλn is an integer.
(b)gcd(λn,λn+1)=1gcd( \lambda_n ,\lambda_{n+1}) = 1gcd(λn,λn+1)=1
Note by Eddie The Head 7 years, 1 month ago
Easy Math Editor
This discussion board is a place to discuss our Daily Challenges and the math and science related to those challenges. Explanations are more than just a solution — they should explain the steps and thinking strategies that you used to obtain the solution. Comments should further the discussion of math and science.
When posting on Brilliant:
*italics*
_italics_
**bold**
__bold__
- bulleted- list
1. numbered2. list
paragraph 1paragraph 2
paragraph 1
paragraph 2
[example link](https://brilliant.org)
> This is a quote
This is a quote
# I indented these lines # 4 spaces, and now they show # up as a code block. print "hello world"
\(
\)
\[
\]
2 \times 3
2^{34}
a_{i-1}
\frac{2}{3}
\sqrt{2}
\sum_{i=1}^3
\sin \theta
\boxed{123}
We get the relation λn+1=−m.λn+λn−1\lambda_{n+1}=-m.\lambda_n+\lambda_{n-1}λn+1=−m.λn+λn−1.
Since λ0=2,λ1=−m\lambda_0=2,\lambda_1=-mλ0=2,λ1=−m, it follows that (λ0,λ1)=1(\lambda_0,\lambda_1)=1(λ0,λ1)=1, because m is an odd integer.Also, since the first two terms are integers and we got a recurrence relation with integer coefficients, it follows that λn\lambda_nλn must be an integer.
Firstly,(λ0,λ1)=1(\lambda_0,\lambda_1)=1(λ0,λ1)=1.Let (λn,λn−1)=1(\lambda_n,\lambda_{n-1})=1(λn,λn−1)=1.Then let's assume (λn+1,λn)=d,d>1(\lambda_{n+1},\lambda_n)=d,d>1(λn+1,λn)=d,d>1.Then, using the relation we would get that d∣λn−1d|\lambda_{n-1}d∣λn−1, which is clearly a contradiction, so we have proved it by induction.
Log in to reply
Nice ..I also solved in the same way....
Problem Loading...
Note Loading...
Set Loading...
Easy Math Editor
This discussion board is a place to discuss our Daily Challenges and the math and science related to those challenges. Explanations are more than just a solution — they should explain the steps and thinking strategies that you used to obtain the solution. Comments should further the discussion of math and science.
When posting on Brilliant:
*italics*
or_italics_
**bold**
or__bold__
paragraph 1
paragraph 2
[example link](https://brilliant.org)
> This is a quote
\(
...\)
or\[
...\]
to ensure proper formatting.2 \times 3
2^{34}
a_{i-1}
\frac{2}{3}
\sqrt{2}
\sum_{i=1}^3
\sin \theta
\boxed{123}
Comments
We get the relation λn+1=−m.λn+λn−1.
Since λ0=2,λ1=−m, it follows that (λ0,λ1)=1, because m is an odd integer.Also, since the first two terms are integers and we got a recurrence relation with integer coefficients, it follows that λn must be an integer.
Firstly,(λ0,λ1)=1.Let (λn,λn−1)=1.Then let's assume (λn+1,λn)=d,d>1.Then, using the relation we would get that d∣λn−1, which is clearly a contradiction, so we have proved it by induction.
Log in to reply
Nice ..I also solved in the same way....