Navvye/Olympiad-Problems-CSV huggingface dataset:
Problem: A rhombic dodecahedron is a solid with $12$ congruent rhombus faces. At every vertex, $3$ or $4$ edges meet, depending on the vertex. How many vertices have exactly $3$ edges meet?
$\textbf{(A) }5\qquad\textbf{(B) }6\qquad\textbf{(C) }7\qquad\textbf{(D) }8\qquad\textbf{(E) }9$

Solution: Each of the twelve rhombi has two pairs of angles across from each other that must be congruent. If both pairs of angles occur at $4$ -point intersections, we have a grid of squares. If both occur at $3$ -point intersections, we would have a cube with six square faces. Therefore, two of the points must occur at a $3$ -point intersection and two at a $4$ -point intersection.
Since each $3$ -point intersection has $3$ adjacent rhombuses, we know the number of $3$ -point intersections must equal the number of $3$ -point intersections per rhombus times the number of rhombuses over $3$ . Since there are $12$ rhombuses and two $3$ -point intersections per rhombus, this works out to be:
$\frac{2\cdot12}{3}$
Hence: $\boxed{8}$ ~hollph27
~Minor edits by FutureSphinx

Answer: D 8
Problem: A rhombic dodecahedron is a solid with $12$ congruent rhombus faces. At every vertex, $3$ or $4$ edges meet, depending on the vertex. How many vertices have exactly $3$ edges meet?
$\textbf{(A) }5\qquad\textbf{(B) }6\qquad\textbf{(C) }7\qquad\textbf{(D) }8\qquad\textbf{(E) }9$

Solution: Note that a rhombic dodecahedron is formed when a cube is turned inside out (as seen here ), thus there are 6 4-vertices (corresponding to each face of the cube) and 8 3-vertices (corresponding to each corner of the cube). Thus the answer is $\boxed{8}$

Answer: D 8
Problem: A rhombic dodecahedron is a solid with $12$ congruent rhombus faces. At every vertex, $3$ or $4$ edges meet, depending on the vertex. How many vertices have exactly $3$ edges meet?
$\textbf{(A) }5\qquad\textbf{(B) }6\qquad\textbf{(C) }7\qquad\textbf{(D) }8\qquad\textbf{(E) }9$

Solution: Let $m$ be the number of $4$ -edge vertices, and $n$ be the number of $3$ -edge vertices. The total number of vertices is $m+n$ . Now, we know that there are $4 \cdot 12 = 48$ vertices, but we have overcounted. We have overcounted $m$ vertices $3$ times and overcounted $n$ vertices $2$ times. Therefore, we subtract $3m$ and $2n$ from $48$ and set it equal to our original number of vertices. \[48 - 3m - 2n = m+n\] \[4m + 3n = 48\] From here, we reduce both sides modulo $4$ . The $4m$ disappears, and the left hand side becomes $3n$ . The right hand side is $0$ , meaning that $3n$ must be divisible by $4$ . Looking at the answer choices, this is only possible for $n = \boxed{8}$

Answer:  8
Problem: A rhombic dodecahedron is a solid with $12$ congruent rhombus faces. At every vertex, $3$ or $4$ edges meet, depending on the vertex. How many vertices have exactly $3$ edges meet?
$\textbf{(A) }5\qquad\textbf{(B) }6\qquad\textbf{(C) }7\qquad\textbf{(D) }8\qquad\textbf{(E) }9$

Solution: Note that a rhombic dodecahedron is the dual of a cuboctahedron. A cuboctahedron has $8$ triangular faces, which correspond to $\boxed{8}$ vertices on a rhombic dodecahedron that have $3$ edges.

Answer: D 8
Problem: The line segment formed by $A(1, 2)$ and $B(3, 3)$ is rotated to the line segment formed by $A'(3, 1)$ and $B'(4, 3)$ about the point $P(r, s)$ . What is $|r-s|$
$\textbf{(A) } \frac{1}{4} \qquad \textbf{(B) } \frac{1}{2} \qquad \textbf{(C) } \frac{3}{4}   \qquad \textbf{(D) } \frac{2}{3} \qquad   \textbf{(E) } 1$

