Recursive sequences Quiz
10 questions · easy to harder · Algebra 2 · score and step-by-step answers
How it works
- 10 questions, about 20 minutes (a timer counts down; you can hide it). Solve it right here: no sign-up.
- 0 questions have choices. For the others you type the answer: a number like 4, −2, 7/2 or 3.5, or for example x = 4, x = 2 or x = −3, (3, 5), 2x + 1. Use ^ for powers (x^2) and sqrt for √. Any form with the same value counts (7/2 = 3.5).
- One question at a time: Back, Next, Mark for review and the question list at the bottom. A calculator is on the screen.
- At the end: your percent and grade, every question right or wrong, why a wrong choice is wrong, and its step-by-step solution. Then practise the lesson with new questions.
Your answers and results are kept in this browser only, so you can close the page and come back.
1 Question 1
a_1 = 3, a_n = a_(n-1) + 4, find the first 5 termsType the answer.
2 Question 2
a_1 = 2, a_n = 3a_(n-1), find the first 5 termsType the answer.
3 Question 3
a_1 = 1, a_n = 2a_(n-1) + 1, find the first 5 termsType the answer.
4 Question 4
a_1 = 4, a_n = 2a_(n-1), find a_5Type the answer.
5 Question 5
a_1 = 64, a_n = a_(n-1) − 9, find the first 4 termsType the answer.
6 Question 6
a_1 = 3, a_n = 2a_(n-1) + 1, find the first 5 termsType the answer.
7 Question 7
a_1 = −1, a_n = 2a_(n-1) + 5, find the first 5 termsType the answer.
8 Question 8
a_1 = 4, a_n = −2a_(n-1), find a_6Type the answer.
9 Question 9
a_1 = 5, a_n = a_(n-1) + 4, write the explicit rule. Find a_n.Type the answer.
10 Question 10
a_1 = 3, a_n = 2a_(n-1), write the explicit rule. Find a_n.Type the answer.