Difference between revisions of "2011 AIME II Problems/Problem 15"
m (→Solution 2) |
|||
Line 86: | Line 86: | ||
In this case, we have <cmath>1\leq{\sqrt{\frac{y^2-45}{4}}}<2\implies{y\in{[7,\sqrt{61})}}.</cmath> | In this case, we have <cmath>1\leq{\sqrt{\frac{y^2-45}{4}}}<2\implies{y\in{[7,\sqrt{61})}}.</cmath> | ||
To finish, the total length of the interval from which we choose <math>y</math> is <math>27-7=20</math>. The total length of the success intervals is <cmath>(\sqrt{61}-7)+(\sqrt{109}-9)+(\sqrt{621}-23)=\sqrt{61}+\sqrt{109}+\sqrt{621}-39,</cmath>which means the probability is <cmath>\frac{\sqrt{61}+\sqrt{109}+\sqrt{621}-39}{20}.</cmath>AIMEifying the answer gives <math>\boxed{850}</math>. | To finish, the total length of the interval from which we choose <math>y</math> is <math>27-7=20</math>. The total length of the success intervals is <cmath>(\sqrt{61}-7)+(\sqrt{109}-9)+(\sqrt{621}-23)=\sqrt{61}+\sqrt{109}+\sqrt{621}-39,</cmath>which means the probability is <cmath>\frac{\sqrt{61}+\sqrt{109}+\sqrt{621}-39}{20}.</cmath>AIMEifying the answer gives <math>\boxed{850}</math>. | ||
+ | |||
+ | == Solution 3 (Graphing) == | ||
+ | |||
+ | It's definitely possible to conceptualize this problem visually, if that's your thing, since it is a geometric probability problem. Let <math>A = \lfloor\sqrt{P(x)}\rfloor</math> and <math>B = \sqrt{P(\lfloor x \rfloor)}</math>. The graph of <math>A</math> and <math>B</math> will look like this, with <math>A</math> having only integral y-values and <math>B</math> having only integral x-values: | ||
+ | |||
+ | [[File:2011 AIME II Problem 15 Graph 1.png|400px]] | ||
+ | |||
+ | As both <math>A</math> and <math>B</math> consist of a bunch of line segments, the probability that <math>A = B</math> is the "length" of the overlap between the segments of <math>A</math> and <math>B</math> divided by the total length of the segments of <math>B</math>. | ||
+ | |||
+ | Looking at the graph, we see that <math>A</math> and <math>B</math> will overlap only when <math>B</math> is an integer. Specifically, each region of overlap will begin when <math>\sqrt{P(x)}\ = k, 5 \le x \le 15</math> has solutions for integral <math>k</math> in the range of <math>A</math>, which consists of the integers <math>1-13</math>, and end when <math>A</math> jumps up to its next y-value. | ||
+ | |||
+ | Using the quadratic formula, we see that the start point of each of these overlapping segments will be the integral values of <math>\frac{3 + \sqrt{45 + 4k^2}}{2}</math> for <math>k</math> in the specified range, meaning <math>45 + 4k^2</math> must be a perfect square. Plugging in all the possible values of <math>k</math>, we get <math>k = 1, 3, 11</math>, corresponding to start points of <math>x = 5, 6, 13</math>. As already stated, the endpoints will occur when <math>A</math> jumps up to the next integer <math>k</math> at each of these segments, at which point the x-value will be <math>\frac{3 + \sqrt{45 + 4k^2}}{2}</math>. On the graph, the overlapping segments of <math>A</math> and <math>B</math> would be represented by the highlighted green segments below: | ||
+ | |||
+ | [[File:2011 AIME II Problem 15 Graph 2.png|400px]] | ||
+ | |||
+ | |||
+ | Taking the difference between this second x-value and the start point for each of our start points <math>x = 5, 6, 13</math> and summing them will give us the total length of these overlapping segments. We can then divide this value by ten (the total length of the segments of <math>B</math>) to give us the probability of overlap between <math>A</math> and <math>B</math>. | ||
+ | |||
+ | Doing so gives us: | ||
+ | |||
+ | <math>\frac{\left( \frac{3 + \sqrt{61}}{2} - 5 \right) + \left( \frac{3 + \sqrt{109}}{2} - 6 \right) + \left( \frac{3 + \sqrt{621}}{2} - 13 \right)}{10} = \frac{\sqrt{61} + \sqrt{109} + \sqrt{621} - 39}{20}</math> | ||
+ | |||
+ | <math>\implies{61 + 109 + 621 + 39 + 20 = \fbox{850}}</math>. | ||
+ | |||
+ | ~ anellipticcurveoverq | ||
==See also== | ==See also== |
Revision as of 15:13, 21 April 2020
Problem
Let . A real number is chosen at random from the interval . The probability that is equal to , where , , , , and are positive integers. Find .
Solution 1
Table of values of :
In order for to hold, must be an integer and hence must be a perfect square. This limits to or or since, from the table above, those are the only values of for which is an perfect square. However, in order for to be rounded down to , must be less than the next perfect square after (for the said intervals). Now, we consider the three cases:
Case :
must be less than the first perfect square after , which is , i.e.:
(because implies )
Since is increasing for , we just need to find the value where , which will give us the working range .
So in this case, the only values that will work are .
Case :
must be less than the first perfect square after , which is .
So in this case, the only values that will work are .
Case :
must be less than the first perfect square after , which is .
So in this case, the only values that will work are .
Now, we find the length of the working intervals and divide it by the length of the total interval, :
Thus, the answer is .
P.S. You don't need to calculate all the values of P(x) calculated by the above solution. Some very simple modular arithmetic eliminates a large portion of the numbers. The time saved is not that much if you are already at your mathcounts prime.
Solution 2
Make the substitution , so We're looking for solutions to with the new bounds . Since the right side is an integer, it must be that is a perfect square. For simplicity, write and Since , it must be that , which gives solutions , respectively. But this gives us three cases to check:
Case 1: .
In this case, we have Case 2: .
In this case, we have Case 3:
In this case, we have To finish, the total length of the interval from which we choose is . The total length of the success intervals is which means the probability is AIMEifying the answer gives .
Solution 3 (Graphing)
It's definitely possible to conceptualize this problem visually, if that's your thing, since it is a geometric probability problem. Let and . The graph of and will look like this, with having only integral y-values and having only integral x-values:
As both and consist of a bunch of line segments, the probability that is the "length" of the overlap between the segments of and divided by the total length of the segments of .
Looking at the graph, we see that and will overlap only when is an integer. Specifically, each region of overlap will begin when has solutions for integral in the range of , which consists of the integers , and end when jumps up to its next y-value.
Using the quadratic formula, we see that the start point of each of these overlapping segments will be the integral values of for in the specified range, meaning must be a perfect square. Plugging in all the possible values of , we get , corresponding to start points of . As already stated, the endpoints will occur when jumps up to the next integer at each of these segments, at which point the x-value will be . On the graph, the overlapping segments of and would be represented by the highlighted green segments below:
Taking the difference between this second x-value and the start point for each of our start points and summing them will give us the total length of these overlapping segments. We can then divide this value by ten (the total length of the segments of ) to give us the probability of overlap between and .
Doing so gives us:
.
~ anellipticcurveoverq
See also
2011 AIME II (Problems • Answer Key • Resources) | ||
Preceded by Problem 14 |
Followed by Last Problem | |
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.