Sequences and Notation: Core practice
10 practice problems for this lesson. Work on paper, use hints when you need them, and check the answer or the full solution when you are ready.
Difficulty: Core (core-course level)
0 of 10 completed · 0 skipped
Progress saved in this browser.
Progress can't be saved in this browser, so your choices last for this visit only.
-
Problem 1 A centered index
A finite sequence is given by for the integer indices . Find .
- Hint 1
The subscript is the input to the rule.
- Hint 2
The absolute value of zero is zero.
Answer
.
Full solution
The index zero is explicitly included, so substitute it into the rule.
Thus .
The input is , while the term it names is .
Answer
.
Key idea
An index identifies a term but need not equal that term's value.
- Hint 1
-
Problem 2 A finite sum
Evaluate .
- Hint 1
Both limits are included, so there are four summands.
- Hint 2
Evaluate the two powers at each of the four integer indices.
Answer
.
Full solution
The summands at are , respectively.
This is four evaluations, including the one at zero.
Answer
.
Key idea
Sigma notation instructs you to evaluate the entire summand at every included integer index.
- Hint 1
-
Problem 3 Three starting terms
A sequence has , , and . For , its rule is . Find .
- Hint 1
Substitute the index four into each subscript of the rule.
- Hint 2
The terms required are those at indices and .
Answer
.
Full solution
At , the recursion requires and , both of which are supplied.
Therefore .
The unused seed will be needed when computing .
Answer
.
Key idea
A recursion may reach past the immediately preceding term, so its subscripts must be followed carefully.
- Hint 1
-
Problem 4 A plotted list
The graph gives every term of a finite sequence . State its domain, write its five terms in index order, and find .
The terms of the sequence b. Text description of this figure
A grid with a horizontal axis labeled n running from -1 to 5 and a vertical axis labeled b running from 0 to 6, on equal unit scales, with a grid line and a label at every integer. Five filled dots stand alone, with no line joining them: above n equals 0 at height 3, above n equals 1 at height 1, above n equals 2 at height 4, above n equals 3 at height 2, and above n equals 4 at height 5. Nothing else is plotted and no dot is labeled.
- Hint 1
Read horizontal coordinates as indices and vertical coordinates as term values.
- Hint 2
Only the plotted integer inputs belong to this finite sequence.
Answer
Domain ; terms ; .
Full solution
The plotted horizontal coordinates are , giving the finite domain.
Reading the corresponding heights gives .
The points above indices two and four have values and .
The term is the third term in this list because indexing starts at zero.
Answer
Domain ; terms ; .
Key idea
A sequence graph records separate index-value pairs in the order specified by its domain.
- Hint 1
-
Problem 5 An incomplete rule
A proposed sequence has and , with for . Identify the missing seed. Show that choosing it as or produces different values of .
- Hint 1
A rule beginning at index four does not determine all of its first three terms.
- Hint 2
Compute and , tracking which starting terms each one uses.
Answer
The missing seed is ; if , and if .
Full solution
The missing initial term is .
The rule gives , which is , so even depends on that choice.
At the next step,
which is .
The two proposed seeds give and , showing that the incomplete specification does not define one sequence.
Answer
The missing seed is ; if , and if .
Key idea
This additive rule starts at index four and reaches back three steps, so all three of its first terms must be given before it defines one sequence.
- Hint 1
-
Problem 6 Two ways to generate
For integers , let . Write a recursive rule using only and constants, including its seed and valid starting index. Find .
- Hint 1
An explicit rule and a recursive definition must produce the same term at every allowed index.
- Hint 2
Substitute into the explicit formula to express the preceding term.
- Hint 3
Use and compare the constant terms.
Answer
; for ; .
Full solution
The explicit rule gives .
Also
so for .
The recursion produces through index four.
The explicit check agrees.
Answer
; for ; .
Key idea
When the next value can be written through the preceding one, as here, an explicit rule becomes a recursion with a seed and a starting index.
- Hint 1
-
Problem 7 A shifted index
Four sensor readings are , , and . Write their total in sigma notation with index running from through , then evaluate it.
- Hint 1
The summation index is a counter and need not equal a reading's subscript.
- Hint 2
Choose a subscript expression that gives six at index zero and nine at index three.
Answer
; the reversed form is also valid.
Full solution
The subscript runs through as runs from to , so the total is
Substituting the recorded values gives , which is .
Listing the readings in reverse order, as , gives the same total.
Answer
; the reversed form is also valid.
Key idea
An index shift lets the summation counter and the recorded subscripts start at different values.
- Hint 1
-
Problem 8 A renaming claim
For a fixed real number , a student writes . Is that true for every ? Evaluate both sums in terms of to justify your answer.
- Hint 1
The index changes name but still takes the same three values.
- Hint 2
The letter remains fixed while the temporary index runs through zero, one, and two.
Answer
Yes; both sums equal .
Full solution
Each sum adds , , and .
Therefore
The names and disappear after evaluation; neither replaces the fixed parameter .
Answer
Yes; both sums equal .
Key idea
A fresh summation-index name changes no summands and therefore changes no sum.
- Hint 1
-
Problem 9 A claimed last index
A finite sequence starts at index and has terms. A student says its last term is . Is that correct? State its last index and explain.
- Hint 1
The first index already names one of the terms.
- Hint 2
There are six steps between the first and seventh terms.
Answer
No; the last index is .
Full solution
The seven indices are .
Equivalently,
Index would introduce an eighth term, so it is outside the stated finite domain.
Answer
No; the last index is .
Key idea
A run of k terms spans k minus one steps between its first and last indices.
- Hint 1
-
Problem 10 Repeated values
Let for positive integers . A student claims this cannot be a sequence because . Is the student correct? Find both terms, state the domain and whether the sequence is finite or infinite, and explain.
- Hint 1
A function assigns exactly one output to each allowed input.
- Hint 2
Evaluate the two terms, then distinguish different inputs sharing an output from one input receiving different outputs.
Answer
No; . The domain is , and the sequence is infinite.
Full solution
At index two, , which is , and at index three, , also .
Different inputs may share an output; every positive integer still receives exactly one value, so the rule defines a sequence.
The domain contains every positive integer, so the sequence is infinite.
Answer
No; . The domain is , and the sequence is infinite.
Key idea
Different indices may name equal terms without violating the definition of a sequence.
- Hint 1