Explicit and Recursive Equations

Which of the following equations is recursive?

• f(n) = 3n+2

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

  f(1)=5

Tags

CCSS.HSF.IF.A.3

Which of the following equations is explicit?

• f(n) = 4n + 5

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

  f(2)=10

Tags

CCSS.HSF.BF.A.2

Which of the following equations is recursive?

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

  f(1)=17

• f(n) = 11(4)^n-17

Tags

CCSS.HSF.IF.A.3

f(n) = f(n-1) + 5
What does f(n-1) represent?

• The desired number in a sequence
• The previous number in a sequence

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) = 3n+2

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

  f(0)=2

Tags

CCSS.HSF.IF.A.3

Which equation would be best for helping you find the 72^nd term?

• f(n) = 4(2)ⁿ⁺⁵

• f(n) = f(n-1) * 2

  f(0)=6

Tags

CCSS.HSF.BF.A.2

What is the explicit equation for this function?

• f(x) = 1 +2x

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

• f(x) = 2x

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

Tags

CCSS.8.F.B.4

CCSS.HSF.LE.A.2

What is the recursive equation for this function?

• f(0) = 1

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

• f(0) = 1

  f(x) = f(x-1) + 2

• f(1) = 1

  f(x) = f(x-1) + 2

• f(1) = 1

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

Tags

CCSS.HSF.IF.A.3

f(n) = f(n-1) + 5
What does f(n-1) represent?

• The desired number in a sequence
• The previous number in a sequence

Tags

CCSS.HSF.IF.A.3