Solution: Due to rotations preserving an equal distance, we can bash the answer with the distance formula. $D(A, P) = D(A', P)$ , and $D(B, P) = D(B',P)$ .
Thus we will square our equations to yield: $(1-r)^2+(2-s)^2=(3-r)^2+(1-s)^2$ , and $(3-r)^2+(3-s)^2=(4-r)^2+(3-s)^2$ .
Canceling $(3-s)^2$ from the second equation makes it clear that $r$ equals $3.5$
Substituting will yield
\begin{align*}(2.5)^2+(2-s)^2 &= (-0.5)^2+(1-s)^2 \\ 6.25+4-4s+s^2 &= 0.25+1-2s+s^2 \\ 2s &= 9 \\ s &=4.5 \\ \end{align*}
Now $|r-s| = |3.5-4.5| = \boxed{1}$

Answer: E 1
Problem: The line segment formed by $A(1, 2)$ and $B(3, 3)$ is rotated to the line segment formed by $A'(3, 1)$ and $B'(4, 3)$ about the point $P(r, s)$ . What is $|r-s|$
$\textbf{(A) } \frac{1}{4} \qquad \textbf{(B) } \frac{1}{2} \qquad \textbf{(C) } \frac{3}{4}   \qquad \textbf{(D) } \frac{2}{3} \qquad   \textbf{(E) } 1$

Solution: Due to rotations preserving distance, we have that $BP = B^\prime P$ , as well as $AP = A^\prime P$ . From here, we can see that P must be on the perpendicular bisector of $\overline{BB^\prime}$ due to the property of perpendicular bisectors keeping the distance to two points constant.
From here, we proceed to find the perpendicular bisector of $\overline{BB^\prime}$ . We can see that this is just a horizontal line segment with midpoint at $(3.5, 3)$ . This means that the equation of the perpendicular bisector is $x = 3.5$
Similarly, we find the perpendicular bisector of $\overline{AA^\prime}$ . We find the slope to be $\frac{1-2}{3-1} = -\frac12$ , so our new slope will be $2$ . The midpoint of $A$ and $A^\prime$ is $(2, \frac32)$ , which we can use with our slope to get another equation of $y = 2x - \frac52$
Now, point P has to lie on both of these perpendicular bisectors, meaning that it has to satisfy both equations. Plugging in the value of $x$ we found earlier, we find that $y=4.5$ . This means that $|r - s| = |3.5 - 4.5| = \boxed{1}$

Answer: E 1
Problem: The line segment formed by $A(1, 2)$ and $B(3, 3)$ is rotated to the line segment formed by $A'(3, 1)$ and $B'(4, 3)$ about the point $P(r, s)$ . What is $|r-s|$
$\textbf{(A) } \frac{1}{4} \qquad \textbf{(B) } \frac{1}{2} \qquad \textbf{(C) } \frac{3}{4}   \qquad \textbf{(D) } \frac{2}{3} \qquad   \textbf{(E) } 1$

Solution: To find the center of rotation, we find the intersection point of the perpendicular bisectors of $\overline{AA^\prime}$ and $\overline{BB^\prime}$
We can find that the equation of the line $\overline{AA^\prime}$ is $y = -\frac{1}{2}x + \frac{5}{2}$ , and that the equation of the line $\overline{BB^\prime}$ is $y = 3$
When we solve for the perpendicular bisector of $y = -\frac{1}{2}x + \frac{5}{2}$ , we determine that it has a slope of 2, and it runs through $(2, 1.5)$ . Plugging in $1.5 = 2(2)-n$ , we get than $n = \frac{5}{2}$ . Therefore our perpendicular bisector is $y=2x-\frac{5}{2}$ . Next, we solve for the perpendicular of $y = 3$ . We know that it has an undefined slope, and it runs through $(3.5, 3)$ . We can determine that our second perpendicular bisector is $x = 3.5$
Setting the equations equal to each other, we get $2x-\frac{5}{2} = 3.5$ . Solving for x, we get that $x = \frac{9}{2}$ . Therefore, $|r - s| = |3.5 - 4.5| = \boxed{1}$

Answer: E 1
Problem: The line segment formed by $A(1, 2)$ and $B(3, 3)$ is rotated to the line segment formed by $A'(3, 1)$ and $B'(4, 3)$ about the point $P(r, s)$ . What is $|r-s|$
$\textbf{(A) } \frac{1}{4} \qquad \textbf{(B) } \frac{1}{2} \qquad \textbf{(C) } \frac{3}{4}   \qquad \textbf{(D) } \frac{2}{3} \qquad   \textbf{(E) } 1$

