This question tests your understanding that sequences are special functions with integer domains, and how to work with recursively defined sequences. A recursive definition tells you how to get each term from the previous term(s): it gives you a starting value (like f(1) = 2) and a rule for finding the next one (like f(n+1) = 3f(n), which means 'multiply the previous term by 3'). Let's find f(4) step by step using the recursive definition. We start with f(1) = 2. Then we apply the rule f(n+1) = 3f(n): f(2) = 3·f(1) = 3·2 = 6, then f(3) = 3·f(2) = 3·6 = 18, and finally f(4) = 3·f(3) = 3·18 = 54. So f(4) = 54. Building sequences recursively is like climbing stairs—each step depends on the one before! Choice B is correct because it properly follows the recursive rule, multiplying by 3 at each step to get 54. Great work following the pattern! Choice A makes an error by getting 18, which is actually f(3), not f(4). When following recursive rules, each step has to follow the exact rule—one small change throws off all the later terms! When working with recursively defined sequences, always start by writing down the initial term(s) clearly, then apply the rule one step at a time, calculating each new term before moving to the next. For geometric sequences like this one where we multiply by the same number each time, the values grow very quickly!

This question tests your understanding that sequences are special functions with integer domains, and how to work with recursively defined sequences. A recursive definition tells you how to get each term from the previous term(s): it gives you a starting value (like a₁ = 6) and a rule for finding the next one (like aₙ₊₁ = aₙ - 3, which means 'subtract 3 from the previous term'). To find any term, you start at the beginning and apply the rule step by step. Looking at the sequence 6, 3, 0, -3, ..., let's find the pattern between consecutive terms: from 6 to 3, we subtract 3. From 3 to 0, we subtract 3. This pattern holds for all consecutive terms, so the recursive rule is aₙ₊₁ = aₙ - 3, with starting value a₁ = 6. Choice B is correct because it properly identifies the pattern as subtracting 3 each time with the correct starting value of 6. Great work following the pattern! Choice C has the right pattern but starts with the wrong initial value, using 3 instead of 6. The starting value is crucial in recursive sequences—like the first domino that sets everything else in motion! To write a recursive rule from a sequence, compare consecutive terms: What's happening from term to term? Are we adding the same number (arithmetic)? Multiplying by the same number (geometric)? Adding the previous two (Fibonacci-style)? Once you spot the pattern, write it as aₙ₊₁ = [rule using aₙ], and don't forget to state your starting value! The beauty of recursive definitions is that they describe the pattern in the simplest way: 'start at 6, subtract 3 each time' is clear and natural.

This question tests your understanding that sequences are special functions with integer domains, and how to work with recursively defined sequences. A recursive definition tells you how to get each term from the previous term(s): it gives you a starting value (like f(1) = 2) and a rule for finding the next one (like f(n+1) = 2f(n), which means 'multiply the previous term by 2'). To find any term, you start at the beginning and apply the rule step by step. Let's find f(4) step by step using the recursive definition. We start with f(1) = 2. Then we apply the rule f(n+1) = 2f(n): f(2) = 2 * 2 = 4, then f(3) = 2 * 4 = 8, and f(4) = 2 * 8 = 16. So f(4) = 16. Building sequences recursively is like climbing stairs—each step depends on the one before! Choice C is correct because it accurately calculates to get 16 by correctly evaluating each term following the recursive rule. Great work following the pattern! Choice D makes an error in the last step, multiplying by 2 one extra time to get 32 instead of stopping at f(4). When following recursive rules, each step has to follow the exact rule—one small change throws off all the later terms! When working with recursively defined sequences, always start by writing down the initial term(s) clearly, then apply the rule one step at a time, calculating each new term before moving to the next. It's like following a recipe—don't skip steps! If you need the 4th term, you'll typically need to find the 2nd and 3rd terms along the way.

