Explicit to Recursive Formula

Given the first five terms, write the recursive formula.
15, 12, 9, 6, 3 ....

• u₁ = 15
  u_n = u_n-1 + 3

• u₀ = 15
  u_n = u_n-1 + 3

• u₁ = 15
  u_n = u_n-1 - 3 

• u₀ = 15
  u_n = u_n-1 - 3

Tags

CCSS.HSF.BF.A.2

Write the recursive formula of 13, 9, 5, 1, -3, ...

• 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

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

Tags

CCSS.HSF.LE.A.2

Find the first four terms of the sequence. a_n= a_(n-1) - 18 where a₁=10

• 18, 8, -2, -12

• 28, 46, 64, 82

• -8, -26, -44, -60

• 10, -8, -26, -44

Tags

CCSS.HSF.BF.A.2

• A

• B

• C

• None of these

Tags

CCSS.HSF.IF.A.3

Which statement is true about this formula?

• It is an EXPLICIT formula. The first four terms are 5,7,9,11

• It is a RECURSIVE formula. The first four terms are 5,13,29,61

• It is an EXPLICIT formula. The first four terms are 13,15,17,19

• It is a RECURSIVE formula. The first four terms are 13,29,61,125

Tags

CCSS.HSF.IF.A.3

Which recursive formula best describes the sequence 2, -6, 18, - 54...

• a₁ = 2; a_{n =} -4 a_n-1

• a₁ = 2; a_{n =} -8 a_n-1

• a₁ = 2; a_{n =} 2 a_n-1

• a₁ = 2; a_{n =} -3 a_n-1

Tags

CCSS.HSF.BF.A.2

Which statement is true about this formula?

• It is an EXPLICIT formula. The first four terms are -1,2,7,14

• It is a RECURSIVE formula. The first four terms are -2,2,0,-2

• It is an EXPLICIT formula. The first four terms are -1,-3,7,47

• It is a RECURSIVE formula. The first four terms are -2,-6,-18,-36

Tags

CCSS.HSF.BF.A.2

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

Tags

CCSS.HSF.BF.A.2

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