2025 AIME I Problems/Problem 13
Contents
Problem
Alex divides a disk into four quadrants with two perpendicular diameters intersecting at the center of the disk. He draws more lines segments through the disk, drawing each segment by selecting two points at random on the perimeter of the disk in different quadrants and connecting these two points. Find the expected number of regions into which these
line segments divide the disk.
Solution
Consider a blank circle. Drawing one line yields one more region. In fact, if we consider any arrangement of lines in a circle, drawing one line yields one more region. Since Alex draws more lines, these form
new regions solely by existing. We add these to the original
formed by the perpendicular diameters. We also note that each time a new line intersects an existing line, this adds one more region to the count. All that is left to consider now is the expected number of intersections.
First, we consider how many intersections are expected to occur between the quadrant lines and the new lines. Consider only one of the new lines. Let one of its endpoints lie in one of the four quadrants. There is a
chance that the other endpoint lies on one of the adjacent quadrants, where only one of the diameters would be crossed. There is a
chance that the other endpoint lies on the opposite quadrant, where both of the diameters would be crossed. Thus the expected number of crossings of the diameters for one line is
. There are
lines, so
crossings.
Next, we consider interactions between non-diameter lines. Assume we place one line arbitrarily onto the circle (the blue line). As before, there is a chance that the line's endpoints lie on adjacent quadrants and a
chance that the line's endpoints lie on opposite quadrants. We first consider the adjacent quadrant case.
Assume WLOG that the endpoints of the blue line lie in quadrants one and four (diagram above). Let the arc lengths from the end of the -axis to the endpoints be
and
, and let the arc length of one quadrant be
. We know that
and
's angles range between
and
degrees and the probability is evenly distributed, so the expected value of
and
's central angles are
degrees, or
. We need only consider the expected values, so let
and
.
For our new line, we first place one endpoint in some region and consider probabilities. We first consider the case where the first endpoint is placed in the arc. This occurs with a probability of
. Then the sum of the arcs where the new line would cross the blue line is
(remember that the new line cannot fall in one quadrant only), so the overall probability is
. Since we only need expected values, we can substitute in
to find a probability of
. Notice that the first endpoint falling in the
arc case is the same since
, so the probability doubles to
. Finally, we could have flipped the new line (placing the first endpoint where the second currently is and vice versa), so we double again for an overall probability of
. This only occurs
of the time, so the contribution is
.
Next, we consider the case where the blue line's endpoints fall in two opposite quadrants.
(am completing right now)
Solution 1
First, we calculate the probability that two segments intersect each other. Let the quadrants be numbered through
in the normal labeling of quadrants, let the two perpendicular diameters be labeled the
-axis and
-axis, and let the two segments be
and
Segment
has endpoints in two opposite quadrants. This happens with probability
WLOG let the two quadrants be
and
We do cases in which quadrants segment
lies in.
- Quadrants
and
and
and
and
and
: These share one quadrant with
and it is clear that for any of them to intersect
it must be on a certain side of
For example, if it was quadrants
and
then the point in quadrant
must be closer to the
-axis than the endpoint of
in quadrant
This happens with probability
Additionally, segment
has a
to have endpoints in any set of two quadrants, so this case contributes to the total probability
- Quadrants
and
This always intersects segment
so this case contributes to the total probability
- Quadrants
and
We will first choose the endpoints, and then choose the segments from the endpoints. Let the endpoints of the segments in quadrant
be
and
and the endpoints of the segments in quadrant
be
and
such that
and
are in clockwise order. Note that the probability that
and
intersect is the probability that
is paired with
which is
Thus, this case contributes to the total probability
Segment
has endpoints in two adjacent quadrants. This happens with probability
WLOG let the two quadrants be
and
We do cases in which quadrants segment
lies in.
- Quadrants
and
and
and
and
and
This is similar to our first case above, so this contributes to the total probability
- Quadrants
and
This cannot intersect segment
- Quadrants
and
Similar to our third case above, this intersects segment
with probability
so this case contributes to the total probability
Thus, the probability that two segments intersect is
Next, we will compute the expected number of intersections of a segment with the axes. WLOG let a segment have an endpoint in quadrant
Then, it will intersect each axis with probability
because two out of the three remaining quadrants let it intersect a specific axis, so the expected number of axes a segment intersects is
So, why do intersections matter, because when adding a segment, it will pass through a number of regions, and for each region it passes through, it will split that region into two and add another region. The segment starts in a region, and for each intersection, it will enter another region, so the number of regions a segment passes through is
more than the number of intersections with the axes and other segments. Thus, we have that by linearity of expectation the expected number of new regions created by adding a segment is
so the number of new regions added in total by
segments again by linearity of expectation is
which simplifies to
as the expected number of new regions added by the
segments. At the beginning the axis create
regions, so our answer is
~BS2012
See also
2025 AIME I (Problems • Answer Key • Resources) | ||
Preceded by Problem 12 |
Followed by Problem 14 | |
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.