Exponential Functions and Recursive Formulas

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

• 3, 5, 7, 9, 11

• 5, 7, 9, 11, 13

The recursive formula can only be used if you know the previous term

• True

• False

Tags

CCSS.HSF.BF.A.2

CCSS.HSF.IF.A.3

Given the sequence: a₁ = 25 a_n=a_n-1- 4 Write the explicit equation that models the sequence. Be careful with the 1st term and 0th term when switching from recursive to explicit.

• a_n = 29 + 4n

• a_n = 25 - 4n

• a_n = 29 - 4n

• a_n = 25 + 4n

Tags

CCSS.HSF.BF.A.2

CCSS.HSF.IF.A.3

CCSS.HSF.LE.A.2

Given the sequence: a₁ = 25 a_n=a_n-1 +(-4) Write the explicit equation that models the sequence. Be careful with the 1st term and 0th term when switching from recursive to explicit.

• a_n = 29 + 4n

• a_n = 25 - 4n

• a_n = 29 - 4n

• a_n = 25 + 4n

Tags

CCSS.HSF.BF.A.2

CCSS.HSF.IF.A.3

CCSS.HSF.LE.A.2

Given the recursive formula below, find the explicit formula.

• a_n = 5 - 6(n - 1)

• a_n = 11 - 6(n - 1)

• Both

• Neither

Tags

CCSS.HSF.BF.A.2

CCSS.HSF.LE.A.2

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

• a_n = n - 2

• a_n = -2n + 7

• a_n = 2n - 7

• a_n = -2n + 5

Tags

CCSS.HSF.BF.A.2

CCSS.HSF.IF.A.3

CCSS.HSF.LE.A.2

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

• a_n = n - 2

• a_n = -2n + 7

• a_n = 2n - 7

• a_n = -2n + 5

Which of the following equations is recursive?

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

• f(n) = 2n - 5

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

What is the explicit rule for the sequence:
11, 22, 44, 88...

• a_n = 2(11)^n-1

• a_n = 11x2

• a_n = 11(2)^n-1

• a_n+1 = a_{n *} 2;  a₁ = 11