Solution: We use the complex numbers approach to solve this problem.
Denote by $\theta$ the angle that $AB$ rotates about $P$ in the counterclockwise direction.
Thus, $A' - P = e^{i \theta} \left( A - P \right)$ and $B' - P = e^{i \theta} \left( B - P \right)$
Taking ratio of these two equations, we get \[ \frac{A' - P}{A - P} = \frac{B' - P}{B - P} . \]
By solving this equation, we get $P = \frac{7}{2} + i \frac{9}{2}$ .
Therefore, $|s-t| = \left| \frac{7}{2} - \frac{9}{2} \right| = \boxed{1}$

Answer: E 1
Problem: Each square in a $3\times3$ grid of squares is colored red, white, blue, or green so that every $2\times2$ square contains one square of each color. One such coloring is shown on the right below. How many different colorings are possible?
[asy] unitsize(0.5cm, 0.5cm); draw((0,0)--(9,0)--(9,9)--(0,9)--cycle); draw((0,3)--(9,3)); draw((0,6)--(9,6)); draw((3,0)--(3,9)); draw((6,0)--(6,9));  draw((18,0)--(27,0)--(27,9)--(18,9)--cycle); draw((18,3)--(27,3)); draw((18,6)--(27,6)); draw((21,0)--(21,9)); draw((24,0)--(24,9));  label("R", (19.5,1.5)); label("B", (22.5,1.5)); label("R", (25.5,1.5));  label("G", (19.5,4.5)); label("W", (22.5,4.5)); label("G", (25.5,4.5));  label("B", (19.5,7.5)); label("R", (22.5,7.5)); label("B", (25.5,7.5));  [/asy]
$\textbf{(A) }24\qquad\textbf{(B) }48\qquad\textbf{(C) }60\qquad\textbf{(D) }72\qquad\textbf{(E) }96$

Solution: Let a "tile" denote a $1\times1$ square and "square" refer to $2\times2$
We first have $4!=24$ possible ways to fill out the top left square. We then fill out the bottom right tile. In the bottom right square, we already have one corner filled out (from our initial coloring), and we now have $3$ options left to pick from.
We then look at the right middle tile. It is part of two squares: the top right and top left. Among these squares, $3$ colors have already been used, so we only have one more option for it. Similarly, every other square only has one more option, so we have a total of $3\cdot4!=\boxed{72}$ ways.

Answer: D 72
Problem: Each square in a $3\times3$ grid of squares is colored red, white, blue, or green so that every $2\times2$ square contains one square of each color. One such coloring is shown on the right below. How many different colorings are possible?
[asy] unitsize(0.5cm, 0.5cm); draw((0,0)--(9,0)--(9,9)--(0,9)--cycle); draw((0,3)--(9,3)); draw((0,6)--(9,6)); draw((3,0)--(3,9)); draw((6,0)--(6,9));  draw((18,0)--(27,0)--(27,9)--(18,9)--cycle); draw((18,3)--(27,3)); draw((18,6)--(27,6)); draw((21,0)--(21,9)); draw((24,0)--(24,9));  label("R", (19.5,1.5)); label("B", (22.5,1.5)); label("R", (25.5,1.5));  label("G", (19.5,4.5)); label("W", (22.5,4.5)); label("G", (25.5,4.5));  label("B", (19.5,7.5)); label("R", (22.5,7.5)); label("B", (25.5,7.5));  [/asy]
$\textbf{(A) }24\qquad\textbf{(B) }48\qquad\textbf{(C) }60\qquad\textbf{(D) }72\qquad\textbf{(E) }96$