This question tests your understanding that sequences are special functions with integer domains, and how to work with recursively defined sequences. A recursive definition tells you how to get each term from the previous term(s): it gives you a starting value (like $a_1 = 4$) and a rule for finding the next one (like $a_{n+1} = a_n + 3$, which means 'add 3 to the previous term'). To find any term, you start at the beginning and apply the rule step by step. Let's find $a_5$ step by step using the recursive definition. We start with $a_1 = 4$. Then we apply the rule $a_{n+1} = a_n + 3$: $a_2 = 4 + 3 = 7$, then $a_3 = 7 + 3 = 10$, then $a_4 = 10 + 3 = 13$, and $a_5 = 13 + 3 = 16$. So $a_5 = 16$. Building sequences recursively is like climbing stairs—each step depends on the one before! Choice B is correct because it accurately calculates to get 16. Choice A makes an error in the 5th step: it stops at 13 instead of adding 3 one more time. When following recursive rules, each step has to follow the exact rule—one small change throws off all the later terms! When working with recursively defined sequences, always start by writing down the initial term(s) clearly, then apply the rule one step at a time, calculating each new term before moving to the next. It's like following a recipe—don't skip steps! If you need the 5th term, you'll typically need to find the 2nd, 3rd, and 4th terms along the way.

This question tests your understanding that sequences are special functions with integer domains, and how to work with recursively defined sequences. A recursive definition tells you how to get each term from the previous term(s): it gives you a starting value (like f(1) = 2) and a rule for finding the next one (like f(n+1) = 2f(n), which means 'multiply the previous term by 2'). Let's find f(4) step by step using the recursive definition. We start with f(1) = 2. Then we apply the rule f(n+1) = 2f(n): f(2) = 2·f(1) = 2·2 = 4, then f(3) = 2·f(2) = 2·4 = 8, and finally f(4) = 2·f(3) = 2·8 = 16. So f(4) = 16. Building sequences recursively is like climbing stairs—each step depends on the one before! Choice C is correct because it correctly evaluates each term following the recursive rule to get 16. Great work following the pattern! Choice B makes an error in the calculation: it might have added instead of multiplied, or made an arithmetic mistake. When the recursive rule says f(n+1) = 2f(n), we multiply by 2 at each step—this creates a geometric sequence that grows quickly! When working with recursively defined sequences, always start by writing down the initial term(s) clearly, then apply the rule one step at a time, calculating each new term before moving to the next. It's like following a recipe—don't skip steps! If you need the 4th term, you'll typically need to find the 2nd and 3rd terms along the way.

This question tests your understanding that sequences are special functions with integer domains, and how to work with recursively defined sequences. A recursive definition tells you how to get each term from the previous term(s): it gives you a starting value (like a₁ = 6) and a rule for finding the next one (like aₙ₊₁ = ½aₙ, which means 'multiply the previous term by ½'). Let's find a₄ step by step using the recursive definition. We start with a₁ = 6. Then we apply the rule aₙ₊₁ = ½aₙ: a₂ = ½·a₁ = ½·6 = 3, then a₃ = ½·a₂ = ½·3 = 3/2, and finally a₄ = ½·a₃ = ½·(3/2) = 3/4. So a₄ = 3/4. Building sequences recursively is like climbing stairs—each step depends on the one before! Choice B is correct because it correctly evaluates each term following the recursive rule to get 3/4. Great work following the pattern! Choice C (3/2) is actually a₃, not a₄—it stops one step too early. When following recursive rules, each step has to follow the exact rule—one small change throws off all the later terms! When working with recursively defined sequences, always start by writing down the initial term(s) clearly, then apply the rule one step at a time, calculating each new term before moving to the next. It's like following a recipe—don't skip steps! If you need the 4th term, you'll typically need to find the 2nd and 3rd terms along the way.

This question tests your understanding that sequences are special functions with integer domains, and how to work with recursively defined sequences. A recursive definition tells you how to get each term from the previous term(s): it gives you a starting value (like f(1) = 8) and a rule for finding the next one (like f(n+1) = f(n) - 1, which means 'subtract 1 from the previous term'). Let's find f(1), f(2), f(3), f(4) step by step using the recursive definition. We start with f(1) = 8. Then we apply the rule f(n+1) = f(n) - 1: f(2) = f(1) - 1 = 8 - 1 = 7, then f(3) = f(2) - 1 = 7 - 1 = 6, and finally f(4) = f(3) - 1 = 6 - 1 = 5. So the first four terms are 8, 7, 6, 5. Building sequences recursively is like climbing stairs—each step depends on the one before! Choice A is correct because it correctly evaluates each term following the recursive rule to get 8, 7, 6, 5. Great work following the pattern! Choice B adds 1 instead of subtracting 1. When following recursive rules, each step has to follow the exact rule—one small change throws off all the later terms! When working with recursively defined sequences, always start by writing down the initial term(s) clearly, then apply the rule one step at a time, calculating each new term before moving to the next. Remember: sequences ARE functions, just special ones! The input is always a positive integer (the term number), and the output is the term value.

