Difference between revisions of "2020 AMC 12B Problems/Problem 25"
(→Solution) |
m (→Solution) |
||
Line 19: | Line 19: | ||
<cmath>\sin{(\pi x)}=\cos{(\pi y)}=\sin{(\frac{\pi}{2}\pm \pi y)}</cmath> | <cmath>\sin{(\pi x)}=\cos{(\pi y)}=\sin{(\frac{\pi}{2}\pm \pi y)}</cmath> | ||
− | Solving | + | Solving the first case gives us <cmath>y=\tfrac{1}{2}-x \quad \textrm{and} \quad y=x-\tfrac{1}{2}.</cmath> Solving the second case gives us <cmath>y=x+\tfrac{1}{2}\quad \textrm{and} \quad y=\tfrac{3}{2}-x.</cmath> If we graph these equations in <math>[0,1]\times[0,1]</math>, we get a rhombus shape. |
+ | <asy> | ||
+ | defaultpen(fontsize(9)+0.8); size(200); | ||
+ | pen p=fontsize(10); | ||
+ | pair A,B,C,D,A1,A2,B1,B2,C1,C2,D1,D2,I,L; | ||
+ | A=MP("(0,0)",origin,down+left,p); B=MP("(1,0)",right,down+right,p); C=MP("(1,1)",right+up,up+right,p); D=MP("(0,1)",up,up+left,p); | ||
+ | A1=MP("",extension(A,B,(0.5,0),(0,0.5)),2*down,p); dot(A1); | ||
+ | A2=MP("",extension(A,D,(0.5,0),(0,0.5)),2*left,p); dot(A2); | ||
+ | B1=MP("",extension(B,C,(0.5,0),(0,-0.5)),2*right,p); dot(B1); | ||
+ | B2=MP("",extension(C,D,(0.5,1),(0,0.5)),2*up,p); dot(B2); | ||
+ | real a=0.7; | ||
+ | draw(A1--B1--B2--A2--cycle, gray+0.6); | ||
+ | draw(a*right--a*right+up, royalblue); | ||
+ | draw(A1--B2, royalblue+dashed); | ||
+ | draw(A--B--C--D--A, black+1.2); | ||
+ | </asy> | ||
+ | Testing points in each section tells us that the inside of the rhombus satisfies the inequality in the problem statement. | ||
− | From the region graph, notice that in order to maximize <math>P(a)</math>, <math>a\geq\ | + | From the region graph, notice that in order to maximize <math>P(a)</math>, <math>a\geq\tfrac{1}{2}</math>. We can solve the rest with geometric probability. |
− | When <math>a\geq\ | + | When <math>a\geq\tfrac{1}{2}, P(a)</math> consists of a triangle with area <math>\tfrac{1}{4}</math> and a trapezoid with bases <math>1</math> and <math>2-2a</math> and height <math>a-\frac{1}{2}</math>. Finally, to calculate <math>P(a)</math>, we divide this area by <math>a</math>, so <cmath>P(a)=\frac{1}{a}\left(\frac{1}{4}+\frac{(a-\frac{1}{2})(3-2a)}{2}\right)</cmath> |
− | After expanding out, we get <math>P(a) | + | After expanding out, we get <math>P(a)=2-a-\frac{1}{2a}</math>. In order to maximize this expression, we must minimize <math>a+\frac{1}{2a}</math>. |
By AM-GM, <math>a+\frac{1}{2a}\geq 2\sqrt{\frac{a}{2a}}=\sqrt{2}</math>, which we can achieve by setting <math>a=\frac{\sqrt{2}}{2}</math>. | By AM-GM, <math>a+\frac{1}{2a}\geq 2\sqrt{\frac{a}{2a}}=\sqrt{2}</math>, which we can achieve by setting <math>a=\frac{\sqrt{2}}{2}</math>. |
Revision as of 12:43, 13 July 2022
Contents
Problem
For each real number with , let numbers and be chosen independently at random from the intervals and , respectively, and let be the probability that
What is the maximum value of
Solution
Let's start first by manipulating the given inequality.
Let's consider the boundary cases: and
Solving the first case gives us Solving the second case gives us If we graph these equations in , we get a rhombus shape. Testing points in each section tells us that the inside of the rhombus satisfies the inequality in the problem statement.
From the region graph, notice that in order to maximize , . We can solve the rest with geometric probability.
When consists of a triangle with area and a trapezoid with bases and and height . Finally, to calculate , we divide this area by , so
After expanding out, we get . In order to maximize this expression, we must minimize .
By AM-GM, , which we can achieve by setting .
Therefore, the maximum value of is
Video Solution
On The Spot STEM: https://www.youtube.com/watch?v=5goLUdObBrY
See Also
2020 AMC 12B (Problems • Answer Key • Resources) | |
Preceded by Problem 24 |
Followed by Last Problem |
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.