Recursive & Explicit Notation Review

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

CCSS.HSF.IF.A.3

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

CCSS.HSF.IF.A.3

Write a recursive rule for the sequence 17, 1, -15, -31 . . .

• 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
  a₁=17

Tags

CCSS.HSF.BF.A.2

CCSS.HSF.IF.A.3

CCSS.HSF.LE.A.2

Find the next three terms:
5, 8, 11, 14...

• 16, 19, 22
• 17, 19, 21
• 17, 20, 23
• 16, 18, 20 

Tags

CCSS.HSF.BF.A.2

CCSS.HSF.IF.A.3

CCSS.HSF.LE.A.2

Given the recursive formula below, find the first five terms.  
a₁ = 3
a_k+1 = a_k + 2

• 3, 5, 7, 9, 11
• 5, 7, 9, 11, 13

Tags

CCSS.HSF.BF.A.2

CCSS.HSF.IF.A.3

CCSS.HSF.LE.A.2

Given the first five terms, write the recursive formula.
15, 12, 9, 6, 3 ....

• a₁ = 15
  a_k+1 = a_k + 3
• a₀ = 15
  a_n = a_n-1 + 3
• a₁ = 15
  a_k+1 = a_k - 3 
• a₀ = 15
  _an = a_n-1 - 3

Tags

CCSS.HSF.BF.A.2

CCSS.HSF.IF.A.3

Given the recursive formula below, find the explicit formula.  
a₀ = 1
a_n = a_n-1 + 5

• a_n = 6 + 5n
• a_n = 1 + 5n

Tags

CCSS.HSF.BF.A.2

CCSS.HSF.LE.A.2

Given the sequence below, write the explicit formula.
3, 8, 13, 18 ... 

• a_n = 3 + 5n
• a_n = -2 + 5n

Tags

CCSS.HSF.BF.A.2

CCSS.HSF.LE.A.2

Given the recursive formula below, find the explicit formula.  
a₁ = 5
a_n = a_n-1 - 6

• a_n = 5 - 6n 
• a_n = 11 - 6n 

Tags

CCSS.HSF.BF.A.2

CCSS.HSF.LE.A.2

Given the recursive formula below, write the linear equation.
a₁ = 9
a_n = a_n-1 + 2

• y = 9 + 2n
• y = 7 + 2n 

Tags

CCSS.HSF.BF.A.2

CCSS.HSF.IF.A.3

CCSS.HSF.LE.A.2