Recurrence system

[HATLEY1997]

Any guidance on how to work this out?

 

[khansaheb]

Any guidance on how to work this out?

Please re-orient your "image" - so that we can read it easily.

Is this a HW from a class that you are currently attending?

Please show us what you have tried and exactly where you are stuck.

Please follow the rules of posting in this forum, as enunciated at:

READ BEFORE POSTING​

Please share your work/thoughts about this problem

 

[blamocur]

Any guidance on how to work this out?

You could also start by making your picture readable, as suggested by @khansaheb:

 

[blamocur]

One way is to verify each of the answers against the recurrence equations.

 

[topsquark]

You could also start by making your picture readable, as suggested by @khansaheb:

View attachment 37962

$a_n = \dfrac{1}{2} a_{n-1}$

$a_n - \dfrac{1}{2} a_{n-1} = 0$

Now solve the associated equation
$m^1 - \dfrac{1}{2}m^0 = 0$

Then $a_n = a_1 m^{n-1}$

for m and use $a_1 = 3$.

-Dan

 

[HATLEY1997]

Thanks Dan

 

[Steven G]

blamocur gave a gave hint. I will go further with that hint.
a₂= 3/2. Only one choice gives 3/2 when n = 2. Done.