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

CCSS.HSF.IF.A.3

CCSS.HSF.LE.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

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

What is the a_n-1 if the a_n=5?

• 7

• 6

• 4

• 72

Tags

CCSS.HSF.BF.A.2

CCSS.HSF.IF.A.3

CCSS.HSF.LE.A.2

Write the recursive formula for 4, 8, 12....

• a_n=a_n-1-7

• a_n=a_n-1-4

• a_n=a_n-1+3

• a_n=a_n-1+4

Tags

CCSS.HSF.BF.A.2

CCSS.HSF.IF.A.3

CCSS.HSF.LE.A.2

Write the recursive formula of 13, 9, 5...

• a_n=a_n-1-4

• a_n=a_n-1+3

• a_n=a_n-1-5

• a_n=a_n-1+4

Tags

CCSS.HSF.BF.A.2

CCSS.HSF.IF.A.3

A formula that requires the computation of all previous terms to find the value of a_n.

• Explicit Formula

• Recursive Formula

• Arithmetic Formula

• Geometric Formula

Tags

CCSS.HSF.BF.A.2

CCSS.HSF.IF.A.3

On a scale of 1-5, 1 meaning "I have no clue what recursive sequences are" to 5 meaning "I got it completely," how would you rate your understanding of today's lesson?

• 1

• 2

• 3

• 4

• 5

Tags

CCSS.HSF.BF.A.2

CCSS.HSF.IF.A.3

What is the a_n-1 if the a_n=-9?

• 9

• 10

• -10

• 2

Tags

CCSS.HSF.BF.A.2

CCSS.HSF.IF.A.3

CCSS.HSF.LE.A.2

What is the a_n if the a_n+1= 3?

• 4

• 2

• 3

• -3

Tags

CCSS.HSA.REI.B.3

CCSS.HSA.SSE.A.1

CCSS.HSF.BF.A.2

CCSS.HSF.IF.A.3