Multiply the the numbers for each locket and see which number is greater
Answer:
See proof below
Step-by-step explanation:
We have to verify that if we substitute
in the equation
the equality is true.
Let's substitute first in the right hand side:

Now we use the distributive laws. Also, note that
(this also works when the power is n-2).



then the sequence solves the recurrence relation.
Let me see if I am correct I will get back to u
Answer:
3.16(i think)
Step-by-step explanation:
Answer:
Step-by-step explanation: