Let $a_n$ be a sequence defined by recursion: $a_n=x+ya_{n-1}, a_1=k$. For example, if $(x,y)=(3,5)$, then the sequence would go
$$a=\{k,\space 3+5k,\space 3+5(3+5k),\space ...\}$$
Is there an explicit formula for $a_n$? If not, is there a way to tell if a number is a member of $a$?
Asked
Active
Viewed 50 times
0

4yl1n
- 320
-
Here is a related question. – rtybase Apr 27 '20 at 00:10
2 Answers
2
Hint: Let $b_n = a_{n+1}-a_n$. Then $b_n = y b_{n-1}$. Can you finish?

lhf
- 216,483
-
See https://en.wikipedia.org/wiki/Recurrence_relation#Solving_non-homogeneous_linear_recurrence_relations_with_constant_coefficients – lhf Apr 26 '20 at 20:50
-
If you can finish, please add a complete answer yourself for future visitors – lhf Apr 26 '20 at 21:21
2
Just another solution.
Considering $$a_n=x+y\,a_{n-1}$$ let $a_n=b_n+k$ and replace $$b_n+k=x +y\ b_{n-1}+k y$$ Let $k=x+k y \implies k=\frac x{1-y}$ (if $y \neq 1$) to make $$b_n=y \,b_{n-1}$$ which is simple.
Solve for $b_n$ and $a_n=b_n+\frac x{1-y}$

Claude Leibovici
- 260,315
-
-
@robjohn. In French, we have an expression "great minds meet". The problem is that I am not ! Cheers and thanks. – Claude Leibovici Apr 27 '20 at 03:44
-
-
1
-
-
1