Recursive Sequences

Write the recursive formula for 6, 17, 28, 39, 50....

• a_n=a_n-1+11
  a₁=6
• a_n=a_n-1-4
  a₁=6
• a_n=a_n-1+9
  a₁=6
• a_n=a_n-1+6
  a₁=6

Tags

CCSS.HSF.BF.A.2

Given the recursive formula, find the first four terms:
a_n = a_n-1 + 5
a₁ = -16

• -16, -21, -26, -31
• 5, -11, -27, -43
• -16, -80, -500, -200
• -16, -11, -6, -1

Tags

CCSS.HSF.BF.A.2

Which of the following recursive formulas represents the given sequence.

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

• $a_1=7$ , $a_n=a_{\left(n-1\right)}+7$

• $a_1=7$ , $a_n=a_{\left(n-1\right)}\cdot7$

• $a_1=7$ , $a_n=a_{\left(n-1\right)}\cdot2$

• $a_1=7$ , $a_n=a_{\left(n-1\right)}+14$

Tags

CCSS.HSF.IF.A.3

Determine the 3rd term of the sequence.

a₁=5

a_n= 2a_n-1 - 1

• 14

• 13

• 17

• 16

Tags

CCSS.HSF.BF.A.2

Write a recursive formula for the following sequence:

16,8, 4, 2,...

• a₁=16

  a_n=a_n-1 (2)

• a₁=16

  a_n=a_n-1 (1/2)

• a₁=16

  a_n=a_n-1 + (1/2)

• a₁=16

  a_n=a_{n-1 +} (2)

Tags

CCSS.HSF.BF.A.2

Find the first four terms of the sequence.

a_n= 2a_(n-1) + n where a₀= 0

• 0, 0, 0, 0

• 0, 1, 4, 11

• 0, 1, 2, 4

• 0, 2, 4, 8

Tags

CCSS.HSF.BF.A.2

Which of the following sequences has the recursive rule g_n = g_n-1 * 1/5

• {17,22,27,32,37, …}

• {11,6,1,-4,-9, …}

• {7,35,175,875,4375, …}

• {21875,4375,875,175,35, …}

Tags

CCSS.HSF.BF.A.2

Which of the following sequences has the recursive rule f_n = f_n-1 + f_n-2

• {8,12,16,20,24, …}

• {-15,-19,-23,-27,-31, …}

• {-3,-12,-48,-192,-768, …}

• {1, 2, 3, 5, 8, …}

Tags

CCSS.HSF.IF.A.3

Given the recursive formula, find the explicit form
a_n = a_n-1 - 5
a₁ = 22

• a_n = 22 + (n-1)(-5)
• a_n = 22 + (n-1)(5)
• a_n = -5 + (n-1)(22)
• a_n = -16 + (n-1)(-5)

Tags

CCSS.HSF.BF.A.2

Write a recursive rule for the sequence a_n = 17 + (n-1)(-16)

• a₁ = 17
  a_n = a_n-1 + 16
• a₁ = 17
  a_n = a_n-1 - 17
• a₁ = 17
  a_n = a_n-1 - 15
• a₁ = 17
  a_n = a_n-1 - 16

Tags

CCSS.HSF.BF.A.2