sequence with a property

Algebra Level pending

Let a 1 = 1 a_1=1 , a 2 = 1 a_2=1 and the recurrence relation is a n = a n 1 2 + 2 a n 2 , n 3 \displaystyle a_n=\frac{a_{n-1}^2 +2}{a_{n-2}},\forall n \ge3 . then a n a_n is

Irrational for some n n Always rational number Integer for some n n and rational for some n n Always an integer

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

by rearranging terms we get a n × a n 2 = a n 2 + 2 a_n\times a_{n-2}=a_{n}^2 +2 . replace n n by n 1 n-1 we get a n + 1 × a n 1 = a n 2 a_{n+1}\times a_{n-1}=a_n^2 . subtract and trivial transformation yields a n + 1 + a n 1 a n = a n + a n 2 a n 1 = c \displaystyle \frac{a_{n+1}+a_{n-1}}{a_n}=\frac{a_n + a_{n-2}}{a_{n-1}}=c . Substituting the initial conditions a 1 = a 2 = 1 a_1=a_2=1 we get c = 4 c=4 . therefore we get a n + 1 = 4 a n a n 1 a_{n+1}=4a_n-a_{n-1} . by induction we can show a n a_n is always integers.

Nice solution

Newsun V - 1 year ago
Sahil Goyat
May 24, 2020

a 1 = 1 a_{1}=1 and a 2 = 1 a_{2}=1

we calculate a 3 a_{3} and a 4 a_{4} and find them to be 3,11 respectively

now let us assume a k a_{k} is an integer

so ( a k 1 ) 2 + 2 a k 2 \frac{(a_{k-1})^{2}+2}{a_{k-2}} is an integer

now a k + 1 = ( a k ) 2 + 2 a k 1 a_{k+1}=\frac{(a_{k})^{2}+2}{a_{k-1}}

putting value of a k a_{k} we get

a k + 1 = ( ( a k 1 ) 2 + 2 a k 2 ) 2 + 2 a k 1 a_{k+1}=\frac{(\frac{(a_{k-1})^{2}+2}{a_{k-2}})^{2}+2}{a_{k-1}}

solving it(openig the square and adding) we see that for it to be an integer a k 1 a_{k-1} must divide 2 ( a k 2 ) 2 + 4 2(a_{k-2})^{2}+4

so ( a k 2 ) 2 + 4 a k 1 \frac{(a_{k-2})^{2}+4}{a_{k-1}} must be an integer

putting value for a k 1 a_{k-1} we get

( 2 ( a k 2 ) 2 + 4 ) × ( a k 3 ) ( a k 2 ) 2 + 2 \frac{(2(a_{k-2})^{2}+4)\times(a_{k-3})}{(a_{k-2})^{2}+2}

which is an integer if and only if a k 3 a_{k-3} is an integer

now by induction : if p(k+1) is true only when p(k) and p(k-3) are true and p is true for first four natural numbers then it true for all natural numbers

and we have already done that hence the sequence returns only integer values.

Nice solution

Newsun V - 1 year ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...