Solution: [asy] unitsize(0.5cm, 0.5cm); draw((0,0)--(9,0)--(9,9)--(0,9)--cycle); draw((0,3)--(9,3)); draw((0,6)--(9,6)); draw((3,0)--(3,9)); draw((6,0)--(6,9));  label("R", (1.5,1.5)); label("B", (4.5,1.5)); label("R", (7.5,1.5));  label("G", (1.5,4.5)); label("W", (4.5,4.5)); label("G", (7.5,4.5));  label("B", (1.5,7.5)); label("R", (4.5,7.5)); label("B", (7.5,7.5));    draw((18,0)--(27,0)--(27,9)--(18,9)--cycle); draw((18,3)--(27,3)); draw((18,6)--(27,6)); draw((21,0)--(21,9)); draw((24,0)--(24,9));  label("R", (19.5,1.5)); label("B", (22.5,1.5)); label("R", (25.5,1.5));  label("G", (19.5,4.5)); label("W", (22.5,4.5)); label("G", (25.5,4.5));  label("R", (19.5,7.5)); label("B", (22.5,7.5)); label("R", (25.5,7.5));  [/asy] We can split this problem into $2$ cases as shown above. We can swap a set of equal colors for another set of equal colors to create a new square.
Square 1:
The first square can be rotated to create another square so we have to multiply the number of arrangements by $2$ . We have $4! = 24$ arrangements without rotating and $24\cdot 2 = 48$ arrangements in total for the first square.
Square 2:
There are $4! = 24$ ways to arrange the colors.
In total, we have $48 + 24 = \boxed{72}$ arrangements.

Answer: D 72
Problem: Each square in a $3\times3$ grid of squares is colored red, white, blue, or green so that every $2\times2$ square contains one square of each color. One such coloring is shown on the right below. How many different colorings are possible?
[asy] unitsize(0.5cm, 0.5cm); draw((0,0)--(9,0)--(9,9)--(0,9)--cycle); draw((0,3)--(9,3)); draw((0,6)--(9,6)); draw((3,0)--(3,9)); draw((6,0)--(6,9));  draw((18,0)--(27,0)--(27,9)--(18,9)--cycle); draw((18,3)--(27,3)); draw((18,6)--(27,6)); draw((21,0)--(21,9)); draw((24,0)--(24,9));  label("R", (19.5,1.5)); label("B", (22.5,1.5)); label("R", (25.5,1.5));  label("G", (19.5,4.5)); label("W", (22.5,4.5)); label("G", (25.5,4.5));  label("B", (19.5,7.5)); label("R", (22.5,7.5)); label("B", (25.5,7.5));  [/asy]
$\textbf{(A) }24\qquad\textbf{(B) }48\qquad\textbf{(C) }60\qquad\textbf{(D) }72\qquad\textbf{(E) }96$

Solution: Let’s call the top-right corner color A, the top-middle color B, the top-right color C, and so on, with color D being the middle row, and right corner square, and color G being the bottom-left square’s color. WLOG A=Red, B=White, D=Blue, and E=Green. We will now consider squares C and F’s colors.
Case 1 : C=Red and F=Blue
In this case, we get that G and H have to be Red and White in some order, and the same for H and I. We can color this in 2 ways.
Case 2 : C=Blue and F=Red
In this case, one of G and H needs to be White and Red, and  H and I needs to be White and Blue. There is 1 way to color this.
In total, we get 24*(2+1)=72 ways to color the grid. $\boxed{72}$

Answer: D 72
Problem: Each square in a $3\times3$ grid of squares is colored red, white, blue, or green so that every $2\times2$ square contains one square of each color. One such coloring is shown on the right below. How many different colorings are possible?
[asy] unitsize(0.5cm, 0.5cm); draw((0,0)--(9,0)--(9,9)--(0,9)--cycle); draw((0,3)--(9,3)); draw((0,6)--(9,6)); draw((3,0)--(3,9)); draw((6,0)--(6,9));  draw((18,0)--(27,0)--(27,9)--(18,9)--cycle); draw((18,3)--(27,3)); draw((18,6)--(27,6)); draw((21,0)--(21,9)); draw((24,0)--(24,9));  label("R", (19.5,1.5)); label("B", (22.5,1.5)); label("R", (25.5,1.5));  label("G", (19.5,4.5)); label("W", (22.5,4.5)); label("G", (25.5,4.5));  label("B", (19.5,7.5)); label("R", (22.5,7.5)); label("B", (25.5,7.5));  [/asy]
$\textbf{(A) }24\qquad\textbf{(B) }48\qquad\textbf{(C) }60\qquad\textbf{(D) }72\qquad\textbf{(E) }96$

