Answer:
The first terms of this sequence should be:
f(1) = 65536
f(2) = 256
f(3) = 16
f(4) = 4
f(5) = 2
Explanation:
It is required to show the first tems of the sequence defined by the rule:

In this sense, it is required to calculate f(n-1) in order to calculate f(n).
First term f(1) = 65536 is given in the problem. So, we can calcualte the other terms by replacing in the recursive formulation for this sequence as follows:

So we have that f(4) = 4.
Finally the term 5. f(5)

Finally, we can conclude that The first terms of this sequence should be:
f(1) = 65536
f(2) = 256
f(3) = 16
f(4) = 4
f(5) = 2
Answer:
Explanation:
1. Lo compré hace una semana.
2.Yo pagué ayer por unos guantes un dólar
3. Un lector DVD no es muy caro
4 Las joyas se venden en el almacén
5. La semana pasada yo compré un suéter nuevo
6.Anoche yo compré una computadora nueva
7. Cuánto pagaste por el collar
8. Tu lo compraste el año pasado
9. En está tienda venden joyas por veinte dólares
Actually, the superlative form of "bonita" wouldn't be "bonitísima", it would merely be "muy bonita". Just like "very beautiful", not "beautifullest"