Applying and analysing functions

Which recursive formula best describes the following sequence:
3, 8, 13, 18, 23...

• a_n = (3)^n-1 ; a₁ =5
• a_n = (5)^n-1 ; a₁ =3
• a_n = a_n-1+3 ; a₁ =5
• a_n = a_n-1+5 ; a₁ =3

Tags

CCSS.HSF.IF.A.3

Choose the correct recursive formula for the following sequence: 2, 8, 14, 20, . . .

Tags

CCSS.HSF.IF.A.3

Which of the following recursive equations could be used to describe the following sequence?

3, 6, 9, 12, ...

• a_n = a_{n – 1} · 3;

  a₁ = 3

• a_n = a_{n – 1} – 3;

  a₁ = 1

• a_n = a_{n – 1} · 2;

  a₁ = 3

• a_n = a_{n – 1} + 3;

  a₁ = 3

Tags

CCSS.HSF.IF.A.3

What is the recursive equation for this function?

• f(0) = 3
  f(x) = f(x-1) +2

• f(0) = 3
  f(x) = f(x-1) + 5

• f(0) = 3
  f(x) = f(x-1) + 3

• f(0) = 3
  f(x) = f(x-1) * 3

Tags

CCSS.HSF.IF.A.3

Which of the following equations is recursive?

• f(n) = f(n-1) +4
• f(n) = 2n - 5

Tags

CCSS.HSF.IF.A.3

Which of the following recursive formulas represents the given sequence?

7, 14, 28, 56, 112, ...

Tags

CCSS.HSF.IF.A.3

-5, -1, 3, 7, 11
What is the recursive rule?

•   $A_n=A_{\left(n-1\right)}\ +\ 4$  

•   $A_n=A_{\left(n-1\right)}-9$ 

•  $A_n=A_{\left(n-1\right)}-5$  

•  $A_n=A_{\left(n\right)}-4$  

Tags

CCSS.HSF.IF.A.3

Arrange by the starting term for each recursive form from greatest to smallest.

• f(1) = -2; f(x) = f(x-1) -5

• f(1) = 5 ; f(x) = f(x-1) -1

• f(1) = 14 ; f(x) = f(x-1) + 3

• f(1) = -8 ; f(x) = f(x-1) - 1

• f(1) = -1 ; f(x) = f(x-1)-2

Tags

CCSS.HSF.BF.A.2

 $f\left(1\right)=50\ ;\ f\left(n\right)\ =\ f\left(n-1\right)+5$  
Which explicit equation below would describe the same set of values as the recursive equation above?

•  $f\left(n\right)\ =\ 50+5n$  

•   $f\left(n\right)=50+5\left(n-1\right)$  

•  $f\left(n\right)=5+50n$  

•  $f\left(n\right)=5+50\left(n-1\right)$  

Tags

CCSS.HSF.IF.A.3

 $f\left(n\right)=\ -2^n$  
 $f\left(0\right)\ =\ ?$  

• 1

• -20

• -2

• -1

Tags

CCSS.HSF.IF.A.3