Art of Problem Solving

2005 AMC 12A Problems/Problem 25: Difference between revisions

1=2 (talk | contribs)
No edit summary
1=2 (talk | contribs)
Line 1: Line 1:
== Problem ==
== Problem ==
Let <math>S</math> be the set of all points with coordinates <math>(x,y,z)</math>, where x, y, and z are each chosen from the set {0,1,2}. How many equilateral triangles all have their vertices in <math>S</math>?
Let <math>S</math> be the [[set]] of all [[point]]s with [[coordinate]]s <math>(x,y,z)</math>, where x, y, and z are each chosen from the set {0,1,2}. How many [[equilateral]] [[triangle]]s all have their [[vertices]] in <math>S</math>?


== Solution ==
== Solution ==

Revision as of 08:16, 9 September 2007

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$?

Solution

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

See also