The correct option is A c=asas+2−a2s
Clearly, all the terms of the sequence are positive numbers. Write the recursive relation as an+1an−1=a2n+c.
anan−2=a2n−1+c,
and by subtracting the two equalities we deduce an−1(an+1+an−1)=an(an+an−2).
Therefore an+1+an−1an=an+an−2an−1
n≥3 for all
bn=an+1+an−1an It follows that the sequence
bn=k, is constant, say
For all n≥2. Then the sequence (an) satisfies the recursive relation an+1=kan−an−1 for all n≥2 and since a3=b2+ca=kb−a,
We derive that k=a2+b2+cab Now, if a,b and k are positive integers, it follows inductively that an
is a positive integer for all n≥1
Then a,b are positive integers and k=a3+ab is a rational number .Let
k=pq,
where p and q are relatively prime positive integers. We want to prove that q = 1. Suppose that q>1.
From the recursive relation we obtain q(an+1+an−1)=pan,
and hence q divides an for all n≥2 We prove by induction on s that
qs divides an for all n≥s+1 We have seen that this is true for s=1. Suppose qs−1 divides
an for all n≥s. we have an+2=pqan+1−an,which is equivalent toan+2qs−1=pan+1qs−anqs−1. if n≥s, then,
qs−1 divides an hence an+2, and qs divides an+1. it follows that qs
as+2=a2s+1+cas
c=asas+2−a2s
which implies that c is divisible by q2(s−1) for all
s≥1. because c>0, this is a contradiction.