Difference between revisions of "2016 AMC 12A Problems/Problem 23"
(→Solution) |
Happypi31415 (talk | contribs) (→Solution 9(Fastest solution if you have no time): Stick Solution) |
||
(8 intermediate revisions by 4 users not shown) | |||
Line 6: | Line 6: | ||
==Solution== | ==Solution== | ||
− | [[File:AMC12 2006 A 23.png| | + | [[File:AMC12 2006 A 23.png|500px|center]] |
− | + | ==Solution 1: Super WLOG== | |
− | Because we can let the the sides of the triangle be any variable we want, to make it easier for us when solving, let’s let the side lengths be <math>x,y,</math> and <math>a</math>. WLOG assume <math>a</math> is the largest. Then, <math> | + | Because we can let the the sides of the triangle be any variable we want, to make it easier for us when solving, let’s let the side lengths be <math>x,y,</math> and <math>a</math>. WLOG assume <math>a</math> is the largest. Then, <math>x+y>a</math>, meaning the solution is <math>\boxed{\textbf{(C)}\;1/2}</math>, as shown in the graph below. |
<asy> | <asy> | ||
pair A = (0,0); | pair A = (0,0); | ||
Line 30: | Line 30: | ||
</asy> | </asy> | ||
− | + | ==Solution 2: Conditional Probability== | |
WLOG, let the largest of the three numbers drawn be <math>a>0</math>. Then the other two numbers are drawn uniformly and independently from the interval <math>[0,a]</math>. The probability that their sum is greater than <math>a</math> is <math>\boxed{\textbf{(C)}\;1/2.}</math> | WLOG, let the largest of the three numbers drawn be <math>a>0</math>. Then the other two numbers are drawn uniformly and independently from the interval <math>[0,a]</math>. The probability that their sum is greater than <math>a</math> is <math>\boxed{\textbf{(C)}\;1/2.}</math> | ||
− | + | ==Solution 3: Calculus== | |
When <math>a>b</math>, consider two cases: | When <math>a>b</math>, consider two cases: | ||
Line 46: | Line 46: | ||
<math>a<b</math> is the same. Thus the answer is <math>\frac{1}{2}</math>. | <math>a<b</math> is the same. Thus the answer is <math>\frac{1}{2}</math>. | ||
− | + | ==Solution 4: Geometry== | |
The probability of this occurring is the volume of the corresponding region within a <math>1 \times 1 \times 1</math> cube, where each point <math>(x,y,z)</math> corresponds to a choice of values for each of <math>x, y,</math> and <math>z</math>. The region where, WLOG, side <math>z</math> is too long, <math>z\geq x+y</math>, is a pyramid with a base of area <math>\frac{1}{2}</math> and height <math>1</math>, so its volume is <math>\frac{\frac{1}{2}\cdot 1}{3}=\frac{1}{6}</math>. Accounting for the corresponding cases in <math>x</math> and <math>y</math> multiplies our answer by <math>3</math>, so we have excluded a total volume of <math>\frac{1}{2}</math> from the space of possible probabilities. Subtracting this from <math>1</math> leaves us with a final answer of <math>\frac{1}{2}</math>. | The probability of this occurring is the volume of the corresponding region within a <math>1 \times 1 \times 1</math> cube, where each point <math>(x,y,z)</math> corresponds to a choice of values for each of <math>x, y,</math> and <math>z</math>. The region where, WLOG, side <math>z</math> is too long, <math>z\geq x+y</math>, is a pyramid with a base of area <math>\frac{1}{2}</math> and height <math>1</math>, so its volume is <math>\frac{\frac{1}{2}\cdot 1}{3}=\frac{1}{6}</math>. Accounting for the corresponding cases in <math>x</math> and <math>y</math> multiplies our answer by <math>3</math>, so we have excluded a total volume of <math>\frac{1}{2}</math> from the space of possible probabilities. Subtracting this from <math>1</math> leaves us with a final answer of <math>\frac{1}{2}</math>. | ||
− | + | == Solution 5: More Calculus == | |
The probability of this occurring is the volume of the corresponding region within a <math>1 \times 1 \times 1</math> cube, where each point <math>(x,y,z)</math> corresponds to a choice of values for each of <math>x, y,</math> and <math>z</math>. We take a horizontal cross section of the cube, essentially picking a value for z. The area where the triangle inequality will not hold is when <math>x + y < z</math>, which has area <math>\frac{z^2}{2}</math> or when <math>x+z<y</math> or <math>y+z<x</math>, which have an area of <math>\frac{(1-z)^2}{2}+\frac{(1-z)^2}{2} = (1-z)^2.</math> Integrating this expression from 0 to 1 in the form | The probability of this occurring is the volume of the corresponding region within a <math>1 \times 1 \times 1</math> cube, where each point <math>(x,y,z)</math> corresponds to a choice of values for each of <math>x, y,</math> and <math>z</math>. We take a horizontal cross section of the cube, essentially picking a value for z. The area where the triangle inequality will not hold is when <math>x + y < z</math>, which has area <math>\frac{z^2}{2}</math> or when <math>x+z<y</math> or <math>y+z<x</math>, which have an area of <math>\frac{(1-z)^2}{2}+\frac{(1-z)^2}{2} = (1-z)^2.</math> Integrating this expression from 0 to 1 in the form | ||
Line 56: | Line 56: | ||
<math>\int_0^1 \left(\frac{z^2}{2} + (1-z)^2\right) dz = \bigg[\frac{z^3}{2} - z^2 + z \biggr |_0^1 = \frac{1}{2} -1 + 1 = \frac{1}{2}</math> | <math>\int_0^1 \left(\frac{z^2}{2} + (1-z)^2\right) dz = \bigg[\frac{z^3}{2} - z^2 + z \biggr |_0^1 = \frac{1}{2} -1 + 1 = \frac{1}{2}</math> | ||
− | ==Solution 5.1 (better explanation)== | + | ===Solution 5.1 (better explanation)=== |
This problem is going to require some geometric probability, so let's dive right in. | This problem is going to require some geometric probability, so let's dive right in. | ||
Take three integers <math>x</math>, <math>y</math>, and <math>z</math>. Then for the triangle inequality to hold, the following <math>3</math> inequalities must be true | Take three integers <math>x</math>, <math>y</math>, and <math>z</math>. Then for the triangle inequality to hold, the following <math>3</math> inequalities must be true | ||
Line 107: | Line 107: | ||
~Extremelysupercooldude | ~Extremelysupercooldude | ||
− | + | == Solution 6: Geometry in 2-D == | |
WLOG assume that <math>z</math> is the largest number and hence the largest side. Then <math>x,y \leq z</math>. We can set up a square that is <math>z</math> by <math>z</math> in the <math>xy</math> plane. We are wanting all the points within this square that satisfy <math>x+y > z</math>. This happens to be a line dividing the square into 2 equal regions. Thus the answer is <math>\frac{1}{2}</math>. | WLOG assume that <math>z</math> is the largest number and hence the largest side. Then <math>x,y \leq z</math>. We can set up a square that is <math>z</math> by <math>z</math> in the <math>xy</math> plane. We are wanting all the points within this square that satisfy <math>x+y > z</math>. This happens to be a line dividing the square into 2 equal regions. Thus the answer is <math>\frac{1}{2}</math>. | ||
Line 113: | Line 113: | ||
[][] diagram for this problem goes here (z by z square) | [][] diagram for this problem goes here (z by z square) | ||
− | + | == Solution 7: More WLOG, Complementary Probability == | |
The triangle inequality simplifies to considering only one case: <math>\text{the smallest side+ the second smallest side} > \text{the largest side}</math>. Consider the complement (the same statement, except with a less than or equal to). Assume (WLOG) <math>a</math> is the largest, so on average <math>a=1/2</math> (now equal to becomes a degenerate case with probability <math>0</math>, so we no longer need to consider it). We now want <math>b+c<1/2</math>, so imagine choosing <math>b+c</math> at once rather than independently. But we know that <math>b+c</math> is between <math>0</math> and <math>2</math>. The complement is thus: <math>(1/2-0)/2=1/4</math>. But keep in mind that we choose each <math>b</math> and <math>c</math> randomly and independently, so if there are <math>k</math> ways to choose <math>b+c</math> together, there are <math>2k</math> ways to choose them separately, and therefore the complement actually doubles to match each case (a good example of this is to restrict b and c to integers such that if <math>b+c=3</math>, then we only count this once, but in reality: we have two cases <math>1+2</math>, and <math>2+1</math>; similar reasoning also generalizes to non-integral values). The complement is then actually <math>2(1/4)=1/2</math>. Therefore, our desired probability is given by <math>1-\text{complement}=1/2, C</math> | The triangle inequality simplifies to considering only one case: <math>\text{the smallest side+ the second smallest side} > \text{the largest side}</math>. Consider the complement (the same statement, except with a less than or equal to). Assume (WLOG) <math>a</math> is the largest, so on average <math>a=1/2</math> (now equal to becomes a degenerate case with probability <math>0</math>, so we no longer need to consider it). We now want <math>b+c<1/2</math>, so imagine choosing <math>b+c</math> at once rather than independently. But we know that <math>b+c</math> is between <math>0</math> and <math>2</math>. The complement is thus: <math>(1/2-0)/2=1/4</math>. But keep in mind that we choose each <math>b</math> and <math>c</math> randomly and independently, so if there are <math>k</math> ways to choose <math>b+c</math> together, there are <math>2k</math> ways to choose them separately, and therefore the complement actually doubles to match each case (a good example of this is to restrict b and c to integers such that if <math>b+c=3</math>, then we only count this once, but in reality: we have two cases <math>1+2</math>, and <math>2+1</math>; similar reasoning also generalizes to non-integral values). The complement is then actually <math>2(1/4)=1/2</math>. Therefore, our desired probability is given by <math>1-\text{complement}=1/2, C</math> | ||
− | + | == Solution 8: 3D geometry == | |
We can draw a 3D space where each coordinate is in the range [0,1]. Drawing the lines <math>x+y>z, x+z>y,</math> and <math>y+z>x,</math> We have a 3D space that consists of two tetrahedrons. One is a regular tetrahedron with side length <math>\sqrt2</math> and the other has 3 sides of length <math>\sqrt2</math> and 3 sides of length <math>1.</math> The volume of this region is <math>\frac 1 2</math>. Hence our solution is <math>C.</math> | We can draw a 3D space where each coordinate is in the range [0,1]. Drawing the lines <math>x+y>z, x+z>y,</math> and <math>y+z>x,</math> We have a 3D space that consists of two tetrahedrons. One is a regular tetrahedron with side length <math>\sqrt2</math> and the other has 3 sides of length <math>\sqrt2</math> and 3 sides of length <math>1.</math> The volume of this region is <math>\frac 1 2</math>. Hence our solution is <math>C.</math> | ||
+ | |||
+ | == Solution 9(Fastest solution if you have no time): Stick Solution == | ||
+ | |||
+ | Consider a stick of length <math>1</math>. Cutting the stick at two random points gives a triangle from the three new segments. These two random points must be on opposite sides of the halfway mark. Thus, after the first cut is made, there is <math>\boxed{\textbf{(C) }\frac12}</math> probability that the second cut is on the opposite side. | ||
+ | |||
+ | -this isn't necessarily true: what if the cuts are very very close to the edges? -happypi31415 | ||
+ | |||
+ | -alanisawesome2018 | ||
== Video Solution by Punxsutawney Phil == | == Video Solution by Punxsutawney Phil == |
Latest revision as of 15:49, 16 May 2024
Contents
- 1 Problem
- 2 Solution
- 3 Solution 1: Super WLOG
- 4 Solution 2: Conditional Probability
- 5 Solution 3: Calculus
- 6 Solution 4: Geometry
- 7 Solution 5: More Calculus
- 8 Solution 6: Geometry in 2-D
- 9 Solution 7: More WLOG, Complementary Probability
- 10 Solution 8: 3D geometry
- 11 Solution 9(Fastest solution if you have no time): Stick Solution
- 12 Video Solution by Punxsutawney Phil
- 13 Video Solution by The Art of Problem Solving
- 14 See Also
Problem
Three numbers in the interval are chosen independently and at random. What is the probability that the chosen numbers are the side lengths of a triangle with positive area?
Solution
Solution 1: Super WLOG
Because we can let the the sides of the triangle be any variable we want, to make it easier for us when solving, let’s let the side lengths be and . WLOG assume is the largest. Then, , meaning the solution is , as shown in the graph below.
Solution 2: Conditional Probability
WLOG, let the largest of the three numbers drawn be . Then the other two numbers are drawn uniformly and independently from the interval . The probability that their sum is greater than is
Solution 3: Calculus
When , consider two cases:
1) , then
2), then
is the same. Thus the answer is .
Solution 4: Geometry
The probability of this occurring is the volume of the corresponding region within a cube, where each point corresponds to a choice of values for each of and . The region where, WLOG, side is too long, , is a pyramid with a base of area and height , so its volume is . Accounting for the corresponding cases in and multiplies our answer by , so we have excluded a total volume of from the space of possible probabilities. Subtracting this from leaves us with a final answer of .
Solution 5: More Calculus
The probability of this occurring is the volume of the corresponding region within a cube, where each point corresponds to a choice of values for each of and . We take a horizontal cross section of the cube, essentially picking a value for z. The area where the triangle inequality will not hold is when , which has area or when or , which have an area of Integrating this expression from 0 to 1 in the form
Solution 5.1 (better explanation)
This problem is going to require some geometric probability, so let's dive right in. Take three integers , , and . Then for the triangle inequality to hold, the following inequalities must be true
Now, it would be really easy if these equations only had two variables instead of , because then we could graph it in a -dimensional plane instead of a -dimensional cube. So, we assume is a constant. We will deal with it later.
Now, since we are graphing, we should probably write these equations in terms of so they are in slope-intercept form and are easier to graph.
Now, note that all solutions are in a square in the -plane because , .
I recommend drawing the following figure to get an idea of what is going on. The first line is a line with a negative slope that cuts off a triangle with side length of the bottom left corner of the square. The second line is a line with a positive slope that cuts off a triangle with side length off the top left corner of the square. The third line also has a positive slope and cuts a triangle with side length off the bottom right corner of the square.
Note: All triangles are because the lines have slopes of or .
Using the and signs in the lines, we see that the area that satisfies all three inequalities is the area not enclosed in the three triangles. So, our plan of attack will be to
Find the area of the triangles -> Subtract that from the area of the square -> Use probability to get the answer.
Except, now, we have one problem. is still a variable. But, we want to be a constant. Well, what if we just took the area over every possible value of ? Well, that would be a bit hard, if not impossible to do by hand, but there is a handy math tool that will let us do that: the integral!
To find the area of the triangles, our plan of attack will be
Find the area in terms of -> take the integral from to of the expression for the area (this will cover every possible value of
The area of the triangles is
.
The integral from to is
The total area of all the possible unit squares is quite obviously
Thus, the area not enclosed by the triangles is , and the total area of the square is . Thus, the desired probability is
~Extremelysupercooldude
Solution 6: Geometry in 2-D
WLOG assume that is the largest number and hence the largest side. Then . We can set up a square that is by in the plane. We are wanting all the points within this square that satisfy . This happens to be a line dividing the square into 2 equal regions. Thus the answer is .
[][] diagram for this problem goes here (z by z square)
Solution 7: More WLOG, Complementary Probability
The triangle inequality simplifies to considering only one case: . Consider the complement (the same statement, except with a less than or equal to). Assume (WLOG) is the largest, so on average (now equal to becomes a degenerate case with probability , so we no longer need to consider it). We now want , so imagine choosing at once rather than independently. But we know that is between and . The complement is thus: . But keep in mind that we choose each and randomly and independently, so if there are ways to choose together, there are ways to choose them separately, and therefore the complement actually doubles to match each case (a good example of this is to restrict b and c to integers such that if , then we only count this once, but in reality: we have two cases , and ; similar reasoning also generalizes to non-integral values). The complement is then actually . Therefore, our desired probability is given by
Solution 8: 3D geometry
We can draw a 3D space where each coordinate is in the range [0,1]. Drawing the lines and We have a 3D space that consists of two tetrahedrons. One is a regular tetrahedron with side length and the other has 3 sides of length and 3 sides of length The volume of this region is . Hence our solution is
Solution 9(Fastest solution if you have no time): Stick Solution
Consider a stick of length . Cutting the stick at two random points gives a triangle from the three new segments. These two random points must be on opposite sides of the halfway mark. Thus, after the first cut is made, there is probability that the second cut is on the opposite side.
-this isn't necessarily true: what if the cuts are very very close to the edges? -happypi31415
-alanisawesome2018
Video Solution by Punxsutawney Phil
Video Solution by The Art of Problem Solving
https://www.youtube.com/watch?v=FqRsTNB89ps&list=PLyhPcpM8aMvI7N78mYZyatqveRU30iNcf&index=3
- AMBRIGGS
See Also
2016 AMC 12A (Problems • Answer Key • Resources) | |
Preceded by Problem 22 |
Followed by Problem 24 |
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 |
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions.