Unit 1, Lesson 1
A Towering Sequence
Algebra 2
1.1
Warm-up
Which Three Go Together: What’s Next?
Which three go together? Why do they go together?
A
2, 3, 5, 9, 17
B
2, 3, 4.5, 6.75
C
2, 1,
D
2, -4, 8, -16, 32
Sign in to view assessments and invite other educators
Sign in using your existing Kendall Hunt account. If you don’t have one, create an educator account.
In the Tower of Hanoi (huh-NOY) puzzle, a set of discs sits on 1 peg, and there are 2 other empty pegs.
A move in the Tower of Hanoi puzzle involves taking a disc and moving it to another peg. There are two rules:
You complete the puzzle by building the complete tower on any peg other than the starting peg.
Some checkers are lined up. Blue checkers are on one side, red are on the other, and there is 1 empty space between them. A move in this checker game pushes any checker forward 1 space or jumps over any 1 checker of the other color. Jumping the same color is not allowed, moving backward is not allowed, and 2 checkers cannot occupy the same space.
A puzzle that consists of a row of 7 connected squares. From left to right, the squares contain the following, blue checker, blue checker, blue checker, empty, red checker, red checker, red checker.
The puzzle is completed when the colors are completely switched: ending up with blue on the right, red on the left, and 1 empty space between them.
A list of numbers, possibly going on forever, such as all the odd positive integers arranged in order: 1, 3, 5, 7, . . . .
One of the numbers in a sequence.
Help us improve by sharing suggestions or reporting issues.