This question tests your understanding that sequences are special functions with integer domains, and how to work with recursively defined sequences. The Fibonacci sequence is a famous recursive sequence where each term is the sum of the two previous terms: f(1) = 1, f(2) = 1, and f(n) = f(n-1) + f(n-2) for n ≥ 3. So f(3) = f(2) + f(1) = 1 + 1 = 2, then f(4) = f(3) + f(2) = 2 + 1 = 3, and so on—each new term builds on the ones before it! For Fibonacci-style sequences where each term is based on the previous two, we need two starting values: f(1) = 1 and f(2) = 1. Then for each new term, we add the previous two: f(3) = f(2) + f(1) = 1 + 1 = 2, f(4) = f(3) + f(2) = 2 + 1 = 3, f(5) = f(4) + f(3) = 3 + 2 = 5, and f(6) = f(5) + f(4) = 5 + 3 = 8. It's like each term 'inherits' from its two parents! Choice B is correct because it correctly calculates f(6) = 8 by following the Fibonacci rule. Great work following the pattern! Choice A (5) is actually f(5), not f(6)—it stops one step too early. When finding a specific term, make sure to count carefully and continue all the way to the term you need! For Fibonacci-type sequences where each term combines previous terms, make a little table as you go: write n = 1, 2, 3, ... down one side and the term values across the top. This helps you keep track of what you've calculated and makes it easy to reference previous terms.

This question tests your understanding that sequences are special functions with integer domains, and how to work with recursively defined sequences. A recursive definition tells you how to get each term from the previous term(s): it gives you a starting value (like f(1) = 4) and a rule for finding the next one (like f(n+1) = f(n) + 3, which means 'add 3 to the previous term'). Let's find f(5) step by step using the recursive definition. We start with f(1) = 4. Then we apply the rule f(n+1) = f(n) + 3: f(2) = f(1) + 3 = 4 + 3 = 7, then f(3) = f(2) + 3 = 7 + 3 = 10, then f(4) = f(3) + 3 = 10 + 3 = 13, and finally f(5) = f(4) + 3 = 13 + 3 = 16. So f(5) = 16. Building sequences recursively is like climbing stairs—each step depends on the one before! Choice B is correct because it correctly evaluates each term following the recursive rule to get 16. Great work following the pattern! Choice C makes an error by adding 4 instead of 3 at some step, getting 19. When following recursive rules, each step has to follow the exact rule—one small change throws off all the later terms! When working with recursively defined sequences, always start by writing down the initial term(s) clearly, then apply the rule one step at a time, calculating each new term before moving to the next. It's like following a recipe—don't skip steps! If you need the 5th term, you'll typically need to find the 2nd, 3rd, and 4th terms along the way.

This question tests your understanding that sequences are special functions with integer domains, and how to work with recursively defined sequences. A recursive definition tells you how to get each term from the previous term(s): it gives you a starting value (like f(0) = 3) and a rule for finding the next one (like f(n+1) = f(n) + 5, which means 'add 5 to the previous term'). To find any term, you start at the beginning and apply the rule step by step. Let's find f(3) step by step using the recursive definition. We start with f(0) = 3. Then we apply the rule f(n+1) = f(n) + 5: f(1) = 3 + 5 = 8, then f(2) = 8 + 5 = 13, and f(3) = 13 + 5 = 18. So f(3) = 18. Building sequences recursively is like climbing stairs—each step depends on the one before! Choice C is correct because it accurately calculates to get 18 by correctly evaluating each term following the recursive rule. Great work following the pattern! Choice D makes an error by stopping at f(2), giving 13 instead of continuing to add 5 for f(3). When following recursive rules, each step has to follow the exact rule—one small change throws off all the later terms! When working with recursively defined sequences, always start by writing down the initial term(s) clearly, then apply the rule one step at a time, calculating each new term before moving to the next. It's like following a recipe—don't skip steps! If you need the 3rd term, you'll typically need to find the 1st and 2nd terms along the way.