4 years ago

Which sequence matches the recursive formula?

2 answers:

8 0

A1 = 2
a2 = (a1)^2 + 3 = 2^2 + 3 = 4 + 3 = 7
a3 = (a2)^2 + 3 = 7^2 + 3 = 49 + 3 = 52
a4 = (a3)^2 + 3 = 52^2 + 3 = 2,704 + 3 = 2,707

Option C is the correct answer.

marshall27 [118]4 years ago

8 0

Answer:

The solution is 2, 7, 52, 2707, .... To find each term in the sequence, you square the previous term and add 3. This sequence is represented by the recursive formula an = (an-1)2 + 3, where a1 = 2.

So It's C.

Step-by-step explanation:

You might be interested in

What is ABC classified as?

Virty [35]

Answer:

the first 1

Step-by-step explanation:

8 0

3 years ago

Read 2 more answers

Point A is at the coordinate (-5, 6). Point B is located at (-5, -4). What is the distance between these two points?

katrin [286]

Answer:

Step-by-step explanation:

6-(-4)=10

I think so lol

3 0

3 years ago

Read 2 more answers

PLEASEEE HELP ME ANWSER THISSS ♥️♥️♥️♥️

Vilka [71]

What proof do you need?

5 0

3 years ago

100×1.46= cash exhange

liq [111]

Answer:

$\dashrightarrow \sf \: 100 \times 1.46 \\ \\ \dashrightarrow \sf \: \cancel{100} \times \frac{146}{ \cancel{100 }} \\ \\ \dashrightarrow \sf \: 146$

3 0

3 years ago

Mr. Hudson is a car salesman. He makes a fixed amount of $1,000 a month and receives $250 for every car that he sells. Which ine

kkurt [141]

Answer:

250n + 1,000 ≥ 6,000

Step-by-step explanation:

You know that he makes 250 dollars per car her sells and he automatically makes 1000 per month. n is representing the number of cars he sold and that is multiplied by the worth of each car. If he needs a MINIMUM of 6000 dollars. he must make 6000 dollars or more which can also be shown as ≥. Hope this helped!

5 0

3 years ago