Explicit versus Recursive

• Explicit

• Recursive

Tags

CCSS.HSF.IF.A.3

• Explicit

• Recursive

Tags

CCSS.HSF.BF.A.2

Recursive Formulas always have a subscript of n - 1.

• True

• False

Tags

CCSS.HSF.IF.A.3

You must know a starting value for a recursive formula.

• True

• False

Tags

CCSS.HSF.IF.A.3

Explicit formulas do not require you to know a starting value or a previous term.

• True

• False

Tags

CCSS.HSF.BF.A.2

• Explicit

• Recursive

Tags

CCSS.HSF.BF.A.2

• Explicit

• Recursive

Tags

CCSS.HSF.IF.A.3

• The subscript is n.

• The subscript is

  n - 1.

• It has multiplication.

Tags

CCSS.HSF.BF.A.2

• It has subtraction.

• It can be recursive or explicit.

• There is not enough information to determine it it is recursive or explicit.

• The n - 1 is not a subscript.

Tags

CCSS.HSF.BF.A.2

• It has addition.

• The subscript is n.

• The subscript is

  n - 1.

• There is not enough information to determine if it is explicit or recursive.

Tags

CCSS.HSF.IF.A.3