2025 AIME I Problem 13
Below is the professionally curated solution for Problem 13 of the 2025 AIME I, from LIVE by Po-Shen Loh. You can also try the full timed exam, view all 2025 AIME I solutions, or check the answer key.
All of the real AMC 8, AMC 10, AMC 12, and AIME problems in our complete solution collection are used with official legal permission of the Mathematical Association of America (MAA).
Difficulty rating: 3270
13.
Alex divides a disk into four quadrants with two perpendicular diameters intersecting at the center of the disk. He draws more line 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:
Adding chords one at a time, each new chord increases the region count by plus the number of existing chords it crosses inside the disk. Starting from one region, the expected total is where is the expected number of interior crossing pairs. The two diameters cross once. A random chord's endpoints land in one of the quadrant pairs, each with probability The chord crosses the vertical diameter exactly when its endpoints have opposite -signs, which happens for of the pairs, so it meets each diameter with probability and both diameters together times on average: the chords contribute expected crossings with the diameters.
For two random chords, condition on their quadrant pairs ( equally likely ordered combinations). If one uses quadrants and the other the endpoints always alternate, so they always cross: combinations. If the two pairs are adjacent and disjoint, such as and the chords never cross: combinations. In each of the other combinations, whether the endpoints alternate around the circle reduces to comparing independent uniform points inside shared quadrants — for example, a chord and a chord cross exactly when the two quadrant- points come in one specific order — and the probability is by symmetry. So two random chords cross with probability
The chord pairs contribute expected crossings, so and the expected number of regions is
Problem 13 in Other Years
1997 AIME · 1998 AIME · 1999 AIME · 2000 AIME I · 2000 AIME II · 2001 AIME I · 2001 AIME II · 2002 AIME I · 2002 AIME II · 2003 AIME I · 2003 AIME II · 2004 AIME I · 2004 AIME II · 2005 AIME I · 2005 AIME II · 2006 AIME I · 2006 AIME II · 2007 AIME I · 2007 AIME II · 2008 AIME I · 2008 AIME II · 2009 AIME I · 2009 AIME II · 2010 AIME I · 2010 AIME II · 2011 AIME I · 2011 AIME II · 2012 AIME I · 2012 AIME II · 2013 AIME I · 2013 AIME II · 2014 AIME I · 2014 AIME II · 2015 AIME I · 2015 AIME II · 2016 AIME I · 2016 AIME II · 2017 AIME I · 2017 AIME II · 2018 AIME I · 2018 AIME II · 2019 AIME I · 2019 AIME II · 2020 AIME I · 2020 AIME II · 2021 AIME I · 2021 AIME II · 2022 AIME I · 2022 AIME II · 2023 AIME I · 2023 AIME II · 2024 AIME I · 2024 AIME II · 2025 AIME II · 2026 AIME I · 2026 AIME II