Example 9.1
How many triangles can be formed by connecting vertices in a regular octagon?
- 1
How many vertices defines a triangle?
Predict first:
Count triangles, squares, rectangles and paths on a grid by choosing points, lines and letters instead of drawing every shape.
In this section you will be able to count triangles by choosing 3 points, and throw out the groups of 3 that sit on one line.
Draw an octagon and join any 3 of its corners. You get a triangle! How many different triangles can you make? Guess before you count.
A triangle is fixed by its 3 corners. So counting triangles is really counting groups of 3 points.
How many triangles can be formed by connecting vertices in a regular octagon?
How many vertices defines a triangle?
How many triangles can be formed by connecting 3 points in the figure below?
How many triangles are in this figure?
In this section you will be able to count squares of every size in a grid, one size at a time.
How many squares are on a 4 × 4 grid? If you said 16, look again: the big outer square counts too, and so do the 2 × 2 ones!
Count the squares size by size. A bigger square has fewer places to sit, so each size gives a smaller perfect square.
The number of squares in a grid of squares is
This comes from the fact that there are squares, squares, …, squares, and square.
How many squares of all sizes can be formed from a 4x4 grid of unit squares?
What's the easiest and most systematic way to count all possible squares?
How many squares of all sizes can be formed from a 3x3 grid of unit squares?
How many squares are in a 5x5 grid of squares with 2 diagonally opposite corners missing?
In this section you will be able to count rectangles in a grid by choosing 2 horizontal lines and 2 vertical lines.
A chocolate bar is a 3 × 5 grid of squares. You may snap out any rectangle of pieces. How many different rectangles could you snap out?
Every rectangle has a top side, a bottom side, a left side and a right side. Pick those lines, and the rectangle is fixed.
The general formula for the number of rectangles of all sizes in a rectangular grid of size is
Each combination of two horizontal lines and two vertical lines creates a unique rectangle. We have
ways to choose two horizontal lines and
ways to choose two vertical lines.
How many rectangles are in a 3x5 grid of rectangles?
What defines a rectangle in a grid?
How many rectangles, which are not squares, are in a grid of squares?
Counting non-squares directly is messy. What is easier to count?
How many squares with side length can be found in a 5 by 5 grid of points?
Can a square with side sit flat, with sides along the grid lines?
How many rectangles of any size are in a grid of squares?
How many rectangles of any size are in a grid of squares?
How many rectangles are in the figure below?
Toothpicks are used to make a grid that is 60 toothpicks long and 32 toothpicks wide. How many toothpicks are used altogether?
In this section you will be able to count up-and-right paths on a grid by turning each path into a word of R's and U's.
A rabbit at (0,0) wants the carrot at (5,5). It can only hop right or up. How many different routes can it take? Guess first!
Write each route as a word: R for a right hop, U for an up hop. Different routes give different words. So counting routes is the same as counting word rearrangements.
The number of ways to get from to a point moving only up and right is
Imagine any arrangement string of R's and U's. Each string would correspond to a unique path, so to count this, we can use the word rearrangement formula.
A rabbit is walking in a coordinate plane and has to get from (0,0) to the carrot at the point (5,5). If the rabbit can only move 1 unit up or 1 unit right on any given move, how many ways are there for the rabbit to get to the carrot?
How many right and up moves does the rabbit need to get to the carrot?
How many ways to go from (0, 0) to (5, 6) moving only right or up if you cannot visit all of (1, 2), (3, 4), and (5, 5) because there is a monster that will eat you if you visit all 3 locations?
You may visit one or two of the spots, just not all three. What is easier to count: the safe paths or the eaten ones?
Sally is inside a pen consisting of points such that . If she is currently on the point , she can move to either , , or . Given that she cannot revisit any point she has visited before, find the number of ways she can reach from .
Sally never moves left. So once she steps right out of a column, can she come back to it?
A game board consists of 64 squares that alternate in color between black and white. The figure below shows square in the bottom row and square in the top row. A marker is placed at . A step consists of moving the marker onto one of the adjoining white squares in the row above. How many 7-step paths are there from to ? (The figure shows a sample path.)
From a white square, which squares can the marker move to?
A mouse is standing on a grid at location (0,0). There is cheese on the grid at (5,5). He can only move right or up. How many different paths can he take to the cheese?
Josh starts at the point (0,0) and needs to travel to his home at the point (6,7). There is a fire at the point (2,3) so he cannot travel there. How many ways are there for Josh to reach his home if he can only move up or right?
Josh starts at the point (0,0) and needs to travel to his home at the point (6,7). There is a fire at the point (2,3) so he cannot travel there. Also, he needs to pick up a book from the library at the point (5,5). How many ways are there for Josh to pick up the book and reach his home if he can only move up or right?
Josh is now home at the point (6,7) but realizes he forgot something at school which is at the point (8,11). Because he is in a rush to get there before it closes, he is now willing to move diagonally (up-right) in addition to being able to go up and right. How many ways can he reach his school?
Samantha lives 2 blocks west and 1 block south of the southwest corner of City Park. Her school is 2 blocks east and 2 blocks north of the northeast corner of City Park. On school days she bikes on streets to the southwest corner of City Park, then takes a diagonal path through the park to the northeast corner, and then bikes on streets to school. If her route is as short as possible, how many different routes can she take?
Joe is standing at the point (0,0) in the infinite coordinate plane. On any given move, there is a chance of him moving up, chance of him moving right, chance of him moving down, and chance of him moving left. If the probability he will reach the point (3,3) in less than or equal to 8 moves can be described as , then what is the value of a + b?
In this section you will be able to mix triangles, squares, rectangles and paths on contest problems.
Time to mix it all up! These problems use every trick in the chapter: choosing points, choosing lines and turning paths into words.
Want every problem from this chapter on one page? Open the problem set.
A frog is located at the origin. It makes four hops, each of which moves it either 1 unit to the right or 1 unit to the left. If it also ends at the origin, how many 4-hop paths can it take?
Leanne and Jing Jing are walking around the plane. In one step, Leanne can move from any point to or and Jing Jing can move from to or . The number of ways that Leanne can move from to is equal to the number of ways that Jing Jing can move from to , where a and b are positive integers. Compute the minimum possible value of .