Basic Counting Principles: 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 Camera controls
The grid shows the allowed camera settings. The camera currently uses Portrait mode with the flash On. How many new settings change both the mode and the flash choice?
The allowed camera settings, with the mode down the side and the flash choice across the top. Text description of this figure
A grid with three equal rows and two equal columns. The rows are labeled Landscape, Portrait and Macro from top to bottom, under the heading Mode. The columns are labeled On and Off from left to right, under the heading Flash. Every cell holds one identical dot, and no cell is highlighted or numbered.
- Hint 1
Each cell combines a mode with a flash choice.
- Hint 2
Keep the rows and columns whose labels differ from the current choices, then count the cells where they meet.
Answer
settings.
Full solution
The new mode can be Landscape or Macro, giving two choices.
The new flash choice must be Off, giving one choice.
The number of new settings is
The two cells represent Landscape with Off and Macro with Off.
Each changes both controls, and no other cell does.
Answer
settings.
Key idea
A grid can count outcomes that meet restrictions by using the rows and columns still allowed.
- Hint 1
-
Problem 2 Multiples of or
How many whole numbers from to , including both, are a multiple of or a multiple of ?
- Hint 1
Each counted number is a single choice from the multiples of or the multiples of , so ask whether the two groups share any member.
- Hint 2
Count the multiples of up to , and separately count the multiples of up to .
- Hint 3
A number in both groups would be a common multiple of and , so compare their least common multiple with .
Answer
numbers.
Full solution
The multiples of from to are , , , , , and , which is seven numbers.
The multiples of from to are , , , and , which is five numbers.
A number in both groups would be a common multiple of and .
Their least common multiple is , which is greater than , so no number from to is in both groups.
The lists agree: none of , , , and is a multiple of .
Each counted number is one number from one of two separate groups, so the group sizes add.
Multiplying,
would count pairs made of one multiple of and one multiple of , but each outcome here is a single number.
Answer
numbers.
Key idea
Decide between adding and multiplying from what one outcome contains: one item from groups that share no member adds, and one item from each group multiplies.
- Hint 1
-
Problem 3 The walking tour
The tree shows every allowed walking tour. A tour starts at Gate, passes through one middle location, and ends at one room. How many different complete tours are shown?
The tree of allowed walking tours, starting at Gate. Text description of this figure
A tree drawn from left to right. A starting dot labeled Gate has one branch to a middle dot labeled Courtyard and one branch to a middle dot labeled Hall. From Courtyard, one branch goes to a dot labeled Library and one to a dot labeled Studio. From Hall, one branch goes to a dot labeled Gallery, one to a dot labeled Kitchen, and one to a dot labeled Loft. There are no arrows, distances or numbers.
- Hint 1
Follow a whole path from Gate to an ending room to identify one outcome.
- Hint 2
Count the endings reached through each middle location separately, then combine those separate groups of complete tours.
Answer
tours.
Full solution
Through Courtyard there are two tours, ending at Library or Studio.
Through Hall there are three, ending at Gallery, Kitchen, or Loft.
The groups are separate, so
The two middle locations have different numbers of choices afterward.
Counting their endings separately accounts for every tour once.
Answer
tours.
Key idea
When branches offer different numbers of later choices, count each branch separately and add its outcomes.
- Hint 1
-
Problem 4 A sticker strip
A sticker strip is a row of squares, and each square shows one of five shapes: a star, a heart, a moon, a leaf, or a drop. Every strip has the same number of squares, and every such row of shapes is allowed, including repeated shapes. There are exactly possible strips. How many squares does each strip have?
- Hint 1
Adding a square gives five versions of every shorter strip.
- Hint 2
Compare successive powers of with the total number of strips.
Answer
squares.
Full solution
Each square offers five choices, so a strip with squares has possible patterns.
The counts for one through four squares are
The count reaches at four squares.
Each additional square multiplies the count by five, so no other positive whole number of squares gives that total.
Answer
squares.
Key idea
For repeated choices, the exponent tells how many stages are needed to produce the stated total.
- Hint 1
-
Problem 5 Installing the updates
A technician must install four different updates, each exactly once. Any order is allowed. The technician also chooses one of two starting times, morning or evening, with every update order available at either time. How many complete plans are possible?
- Hint 1
A complete plan contains an update order and a starting time.
- Hint 2
Count the update orders one position at a time, removing each used update from the choices.
- Hint 3
Each update order can be paired with either starting time.
Answer
plans.
Full solution
The four update positions have , , , and choices as updates are used.
The number of orders is
Each order works with either of the two starting times.
As a check, morning plans and evening plans are separate groups of , giving .
Answer
plans.
Key idea
Count an order with shrinking choices, then multiply by the choices of any further stage that is available with every order.
- Hint 1
-
Problem 6 Four beats of sound
A sound sequence has four beats. Each beat uses tone A, B, or C, but a tone must differ from the tone immediately before it. A tone may return after an intervening beat. How many sequences are possible?
- Hint 1
The number of choices after the first beat matters, even when the particular available tones change.
- Hint 2
At each later beat, exclude just the tone used immediately before it.
- Hint 3
Multiply the counts for the four beats.
Answer
sequences.
Full solution
The first beat has three choices.
At each later beat, exactly one of the three tones is excluded, leaving two choices.
A tone used earlier than the preceding beat is available again.
This multiplication is valid because every possible earlier sequence leaves exactly two choices for its next beat.
Answer
sequences.
Key idea
When each stage offers the same number of choices after every earlier outcome, the counts multiply, even if the particular choices differ.
- Hint 1
-
Problem 7 Tile samples
A tile catalog originally offers textures and colors, with every texture available in every color. It adds new textures and new color, again offering every combination. How many additional tile choices does the catalog now offer?
- Hint 1
Compare the total choices before the additions with the total afterward.
- Hint 2
Work out the new texture count and the new color count before multiplying.
- Hint 3
Subtract the old total from the new total.
Answer
additional choices.
Full solution
Originally each of the six textures pairs with four colors.
The new catalog has textures and colors.
The increase is
Check by counting the additions separately: the new color gives six choices on the old textures, and the two new textures give choices, for .
Answer
additional choices.
Key idea
When several stages gain choices, compare the full products before and after the change.
- Hint 1
-
Problem 8 Volunteer lists
The chess list contains Ari, Bea, Cal, and Dev. The music list contains Cal, Dev, and Emi. One volunteer may be chosen from either list. Jules claims there are seven possible volunteers. Is the claim correct? Explain.
- Hint 1
A possible volunteer is a person, even when that name appears on both lists.
- Hint 2
Make one organized list in which each eligible name appears once.
Answer
No; there are possible volunteers.
Full solution
The eligible people are Ari, Bea, Cal, Dev, and Emi, so there are five possible volunteers.
Jules added the list sizes,
but that counts Cal twice and Dev twice.
Counting each eligible person once gives , so the claim is false.
Answer
No; there are possible volunteers.
Key idea
Adding group sizes counts a single choice correctly when the groups share no members.
- Hint 1
-
Problem 9 Recorder slots
A recorder stores four sounds in order. Each slot may contain a bell, a whistle, or a clap, and sounds may repeat. Nora groups the first two slots as one block and the last two as another. She writes for the number of possible records. Is her expression correct? Explain what its base and exponent count, and state how many records are possible.
- Hint 1
A group of two sounds needs its own count before it can serve as a single stage.
- Hint 2
Each sound in the first slot of a block can pair with any of the three sounds in its second slot.
- Hint 3
Choosing the first block leaves all possible choices available for the last block.
Answer
Yes; records. Base counts the ordered two-slot blocks, and exponent counts the two blocks in a record.
Full solution
Each block is an ordered pair of sounds.
There are three choices for its first sound and three for its second, including a repeat.
The block count is
Every first block can be followed by any of the nine last blocks.
Thus Nora's count is
The base counts the choices for a whole block, and the exponent counts the two blocks.
The total number of records is
Counting the individual slots also gives
Grouping the slots changes how the choices are organized, but every complete record is still counted once.
Answer
Yes; records. Base counts the ordered two-slot blocks, and exponent counts the two blocks in a record.
Key idea
A group of ordered choices can serve as one counting stage after its possible outcomes have been counted.
- Hint 1
-
Problem 10 Status windows
Three labeled windows each show one of seven different status words. Under rule A, the three windows must show three different words. Under rule B, words may repeat. Mina claims rule B allows twice as many settings as rule A. Is her claim correct? Justify your answer.
- Hint 1
Work out a count for each rule before comparing them.
- Hint 2
Under one rule, a used word is unavailable for the next window; under the other, every word remains available.
- Hint 3
Compare the rule B count with twice the rule A count.
Answer
No; rule A allows settings and rule B allows , which is not twice ().
Full solution
For rule A, the window choices shrink as words are used.
For rule B, all seven choices remain available in every window.
Twice the rule A count is
Since is less than , rule B allows fewer than twice as many settings, so Mina's claim is false.
Answer
No; rule A allows settings and rule B allows , which is not twice ().
Key idea
Allowing repetition changes the choices at each later stage, so compare the complete products.
- Hint 1