2011 AMC 10A Problem 25
Below is the professionally curated solution for Problem 25 of the 2011 AMC 10A, from LIVE by Po-Shen Loh. You can also try the full timed exam, view all 2011 AMC 10A 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: 2490
25.
Let be a square region and an integer. A point in the interior of is called n-ray partitional if there are rays emanating from that divide into triangles of equal area. How many points are -ray partitional but not -ray partitional?
Solution:
Let us first find all the points that are -ray and -ray partitional.
First, consider an extreme -ray partitional point. Let this be the point in the top-left corner.
Note that we must draw rays through the vertices of the square, since otherwise we will end up with non-triangular regions.
Since this is the topmost and leftmost point, we have that the areas of the top triangular region and the left triangle region must be minimized.
This means that they do not have any rays going through them, which also means that their areas must be the same.
Then we have that the distance from the point to the top and left side must be the same. We now have rays to split among the other regions.
Since the other two regions also have the same area, we will have to have rays in each region. This means that those two regions are split into equal regions.
Let be the distance between the point and the top of the square. We then have that
Simplifying gives Now, if we move the point right to the next -partitional point, we have that a ray from the right region gets moved to the left region.
Doing the same analysis again would tell us that the point is away from the left side and from the top side.
Repeating this process, moving the point right and down, gets us that all the -partitional points form a grid, with each point away from adjacent points.
Similarly, we can find the -partitional points form a grid where the points are apart.
We now have to find the overlap between these two grids. Note that the gcd of and is This means that all the points that are on both grids themselves form another grid that is and apart.
This means that there are points that are on both grids. Then there are points that are -partitional and not -partitional.
Thus, C is the correct answer.
Problem 25 in Other Years
2000 AMC 10 · 2001 AMC 10 · 2002 AMC 10A · 2002 AMC 10B · 2003 AMC 10A · 2003 AMC 10B · 2004 AMC 10A · 2004 AMC 10B · 2005 AMC 10A · 2005 AMC 10B · 2006 AMC 10A · 2006 AMC 10B · 2007 AMC 10A · 2007 AMC 10B · 2008 AMC 10A · 2008 AMC 10B · 2009 AMC 10A · 2009 AMC 10B · 2010 AMC 10A · 2010 AMC 10B · 2011 AMC 10B · 2012 AMC 10A · 2012 AMC 10B · 2013 AMC 10A · 2013 AMC 10B · 2014 AMC 10A · 2014 AMC 10B · 2015 AMC 10A · 2015 AMC 10B · 2016 AMC 10A · 2016 AMC 10B · 2017 AMC 10A · 2017 AMC 10B · 2018 AMC 10A · 2018 AMC 10B · 2019 AMC 10A · 2019 AMC 10B · 2020 AMC 10A · 2020 AMC 10B · 2021 AMC 10A Spring · 2021 AMC 10B Spring · 2021 AMC 10A Fall · 2021 AMC 10B Fall · 2022 AMC 10A · 2022 AMC 10B · 2023 AMC 10A · 2023 AMC 10B · 2024 AMC 10A · 2024 AMC 10B · 2025 AMC 10A · 2025 AMC 10B