Difference between revisions of "2006 AIME I Problems/Problem 8"

m (img)
m
Line 1: Line 1:
 
== Problem ==
 
== Problem ==
There is an unlimited supply of [[congruent]] [[equilateral triangle]]s made of colored paper. Each [[triangle]] is a solid color with the same color on both sides of the paper. A large equilateral triangle is constructed from four of these paper triangles. Two large triangles are considered distinguishable if it is not possible to place one on the other, using translations, rotations, and/or reflections, so that their corresponding small triangles are of the same color.
+
[[Hexagon]] <math> ABCDEF </math> is divided into five [[rhombus]]es, <math> \mathcal{P, Q, R, S,} </math> and <math> \mathcal{T,} </math> as shown. Rhombuses <math> \mathcal{P, Q, R,} </math> and <math> \mathcal{S} </math> are [[congruent (geometry) | congruent]], and each has [[area]] <math> \sqrt{2006}. </math> Let <math> K </math> be the area of rhombus <math> \mathcal{T}</math>. Given that <math> K </math> is a [[positive integer]], find the number of possible values for <math> K</math>.
  
Given that there are six different colors of triangles from which to choose, how many distinguishable large equilateral triangles may be formed?
+
[[Image:2006AimeA8.PNG]]
 
 
[[Image:2006_I_AIME-8.png]]
 
  
 
== Solution ==
 
== Solution ==
If two of our big equilateral triangles have the same color for their center triangle and the same [[multiset]] of colors for their outer three triangles, we can carry one onto the other by a combination of rotation and reflection. Thus, to make two triangles distinct, they must differ either in their center triangle or in the collection of colors which make up their outer three triangles.
+
Let <math>x</math> denote the common side length of the rhombi.
 
+
Let <math>y</math> denote one of the smaller interior [[angle]]s of rhombus <math> \mathcal{P} </math>. Then <math>x^2\sin(y)=\sqrt{2006}</math>. We also see that <math>K=x^2\sin(2y) \Longrightarrow K=2x^2\sin y \cdot \cos y \Longrightarrow K = 2\sqrt{2006}\cdot \cos y</math>.  Thus <math>K</math> can be any positive integer in the [[interval]] <math>(0, 2\sqrt{2006})</math>.  
There are 6 possible colors for the center triangle.
+
<math>2\sqrt{2006} = \sqrt{8024}</math> and <math>89^2 = 7921 < 8024 < 8100 = 90^2</math>, so <math>K</math> can be any [[integer]] between 1 and 89, inclusive. Thus the number of positive values for <math>K</math> is 089.
 
 
*There are <math>{6\choose3} = 20</math> possible choices for the three outer triangles, if all three have different colors.
 
*There are <math>6\cdot 5 = 30</math> (or <math>2 {6\choose2}</math>) possible choices for the three outer triangles, if two are one color and the third is a different color.
 
*There are <math>{6\choose1} = 6</math> possible choices for the three outer triangles, if all three are the same color.
 
 
 
Thus, in total we have <math>6\cdot(20 + 30 + 6) = 336</math> total possibilities.
 
  
 
== See also ==
 
== See also ==
 
{{AIME box|year=2006|n=I|num-b=7|num-a=9}}
 
{{AIME box|year=2006|n=I|num-b=7|num-a=9}}
  
[[Category:Intermediate Combinatorics Problems]]
+
[[Category:Intermediate Geometry Problems]]
 +
[[Category:Intermediate Trigonometry Problems]]

Revision as of 19:31, 25 September 2007

Problem

Hexagon $ABCDEF$ is divided into five rhombuses, $\mathcal{P, Q, R, S,}$ and $\mathcal{T,}$ as shown. Rhombuses $\mathcal{P, Q, R,}$ and $\mathcal{S}$ are congruent, and each has area $\sqrt{2006}.$ Let $K$ be the area of rhombus $\mathcal{T}$. Given that $K$ is a positive integer, find the number of possible values for $K$.

2006AimeA8.PNG

Solution

Let $x$ denote the common side length of the rhombi. Let $y$ denote one of the smaller interior angles of rhombus $\mathcal{P}$. Then $x^2\sin(y)=\sqrt{2006}$. We also see that $K=x^2\sin(2y) \Longrightarrow K=2x^2\sin y \cdot \cos y \Longrightarrow K = 2\sqrt{2006}\cdot \cos y$. Thus $K$ can be any positive integer in the interval $(0, 2\sqrt{2006})$. $2\sqrt{2006} = \sqrt{8024}$ and $89^2 = 7921 < 8024 < 8100 = 90^2$, so $K$ can be any integer between 1 and 89, inclusive. Thus the number of positive values for $K$ is 089.

See also

2006 AIME I (ProblemsAnswer KeyResources)
Preceded by
Problem 7
Followed by
Problem 9
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15
All AIME Problems and Solutions