Solution: We will choose colors step-by-step:
1. There are $4$ ways to choose a color in the center.
2. Then we select any corner and there would be $3$ ways to choose a color as we can't use the same color as the one in the center.
3. Consider the $2\times 2$ square that contains the center and the corner we have selected. For the other $2$ squares, there are $2$ ways to choose colors.
4. Now, consider how many configurations it makes sense to construct the $2\times 2$ square opposite to the corner we have selected using the $2$ other $2\times 2$ squares, and we get $3$ configurations.
Finally, the answer is $4 \cdot 3 \cdot 2 \cdot 3 = \boxed{72}$

Answer: D 72
Problem: Each square in a $3\times3$ grid of squares is colored red, white, blue, or green so that every $2\times2$ square contains one square of each color. One such coloring is shown on the right below. How many different colorings are possible?
[asy] unitsize(0.5cm, 0.5cm); draw((0,0)--(9,0)--(9,9)--(0,9)--cycle); draw((0,3)--(9,3)); draw((0,6)--(9,6)); draw((3,0)--(3,9)); draw((6,0)--(6,9));  draw((18,0)--(27,0)--(27,9)--(18,9)--cycle); draw((18,3)--(27,3)); draw((18,6)--(27,6)); draw((21,0)--(21,9)); draw((24,0)--(24,9));  label("R", (19.5,1.5)); label("B", (22.5,1.5)); label("R", (25.5,1.5));  label("G", (19.5,4.5)); label("W", (22.5,4.5)); label("G", (25.5,4.5));  label("B", (19.5,7.5)); label("R", (22.5,7.5)); label("B", (25.5,7.5));  [/asy]
$\textbf{(A) }24\qquad\textbf{(B) }48\qquad\textbf{(C) }60\qquad\textbf{(D) }72\qquad\textbf{(E) }96$

Solution: Note that there can be no overlap between colors in each square.
Then, we can choose $1$ color to be in the center. ${4 \choose 1}$ = 4
Now, we have some casework:
Case 1: 1 color is placed in 4 corners and then others are placed on opposite edges. $232$ $414$ $232$ There's $3!=6$ ways to do this.
Case 2: 2 colors are placed with 2 in adjacent corners and 1 edge opposite them. The final color is placed in the remaining 2 edges. $232$ $414$ $323$ The orientation of the 2 colors has 2 possibilities, and there are $3!$ color permutations. $2*3!=12$
There can't be any more ways to do this, as we have combined all cases such that each color is used once and only once per $2*2$ square.
We multiply the start with the sum of the 2 cases: $4(6+12)=\boxed{72}$

Answer: D 72
Problem: Each square in a $3\times3$ grid of squares is colored red, white, blue, or green so that every $2\times2$ square contains one square of each color. One such coloring is shown on the right below. How many different colorings are possible?
[asy] unitsize(0.5cm, 0.5cm); draw((0,0)--(9,0)--(9,9)--(0,9)--cycle); draw((0,3)--(9,3)); draw((0,6)--(9,6)); draw((3,0)--(3,9)); draw((6,0)--(6,9));  draw((18,0)--(27,0)--(27,9)--(18,9)--cycle); draw((18,3)--(27,3)); draw((18,6)--(27,6)); draw((21,0)--(21,9)); draw((24,0)--(24,9));  label("R", (19.5,1.5)); label("B", (22.5,1.5)); label("R", (25.5,1.5));  label("G", (19.5,4.5)); label("W", (22.5,4.5)); label("G", (25.5,4.5));  label("B", (19.5,7.5)); label("R", (22.5,7.5)); label("B", (25.5,7.5));  [/asy]
$\textbf{(A) }24\qquad\textbf{(B) }48\qquad\textbf{(C) }60\qquad\textbf{(D) }72\qquad\textbf{(E) }96$

