Art of Problem Solving
AoPS Online
Math texts, online classes, and more
for students in grades 5-12.
Visit AoPS Online ‚
Books for Grades 5-12 Online Courses
Beast Academy
Engaging math books and online learning
for students ages 6-13.
Visit Beast Academy ‚
Books for Ages 6-13 Beast Academy Online
AoPS Academy
Small live classes for advanced math
and language arts learners in grades 2-12.
Visit AoPS Academy ‚
Find a Physical Campus Visit the Virtual Campus

Difference between revisions of "2011 AMC 12A Problems/Problem 22"
(→‎Solution 4 (not scary))
 
(15 intermediate revisions by 9 users not shown)
Line 1: Line 1:
 +
{{duplicate|[[2011 AMC 12A Problems|2011 AMC 12A #22]] and [[2011 AMC 10A Problems|2011 AMC 10A #25]]}}
 +
 
== Problem ==
 
== Problem ==
−
Let <math>R</math> be a square region and <math>n \geq 4</math> an integer. A point <math>X</math> in the interior of <math>R</math> is called ''n-ray'' partitional if there are <math>n</math> rays emanating from <math>X</math> that divide <math>R</math> into <math>n</math> triangles of equal area. How many points are <math>100</math>-ray partitional but not <math>60</math>-ray partitional?
+
Let <math>R</math> be a unit square region and <math>n \geq 4</math> an integer. A point <math>X</math> in the interior of <math>R</math> is called ''n-ray'' partitional if there are <math>n</math> rays emanating from <math>X</math> that divide <math>R</math> into <math>n</math> triangles of equal area. How many points are <math>100</math>-ray partitional but not <math>60</math>-ray partitional?
  
 
<math>
 
<math>
Line 17: Line 19:
 
Let the distance from this corner point to the closest side be <math>a</math> and the side of the square be <math>s</math>. From this, we get the equation <math>\frac{a\times s}{2}=\frac{(s-a)\times s}{2}\times\frac1{49}</math>. Solve for <math>a</math> to get <math>a=\frac s{50}</math>. Therefore, point <math>X</math> is <math>\frac1{50}</math> of the side length away from the two sides it is closest to. By moving <math>X</math> <math>\frac s{50}</math> to the right, we also move one ray from the right sector to the left sector, which determines another <math>100</math>-ray partitional point. We can continue moving <math>X</math> right and up to derive the set of points that are <math>100</math>-ray partitional.  
 
Let the distance from this corner point to the closest side be <math>a</math> and the side of the square be <math>s</math>. From this, we get the equation <math>\frac{a\times s}{2}=\frac{(s-a)\times s}{2}\times\frac1{49}</math>. Solve for <math>a</math> to get <math>a=\frac s{50}</math>. Therefore, point <math>X</math> is <math>\frac1{50}</math> of the side length away from the two sides it is closest to. By moving <math>X</math> <math>\frac s{50}</math> to the right, we also move one ray from the right sector to the left sector, which determines another <math>100</math>-ray partitional point. We can continue moving <math>X</math> right and up to derive the set of points that are <math>100</math>-ray partitional.  
  
−
In the end, we get a square grid of points each <math>\frac s{50}</math> apart from one another. Since this grid ranges from a distance of <math>\frac s{50}</math> from one side to <math>\frac{49s}{50}</math> from the same side, we have a <math>49\times49</math> grid, a total of <math>2401</math> <math>100</math>-ray partitional points. To find the overlap from the <math>60</math>-ray partitional, we must find the distance from the corner-most <math>60</math>-ray partitional point to the sides closest to it. Since the <math>100</math>-ray partitional points form a <math>49\times49</math> grid, each point <math>\frac s{50}</math> apart from each other, we can deduce that the <math>60</math>-ray partitional points form a <math>29\times29</math> grid, each point <math>\frac s{30}</math> apart from each other. To find the overlap points, we must find the common divisors of <math>30</math> and <math>50</math> which are <math>1, 2, 5,</math> and <math>10</math>. Therefore, the overlapping points will form grids with points <math>s</math>, <math>\frac s{2}</math>, <math>\frac s{5}</math>, and <math>\frac s{10}</math> away from each other respectively. Since the grid with points <math>\frac s{10}</math> away from each other includes the other points, we can disregard the other grids. The total overlapping set of points is a <math>9\times9</math> grid, which has <math>81</math> points. Subtract <math>81</math> from <math>2401</math> to get <math>2401-81=\boxed{\textbf{(C)}\ 2320}</math>.  
+
In the end, we get a square grid of points each <math>\frac s{50}</math> apart from one another. Since this grid ranges from a distance of <math>\frac s{50}</math> from one side to <math>\frac{49s}{50}</math> from the same side, we have a <math>49\times49</math> grid, a total of <math>2401</math> <math>100</math>-ray partitional points. To find the overlap from the <math>60</math>-ray partitional, we must find the distance from the corner-most <math>60</math>-ray partitional point to the sides closest to it. Since the <math>100</math>-ray partitional points form a <math>49\times49</math> grid, each point <math>\frac s{50}</math> apart from each other, we can deduce that the <math>60</math>-ray partitional points form a <math>29\times29</math> grid, each point <math>\frac s{30}</math> apart from each other. To find the overlap points, we must find the common divisors of <math>30</math> and <math>50</math> which are <math>1, 2, 5,</math> and <math>10</math>. Therefore, the overlapping points will form grids with points <math>s</math>, <math>\frac s{2}</math>, <math>\frac s{5}</math>, and <math>\frac s{10}</math> away from each other respectively. Since the grid with points <math>\frac s{10}</math> away from each other includes the other points, we can disregard the other grids. The total overlapping set of points is a <math>9\times9</math> grid, which has <math>81</math> points. Subtract <math>81</math> from <math>2401</math> to get <math>2401-81=\boxed{\textbf{(C)}\ 2320}</math>.
  
 
== Solution 2 ==
 
== Solution 2 ==
Line 33: Line 35:
  
  
−
So for a point <math>X</math> to be <math>100</math>-ray partitional, <math>a+b+c+d=100</math>, so <math>a+c=b+d=50</math>. <math>X</math> must then be of the form <math>(\frac{d}{50}s, \frac{a}{50}s)</math>. Since <math>X</math> is in the interior of <math>R</math>, <math>a</math> and <math>d</math> can be any positive integer from <math>1</math>  to <math>49</math> (with <math>b</math> and <math>c</math> just equaling <math>50-d</math> and <math>50-a</math>, respectively). Thus, there are <math>49\times 49=2401</math> points that are <math>100</math>-ray partitional.
+
So for a point <math>X</math> to be <math>100</math>-ray partitional, <math>a+b+c+d=100</math>, so <math>a+c=b+d=50</math>. <math>X</math> must then be of the form <math>\left(\frac{d}{50}s, \frac{a}{50}s\right)</math>. Since <math>X</math> is in the interior of <math>R</math>, <math>a</math> and <math>d</math> can be any positive integer from <math>1</math>  to <math>49</math> (with <math>b</math> and <math>c</math> just equaling <math>50-d</math> and <math>50-a</math>, respectively). Thus, there are <math>49\times 49=2401</math> points that are <math>100</math>-ray partitional.
  
  
−
However, the problem asks for points that are not only <math>100</math>-ray partitional but also not <math>60</math>-ray partitional. Points that are <math>60</math>-ray partitional are of the form <math>(\frac{m}{30}s, \frac{n}{30}s)</math>, where <math>m</math> and <math>n</math> are also positive integers. We count the number of points <math>(\frac{d}{50}s, \frac{a}{50}s)</math> that can also be written in this form. For a given <math>d</math>, <math>\frac{d}{50}=\frac{m}{30}</math> if and only if <math>m=\frac{3}{5}d</math>, and likewise with <math>a</math> and <math>n</math>. We can then see that a point is both <math>100</math>-ray partitional and <math>60</math>-ray partitional if and only if <math>a</math> and <math>d</math> are both divisible by <math>5</math>. There are <math>9</math> integers between <math>1</math> and <math>49</math> that are divisible by <math>5</math>, so out of our <math>2401</math> points that are <math>100</math>-ray partitional, <math>9\times 9=81</math> are also <math>60</math>-ray partitional.
+
However, the problem asks for points that are not only <math>100</math>-ray partitional but also not <math>60</math>-ray partitional. Points that are <math>60</math>-ray partitional are of the form <math>\left(\frac{m}{30}s, \frac{n}{30}s\right)</math>, where <math>m</math> and <math>n</math> are also positive integers. We count the number of points <math>\left(\frac{d}{50}s, \frac{a}{50}s\right)</math> that can also be written in this form. For a given <math>d</math>, <math>\frac{d}{50}=\frac{m}{30}</math> if and only if <math>m=\frac{3}{5}d</math>, and likewise with <math>a</math> and <math>n</math>. We can then see that a point is both <math>100</math>-ray partitional and <math>60</math>-ray partitional if and only if <math>a</math> and <math>d</math> are both divisible by <math>5</math>. There are <math>9</math> integers between <math>1</math> and <math>49</math> that are divisible by <math>5</math>, so out of our <math>2401</math> points that are <math>100</math>-ray partitional, <math>9\times 9=81</math> are also <math>60</math>-ray partitional.
  
  
 
Our answer then is just <math>2401-81=\boxed{\textbf{(C)}\ 2320}</math>.
 
Our answer then is just <math>2401-81=\boxed{\textbf{(C)}\ 2320}</math>.
 +
 +
== Solution 3 ==
 +
For the sake of simplicity, let <math>R</math> be a <math>60 \times 60</math> square and set the bottom-left point as the origin. Then, <math>R</math> has vertices: <cmath>(0,0), (60,0), (60,60), (0,60).</cmath>
 +
 +
Now, let a point in the square have coordinates <math>(x, y).</math>
 +
 +
In order for the point to be <math>100-</math> ray partitional, we must be able to make <math>100</math> triangles with area <math>60^2/100 = 36.</math> For it to not be <math>60</math>-ray partitional, we cannot make <math>60</math> triangles with area <math>60^2/60 = 60.</math>
 +
 +
When we draw such a triangle, it's base will always be on one of the sides of the square. If it is on the bottom side, then the height must be <math>y</math>. So, the base of each triangle must be <math>\frac{72}{y}.</math> So, there will be <math>\frac{60}{\frac{72}{y}} = \frac{60y}{72}</math> total triangles on that side.
 +
 +
If the triangle is on the right side of the square, then the height has to be <math>60 - x.</math> So, the base will be <math>\frac{72}{60-x}</math> and there will be <math>\frac{60 (60-x)}{72}</math> triangles.
 +
 +
If the triangle is on the top, the height will be <math>60-y</math>, the base will be <math>\frac{72}{60-y}</math> and there will be <math>\frac{60 (60-y)}{72}</math> triangles along this side.
 +
 +
The triangles on the left will have height <math>x</math>, base <math>\frac{72}{x}</math> and <math>\frac{60x}{72}</math> such triangles must exist.
 +
 +
Simplifying, we get <math>\frac{5y}{6}, \frac{5 (60-x)}{6}, \frac{5(60-y)}{6}, \frac{5x}{6}</math> triangles on the respective sides of the square.
 +
 +
All of these numbers must be integers. Let <math>x = 60a</math> and <math>y = 60b</math> where <math>0 < a, b < 1.</math>
 +
 +
 +
Then, the amounts become: <cmath>50a, 50b,  50 - 50a, 50 - 50b.</cmath>
 +
 +
As long as <math>50a</math> and <math>50b</math> are integers, <math>50 - 50a</math> and <math>50 - 50b</math> will also be integers.
 +
 +
For this to happen, <math>a</math> and <math>b</math> must be of the form <math>\frac{x}{50}</math> where <math>1 \le x \le 49.</math> So, we have a total of <math>49^2 = 2401</math> points that are <math>100</math>-ray partitional.
 +
 +
Now, we must calculate the number of <math>100</math>- ray partitional points that are also <math>60</math>-ray partitional.
 +
 +
Using a method similar to before, if a point is <math>60</math>-ray partitional, then we must be able to make <math>30a, 30b, 30 - 30a, 30 -30b</math> triangles on the different sides.
 +
 +
So, <math>30a</math> and <math>30b</math> must be integers. This means <math>a</math> and <math>b</math> have to be of the form <math>\frac{y}{30}</math> where <math>0<y<30.</math>
 +
 +
If a point is both <math>100</math>-ray partitional and <math>60</math>-ray partitional, then it can be written as <cmath>\frac{x}{50} =  \frac{y}{30}</cmath>. Note that whenever <math>x</math> is divisible by <math>5</math>, a <math>y</math> will always exist to satisfy the above equation.
 +
 +
So, <math>x</math> has to be in the range <math>(0, 50)</math> and must be divisible by <math>5</math>. There are <math>9</math> possibilities, namely <math>5, 10, 15, 20, 25, 30, 35, 40, 45.</math>
 +
 +
The <math>x</math>-coordinate of the point and the <math>y</math>-coordinate of the point can each use any of these <math>9</math> possibilities, giving <math>9^2 = 81</math> numbers that are both <math>100</math>-ray partitional and <math>60</math>-ray partitional.
 +
 +
Overall, we are left with <math>2401 - 81 = \boxed{2320}</math> solutions.
 +
 +
== Solution 4 (not scary) ==
 +
 +
If <math>X</math> is <math>100-ray</math> partitional, and there are <math>n</math> triangles on a side, then the total area of those <math>n</math> triangles will be <math>\frac{n}{100}</math>. Since the side has length <math>1</math>, then the length of the altitude from <math>X</math> to that side will be <math>\frac{n}{50}</math>.
 +
 +
 +
There will be 1 unique way to split this side into bases of triangles with height <math>\frac{n}{50}</math>, and also 1 unique split into triangles on the opposite side. Since <math>n</math> can range from <math>[1,49]</math>, there will be <math>49</math> different distances from <math>1</math> side, and <math>49</math> different distances from an adjacent side, for a total of <math>49\cdot 49 = 2401</math> <math>100-ray</math> partitional points.
 +
 +
 +
Similarly, for a point to be <math>60-ray</math> partitional, the distance from the sides should be of the form <math>\frac{k}{30}</math>. For this point to also be <math>100-ray</math> partitional, it must also be of the form <math>\frac{z}{50}</math>. Clearly, the only possible values of <math>k</math> are <math>(3,6,9,12,15,18,21,24,27)</math> for a total of 9 ways, so there are <math>9\cdot 9 = 81</math> points that are <math>60-ray</math> partitional and <math>100-ray</math> partitional.
 +
 +
 +
Subtracting <math>81</math> from <math>2401</math>, we get <math>\boxed{\textbf{(C) } 2320}</math>.
 +
 +
-skibbysiggy
 +
 +
==Video Solution by Ryan Yang==
 +
https://www.youtube.com/watch?v=GFJrM6Pj-Z0
  
 
== See also ==
 
== See also ==
 
{{AMC12 box|year=2011|num-b=21|num-a=23|ab=A}}
 
{{AMC12 box|year=2011|num-b=21|num-a=23|ab=A}}
 +
{{AMC10 box|year=2011|num-b=24|after=Last Problem|ab=A}}
  
 
[[Category:Intermediate Geometry Problems]]
 
[[Category:Intermediate Geometry Problems]]
 
{{MAA Notice}}
 
{{MAA Notice}}

Latest revision as of 12:51, 4 September 2024

The following problem is from both the 2011 AMC 12A #22 and 2011 AMC 10A #25, so both problems redirect to this page.

Problem

Let $R$ be a unit square region and $n \geq 4$ an integer. A point $X$ in the interior of $R$ is called n-ray partitional if there are $n$ rays emanating from $X$ that divide $R$ into $n$ triangles of equal area. How many points are $100$-ray partitional but not $60$-ray partitional?

$\textbf{(A)}\ 1500 \qquad \textbf{(B)}\ 1560 \qquad \textbf{(C)}\ 2320 \qquad \textbf{(D)}\ 2480 \qquad \textbf{(E)}\ 2500$

Solution 1

There must be four rays emanating from $X$ that intersect the four corners of the square region. Depending on the location of $X$, the number of rays distributed among these four triangular sectors will vary. We start by finding the corner-most point that is $100$-ray partitional (let this point be the bottom-left-most point).

We first draw the four rays that intersect the vertices. At this point, the triangular sectors with bases as the sides of the square that the point is closest to both do not have rays dividing their areas. Therefore, their heights are equivalent since their areas are equal. The remaining $96$ rays are divided among the other two triangular sectors, each sector with $48$ rays, thus dividing these two sectors into $49$ triangles of equal areas.

Let the distance from this corner point to the closest side be $a$ and the side of the square be $s$. From this, we get the equation $\frac{a\times s}{2}=\frac{(s-a)\times s}{2}\times\frac1{49}$. Solve for $a$ to get $a=\frac s{50}$. Therefore, point $X$ is $\frac1{50}$ of the side length away from the two sides it is closest to. By moving $X$ $\frac s{50}$ to the right, we also move one ray from the right sector to the left sector, which determines another $100$-ray partitional point. We can continue moving $X$ right and up to derive the set of points that are $100$-ray partitional.

In the end, we get a square grid of points each $\frac s{50}$ apart from one another. Since this grid ranges from a distance of $\frac s{50}$ from one side to $\frac{49s}{50}$ from the same side, we have a $49\times49$ grid, a total of $2401$ $100$-ray partitional points. To find the overlap from the $60$-ray partitional, we must find the distance from the corner-most $60$-ray partitional point to the sides closest to it. Since the $100$-ray partitional points form a $49\times49$ grid, each point $\frac s{50}$ apart from each other, we can deduce that the $60$-ray partitional points form a $29\times29$ grid, each point $\frac s{30}$ apart from each other. To find the overlap points, we must find the common divisors of $30$ and $50$ which are $1, 2, 5,$ and $10$. Therefore, the overlapping points will form grids with points $s$, $\frac s{2}$, $\frac s{5}$, and $\frac s{10}$ away from each other respectively. Since the grid with points $\frac s{10}$ away from each other includes the other points, we can disregard the other grids. The total overlapping set of points is a $9\times9$ grid, which has $81$ points. Subtract $81$ from $2401$ to get $2401-81=\boxed{\textbf{(C)}\ 2320}$.

Solution 2

Position the square region $R$ so that the bottom-left corner of the square is at the origin. Then define $s$ to be the sidelength of $R$ and $X$ to be the point $(rs, qs)$, where $0<r,q<1$.


There must be four rays emanating from $X$ that intersect the four corners of $R$. The areas of the four triangles formed by these rays are then $A_1=\frac{qs\times s}{2}$, $A_2=\frac{(s-rs)\times s}{2}$, $A_3=\frac{(s-qs)\times s}{2}$, and $A_4=\frac{rs\times s}{2}$.


If a point is $n$-ray partitional, then there exist positive integers $a, b, c, d$ such that $a+b+c+d=n$ and $\frac{A_1}{a}=\frac{A_2}{b}=\frac{A_3}{c}=\frac{A_4}{d}$. Substituting in our formulas for $A_1$, $A_2$, $A_3$, and $A_4$ and canceling equal terms, we get \[\frac{q}{a}=\frac{1-r}{b}=\frac{1-q}{c}=\frac{r}{d}.\]


Taking $\frac{q}{a}=\frac{1-q}{c}$ and solving for $q$, we get $q=\frac{a}{a+c}$, and taking $\frac{1-r}{b}=\frac{r}{d}$ and solving for $r$, we get $r=\frac{d}{b+d}$. Finally, from $\frac{q}{a}=\frac{r}{d}$, we have $qd=ar$ $\Leftrightarrow$ $\frac{ad}{a+c}=\frac{ad}{b+d}$ $\Leftrightarrow$ $a+c=b+d$.


So for a point $X$ to be $100$-ray partitional, $a+b+c+d=100$, so $a+c=b+d=50$. $X$ must then be of the form $\left(\frac{d}{50}s, \frac{a}{50}s\right)$. Since $X$ is in the interior of $R$, $a$ and $d$ can be any positive integer from $1$ to $49$ (with $b$ and $c$ just equaling $50-d$ and $50-a$, respectively). Thus, there are $49\times 49=2401$ points that are $100$-ray partitional.


However, the problem asks for points that are not only $100$-ray partitional but also not $60$-ray partitional. Points that are $60$-ray partitional are of the form $\left(\frac{m}{30}s, \frac{n}{30}s\right)$, where $m$ and $n$ are also positive integers. We count the number of points $\left(\frac{d}{50}s, \frac{a}{50}s\right)$ that can also be written in this form. For a given $d$, $\frac{d}{50}=\frac{m}{30}$ if and only if $m=\frac{3}{5}d$, and likewise with $a$ and $n$. We can then see that a point is both $100$-ray partitional and $60$-ray partitional if and only if $a$ and $d$ are both divisible by $5$. There are $9$ integers between $1$ and $49$ that are divisible by $5$, so out of our $2401$ points that are $100$-ray partitional, $9\times 9=81$ are also $60$-ray partitional.


Our answer then is just $2401-81=\boxed{\textbf{(C)}\ 2320}$.

Solution 3

For the sake of simplicity, let $R$ be a $60 \times 60$ square and set the bottom-left point as the origin. Then, $R$ has vertices: \[(0,0), (60,0), (60,60), (0,60).\]

Now, let a point in the square have coordinates $(x, y).$

In order for the point to be $100-$ ray partitional, we must be able to make $100$ triangles with area $60^2/100 = 36.$ For it to not be $60$-ray partitional, we cannot make $60$ triangles with area $60^2/60 = 60.$

When we draw such a triangle, it's base will always be on one of the sides of the square. If it is on the bottom side, then the height must be $y$. So, the base of each triangle must be $\frac{72}{y}.$ So, there will be $\frac{60}{\frac{72}{y}} = \frac{60y}{72}$ total triangles on that side.

If the triangle is on the right side of the square, then the height has to be $60 - x.$ So, the base will be $\frac{72}{60-x}$ and there will be $\frac{60 (60-x)}{72}$ triangles.

If the triangle is on the top, the height will be $60-y$, the base will be $\frac{72}{60-y}$ and there will be $\frac{60 (60-y)}{72}$ triangles along this side.

The triangles on the left will have height $x$, base $\frac{72}{x}$ and $\frac{60x}{72}$ such triangles must exist.

Simplifying, we get $\frac{5y}{6}, \frac{5 (60-x)}{6}, \frac{5(60-y)}{6}, \frac{5x}{6}$ triangles on the respective sides of the square.

All of these numbers must be integers. Let $x = 60a$ and $y = 60b$ where $0 < a, b < 1.$


Then, the amounts become: \[50a, 50b, 50 - 50a, 50 - 50b.\]

As long as $50a$ and $50b$ are integers, $50 - 50a$ and $50 - 50b$ will also be integers.

For this to happen, $a$ and $b$ must be of the form $\frac{x}{50}$ where $1 \le x \le 49.$ So, we have a total of $49^2 = 2401$ points that are $100$-ray partitional.

Now, we must calculate the number of $100$- ray partitional points that are also $60$-ray partitional.

Using a method similar to before, if a point is $60$-ray partitional, then we must be able to make $30a, 30b, 30 - 30a, 30 -30b$ triangles on the different sides.

So, $30a$ and $30b$ must be integers. This means $a$ and $b$ have to be of the form $\frac{y}{30}$ where $0<y<30.$

If a point is both $100$-ray partitional and $60$-ray partitional, then it can be written as \[\frac{x}{50} = \frac{y}{30}\]. Note that whenever $x$ is divisible by $5$, a $y$ will always exist to satisfy the above equation.

So, $x$ has to be in the range $(0, 50)$ and must be divisible by $5$. There are $9$ possibilities, namely $5, 10, 15, 20, 25, 30, 35, 40, 45.$

The $x$-coordinate of the point and the $y$-coordinate of the point can each use any of these $9$ possibilities, giving $9^2 = 81$ numbers that are both $100$-ray partitional and $60$-ray partitional.

Overall, we are left with $2401 - 81 = \boxed{2320}$ solutions.

Solution 4 (not scary)

If $X$ is $100-ray$ partitional, and there are $n$ triangles on a side, then the total area of those $n$ triangles will be $\frac{n}{100}$. Since the side has length $1$, then the length of the altitude from $X$ to that side will be $\frac{n}{50}$.


There will be 1 unique way to split this side into bases of triangles with height $\frac{n}{50}$, and also 1 unique split into triangles on the opposite side. Since $n$ can range from $[1,49]$, there will be $49$ different distances from $1$ side, and $49$ different distances from an adjacent side, for a total of $49\cdot 49 = 2401$ $100-ray$ partitional points.


Similarly, for a point to be $60-ray$ partitional, the distance from the sides should be of the form $\frac{k}{30}$. For this point to also be $100-ray$ partitional, it must also be of the form $\frac{z}{50}$. Clearly, the only possible values of $k$ are $(3,6,9,12,15,18,21,24,27)$ for a total of 9 ways, so there are $9\cdot 9 = 81$ points that are $60-ray$ partitional and $100-ray$ partitional.


Subtracting $81$ from $2401$, we get $\boxed{\textbf{(C) } 2320}$.

-skibbysiggy

Video Solution by Ryan Yang

https://www.youtube.com/watch?v=GFJrM6Pj-Z0

See also

2011 AMC 12A (Problems • Answer Key • Resources)
Preceded by
Problem 21 		Followed by
Problem 23
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
2011 AMC 10A (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 10 Problems and Solutions

The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions. AMC logo.png

Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=2011_AMC_12A_Problems/Problem_22&oldid=226458"