Recursive & Nth Term Definitions

Recursive & Nth Term Definitions

10th - 12th Grade

19 Qs

quiz-placeholder

Similar activities

Factoring Quadratic Expressions When "a" is NOT 1

Factoring Quadratic Expressions When "a" is NOT 1

11th - 12th Grade

15 Qs

09-02 Arithmetic & Geometric Sequences

09-02 Arithmetic & Geometric Sequences

9th - 12th Grade

20 Qs

Factoring Quadratics Practice

Factoring Quadratics Practice

10th Grade

16 Qs

Notasi Sigma

Notasi Sigma

11th Grade

20 Qs

Induksi Matematika

Induksi Matematika

11th Grade

20 Qs

Solving Absolute Value Equations

Solving Absolute Value Equations

11th - 12th Grade

20 Qs

Solving Equations with Special Solutions (Pre-Algebra)

Solving Equations with Special Solutions (Pre-Algebra)

8th - 10th Grade

16 Qs

Standard Calculus Test- Finding Limits Graphically

Standard Calculus Test- Finding Limits Graphically

9th - 12th Grade

20 Qs

Recursive & Nth Term Definitions

Recursive & Nth Term Definitions

Assessment

Quiz

Mathematics

10th - 12th Grade

Medium

CCSS
HSF.IF.A.3, HSF.BF.A.2, HSF.LE.A.2

Standards-aligned

Created by

Anna Hankner

Used 69+ times

FREE Resource

19 questions

Show all answers

1.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Media Image

What is the correct recursive definition for sequence g?

Tags

CCSS.HSF.IF.A.3

2.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Media Image

Which of the following is the correct recursive definition for sequence g(n)?

 g(1) = 200, g(n) =2 g(n1)g\left(1\right)\ =\ 200,\ g\left(n\right)\ =2\cdot\ g\left(n-1\right) 

 g(1) = 200, g(n) =12 g(n1)g\left(1\right)\ =\ 200,\ g\left(n\right)\ =\frac{1}{2}\cdot\ g\left(n-1\right) 

 g(0) = 6, g(n) =2 g(n1)g\left(0\right)\ =\ 6,\ g\left(n\right)\ =2\cdot\ g\left(n-1\right) 

 g(0) = 6, g(n) =12 g(n1)g\left(0\right)\ =\ 6,\ g\left(n\right)\ =\frac{1}{2}\cdot\ g\left(n-1\right) 

Tags

CCSS.HSF.IF.A.3

3.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Media Image

What is the correct recursive definition for sequence a(n)?

 a(1) = 100, a(n) =a(n1)+ 5,  n2a\left(1\right)\ =\ 100,\ a\left(n\right)\ =a\left(n-1\right)+\ 5,\ \ n\ge2 

 a(0) = 100, a(n) =a(n1) 5,  n1a\left(0\right)\ =\ 100,\ a\left(n\right)\ =a\left(n-1\right)-\ 5,\ \ n\ge1 

 a(1) = 100, a(n) =a(n1)5,  n95a\left(1\right)\ =\ 100,\ a\left(n\right)\ =a\left(n-1\right)-5,\ \ n\ge95 

 a(0) = 100, a(n) =5a(n1),  n1a\left(0\right)\ =\ 100,\ a\left(n\right)\ =5\cdot a\left(n-1\right),\ \ n\ge1 

Tags

CCSS.HSF.IF.A.3

4.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Media Image

What is the correct recursive definition for sequence a(n)?

a(1) = 18, a(n) =10a(n1)a\left(1\right)\ =\ 18,\ a\left(n\right)\ =10\cdot a\left(n-1\right)

a(0) = 18, a(n) =a(n1) 100a\left(0\right)\ =\ 18,\ a\left(n\right)\ =a\left(n-1\right)-\ 100

a(1) = 18, a(n) =a(n1)100a\left(1\right)\ =\ 18,\ a\left(n\right)\ =a\left(n-1\right)-100

a(0) = 18, a(n) =100+a(n1)a\left(0\right)\ =\ 18,\ a\left(n\right)\ =100+a\left(n-1\right)

Tags

CCSS.HSF.IF.A.3

5.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Media Image

What is the correct recursive definition for sequence a(n)?

a(1) = 88, a(n) =4+a(n1)a\left(1\right)\ =\ 88,\ a\left(n\right)\ =4+a\left(n-1\right)

a(0) = 88, a(n) =a(n1) 4a\left(0\right)\ =\ 88,\ a\left(n\right)\ =a\left(n-1\right)-\ 4

a(1) = 88, a(n) =a(n1)÷4a\left(1\right)\ =\ 88,\ a\left(n\right)\ =a\left(n-1\right)\div4

a(0) = 88, a(n) =10+a(n1)a\left(0\right)\ =\ 88,\ a\left(n\right)\ =10+a\left(n-1\right)

Tags

CCSS.HSF.IF.A.3

6.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Media Image

What is the correct recursive definition for sequence f(n)?

 f(1) = 5, f(n) =3f(n1)f\left(1\right)\ =\ 5,\ f\left(n\right)\ =3\cdot f\left(n-1\right) 

 f(0) = 5, f(n) =f(n1)+10f\left(0\right)\ =\ 5,\ f\left(n\right)\ =f\left(n-1\right)+10 

 f(1) = 5, f(n) =f(n1)15f\left(1\right)\ =\ 5,\ f\left(n\right)\ =f\left(n-1\right)\cdot15 

 f(0) = 5, f(n) =10f(n1)f\left(0\right)\ =\ 5,\ f\left(n\right)\ =10\cdot f\left(n-1\right) 

Tags

CCSS.HSF.IF.A.3

7.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Media Image

What is the correct nth term definition for sequence g(n)?

 g(n) = 62n1,  n1g\left(n\right)\ =\ 6\cdot2^{n-1},\ \ n\ge1 

 g(n) = 6  2(n1), n1g\left(n\right)\ =\ 6\ \cdot\ 2\left(n-1\right),\ n\ge1 

 g(n) = 6 + 2n,  n0g\left(n\right)\ =\ 6\ +\ 2^n,\ \ n\ge0 

 g(n) = 2  6n, n0g\left(n\right)\ =\ 2\ \cdot\ 6^n,\ n\ge0 

Tags

CCSS.HSF.BF.A.2

Create a free account and access millions of resources

Create resources
Host any resource
Get auto-graded reports
or continue with
Microsoft
Apple
Others
By signing up, you agree to our Terms of Service & Privacy Policy
Already have an account?