Translating Explicit and Recursive

Write a Next/Now rule for the table.

• Next=Now + 4 Starting at 2

• Next=Now + 4 Starting at 0

• Next=Now × 3 Starting at 2

• Next=Now × 3 Starting at 0

Tags

CCSS.6.EE.C.9

Given the recursive formula below, find the first five terms. u₁ = 3 u_n = u_n-1 + 2

• 3, 5, 7, 9, 11

• 5, 7, 9, 11, 13

Tags

CCSS.HSF.BF.A.2

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

Which of the following equations is recursive?

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

• f(n) = 2n - 5

Tags

CCSS.HSF.IF.A.3

• 1

• 2

• 3

• 4

Tags

CCSS.HSF.IF.A.3

Which of the following equations is explicit?

• f(n) = 4n + 5

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

Tags

CCSS.HSF.BF.A.2

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

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

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

• a_n = -11 + (n-1)(5)

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

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

Tags

CCSS.HSF.BF.A.2

Given the sequence:
a₁ = 25
a_n=a_n-1-4
Write the explicit equation that models the sequence.

• a_n = 4n + 29

• a_n = -4n + 25

• a_n = -4n + 29

• a_n = 4n + 25

Tags

CCSS.HSF.BF.A.2

Write the recursive formula for
a_n = 17 + (n-1)(11)

• a₁ = 17
  a_n=a_n-1+11

• a₁ = 17
  a_n=a_n-1-11

• a_n=a
  a₁ = 17_n-1+11

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

Tags

CCSS.HSF.BF.A.2