Solution: [asy] unitsize(0.5cm, 0.5cm); draw((0,0)--(9,0)--(9,9)--(0,9)--cycle); draw((0,3)--(9,3)); draw((0,6)--(9,6)); draw((3,0)--(3,9)); draw((6,0)--(6,9));  label("2", (1.5,1.5)); label("1", (4.5,1.5)); label("1", (7.5,1.5));  label("2", (1.5,4.5)); label("3", (4.5,4.5)); label("1", (7.5,4.5));  label("3", (1.5,7.5)); label("1", (4.5,7.5)); label("2", (7.5,7.5));  [/asy]
Note that we could fill the 3 by 3 square with numbers of choices, rather than letters or color names. The top-left corner receives a 3 because there are 3 total choices to choose from: R, G and B. The squares bordering them has values of 2 and 1, regardless of order. 2 indicates that the small square can have any color excluding the one existing color, 1 indicates the remaining color of the 2 by 2 square. Finally, the middle square receives 3, since the first 2 by 2 square has RGB already, and it does not matter what color it has. Moving onto the next 2 by 2 square, we see that there are already 2 decided colors, so the other squares must be 2 and 1, again, regardless of the order. The same applys to the third 2 by 2 square, and finally the last square has the value of one, as it is the only square left. Multiplying the numbers, $2\times2\times2\times3\time3\times3$ $\boxed{72}$

Answer: D 72
Problem: Let $P(x)$ be the unique polynomial of minimal degree with the following properties:
The roots of $P(x)$ are integers, with one exception. The root that is not an integer can be written as $\frac{m}{n}$ , where $m$ and $n$ are relatively prime integers. What is $m+n$
$\textbf{(A) }41\qquad\textbf{(B) }43\qquad\textbf{(C) }45\qquad\textbf{(D) }47\qquad\textbf{(E) }49$

Solution: From the problem statement, we know $P(2-2)=0$ $P(9)=0$ and $4P(4)=0$ . Therefore, we know that $0$ $9$ , and $4$ are roots. So, we can factor $P(x)$ as $x(x - 9)(x - 4)(x - a)$ , where $a$ is the unknown root. Since $P(x) - 1 = 0$ , we plug in $x = 1$ which gives $1(-8)(-3)(1 - a) = 1$ , therefore $24(1 - a) = 1 \implies 1 - a = 1/24 \implies a = 23/24$ . Therefore, our answer is $23 + 24 =\boxed{47}$

Answer: D 47
Problem: Let $P(x)$ be the unique polynomial of minimal degree with the following properties:
The roots of $P(x)$ are integers, with one exception. The root that is not an integer can be written as $\frac{m}{n}$ , where $m$ and $n$ are relatively prime integers. What is $m+n$
$\textbf{(A) }41\qquad\textbf{(B) }43\qquad\textbf{(C) }45\qquad\textbf{(D) }47\qquad\textbf{(E) }49$

Solution: We proceed similarly to solution one. We get that $x(x-9)(x-4)(x-a)=1$ . Expanding, we get that $x(x-9)(x-4)(x-a)=x^4-(a+13)x^3+(13a+36)x^2-36ax$ . We know that $P(1)=1$ , so the sum of the coefficients of the cubic expression is equal to one. Thus $1+(a+13)+(13a+36)-36a=1$ . Solving for a, we get that a=23/24. Therefore, our answer is $23 + 24 =\boxed{47}$

Answer: D 47
Problem: If the positive integer $n$ has positive integer divisors $a$ and $b$ with $n = ab$ , then $a$ and $b$ are said to be $\textit{complementary}$ divisors of $n$ . Suppose that $N$ is a positive integer that has one complementary pair of divisors that differ by $20$ and another pair of complementary divisors that differ by $23$ . What is the sum of the digits of $N$
$\textbf{(A) } 9 \qquad \textbf{(B) } 13\qquad \textbf{(C) } 15 \qquad \textbf{(D) } 17 \qquad \textbf{(E) } 19$

Solution: Consider positive integers $a, b$ with a difference of $20$ . Suppose $b = a-20$ . Then, we have $(a)(a-20) = n$ . If there is another pair of two integers that multiply to $n$ but have a difference of 23, one integer must be greater than $a$ , and one must be smaller than $a-20$ . We can create two cases and set both equal. We have $(a)(a-20) = (a+1)(a-22)$ , and $(a)(a-20) = (a+2)(a-21)$ . Starting with the first case, we have $a^2-20a = a^2-21a-22$ ,or $0=-a-22$ , which gives $a=-22$ , which is not possible. The other case is $a^2-20a = a^2-19a-42$ , so $a=42$ . Thus, our product is $(42)(22) = (44)(21)$ , so $c = 924$ . Adding the digits, we have $9+2+4 = \boxed{15}$ .
-Sepehr2010
-minor edits by aidanb
-extremely minor edits by cc21
-no edits in the actual solution by get-rickrolled

