2005 AMC 12A Problems/Problem 25

Problem

Let $S$ be the set of all points with coordinates $(x,y,z)$ , where x, y, and z are each chosen from the set $\{0,1,2\}$ . How many equilateral triangles all have their vertices in $S$ ?

$(\mathrm {A}) \ 72\qquad (\mathrm {B}) \ 76 \qquad (\mathrm {C})\ 80 \qquad (\mathrm {D}) \ 84 \qquad (\mathrm {E})\ 88$

Solution

Solution 1 (non-rigorous)

For this solution, we will just find as many solutions as possible, until it becomes intuitive that there are no more triangles left.

Take an unit cube. We try to make three of its vertices form an equilateral triangle. This we find is possible by taking any vertex, and connecting the three adjacent vertices into a triangle. This triangle will have a side length of $\sqrt{2}$ ; a quick further examination of this cube will show us that this is the only possible side length. Each of these triangles is determined by one vertex of the cube, so in one cube we have 8 equilateral triangles. We have 8 unit cubes, and then the entire cube, giving us 9 cubes and $9 \cdot 8 = 72$ equilateral triangles.

An image is supposed to go here. You can help us out by creating one and editing it in. Thanks.

It may be tempting to connect the centers of the faces and to call that a cube, but a quick look at this tells us that that figure is actually an octahedron.

Now, we look for any additional equilateral triangles. Since the space diagonals of the cube cannot make an equilateral triangle, we will assume symmetry in the cube. A bit more searching shows us that connecting three non-adjacent, non-parallel edges, and connecting their midpoints gives us another equilateral triangle.

An image is supposed to go here. You can help us out by creating one and editing it in. Thanks.

Notice that picking these three edges leaves two vertices alone, and that picking any two opposite vertices determine two equilateral triangles. Hence there are $\frac{8 \cdot 2}{2} = 8$ additional equilateral triangles, for a total of $80 \Longrightarrow \mathrm{(C)}$ .

Solution 2 (rigorous)

See Math Jam solution.

This problem needs a solution. If you have a solution for it, please help us out by adding it.

An image is supposed to go here. You can help us out by creating one and editing it in. Thanks.

2005 AMC 12A (Problems • Answer Key • Resources)
Preceded by Problem 24	Followed by Last question
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 • 16 • 17 • 18 • 19 • 20 • 21 • 22 • 23 • 24 • 25
All AMC 12 Problems and Solutions

Page

Toolbox

Search

2005 AMC 12A Problems/Problem 25

Problem

Contents

Solution

Solution 1 (non-rigorous)

Solution 2 (rigorous)

See also