Suppose that a real number x satisfies the equation
x 2 + x 2 1 = 3
Define a sequence a n as a n = x n + x n 1 . How many of a 1 , a 2 , ⋯ a 1 0 0 0 are integers?
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.
This proves that a n is an integer for even n but we must also prove that a n is not an integer for odd n .
Log in to reply
Right, but this recurrence is extendable to prove that odds are multiples of 5 , by taking different start values :)
@Satvik Golechha , @Krishna Ar see a new use of recurrence relations !
Log in to reply
That was awesome! You find recurrences everywhere @Aditya Raut
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!
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.}
FYI - To display images using Markdown, you just need to add a ! in front of your hyperlink. :)
And using L A T E X instead of images will be easier ! The guide brilliant provides is awesome, just try it once !
Problem Loading...
Note Loading...
Set Loading...
From the given condition, we see that if x = α satisfies, then x = α 1 also satisfies.
Think of a quadratic equation x 2 − 3 x + 1 = 0 .
See that α and α 1 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 . See that if you design it's initial terms as b 0 = 2 and b 1 = 3 , then we get each term of this recurrence as b n = α n + α n 1 .
Now, as we have b n = 3 b n − 1 − a n − 2 and b 0 and 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 + x 2 1 = 3 , so we conclude that b n are the terms with even power of the roots, i.e. b i are ranging in a 2 n
This means that only terms in the sequence { a i } which are integers, are for i = 2 k for k ∈ N .
Thus we have 5 0 0 integers in the sequence.