Difference between revisions of "2018 AIME I Problems/Problem 7"
Kevinmathz (talk | contribs) (→Solution) |
(→Video Solution) |
||
(12 intermediate revisions by 9 users not shown) | |||
Line 5: | Line 5: | ||
We can consider two cases: when the three vertices are on one base, and when the vertices are on two bases. | We can consider two cases: when the three vertices are on one base, and when the vertices are on two bases. | ||
− | Case 1: vertices are on one base. Then we can call one of the vertices <math>A</math> for distinction. Either the triangle can have sides <math>1, 1, \sqrt{3}</math> with 6 cases or <math> | + | Case 1: vertices are on one base. Then we can call one of the vertices <math>A</math> for distinction. Either the triangle can have sides <math>1, 1, \sqrt{3}</math> with 6 cases or <math>\sqrt{3}, \sqrt{3}, \sqrt{3}</math> with 2 cases. This can be repeated on the other base for <math>16</math> cases. |
Case 2: The vertices span two bases. WLOG call the only vertex on one of the bases <math>X</math>. Call the closest vertex on the other base <math>B</math>, and label clockwise <math>C, D, E, F, G</math>. We will multiply the following scenarios by <math>12</math>, because the top vertex can have <math>6</math> positions and the top vertex can be on the other base. We can have <math>XCG, XDF</math>, but we are not done! Don't forget that the problem statement implies that the longest diagonal in a base is <math>2</math> and the height is <math>2</math>, so <math>XBE</math> is also correct! Those are the only three cases, so there are <math>12*3=36</math> cases for this case. | Case 2: The vertices span two bases. WLOG call the only vertex on one of the bases <math>X</math>. Call the closest vertex on the other base <math>B</math>, and label clockwise <math>C, D, E, F, G</math>. We will multiply the following scenarios by <math>12</math>, because the top vertex can have <math>6</math> positions and the top vertex can be on the other base. We can have <math>XCG, XDF</math>, but we are not done! Don't forget that the problem statement implies that the longest diagonal in a base is <math>2</math> and the height is <math>2</math>, so <math>XBE</math> is also correct! Those are the only three cases, so there are <math>12*3=36</math> cases for this case. | ||
Line 16: | Line 16: | ||
~kevinmathz~ | ~kevinmathz~ | ||
+ | |||
+ | ==Solution 3== | ||
+ | |||
+ | To start, let's find the distances from any vertex (call it A, doesn't matter since the prism is symmetrical) to all the other 11 vertices. Using Pythagorean relations, we find that the distances are <math>1</math>, <math>\sqrt{3}</math>, <math>2</math>, <math>\sqrt{3}</math>, <math>1</math>, <math>\sqrt{7}</math>, <math>\sqrt{5}</math>, <math>2</math>, <math>\sqrt{5}</math>, <math>\sqrt{7}</math>, and <math>\sqrt{8}</math>. | ||
+ | |||
+ | We can clearly form an isosceles triangle using any vertex and any two neighboring edges that are equal. There are 12 total vertices, all of which are symmetrical to the vertex A. Thus, for each vertex, we can form 5 isosceles triangles (with neighboring edges <math>1</math>-<math>1</math>, <math>2</math>-<math>2</math>, <math>\sqrt{3}</math>-<math>\sqrt{3}</math>, <math>\sqrt{5}</math>-<math>\sqrt{5}</math>, and <math>\sqrt{7}</math>-<math>\sqrt{7}</math>) , so have so far <math>12 \times 5 = 60</math> isosceles triangles. | ||
+ | |||
+ | To check for overcounting, note that isosceles triangles can be split into two major categories: equilateral isosceles, and non-equilateral isosceles. | ||
+ | We only counted non-equilateral isosceles triangles once since there is only one vertex whose two neighboring edges are equal. | ||
+ | But equilateral triangles were counted three times (namely once for each vertex). | ||
+ | |||
+ | By observation, there are only 4 equilateral triangles (1-1-1 side lengths), two on each hexagonal face. Since we counted each two more times than we should of (three instead of once), we will subtract (<math>4</math> eq. triangles) <math>\times</math> (<math>2</math> overcounts per eq. triangle) = <math>8</math> overcounts. | ||
+ | |||
+ | Finally, we have <math>60 - 8</math> overcounts = <math>\boxed{052}</math> isoceles triangles. | ||
+ | |||
+ | ==Solution 4== | ||
+ | Start by drawing the hexagonal prism. Start from one of the points, let's call it <math>A</math>. From simple inspection, we can see that each point we choose creates <math>4</math> isosceles triangles; <math>A</math> and the two adjacent points, <math>A</math> and the two points adjacent to those, <math>A</math> and the adjacent point on the other face, and <math>A</math> and the two points adjacent to those. Here, we have <math>12\cdot4\Rightarrow48</math> isosceles triangles. | ||
+ | |||
+ | Next, notice that you can create an isosceles triangle with the bases of the hexagonal prism. Let's say that our base, starting from the very left-most point of the hexagon, has points <math>A, B, C, D, E, F</math>, rotating counter-clockwise. We can create a triangle with either points <math>\bigtriangleup{BCE}</math> or <math>\bigtriangleup{BCF}</math>. WLOG, assuming we use <math>\bigtriangleup{BCE}</math>, we can use the Law of Cosines and find that <math>\overline{CE}</math> = <math>\sqrt{3}</math>. Thus, this would mean <math>\overline{CF}</math> is <math>2</math>, which is the exactly the same length as the height of the hexagonal prism. There are <math>4</math> possibilities of this case, so our final solution is <math>48+4=\boxed{052}</math>. | ||
+ | |||
+ | Solution by IronicNinja~ | ||
+ | ==Solution 5 (Official MAA)== | ||
+ | There are <math>2</math> equilateral and <math>6</math> other isosceles triangles on each base, providing a total of <math>16</math> triangles when all <math>3</math> vertices are chosen from the same base. To count the rest of the isosceles triangles, there are <math>2</math> ways to choose the base that will contain <math>2</math> vertices. Assume that <math>2</math> vertices have been chosen from the bottom base. Then there are no isosceles triangles if the <math>2</math> vertices on the bottom base are adjacent vertices of the hexagon, <math>6\cdot 2=12</math> isosceles triangles if the <math>2</math> vertices on the bottom base have <math>1</math> vertex between them on the hexagon, and <math>3\cdot2=6</math> isosceles triangles if the <math>2</math> vertices on the bottom base have <math>2</math> vertices between them on the hexagon. | ||
+ | |||
+ | The total number of isosceles triangles is <math>16+2(12+6)=52.</math> | ||
+ | ==Video Solution== | ||
+ | |||
+ | https://www.youtube.com/watch?v=iE8paW_ICxw | ||
+ | ~Shreyas S | ||
+ | |||
+ | This is invalid. ~ishanvannadil2008 | ||
== See also == | == See also == | ||
{{AIME box|year=2018|n=I|num-b=6|num-a=8}} | {{AIME box|year=2018|n=I|num-b=6|num-a=8}} | ||
{{MAA Notice}} | {{MAA Notice}} |
Latest revision as of 17:54, 8 March 2021
Contents
Problem
A right hexagonal prism has height . The bases are regular hexagons with side length . Any of the vertices determine a triangle. Find the number of these triangles that are isosceles (including equilateral triangles).
Solution 1
We can consider two cases: when the three vertices are on one base, and when the vertices are on two bases.
Case 1: vertices are on one base. Then we can call one of the vertices for distinction. Either the triangle can have sides with 6 cases or with 2 cases. This can be repeated on the other base for cases.
Case 2: The vertices span two bases. WLOG call the only vertex on one of the bases . Call the closest vertex on the other base , and label clockwise . We will multiply the following scenarios by , because the top vertex can have positions and the top vertex can be on the other base. We can have , but we are not done! Don't forget that the problem statement implies that the longest diagonal in a base is and the height is , so is also correct! Those are the only three cases, so there are cases for this case.
In total there's cases.
Solution 2
If there are two edges on a single diameter, there would be six diameters. There are four ways to put the third number, and four equilateral triangles. There are ways. Then, if one length was but no side on the diameter, there would be twelve was to put the side, and two ways to put the other point. for four ways to put the third point. Adding the number up, the final answer is
~kevinmathz~
Solution 3
To start, let's find the distances from any vertex (call it A, doesn't matter since the prism is symmetrical) to all the other 11 vertices. Using Pythagorean relations, we find that the distances are , , , , , , , , , , and .
We can clearly form an isosceles triangle using any vertex and any two neighboring edges that are equal. There are 12 total vertices, all of which are symmetrical to the vertex A. Thus, for each vertex, we can form 5 isosceles triangles (with neighboring edges -, -, -, -, and -) , so have so far isosceles triangles.
To check for overcounting, note that isosceles triangles can be split into two major categories: equilateral isosceles, and non-equilateral isosceles. We only counted non-equilateral isosceles triangles once since there is only one vertex whose two neighboring edges are equal. But equilateral triangles were counted three times (namely once for each vertex).
By observation, there are only 4 equilateral triangles (1-1-1 side lengths), two on each hexagonal face. Since we counted each two more times than we should of (three instead of once), we will subtract ( eq. triangles) ( overcounts per eq. triangle) = overcounts.
Finally, we have overcounts = isoceles triangles.
Solution 4
Start by drawing the hexagonal prism. Start from one of the points, let's call it . From simple inspection, we can see that each point we choose creates isosceles triangles; and the two adjacent points, and the two points adjacent to those, and the adjacent point on the other face, and and the two points adjacent to those. Here, we have isosceles triangles.
Next, notice that you can create an isosceles triangle with the bases of the hexagonal prism. Let's say that our base, starting from the very left-most point of the hexagon, has points , rotating counter-clockwise. We can create a triangle with either points or . WLOG, assuming we use , we can use the Law of Cosines and find that = . Thus, this would mean is , which is the exactly the same length as the height of the hexagonal prism. There are possibilities of this case, so our final solution is .
Solution by IronicNinja~
Solution 5 (Official MAA)
There are equilateral and other isosceles triangles on each base, providing a total of triangles when all vertices are chosen from the same base. To count the rest of the isosceles triangles, there are ways to choose the base that will contain vertices. Assume that vertices have been chosen from the bottom base. Then there are no isosceles triangles if the vertices on the bottom base are adjacent vertices of the hexagon, isosceles triangles if the vertices on the bottom base have vertex between them on the hexagon, and isosceles triangles if the vertices on the bottom base have vertices between them on the hexagon.
The total number of isosceles triangles is
Video Solution
https://www.youtube.com/watch?v=iE8paW_ICxw ~Shreyas S
This is invalid. ~ishanvannadil2008
See also
2018 AIME I (Problems • Answer Key • Resources) | ||
Preceded by Problem 6 |
Followed by Problem 8 | |
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 | ||
All AIME Problems and Solutions |
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions.