Core practice ← Back to lesson

Arithmetic Sequences: 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

Progress saved in this browser.

Problem 1 of 10
  1. Problem 1 The stored entries

    An arithmetic sequence has a1=−2a_1=-2 and common difference d=6d=6. Find a13a_{13}.

  2. Problem 2 The covered digit

    The three numbers 5252, 4□4\square, and 3838, in that order, form an arithmetic sequence, where the square hides the ones digit of the middle number. Find the middle number.

  3. Problem 3 The decimal record

    A sequence starts with a1=−2.5a_1=-2.5 and follows an=an−1+0.75a_n=a_{n-1}+0.75 for every integer n≥2n\ge2. Write its explicit rule in the form an=pn+qa_n=pn+q for positive integers nn.

  4. Problem 4 The selected entries

    An arithmetic sequence has a1=4a_1=4 and common difference 2.52.5. A device keeps entries in positions 11, 44, 77, 1010, and so on, skipping two entries between kept entries. It calls the kept sequence b1,b2,b3,…b_1,b_2,b_3,\ldots. Give an explicit rule for bnb_n in the form bn=b1+(n−1)Db_n=b_1+(n-1)D and a recursive rule with its starting value.

  5. Problem 5 The matching entry

    A sequence is given by an=17−3(n−1)a_n=17-3(n-1) for positive integers nn. Find every position where the term value equals its own position number.

  6. Problem 6 The tile panels

    The figure shows the first three panels of a tile pattern. Each later panel repeats the shaded column unchanged and adds one more column of the same size as the columns already beside it, with no overlaps. Write the tile count ana_n for Panel nn as an explicit rule in the form an=pn+qa_n=pn+q, and find the count in Panel 1212.

    The first three panels of the tile patternThree panels of equal square tiles, drawn at the same scale and separated by gaps. In every panel a lightly shaded column of five tiles stands on the left. Beside it, Panel 1 has one unshaded column of three tiles, Panel 2 has two such columns and Panel 3 has three. Every column rests on the same bottom line, so the shorter columns reach only part of the way up the shaded one.Panel 1Panel 2Panel 3
    The first three panels of the pattern, with the repeated left column shaded.
    Text description of this figure

    Three tile panels stand side by side, labeled Panel 1, Panel 2 and Panel 3 from left to right. Every panel begins on the left with the same lightly shaded column of five equal square tiles. To the right of that column, Panel 1 has one unshaded column of three tiles, Panel 2 has two unshaded columns of three tiles, and Panel 3 has three unshaded columns of three tiles. All the columns in a panel rest on the same bottom line, and every tile is the same size, with its boundary drawn. No totals, measurements or rules are printed, and no further panel is shown.

  7. Problem 7 The reversed strip

    A strip has nine labels in order, with values an=−3+2.5(n−1)a_n=-3+2.5(n-1) for integers 1≤n≤91\le n\le9. The strip is turned end for end, and the labels in the new order are called b1b_1 through b9b_9. Give bnb_n in the form bn=b1+(n−1)Db_n=b_1+(n-1)D, and find the new position of the label 9.59.5.

  8. Problem 8 The seven entries

    A list has seven real entries a1a_1 through a7a_7 and satisfies a3+a7=2a5a_3+a_7=2a_5. Jo says this guarantees that the whole list is arithmetic. Decide whether Jo is right, and justify your decision.

  9. Problem 9 The stack of cups

    Measured heights of a stack of nested cups are: one cup, 9.59.5 centimeters; two cups, 11.111.1 centimeters; three cups, 12.712.7 centimeters; four cups, 14.314.3 centimeters. Each further cup adds the same amount. Write an explicit rule hnh_n for the height of a stack of nn cups, find the height of a stack of 2020 cups, and decide whether any stack is exactly 3030 centimeters tall.

  10. Problem 10 The constant record

    For positive integers nn, a sequence has an=8+0(n−1)a_n=8+0(n-1). Setting an=8a_n=8, Ivo reaches 0=0(n−1)0=0(n-1). He cancels the zero from both sides to get n−1=0n-1=0, and reports that only n=1n=1 works. Is his conclusion correct? State every position with value 88 and every position with value 99.