The recursive geometric sequence that models this situation is:
![f(n) = 0.9f(n-1)](https://tex.z-dn.net/?f=f%28n%29%20%3D%200.9f%28n-1%29)
![f(1) = 90000](https://tex.z-dn.net/?f=f%281%29%20%3D%2090000)
<h3>What is a geometric sequence?</h3>
A geometric sequence is a sequence in which the result of the division of consecutive terms is always the same, called common ratio q.
It can be represented by a recursive sequence as follows:
![f(n) = qf(n-1)](https://tex.z-dn.net/?f=f%28n%29%20%3D%20qf%28n-1%29)
With f(1) as the first term.
In this problem, the sequence is: 90.000: 81,000; 72,900; 65,610, hence:
![q = \frac{65610}{72900} = \cdots = \frac{81000}{90000} = 0.9](https://tex.z-dn.net/?f=q%20%3D%20%5Cfrac%7B65610%7D%7B72900%7D%20%3D%20%5Ccdots%20%3D%20%5Cfrac%7B81000%7D%7B90000%7D%20%3D%200.9)
![f(1) = 90000](https://tex.z-dn.net/?f=f%281%29%20%3D%2090000)
Hence:
![f(n) = 0.9f(n-1)](https://tex.z-dn.net/?f=f%28n%29%20%3D%200.9f%28n-1%29)
![f(1) = 90000](https://tex.z-dn.net/?f=f%281%29%20%3D%2090000)
More can be learned about geometric sequences at brainly.com/question/11847927
Here the answer is 21 as the LCM of 14 and 6 is 42 and 42 is exactly divisible by 21.
1. tens
2. ten thousands
3. ones
Answer:
40
Step-by-step explanation:
and congrats home slice have a wonderful day and thx for them points