Drag each tile the correct box not all tiles will be used Consider the recurslvely defined function below
f(1)=10
f(n)=2.2. . f(n-1), for n =2,3,4

create the five terms of the sequence defined by the given function
20. 48.4. 10. 101.64. 234.256. 52.8
127.776. 106.48. 22
if u dont now dot answer pls

yes

Step-by-step explanation:

points are handed out whenever you post answers.

brainliest answers are handed out by the person asking the question, so whether your answer is picked depends entirely on whether the asker bothers to pick

if you're asking about your rank, it depends on having a certain number of points and a certain number of brainliest answers. for example, at the time of this writing, i have 44338 points out of 15000 needed for the next (nearly triple the requirement! ) but i only have 24 out of 50 required brainliest answers. this number decays, meaning after a certain amount of time (i think about a month), the total number of brainliest answers you've earned doesn't count toward this total. (i've been stuck at the same rank for a long

the lesson to learn here is that you shouldn't worry about points or rank. chances are, no matter how good an answer you may provide, your efforts will go mostly unnoticed unless you focus on the newest/most active questions that get posted.

mxb67

step-by-step explanation: