Taking these type of problems to a new level

Algebra Level 4

Suppose that a real number x x satisfies the equation

x 2 + 1 x 2 = 3 x^2+\frac{1}{x^2}=3

Define a sequence a n a_{n} as a n = x n + 1 x n a_{n}=x^n+\frac{1}{x^n} . How many of a 1 , a 2 , a 1000 a_{1}, a_{2}, \cdots a_{1000} are integers?


The answer is 500.

This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try refreshing the page, (b) enabling javascript if it is disabled on your browser and, finally, (c) loading the non-javascript version of this page . We're sorry about the hassle.

2 solutions

Aditya Raut
Sep 2, 2014

From the given condition, we see that if x = α x=\alpha satisfies, then x = 1 α x=\dfrac{1}{\alpha} also satisfies.

Think of a quadratic equation x 2 3 x + 1 = 0 x^2-3x+1=0 .

See that α \alpha and 1 α \dfrac{1}{\alpha} are roots of this equation.

From this quadratic equation, we can form a recurrence relation b n 3 b n 1 + b n 2 = 0 b_n-3b_{n-1}+b_{n-2}=0 . See that if you design it's initial terms as b 0 = 2 b_0=2 and b 1 = 3 b_1=3 , then we get each term of this recurrence as b n = α n + 1 α n b_n=\alpha^n+\dfrac{1}{\alpha^n} .

Now, as we have b n = 3 b n 1 a n 2 b_n=3b_{n-1}-a_{n-2} and b 0 b_0 and b 1 b_1 were defined integers, so we have each term of this sequence to be an integer.

But see that originally , we were given for x 2 + 1 x 2 = 3 x^2+\dfrac{1}{x^2}=3 , so we conclude that b n b_n are the terms with even power of the roots, i.e. b i b_i are ranging in a 2 n a_{2n}

This means that only terms in the sequence { a i } \{a_i\} which are integers, are for i = 2 k i=2k for k N k\in \mathbb{N} .

Thus we have 500 \boxed{500} integers in the sequence.

This proves that a n a_n is an integer for even n n but we must also prove that a n a_n is not an integer for odd n n .

Dan Lawson - 6 years, 9 months ago

Log in to reply

Right, but this recurrence is extendable to prove that odds are multiples of 5 \sqrt{5} , by taking different start values :)

Aditya Raut - 6 years, 9 months ago

@Satvik Golechha , @Krishna Ar see a new use of recurrence relations !

Aditya Raut - 6 years, 9 months ago

Log in to reply

That was awesome! You find recurrences everywhere @Aditya Raut

Satvik Golechha - 6 years, 9 months ago

Wow! @Aditya Raut -Nice! I actually guessed the problem once I saw that a(n) where n is odd can never be an integer..I'm not that good at recurrences..will try to improve!

Krishna Ar - 6 years, 9 months ago

Since only terms with even power are possible,

(x^2 + 1/ x^2)^k would encounter binomial expansions which shall cover all the sums follow.

2

4, 0

6, 2

8, 4, 0

10, 6, 2

12, 8, 4, 0

14, 10, 6, 2

16, 12, 8, 4, 0

18, 14, 10, 6, 2

20, 16, 12, 8, 4, 0

...

All shall be related to x^2 + 1/ x^2 = 3 as start and since only integers can arise, all of them must be integers. Therefore 1000/ 2 = 500 are integers. {x^2 = x + 1 gives golden ratios but not for even power.}

Lu Chee Ket - 6 years, 9 months ago
汶汶 樂
Sep 3, 2014

solution solution

FYI - To display images using Markdown, you just need to add a ! in front of your hyperlink. :)

Calvin Lin Staff - 6 years, 9 months ago

And using LaTeX \LaTeX instead of images will be easier ! The guide brilliant provides is awesome, just try it once !

Aditya Raut - 6 years, 9 months ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...