Answer: C 15
Problem: If the positive integer $n$ has positive integer divisors $a$ and $b$ with $n = ab$ , then $a$ and $b$ are said to be $\textit{complementary}$ divisors of $n$ . Suppose that $N$ is a positive integer that has one complementary pair of divisors that differ by $20$ and another pair of complementary divisors that differ by $23$ . What is the sum of the digits of $N$
$\textbf{(A) } 9 \qquad \textbf{(B) } 13\qquad \textbf{(C) } 15 \qquad \textbf{(D) } 17 \qquad \textbf{(E) } 19$

Solution: We have 4 integers in our problem. Let's call the smallest of them $a$ $a(a+23) =$ either $(a+1)(a+21)$ or $(a+2)(a+22)$ . So, we have the following:
$a^2 + 23a = a^2 + 22a +21$ or
$a^2+23a = a^2 + 24a +44$
The second equation has negative solutions, so we discard it. The first equation has $a = 21$ , and so $a + 23 = 44$ . If we check $(a+1)(a+21)$ we get $22 \cdot 42 = 21 \cdot 44$ $44$ is $2$ times $22$ , and $42$ is $2$ times $21$ , so our solution checks out. Multiplying $21$ by $44$ , we get $924$ => $9 + 2 + 4 = \boxed{15}$

Answer: C 15
Problem: If the positive integer $n$ has positive integer divisors $a$ and $b$ with $n = ab$ , then $a$ and $b$ are said to be $\textit{complementary}$ divisors of $n$ . Suppose that $N$ is a positive integer that has one complementary pair of divisors that differ by $20$ and another pair of complementary divisors that differ by $23$ . What is the sum of the digits of $N$
$\textbf{(A) } 9 \qquad \textbf{(B) } 13\qquad \textbf{(C) } 15 \qquad \textbf{(D) } 17 \qquad \textbf{(E) } 19$

Solution: From the problems, it follows that
\begin{align*} x(x+20)&=y(y+23) = N\\ x^2+20x&=y^2+23y\\ 4x^2+4\cdot20x &= 4y^2+4\cdot23y\\ 4x^2+4\cdot20x+20^2-20^2 &= 4y^2+4\cdot23y+23^2-23^2\\ (2x+20)^2-20^2 &= (2y+23)^2-23^2\\ 23^2-20^2 &= (2y+23)^2-(2x+20)^2\\ (23+20)(23-20) &= (2y+23+2x+20)(2y+23-2x-20)\\ 43\cdot 3 &= (2y+2x+43)(2y-2x+3)\\ 129\cdot 1 &= (2y+2x+43)(2y-2x+3)\\ \end{align*} Since both $(2y+2x+43)$ and $(2y-2x+3)$ must be integer, we get two equations. \begin{align} 129 or 43 &= (2y+2x+43)\\ 1 or 3 &= 2y-2x+3\\ \end{align} 43 & 1 yields (0,0) which is not what we want.
129 & 1 yields (22,21) which is more interesting.
Simplifying the equations, we get: \begin{align*} x+y &= 43\\ x-y &= 1\\ x=22&, y=21\\ N &= (22)(22+20) = 924. \end{align*}
So, the answer is $\boxed{15}$

Answer: C 15
Problem: If the positive integer $n$ has positive integer divisors $a$ and $b$ with $n = ab$ , then $a$ and $b$ are said to be $\textit{complementary}$ divisors of $n$ . Suppose that $N$ is a positive integer that has one complementary pair of divisors that differ by $20$ and another pair of complementary divisors that differ by $23$ . What is the sum of the digits of $N$
$\textbf{(A) } 9 \qquad \textbf{(B) } 13\qquad \textbf{(C) } 15 \qquad \textbf{(D) } 17 \qquad \textbf{(E) } 19$

Solution: Say one factorization is $n(n+23).$ The two cases for the other factorization are $(n+1)(n+21)$ and $(n+2)(n+22).$ We know it must be the first because of AM-GM intuition: lesser factors of a number are closer together than larger factors of a number. (We can also try both and see which works.) Thus, $n(n+23)=(n+1)(n+21)$ and we find that $n=21,N=924$ meaning the answer is $\boxed{15}.$

Answer: C 15