What is the recursive formula, if the sequence is 4, 7, 10, 13, ...? O A(n - 4) + 3
O 4 + 3(n-1)
O A(n-1) + 3

Step-by-step explanation:

In the arithmetic sequence \(t_1\), \(t_2\), \(t_3\), ..., \(t_n\), \(t_1=23\) and \(t_n= t_{n-1} - 3\) for each n > 1. What is the value of n when \(t_n = -4\)?

A. -1

B. 7

C. 10

D. 14

E. 20

Hide Answer

Official Answer and Stats are available only to registered users.  

Register

/

Login

.

Best Regards,

E.

MGMAT 1 --> 530

MGMAT 2--> 640

MGMAT 3 ---> 610

GMAT ==> 730

4 + 3(n-1)

Step-by-step explanation:

Sequences start from n=1,2,3

In this case

4 + 3(1-1)= 4

4 + 3(2-1) =7

And continue the pattern

drive more conversions to your website

conversions are the outcome of your efforts. when a visitor sign up for any newspaper, or fill any form to order a specific product or when your page is shared on social media, all such attempts mean conversions of a website. whenever your desired action is fulfilled, the conversion rate of your website will increase. this increase in your conversion rate will prove that your website is   going well. it also confirms that the quality of your website’s marketing was really good.drive more conversion to your website       drive more conversions to your website

step-by-step explanation:

none of the above.

for one of the equations to be used in the process, there has to be a term in the equation since squared is .

since there is only a term in the first equation, we cannot derive a from completing the square.

solving with completing the square