{
  "competition": "AMC10A",
  "year": 2020,
  "problems": [
    {
      "id": 1,
      "question": "What value of $x$ satisfies $\\[x- \\frac{3}{4} = \\frac{5}{12} - \\frac{1}{3}?\\]$",
      "options": [
        "${-}\\frac{2}{3}\\qquad$",
        "$\\frac{7}{36}\\qquad$",
        "$\\frac{7}{12}\\qquad$",
        "$\\frac{2}{3}\\qquad$",
        "$\\frac{5}{6}$"
      ],
      "correctAnswer": "E",
      "solution": [
        "Adding $\\frac{3}{4}$ to both sides, $x= \\frac{5}{12} - \\frac{1}{3} + \\frac{3}{4} = \\frac{5}{12} - \\frac{4}{12} + \\frac{9}{12}=\\boxed{\\textbf{(E) }\\frac{5}{6}}$.",
        "Multiplying $12$ on both sides gets us $12x-9=1 \\Rightarrow 12x=10$, therefore $x=\\boxed{\\textbf{(E)}~\\frac{5}{6}}$.",
        "Education, The Study of Everything\n\nhttps://youtu.be/4lsmGWDYusk",
        "~IceMatrix https://youtu.be/WUcbVNy2uv0",
        "https://www.youtube.com/watch?v=7-3sl1pSojc\n\n~bobthefam",
        "https://youtu.be/OKoBg15l8ro\n\n~savannahsolve"
      ],
      "difficulty": "easy",
      "category": "algebra"
    },
    {
      "id": 2,
      "question": "The numbers $3, 5, 7, a,$ and $b$ have an average (arithmetic mean) of $15$. What is the average of $a$ and $b$?",
      "options": [
        "$0 \\qquad$",
        "$15 \\qquad$",
        "$30 \\qquad$",
        "$45 \\qquad$",
        "$60$"
      ],
      "correctAnswer": "C",
      "solution": [
        "The arithmetic mean of the numbers $3, 5, 7, a,$ and $b$ is equal to $\\frac{3+5+7+a+b}{5}=\\frac{15+a+b}{5}=15$. Solving for $a+b$, we get $a+b=60$. Dividing by $2$ to find the average of the two numbers $a$ and $b$ gives $\\frac{60}{2}=\\boxed{\\textbf{(C) }30}$.",
        "We know the average is 15. 3, 5, and 7 are, respectively, 12, 10, and 8 below the average. So far then we are -12 - 10 - 8 or 30 below the average. We have to make this up with a and b so on average each is 30/2 = 15 above the average. The average is 15 so each is on average 15+15 = 30, or answer C.\n\nIncidentally we can immediately rule out answers A and B as being too small - with these we'd never catch up to get our average of 15. An alternative solution is that to get an average of 15 we need a sum of 15*5 = 75. We have 3, 5, and 7 which adds up to 15, so a and b must make up the remaining 75-15 = 60. 60/2 = 30 so the average of a and b is 30.",
        "Education, The Study of Everything\n\nhttps://youtu.be/e8Qfe5GpEUg",
        "https://youtu.be/WUcbVNy2uv0\n\n~IceMatrix",
        "https://www.youtube.com/watch?v=7-3sl1pSojc\n\n~bobthefam",
        "https://youtu.be/zVppmKOvx_w\n\n~savannahsolver"
      ],
      "difficulty": "easy",
      "category": "algebra"
    },
    {
      "id": 3,
      "question": "Assuming $a\\neq3$, $b\\neq4$, and $c\\neq5$, what is the value in simplest form of the following expression? $\\[\\frac{a-3}{5-c} \\cdot \\frac{b-4}{3-a} \\cdot \\frac{c-5}{4-b}\\]$",
      "options": [
        "${-}1 \\qquad$",
        "$1 \\qquad$",
        "$\\frac{abc}{60} \\qquad$",
        "$\\frac{1}{abc} - \\frac{1}{60} \\qquad$",
        "$\\frac{1}{60} - \\frac{1}{abc}$"
      ],
      "correctAnswer": "A",
      "solution": [
        "If $x\\neq y,$ then $\\frac{x-y}{y-x}=-1.$ We use this fact to simplify the original expression: $\\[\\frac{\\color{red}\\overset{-1}{\\cancel{a-3}}}{\\color{blue}\\underset{1}{\\cancel{5-c}}} \\cdot \\frac{\\color{green}\\overset{-1}{\\cancel{b-4}}}{\\color{red}\\underset{1}{\\cancel{3-a}}} \\cdot \\frac{\\color{blue}\\overset{-1}{\\cancel{c-5}}}{\\color{green}\\underset{1}{\\cancel{4-b}}}=(-1)(-1)(-1)=\\boxed{\\textbf{(A) } {-}1}.\\]$ ~CoolJupiter ~MRENTHUSIASM",
        "At $(a,b,c)=(4,5,6),$ the answer choices become\n\nand the original expression becomes $\\[\\frac{-1}{1}\\cdot\\frac{-1}{1}\\cdot\\frac{-1}{1}=\\boxed{\\textbf{(A) } {-}1}.\\]$ ~MRENTHUSIASM",
        "We can simply set $x = a - 3, y = b - 4,$ and $z = 5 - c$. Now, the problem simplifies to $\\[\\frac{x}{z}\\cdot\\frac{-y}{x}\\cdot\\frac{z}{y}=\\frac{-xyz}{xyz}=\\boxed{\\textbf{(A) } {-}1}.\\]$\n\nExplanation: After substituting $x$, $y$, and $z$, the opposites (for example $5 - c$ and $c - 5$ ) can just be written as the negative of each. With the same example, this can be shown by: $c - 5 = -(5 - c)$.\n\n~GREATEST",
        "https://youtu.be/WUcbVNy2uv0\n\n~IceMatrix",
        "https://youtu.be/Nrdxe4UAqkA\n\nEducation, The Study of Everything",
        "https://www.youtube.com/watch?v=7-3sl1pSojc\n\n~bobthefam",
        "https://youtu.be/ZccL6yKrTiU\n\n~savannahsolver",
        "https://youtu.be/ba6w1OhXqOQ?t=956\n\n~ pi_is_3.14"
      ],
      "difficulty": "easy",
      "category": "algebra"
    },
    {
      "id": 4,
      "question": "A driver travels for $2$ hours at $60$ miles per hour, during which her car gets $30$ miles per gallon of gasoline. She is paid $$0.50$ per mile, and her only expense is gasoline at $$2.00$ per gallon. What is her net rate of pay, in dollars per hour, after this expense?",
      "options": [
        "$20\\qquad$",
        "$22\\qquad$",
        "$24\\qquad$",
        "$25\\qquad$",
        "$26$"
      ],
      "correctAnswer": "E",
      "solution": [
        "Since the driver travels $60$ miles per hour and each hour she uses $2$ gallons of gasoline, she spends $$4$ per hour on gas. If she gets $$0.50$ per mile, then she gets $$30$ per hour of driving. Subtracting the gas cost, her net rate of money earned per hour is $\\boxed{\\textbf{(E)}\\ 26}$. ~mathsmiley",
        "The driver is driving for $2$ hours at $60$ miles per hour, she drives $120$ miles. Therefore, she uses $\\frac{120}{30}=4$ gallons of gasoline. So, total she has $$0.50\\cdot120-$2.00\\cdot4=$60-$8=$52$. So, her rate is $\\frac{52}{2}=\\boxed{\\textbf{(E)}\\ 26}$. ~sosiaops",
        "https://youtu.be/J-Ery8I0yAg\n\n~Education, the Study of Everything",
        "https://youtu.be/WUcbVNy2uv0\n\n~IceMatrix",
        "https://www.youtube.com/watch?v=7-3sl1pSojc\n\n~bobthefam\n\nhttps://youtu.be/Dj_DFoZO-xw\n\n~savannahsolver"
      ],
      "difficulty": "easy",
      "category": "algebra"
    },
    {
      "id": 5,
      "question": "What is the sum of all real numbers $x$ for which $|x^2-12x+34|=2?$",
      "options": [
        "$12 \\qquad$",
        "$15 \\qquad$",
        "$18 \\qquad$",
        "$21 \\qquad$",
        "$25$"
      ],
      "correctAnswer": "C",
      "solution": [
        "Split the equation into two cases, where the value inside the absolute value is positive and nonpositive.\n\nCase 1:\n\nThe equation yields $x^2-12x+34=2$, which is equal to $(x-4)(x-8)=0$. Therefore, the two values for the positive case is $4$ and $8$.\n\nCase 2:\n\nSimilarly, taking the nonpositive case for the value inside the absolute value notation yields $x^2-12x+34=-2$. Factoring and simplifying gives $(x-6)^2=0$, so the only value for this case is $6$.\n\nSumming all the values results in $4+8+6=\\boxed{\\textbf{(C) }18}$.",
        "We have the equations $x^2-12x+32=0$ and $x^2-12x+36=0$.\n\nNotice that the second is a perfect square with a double root at $x=6$, and the first has two distinct real roots. By Vieta's, the sum of the roots of the first equation is$-(-12)$ or $12$. $12+6=\\boxed{\\textbf{(C) }18}$.",
        "Completing the square gives $\\begin{align*} \\left|(x-6)^2-2\\right|&=2 \\\\ (x-6)^2-2&=\\pm2. \\hspace{15mm}(\\bigstar) \\end{align*}$ Note that the graph of $y=(x-6)^2-2$ is an upward parabola with the vertex $(6,-2)$ and the axis of symmetry $x=6;$ the graphs of $y=\\pm2$ are horizontal lines.\n\nWe apply casework to $(\\bigstar):$\n\nFinally, the sum of all solutions is $12+6=\\boxed{\\textbf{(C) } 18}.$\n\n~MRENTHUSIASM",
        "https://youtu.be/E7zjQkZl59E",
        "Education, The Study Of Everything\n\nhttps://youtu.be/WUcbVNy2uv0\n\n~IceMatrix",
        "https://www.youtube.com/watch?v=7-3sl1pSojc\n\n~bobthefam",
        "https://youtu.be/TlIrYXcEuws\n\n~savannahsolver",
        "https://youtu.be/3dfbWzOfJAI?t=1544\n\n~ pi_is_3.14"
      ],
      "difficulty": "easy",
      "category": "algebra"
    },
    {
      "id": 6,
      "question": "How many $4$-digit positive integers (that is, integers between $1000$ and $9999$, inclusive) having only even digits are divisible by $5?$",
      "options": [
        "$80 \\qquad$",
        "$100 \\qquad$",
        "$125 \\qquad$",
        "$200 \\qquad$",
        "$500$"
      ],
      "correctAnswer": "B",
      "solution": [
        "The units digit, for all numbers divisible by 5, must be either $0$ or $5$. However, since all digits are even, the units digit must be $0$. The middle two digits can be 0, 2, 4, 6, or 8, but the thousands digit can only be 2, 4, 6, or 8 since it cannot be zero. There is one choice for the units digit, 5 choices for each of the middle 2 digits, and 4 choices for the thousands digit, we have a total of $4\\cdot5\\cdot5\\cdot1 = \\boxed{\\textbf{(B) } 100} \\qquad$ numbers.",
        "Education, the Study of Everything\n\nhttps://youtu.be/pvqpXWAvtAk",
        "https://youtu.be/JEjib74EmiY\n\n~IceMatrix",
        "https://youtu.be/Ep6XF3VUO3E\n\n~savannahsolver",
        "https://www.youtube.com/watch?v=kKxaNaSzpRE\n\n~CalculaCore (condensing challenging problems to make them understandable)"
      ],
      "difficulty": "easy",
      "category": "number-theory"
    },
    {
      "id": 7,
      "question": "The $25$integers from$-10$ to $14,$ inclusive, can be arranged to form a $5$-by- $5$ square in which the sum of the numbers in each row, the sum of the numbers in each column, and the sum of the numbers along each of the main diagonals are all the same. What is the value of this common sum?",
      "options": [
        "$2 \\qquad$",
        "$5\\qquad$",
        "$10\\qquad$",
        "$25\\qquad$",
        "$50$"
      ],
      "correctAnswer": "C",
      "solution": [
        "Without loss of generality, consider the five rows in the square. Each row must have the same sum of numbers, meaning that the sum of all the numbers in the square divided by $5$ is the total value per row. The sum of the $25$integers is$-10+-9+...+14=11+12+13+14=50$, and the common sum is $\\frac{50}{5}=\\boxed{\\text{(C) }10}$.",
        "Take the sum of the middle 5 values of the set (they will turn out to be the mean of each row). We get $0 + 1 + 2 + 3 + 4 = \\boxed{\\textbf{(C) } 10}$ as our answer. ~Baolan",
        "Taking the average of the first and last terms, $-10$ and $14$, we have that the mean of the set is $2$. There are 5 values in each row, column or diagonal, so the value of the common sum is $5\\cdot2$, or $\\boxed{\\textbf{(C) } 10}$.  ~Arctic_Bunny, edited by KINGLOGIC",
        "Let us consider the horizontal rows.  Since there are five of them, each with constant sum $x$, we can add up the 25 numbers in 5 rows for a sum of $5x$.  Since the sum of the 25 numbers used is$-10-9-8-\\cdots{}+12+13+14+15=11+12+13+14+15=50$, $5x=50$ and $x=\\boxed{\\textbf{(C) }10}$.  ~cw357",
        "The mean of the set of numbers is $(14-10) \\div 2 = 2$. The numbers around it must be equal (i.e. if the mean of $1$, $2$, $3$, $4$, and $5$ is $3$, then $2+4=1+5$.) One row of the square would be $\\[\\square  \\square  2  \\square  \\square\\]$\n\nAdding the numbers would be\n\n$\\[0, 1, 2, 3, 4\\]$\n\nwith a sum of $\\boxed {\\textbf {(C) }10}$.",
        "If the sum of each row, column, and diagonal is x, then we have a total of 12x for the sum. The sum of the rows and columns is the sum of all the numbers doubled, which is $50\\cdot2=100$. Therefore $100+2x=12x$, $100=10x$, and $x=\\boxed{10}$. ~MC413551",
        "I cool thing to find is that with magic squares, the smallest and largest number are either in the same row, column and diagonal to balance the equation out. To continue doing this, the other numbers in that same line form an arithmetic sequence. With our A term generally being 1, and our last term being n^2. The d = n+1, by working out the a+(n-1)d formula. For a 5x5, d = 6. To apply this we start with A being -10, and our last term being 14. We increase by increments by 6 to get the 5 numbers in our line is -10, -4, 2, 8, 14. This adds up to $\\boxed {\\textbf {(C) }10}$.\n\n(Note the goal of this solution was just to point out something I found that I thought was cool, I don't advise using it in actual competitions)\n\n-CubiksRube",
        "Education, the Study of Everything\n\nhttps://youtu.be/Zf4HCY-y5Z4",
        "https://youtu.be/JEjib74EmiY\n\n~IceMatrix [starts from 1.08 in the video]",
        "https://youtu.be/PHHBIiIlCY0\n\n~savannahsolver",
        "https://youtu.be/mgEZOXgIZXs?t=1\n\n~ pi_is_3.14"
      ],
      "difficulty": "easy",
      "category": "algebra"
    },
    {
      "id": 8,
      "question": "What is the value of $\\[1+2+3-4+5+6+7-8+\\cdots+197+198+199-200?\\]$",
      "options": [
        "$9,800 \\qquad$",
        "$9,900 \\qquad$",
        "$10,000 \\qquad$",
        "$10,100 \\qquad$",
        "$10,200$"
      ],
      "correctAnswer": "B",
      "solution": [
        "Looking at the numbers, you see that every set of $4$ has $3$ positive numbers and 1 negative number. Calculating the sum of the first couple sets gives us $2+10+18...+394$. Clearly, this pattern is an arithmetic sequence. By using the formula we get $\\frac{2+394}{2}\\cdot 50=\\boxed{\\textbf{(B) }9900}$.\n\n-ViratKohli2018",
        "Split the even numbers and the odd numbers apart. If we group every 2 even numbers together and add them, we get a total of $50\\cdot (-2)=-100$. Summing the odd numbers is equivalent to summing the first 100 odd numbers, which is equal to $100^2=10000$. Adding these two, we obtain the answer of $\\boxed{\\textbf{(B) }9900}$.",
        "We can break this entire sum down into $4$ integer bits, in which the sum is $2x$, where $x$ is the first integer in this bit. We can find that the first sum of every sequence is $4x-3$, which we plug in for the $50$ bits in the entire sequence is $1+2+3+\\cdots+50=1275$, so then we can plug it into the first term of every sequence equation we got above $4(1275)-3(50)=4950$, and so the sum of every bit is $2x$, and we only found the value of $x$, the sum of the sequence is $4950\\cdot2=\\boxed{\\textbf{(B) } 9900}$.-middletonkids",
        "Another solution involves adding everything and subtracting out what is not needed.  The first step involves solving $1+2+3+4+5+6+7+8+\\cdots+197+198+199+200$.  To do this, we can simply multiply $200$ and $201$ and divide by $2$ to get us $20100$.  The next step involves subtracting out the numbers with minus signs.  We actually have to do this twice, because we need to take out the numbers we weren’t supposed to add and then subtract them from the problem.  Then, we can see that from $4$ to $200$, incrementing by $4$, there are $50$ numbers that we have to subtract.  To do this we can do $50$ times $51$ divided by $2$, and then we can multiply by $4$, because we are counting by fours, not ones.  Our answer will be $5100$, but remember, we have to do this twice.  Once we do that, we will get $10200$.  Finally, we just have to do $20100-10200$, and our answer is $\\boxed{\\textbf{(B) }9900}$.\n\n— $\\text{Phineas}1500$",
        "In this solution, we group every 4 terms. Our groups should be: $1 + 2 + 3 - 4 = 2$, $5 + 6 + 7 - 8 = 10$, $9 + 10 + 11 - 12 = 18$, ... $197 + 198 + 199 - 200 = 394$. We add them together to get this expression: $2 + 10 + 18 + ... + 394$. This can be rewritten as $8 * (0 + 1 + 2 + ... + 49) + 100$. We add this to get $\\boxed{\\textbf{(B) }9900}$.    ~Baolan",
        "We can split up this long sum into groups of four integers. Finding the first few sums, we have that $1 + 2 + 3 - 4 = 2$, $5 + 6 + 7 - 8 = 10$, and $9 + 10 + 11 - 12 = 18$. Notice that this is an increasing arithmetic sequence, with a common difference of $8$. We can find the sum of the arithmetic sequence by finding the average of the first and last terms, and then multiplying by the number of terms in the sequence. The first term is $1 + 2 + 3 - 4$, or $2$, the last term is $197 + 198 + 199 - 200$, or $394$, and there are $200\\div 4$ or $50$ terms. So, we have that the sum of the sequence is $\\frac{(394+2)\\cdot 50}{2}$, or $\\boxed{\\textbf{(B) }9900}$. ~Arctic_Bunny",
        "Note that the original expression is equal to $\\[(1+2+3+\\dots+199+200)-2(4(1+2+3+\\dots+49+50)).\\]$ Since the sum of the first $n$ positive integers is $\\frac{n(n+1)}{2}$, this is equal to $\\[\\frac{200(201)}{2}-2\\left(4\\left(\\frac{50(51)}{2}\\right)\\right),\\]$ which can be simplified as $\\[20100-4(50)(51)=20100-10200.\\]$ Doing the subtraction yields $\\boxed{\\textbf{(B) }9900}$. -BorealBear",
        "We can split the sum into 4 groups so that the terms in these groups have the same common difference of 4 $(1+5+9+...+197)+(2+6+10+...+198)+(3+7+11+...+199)-(4+8+12+...+200)$. Then, we can use the sum formula. It's equal to $\\frac{50\\cdot(1+197)}{2} + \\frac{50\\cdot(2+198)}{2} + \\frac{50\\cdot(3+199)}{2} - \\frac{50\\cdot(4+200)}{2}$. This can also be expressed as $(25\\cdot198) + (25\\cdot200) + (25\\cdot202) - (25\\cdot204)$. And it is equal to $25\\cdot(198+200+202-204) = 25\\cdot396 = 9900$. Therefore, the answer is $\\boxed{\\textbf{(B) }9900}$. ~kurbanlik_21",
        "We can split the answer into trios of sums and a difference: (1+2+3) + (5+6+7) + (9+10+11) ... + (197+198+199) - (4+8+12+ ... + 200). We note that each of our trios are consecutive integers so replace them by their average - e.g., 5+6+7 = 3*6.\n\nWe have 3 (2+6+10+ ... +198) - 4 (1+2+3+ ... + 50) = 3A - 4B. How we can use a \"rainbow\" method for A to add 2+198 = 6+194 = .... How many terms do we have? 2, 6, 10, ..., 198 has the same number of terms as the sequence 0, 4, 8, ..., 198-2 = 196, which has the same number of terms as the sequence 0, 1, 2, ..., 196/4 = 49 So there are 50 terms, which means 50/2 = 25 pairs of 200. A is 25*200 B is just 50*51/2 = 25*51\n\nSo we have 3(25*200) - 4(25*51) = 100(150-51) = 9900 ~Dilip",
        "We can treat the negative numbers separately than the rest of the sequence.\n\nThe negative numbers are as follows: $-4, -8, -12,... -200$\n\nSumming all of the negative numbers up $[-51*(25*4)]$(first dividing the negative sequence by 4, using Gauss to add all of the numbers up, then re-multiplying by 4), we get$-5100$.\n\nNow, we can add up the original sequence as if there were no negative numbers (so converting all negatives into positives), to which we get $20100$ by having $201*100$.\n\nWe then subtract $5100$ from $20100$ twice (the first time to make all of the negative numbers $0$ in the sequence, second time to obtain the answer).\n\nAnd we obtain $\\boxed{\\textbf{(B) }9900}$. ~martianrunner",
        "Education, The Study of Everything\n\nhttps://youtu.be/xoIWkRr0BOo",
        "https://youtu.be/JEjib74EmiY\n\n~IceMatrix",
        "https://youtu.be/8osKFz1CMSc\n\n~savannahsolver"
      ],
      "difficulty": "easy",
      "category": "algebra"
    },
    {
      "id": 9,
      "question": "A single bench section at a school event can hold either $7$ adults or $11$ children. When $N$ bench sections are connected end to end, an equal number of adults and children seated together will occupy all the bench space. What is the least possible positive integer value of $N?$",
      "options": [
        "$9 \\qquad$",
        "$18 \\qquad$",
        "$27 \\qquad$",
        "$36 \\qquad$",
        "$77$"
      ],
      "correctAnswer": "B",
      "solution": [
        "The least common multiple of $7$ and $11$ is $77$. Therefore, there must be $77$ adults and $77$ children. The total number of benches is $\\frac{77}{7}+\\frac{77}{11}=11+7=\\boxed{\\textbf{(B) }18}$.~taarunganesh",
        "Let $x$ denote how many adults there are. Since the number of adults is equal to the number of children we can write $N$ as $\\frac{x}{7}+\\frac{x}{11}=N$. Simplifying we get $\\frac{18x}{77} = N$ Since both $n$ and $x$ have to be positive integers, $x$ has to equal $77$. Therefore, $N=\\boxed{\\textbf{(B) }18}$ is our final answer.",
        "We have 1 Bench = 7 Adults = 11 Children, or $A = \\frac{11}{7}C$.\n\nThe minimum number of benches is $N = x(A + C)$.\n\nThis gives $\\frac{77}{18}N = x$, so that the minimum value for x is the integer 18, or (B).\n\n~PeterDoesPhysics",
        "The ratio of adults and children is 7:11 and the total amount of benches is the amount of adult and children combined which gives 7 + 11 = $\\boxed{\\textbf{(B) }18}$. We see that this is the smallest integer value.\n\n~Twinotter",
        "Education, The Study of Everything\n\nhttps://youtu.be/GKTQO99CKPM",
        "https://youtu.be/JEjib74EmiY\n\n~IceMatrix",
        "https://youtu.be/w2_H96-yzk8\n\n~savannahsolver",
        "https://youtu.be/ZhAZ1oPe5Ds?t=1616\n\n~ pi_is_3.14"
      ],
      "difficulty": "easy",
      "category": "number-theory"
    },
    {
      "id": 10,
      "question": "Seven cubes, whose volumes are $1$, $8$, $27$, $64$, $125$, $216$, and $343$ cubic units, are stacked vertically to form a tower in which the volumes of the cubes decrease from bottom to top. Except for the bottom cube, the bottom face of each cube lies completely on top of the cube below it. What is the total surface area of the tower (including the bottom) in square units?",
      "options": [
        "$644\\qquad$",
        "$658\\qquad$",
        "$664\\qquad$",
        "$720\\qquad$",
        "$749$"
      ],
      "correctAnswer": "B",
      "solution": [
        "The volume of each cube follows the pattern of $n^3$, for $n$ is between $1$ and $7$.\n\nWe see that the total surface area can be comprised of three parts: the sides of the cubes, the tops of the cubes, and the bottom of the $7\\times 7\\times 7$ cube (which is just $7 \\times 7 = 49$ ). The sides areas can be measured as the sum $4\\sum_{n=1}^{7} n^2$, giving us $560$. Structurally, if we examine the tower from the top, we see that it really just forms a $7\\times 7$ square of area $49$. Therefore, we can say that the total surface area is $560 + 49 + 49 = \\boxed{\\textbf{(B) }658}$. Alternatively, for the area of the tops, we could have found the sum $\\sum_{n=2}^{7}((n)^{2}-(n-1)^{2})$, giving us $49$ as well.\n\n~ciceronii\n\nNote: The area on top and bottom are 49 because the largest area is 49, and the other cubes are \"inscribed\" in it.",
        "It can quickly be seen that the side lengths of the cubes are the integers from 1 to 7 inclusive.\n\nFirst, we will calculate the total surface area of the cubes, ignoring overlap. This value is $6 ( 1^2 + 2^2 + \\cdots + 7^2 ) = 6\\sum_{n=1}^{7} n^2 = 6 \\left( \\frac{7(7 + 1)(2 \\cdot 7 + 1)}{6} \\right) = 7 \\cdot 8 \\cdot 15 = 840$. Then, we need to subtract out the overlapped parts of the cubes. Between each consecutive pair of cubes, one of the smaller cube's faces is completely covered, along with an equal area of one of the larger cube's faces. The total area of the overlapped parts of the cubes is thus equal to $2\\sum_{n=1}^{6} n^2 = 182$. Subtracting the overlapped surface area from the total surface area, we get $840 - 182 = \\boxed{\\textbf{(B) }658}$. ~ emerald_block",
        "It can be seen that the side lengths of the cubes using cube roots are all integers from $1$ to $7$, inclusive.\n\nOnly the cubes with side length $1$ and $7$ have $5$ faces in the surface area and the rest have $4$. Also, since the cubes are stacked, we have to find the difference between each $n^2$ and $(n-1)^2$ side length as $n$ ranges from $7$ to $2$.\n\nWe then come up with this: $5(49)+13+4(36)+11+4(25)+9+4(16)+7+4(9)+5+4(4)+3+5(1)$.\n\nWe then add all of this and get $\\boxed{\\textbf{(B) }658}$.\n\n~aryam, edited by taarunganesh",
        "Notice that the surface area of the top cube is $6s^2$ and the others are $4s^2$. Then we can directly compute. The edge length for the first cube is $7$ and has a surface area of $294$. The surface area of the next cube is $144$. The surface area of the next cube $100$. The surface area of the next cube is $64$. The surface area of the next cube is $36$. The surface area of the next cube is $16$. The surface area of the next cube is $4$. We then sum up $294+144+100+64+36+16+4$ to get $\\boxed{\\textbf{(B) }658}$. ~smartatmath",
        "First of all, compute the area of the sides, excluding the top and bottoms, of the cubes. The side lengths (cube root the volumes) are 1, 2, 3, 4, 5, 6, 7.  Each cube's area of the sides can be calculated with $4($ area of one side $)$ = $4(l^2)$ so in total that is $4(1+4+16+...+49)$ so $4(140)=560$ the area of all the sides of the cubes is $560$.  Then, calculate the bottom face of the largest cube, $7*7=49$.  Now, notice that if you stack the cubes up on top of each other, and look directly down on them, the tops of the cubes showing add up to the area of the bottom cube, the 7x7. Therefore, the sum of the area of the tops of the cubes is $7*7=49$.\n\nNow add them all up: $49+49+560=658.$ Therefore, the answer is $\\boxed{\\textbf{(B) }658}$.\n\n~Hermanboxcar5",
        "Firstly, calculate the total surface area for all the cubes. Knowing that the area of each square of each cube are $2^2,3^2,4^2,5^2,6^2,7^2,$ we have $6(1+4+9+16+25+36+49)=6(140)=840.$ When you stack these cubes, the top square of each are subtracted by the square area of the cube above it. Meanwhile, the bottom square of each (except the 7x7x7 cube) won't be counted because of the stacking. So, we have to subtract $2(1+4+9+16+25+36)=2(91)=182$ from $840$, getting $\\boxed{\\textbf{(B) }658}.$\n\n~Yelechi",
        "Education, The Study of Everything\n\nhttps://youtu.be/tIubHgoWW_M",
        "https://youtu.be/JEjib74EmiY\n\n~IceMatrix",
        "https://youtu.be/ZZB8KiqHbD4\n\n~savannahsolver",
        "https://youtu.be/FDgcLW4frg8?t=3319\n\n~ pi_is_3.14"
      ],
      "difficulty": "easy",
      "category": "geometry"
    },
    {
      "id": 11,
      "question": "What is the median of the following list of $4040$numbers$?$ $\\[1, 2, 3, \\ldots, 2020, 1^2, 2^2, 3^2, \\ldots, 2020^2\\]$",
      "options": [
        "$1974.5\\qquad$",
        "$1975.5\\qquad$",
        "$1976.5\\qquad$",
        "$1977.5\\qquad$",
        "$1978.5$"
      ],
      "correctAnswer": "C",
      "solution": [
        "We can see that $44^2=1936$ which is less than 2020. Therefore, there are $2020-44=1976$ of the $4040$ numbers greater than $2020$. Also, there are $2020+44=2064$ numbers that are less than or equal to $2020$.\n\nSince there are $44$ duplicates/extras, it will shift up our median's placement down $44$. Had the list of numbers been $1,2,3, \\dots, 4040$, the median of the whole set would be $\\dfrac{1+4040}{2}=2020.5$.\n\nThus, our answer is $2020.5-44=\\boxed{\\textbf{(C)}\\ 1976.5}$.\n\n~aryam\n\n~Additions by BakedPotato66",
        "As we are trying to find the median of a $4040$-term set, we must find the average of the $2020$ th and $2021$ st terms.\n\nSince $45^2 = 2025$ is slightly greater than $2020$, we know that the $44$ perfect squares $1^2$ through $44^2$ are less than $2020$, and the rest are greater. Thus, from the number $1$ to the number $2020$, there are $2020 + 44 = 2064$ terms. Since $44^2$ is $44 + 45 = 89$ less than $45^2 = 2025$ and $84$ less than $2020$, we will only need to consider the perfect square terms going down from the $2064$ th term, $2020$, after going down $84$ terms. Since the $2020$ th and $2021$ st terms are only $44$ and $43$ terms away from the $2064$ th term, we can simply subtract $44$ from $2020$ and $43$ from $2020$ to get the two terms, which are $1976$ and $1977$. Averaging the two, we get $\\boxed{\\textbf{(C)}\\ 1976.5}.$\n\n~ emerald_block",
        "We want to know the $2020$ th term and the $2021$ st term to get the median.\n\nWe know that $44^2=1936$. So, numbers $1^2, 2^2, \\ldots,44^2$ are in between $1$ and $1936$.\n\nSo, the sum of $44$ and $1936$ will result in $1980$, which means that $1936$ is the $1980$ th number.\n\nAlso, notice that $45^2=2025$, which is larger than $2021$.\n\nThen the $2020$ th term will be $1936+40 = 1976$, and similarly the $2021$ th term will be $1977$.\n\nSolving for the median of the two numbers, we get $\\boxed{\\textbf{(C)}\\ 1976.5}$\n\n~toastybaker",
        "We note that $44^2 = 1936$, which is the largest square less than $2020$, which means that there are $44$ additional terms before $2020$. This makes $2020$ the $2064$ th term. To find the median, we need the $2020$ th and $2021$ st term. We note that every term before $2020$ is one less than the previous term (That is, we subtract $1$ to get the previous term.). If $2020$ is the $2064$ th term, than $2020 - 44$ is the $(2064 - 44)$ th term. So, the $2020$ th term is $1976$, and the $2021$ st term is $1977$, and the average of these two terms is the median, or $\\boxed{\\textbf{(C)}\\ 1976.5}$.\n\n~primegn",
        "To find the median, we sort the $4040$ numbers in decreasing order, then average the $2020$ th and the $2021$ st numbers of the sorted list.\n\nSince $45^2=2025$ and $44^2=1936,$ the first $2021$ numbers of the sorted list are $\\[\\underbrace{2020^2,2019^2,2018^2,\\ldots,46^2,45^2}_{1976\\mathrm{ \\ numbers}}\\phantom{ },\\phantom{ }\\underbrace{2020,2019,2018,\\ldots,1977,1976}_{45\\mathrm{ \\ numbers}}\\phantom{ },\\]$ from which the answer is $\\frac{1977+1976}{2}=\\boxed{\\textbf{(C)}\\ 1976.5}.$\n\n~MRENTHUSIASM",
        "https://youtu.be/luMQHhp_Rfk",
        "https://youtu.be/ZGwAasE32Y4\n\n~IceMatrix",
        "https://youtu.be/B0RPkcjdkPU\n\n~savannahsolver",
        "https://youtu.be/xqo0PgH-h8Y?t=363\n\n~ pi_is_3.14"
      ],
      "difficulty": "medium",
      "category": "algebra"
    },
    {
      "id": 12,
      "question": "Triangle $AMC$ is isosceles with $AM = AC$. Medians $\\overline{MV}$ and $\\overline{CU}$ are perpendicular to each other, and $MV=CU=12$. What is the area of $\\triangle AMC?$\n![Diagram](/data/images/f543642e2e580d31306b0a3b1c236f0b.png)",
      "options": [
        "$48 \\qquad$",
        "$72 \\qquad$",
        "$96 \\qquad$",
        "$144 \\qquad$",
        "$192$"
      ],
      "correctAnswer": "C",
      "solution": [
        "Since quadrilateral $UVCM$ has perpendicular diagonals, its area can be found as half of the product of the length of the diagonals. Also note that $\\triangle AUV$ has $\\frac 14$ the area of triangle $AMC$ by similarity, so $[UVCM]=\\frac 34\\cdot [AMC].$ Thus, $\\[\\frac 12 \\cdot 12\\cdot 12=\\frac 34 \\cdot [AMC]\\]$ $\\[72=\\frac 34\\cdot [AMC]\\]$ $\\[[AMC]=96\\rightarrow \\boxed{\\textbf{(C)}}.\\]$\n\nNote: We know that since $AU$ is the median $AU$ divided by $AM$ is $1/2$. Since triangle $AUV$ is similar to triangle $AMC$, and by a factor of $1/2$, then every sidelength of $AMC$ must also be scaled by a factor of $1/2$ to get $AUV$. The base and height are all scaled by $1/2$, so then the ratio is $1/2 \\cdot 1/2$.\n\n~<B+ converted \"Note\" into proper LaTeX as it was in plain text previously when it was required to convert into LaTeX by writer of the \"Note\"",
        "![Diagram](/data/images/f543642e2e580d31306b0a3b1c236f0b.png)\n\nWe know that $\\triangle AUV \\sim \\triangle AMC$, and since the ratios of its sides are $\\frac{1}{2}$, the ratio of of their areas is $\\left(\\frac{1}{2}\\right)^2=\\frac{1}{4}$.\n\nIf $\\triangle AUV$ is $\\frac{1}{4}$ the area of $\\triangle AMC$, then trapezoid $MUVC$ is $\\frac{3}{4}$ the area of $\\triangle AMC$.\n\nLet's call the intersection of $\\overline{UC}$ and $\\overline{MV}$ $P$. Let $\\overline{UP}=x$. Then $\\overline{PC}=12-x$. Since $\\overline{UC}  \\perp \\overline{MV}$, $\\overline{UP}$ and $\\overline{CP}$ are heights of triangles $\\triangle MUV$ and $\\triangle MCV$, respectively. Both of these triangles have base $12$.\n\nArea of $\\triangle MUV = \\frac{x\\cdot12}{2}=6x$\n\nArea of $\\triangle MCV = \\frac{(12-x)\\cdot12}{2}=72-6x$\n\nAdding these two gives us the area of trapezoid $MUVC$, which is $6x+(72-6x)=72$.\n\nThis is $\\frac{3}{4}$ of the triangle, so the area of the triangle is $\\frac{4}{3}\\cdot{72}=\\boxed{\\textbf{(C) } 96}$ ~quacker88, diagram by programjames1",
        "Draw median $\\overline{AB}$. ![Diagram](/data/images/451ee1bb8c97c9574cff581a2295d2ed.png)\n\nSince we know that all medians of a triangle intersect at the centroid, we know that $\\overline{AB}$ passes through point $P$. We also know that medians of a triangle divide each other into segments of ratio $2:1$. Knowing this, we can see that $\\overline{PC}:\\overline{UP}=2:1$, and since the two segments sum to $12$, $\\overline{PC}$ and $\\overline{UP}$ are $8$ and $4$, respectively.\n\nFinally knowing that the medians divide the triangle into $6$ sections of equal area, finding the area of $\\triangle PUM$ is enough. $\\overline{PC} = \\overline{MP} = 8$.\n\nThe area of $\\triangle PUM = \\frac{4\\cdot8}{2}=16$. Multiplying this by $6$ gives us $6\\cdot16=\\boxed{\\textbf{(C) }96}$\n\n~quacker88",
        "![Diagram](/data/images/f543642e2e580d31306b0a3b1c236f0b.png) We know that $AU = UM$, $AV = VC$, so $UV = \\frac{1}{2} MC$.\n\nAs $\\angle UPM = \\angle VPC = 90$, we can see that $\\triangle UPM \\cong \\triangle VPC$ and $\\triangle UVP \\sim \\triangle MPC$ with a side ratio of $1 : 2$.\n\nSo $UP = VP = 4$, $MP = PC = 8$.\n\nWith that, we can see that $[\\triangle UPM] = 16$, and the area of trapezoid $MUVC$ is 72.\n\nAs said in solution 1, $[\\triangle AMC] = 72  /  \\frac{3}{4} = \\boxed{\\textbf{(C) } 96}$.\n\n-QuadraticFunctions, solution 1 by ???",
        "![Diagram](/data/images/98c979bb6864f48b10bad95c2e18dab6.png)\n\nLet $AB$ be the height. Since medians divide each other into a $2:1$ ratio, and the medians have length 12, we have $PC=MP=8$ and $UP=VP=4$. From right triangle $\\triangle{MUP}$, $\\[MU^2=MP^2+UP^2=8^2+4^2=80,\\]$ so $MU=\\sqrt{80}=4\\sqrt{5}$. Since $CU$ is a median, $AM=8\\sqrt{5}$. From right triangle $\\triangle{MPC}$, $\\[MC^2=MP^2+PC^2=8^2+8^2=128,\\]$ which implies $MC=\\sqrt{128}=8\\sqrt{2}$. By symmetry $MB=\\dfrac{8\\sqrt{2}}{2}=4\\sqrt{2}$.\n\nApplying the Pythagorean Theorem to right triangle $\\triangle{MAB}$ gives $AB^2=AM^2-MB^2=8\\sqrt{5}^2-4\\sqrt{2}^2=288$, so $AB=\\sqrt{288}=12\\sqrt{2}$. Then the area of $\\triangle{AMC}$ is $\\[\\dfrac{AB \\cdot MC}{2}=\\dfrac{8\\sqrt{2} \\cdot 12\\sqrt{2}}{2}=\\dfrac{96 \\cdot 2}{2}=\\boxed{\\textbf{(C) }96}\\]$",
        "By similarity, the area of $AUV$ is equal to $\\frac{1}{4}$.\n\nThe area of $UVCM$ is equal to 72.\n\nAssuming the total area of the triangle is S, the equation will be : $\\frac{3}{4}$ S = 72.\n\nS = $\\boxed{\\textbf{(C) }96}$",
        "Given a triangle with perpendicular medians with lengths $x$ and $y$, the area will be $\\frac{2xy}{3}=\\boxed{\\textbf{(C) }96}$.",
        "Connect the line segment $UV$ and it's easy to see quadrilateral $UVMC$ has an area of the product of its diagonals divided by $2$ which is $72$. Now, solving for triangle $AUV$ could be an option, but the drawing shows the area of $AUV$ will be less than the quadrilateral meaning the the area of $AMC$ is less than $72*2$ but greater than $72$, leaving only one possible answer choice, $\\boxed{\\textbf{(C) } 96}$.\n\n-Rohan S.",
        "![Diagram](/data/images/451ee1bb8c97c9574cff581a2295d2ed.png)\n\nConnect $AP$, and let $B$ be the point where $AP$ intersects $MC$. $MB=CB$ because all medians of a triangle intersect at one point, which in this case is $P$. $MP:PV=2:1$ because the point at which all medians intersect divides the medians into segments of ratio $2:1$, so $MP=8$ and similarly $CP=8$. We apply the Pythagorean Theorem to triangle $MPC$ and get $MC=\\sqrt{128}=8\\sqrt{2}$. The area of triangle $MPC$ is $\\dfrac{MP\\cdot CP}{2}=32$, and that must equal to $\\dfrac{MC\\cdot BP}{2}$, so $BP=\\dfrac{8}{\\sqrt{2}}=4\\cdot\\sqrt{2}$. $BP=\\dfrac{1}{3}BA$, so $BA=12\\sqrt{2}$. The area of triangle $AMC$ is equal to $\\dfrac{MC\\cdot BA}{2}=\\dfrac{8 \\cdot \\sqrt{2} \\cdot 12 \\cdot \\sqrt{2}}{2}=\\boxed{\\textbf{(C)}\\ 96}$.\n\n-SmileKat32",
        "$[\\square MUVC] = 72$. Let intersection of line $AP$ and base $MC$ be $B$ $\\[[AUV]=[MUB]=[UVB]=[BVC] \\implies \\left[\\frac{\\triangle AMC}{4}\\right] = \\left[\\frac{\\square MUVC}{3}\\right] \\implies [AMC] = \\boxed{\\textbf{(C)}\\ 96}\\]$\n\n~herobrine-india",
        "![Diagram](/data/images/f543642e2e580d31306b0a3b1c236f0b.png)\n\nSince $\\overline{MV}$ and $\\overline{CU}$ intersect at a right angle, this means $MUVC$ is a kite. Hence, the area of this kite is $\\frac{12 \\cdot 12}{2} = 72$.\n\nAlso, notice that $\\triangle AUV \\sim \\triangle AMC$ by AAA Similarity. Since the ratios of its sides is $\\frac{1}{2}$, the ratios of the area is $\\left(\\frac{1}{2}\\right)^2=\\frac{1}{4}$. Therefore,\n\n$\\[[AMC] = [MUVC] + \\frac{1}{4} \\cdot [AMC]\\]$\n\nSimplifying gives us $\\frac{3}{4} \\cdot [AMC] = 72$, so $[AMC] = 72 \\cdot \\frac{4}{3} = \\boxed{\\textbf{(C)}\\ 96}$\n\n~MrThinker",
        "Horizontally translate line $\\overline{UC}$ until point $U$ is at point $V$, with $C$ subsequently at $C'$, and then connect up $C'$ and $C$ to create $\\triangle MVC'$, which is a right triangle.\n\n![Diagram](/data/images/64156c6b6dae31179a1f28ac18b1b37d.png)\n\nNotice that $\\triangle MVC'$ = $12 \\cdot 12 \\cdot \\frac{1}{2} = 72$, and $\\triangle MVC'$ = $\\triangle MVC + \\triangle MUV$ (since the latter has the same base and height as the sub-triangle $\\triangle CVC'$ inside $\\triangle MVC'$ ).\n\nFrom this, we can deduce that $\\textbf{(B)}$ cannot be true, since an incomplete part of $\\triangle AMC$ is equal to it. We can also deduce that $\\textbf{(D)}$ also cannot be true, since the unknown triangle $\\triangle AUV = \\triangle MUV$, and $\\triangle MUV = \\triangle CVC' < \\triangle MVC'$. Therefore, the answer must be between $72$ and $144$, leaving $\\boxed{\\textbf{(C)}\\ 96}$ as the only possible correct answer.\n\n~DifrractSliver",
        "Education, The Study of Everything\n\nhttps://youtu.be/0TslJ3aDXac",
        "https://youtu.be/ZGwAasE32Y4\n\n~IceMatrix",
        "https://youtu.be/7ZvKOYuwSnE\n\n~savannahsolver",
        "https://youtu.be/4_x1sgcQCp4?t=2067\n\n~ pi_is_3.14"
      ],
      "difficulty": "medium",
      "category": "geometry"
    },
    {
      "id": 13,
      "question": "A frog sitting at the point $(1, 2)$ begins a sequence of jumps, where each jump is parallel to one of the coordinate axes and has length $1$, and the direction of each jump (up, down, right, or left) is chosen independently at random. The sequence ends when the frog reaches a side of the square with vertices $(0,0), (0,4), (4,4),$ and $(4,0)$. What is the probability that the sequence of jumps ends on a vertical side of the square?",
      "options": [
        "$\\frac12\\qquad$",
        "$\\frac 58\\qquad$",
        "$\\frac 23\\qquad$",
        "$\\frac34\\qquad$",
        "$\\frac 78$"
      ],
      "correctAnswer": "B",
      "solution": [
        "Drawing out the square, it's easy to see that if the frog goes to the left, it will immediately hit a vertical end of the square. Therefore, the probability of this happening is $\\frac{1}{4} \\cdot 1 = \\frac{1}{4}$. If the frog goes to the right, it will be in the center of the square at $(2,2)$, and by symmetry (since the frog is equidistant from all sides of the square), the chance it will hit a vertical side of a square is $\\frac{1}{2}$. The probability of this happening is $\\frac{1}{4} \\cdot \\frac{1}{2} = \\frac{1}{8}$.\n\nIf the frog goes either up or down, it will hit a line of symmetry along the corner it is closest to and furthest to, and again, is equidistant relating to the two closer sides and also equidistant relating the two further sides. The probability for it to hit a vertical wall is $\\frac{1}{2}$. Because there's a $\\frac{1}{2}$ chance of the frog going up or down, the total probability for this case is $\\frac{1}{2} \\cdot \\frac{1}{2} = \\frac{1}{4}$ and summing up all the cases, $\\frac{1}{4} + \\frac{1}{8} + \\frac{1}{4} = \\frac{5}{8}       \\implies \\boxed{\\textbf{(B) } \\frac{5}{8}}$.",
        "Let's say we have our five by five grid and we work this out by casework. A is where the frog is, while B and C are possible locations for his second jump, while O is everything else. If we land on a C, we have reached the vertical side. However, if we land on a B, we So we have the probability of landing on a C is 1/4, while B is 3/4. Since C means that we have \"succeeded\", while B means that we have a half chance, we compute $1 \\cdot C + \\frac{1}{2} \\cdot B$.\n\n$\\[1 \\cdot \\frac{1}{4} + \\frac{1}{2} \\cdot \\frac{3}{4}\\]$ $\\[\\frac{1}{4} + \\frac{3}{8}\\]$ We get $\\frac{5}{8}$, or $B$ $\\[\\text{O}\\ \\ \\ \\text{O}\\ \\ \\ \\text{O}\\ \\ \\ \\text{O}\\ \\ \\ \\text{O}\\]$ $\\[\\text{O}\\ \\ \\ \\text{B}\\ \\ \\ \\text{O}\\ \\ \\ \\text{O}\\ \\ \\ \\text{O}\\]$ $\\[\\text{C}\\ \\ \\ \\text{A}\\ \\ \\ \\text{B}\\ \\ \\ \\text{O}\\ \\ \\ \\text{O}\\]$ $\\[\\text{O}\\ \\ \\ \\text{B}\\ \\ \\ \\text{O}\\ \\ \\ \\text{O}\\ \\ \\ \\text{O}\\]$ $\\[\\text{O}\\ \\ \\ \\text{O}\\ \\ \\ \\text{O}\\ \\ \\ \\text{O}\\ \\ \\ \\text{O}\\]$-yeskay\n\n~<B+ (minor alterations and edits)",
        "If the frog is on one of the 2 diagonals, the chance of landing on vertical or horizontal each becomes $\\frac{1}{2}$. Since it starts on $(1,2)$, there is a $\\frac{3}{4}$ chance (up, down, or right) it will reach a diagonal on the first jump and $\\frac{1}{4}$ chance (left) it will reach the vertical side. The probablity of landing on a vertical is $\\frac{1}{4}+\\frac{3}{4} \\cdot \\frac{1}{2}=\\boxed{\\textbf{(B)} \\frac{5}{8}}$. - Lingjun",
        "Let $P_{(x,y)}$ denote the probability of the frog's sequence of jumps ends with it hitting a vertical edge when it is at $(x,y)$. Note that $P_{(1,2)}=P_{(3,2)}$ by reflective symmetry over the line $x=2$. Similarly, $P_{(1,1)}=P_{(1,3)}=P_{(3,1)}=P_{(3,3)}$, and $P_{(2,1)}=P_{(2,3)}$.  Now we create equations for the probabilities at each of these points/states by considering the probability of going either up, down, left, or right from that point: $\\[P_{(1,2)}=\\frac{1}{4}+\\frac{1}{2}P_{(1,1)}+\\frac{1}{4}P_{(2,2)}\\]$ $\\[P_{(2,2)}=\\frac{1}{2}P_{(1,2)}+\\frac{1}{2}P_{(2,1)}\\]$ $\\[P_{(1,1)}=\\frac{1}{4}+\\frac{1}{4}P_{(1,2)}+\\frac{1}{4}P_{(2,1)}\\]$ $\\[P_{(2,1)}=\\frac{1}{2}P_{(1,1)}+\\frac{1}{4}P_{(2,2)}\\]$ We have a system of $4$ equations in $4$ variables, so we can solve for each of these probabilities. Plugging the second equation into the fourth equation gives $\\[P_{(2,1)}=\\frac{1}{2}P_{(1,1)}+\\frac{1}{4}\\left(\\frac{1}{2}P_{(1,2)}+\\frac{1}{2}P_{(2,1)}\\right)\\]$ $\\[P_{(2,1)}=\\frac{8}{7}\\left(\\frac{1}{2}P_{(1,1)}+\\frac{1}{8}P_{(1,2)}\\right)=\\frac{4}{7}P_{(1,1)}+\\frac{1}{7}P_{(1,2)}\\]$ Plugging in the third equation into this gives $\\[P_{(2,1)}=\\frac{4}{7}\\left(\\frac{1}{4}+\\frac{1}{4}P_{(1,2)}+\\frac{1}{4}P_{(2,1)}\\right)+\\frac{1}{7}P_{(1,2)}\\]$ $\\[P_{(2,1)}=\\frac{7}{6}\\left(\\frac{1}{7}+\\frac{2}{7}P_{(1,2)}\\right)=\\frac{1}{6}+\\frac{1}{3}P_{(1,2)}\\text{    (*)}\\]$ Next, plugging in the second and third equation into the first equation yields $\\[P_{(1,2)}=\\frac{1}{4}+\\frac{1}{2}\\left(\\frac{1}{4}+\\frac{1}{4}P_{(1,2)}+\\frac{1}{4}P_{(2,1)}\\right)+\\frac{1}{4}\\left(\\frac{1}{2}P_{(1,2)}+\\frac{1}{2}P_{(2,1)}\\right)\\]$ $\\[P_{(1,2)}=\\frac{3}{8}+\\frac{1}{4}P_{(1,2)}+\\frac{1}{4}P_{(2,1)}\\]$ Now plugging in (*) into this, we get $\\[P_{(1,2)}=\\frac{3}{8}+\\frac{1}{4}P_{(1,2)}+\\frac{1}{4}\\left(\\frac{1}{6}+\\frac{1}{3}P_{(1,2)}\\right)\\]$ $\\[P_{(1,2)}=\\frac{3}{2}\\cdot\\frac{5}{12}=\\boxed{\\textbf{(B) }\\frac{5}{8}}\\]$-mathisawesome2169",
        "this is basically another version of solution 4; shoutout to mathisawesome2169 :D\n\nFirst, we note the different places the frog can go at certain locations in the square:\n\nIf the frog is at a border vertical point ( $(1,2),(3,2)$ ), it moves with probability $\\frac{1}{4}$ to a vertical side of the square, probability $\\frac{1}{4}$ to the center of the square, and probability $\\frac{1}{2}$ to a corner square.\n\nIf the frog is at a border horizontal point ( $(2,1),(2,3)$ ), it moves with probability $\\frac{1}{4}$ to a horizontal side of the square, probability $\\frac{1}{4}$ to the center of the square, and probability $\\frac{1}{2}$ to a corner square.\n\nIf the frog is at a center square ( $(2,2)$ ), it moves with probability $\\frac{1}{2}$ to a border horizontal point and probability $\\frac{1}{2}$ to a border vertical point.\n\nIf the frog is at a corner ( $(1,1),(1,3),(3,3),(3,1)$ ), it moves with probability $\\frac{1}{4}$ to a vertical side of the square, probability $\\frac{1}{4}$ to a horizontal side, probability $\\frac{1}{4}$ to a border horizontal point, and probability $\\frac{1}{4}$ to a border vertical point.\n\nNow, let $x$ denote the probability of the frog reaching a vertical side when it is at a border vertical point. Similarly, let $y$ denote the probability of the frog reaching a vertical side when it is at a border horizontal point. Now, the probability of the frog reaching a vertical side of the square at any location inside the square can be expressed in terms of $x$ and $y$.\n\nFirst, the two easier ones: $P_{center}=\\frac{1}{2}x+\\frac{1}{2}y$, and $P_{corner}=\\frac{1}{4}+\\frac{1}{4}x+\\frac{1}{4}y$. Now, we can write $x$ and $y$ in terms of $x$ and $y$, allowing us to solve a system of two variables: $\\[x=\\frac{1}{4}+\\frac{1}{4}P_{center}+\\frac{1}{2}P_{corner}=\\frac{1}{4}+\\frac{1}{4}\\left(\\frac{1}{2}x+\\frac{1}{2}y\\right)+\\frac{1}{2}\\left(\\frac{1}{4}+\\frac{1}{4}x+\\frac{1}{4}y\\right)\\]$ and $\\[y=\\frac{1}{4}P_{center}+\\frac{1}{2}P_{corner}=\\frac{1}{4}\\left(\\frac{1}{2}x+\\frac{1}{2}y\\right)+\\frac{1}{2}\\left(\\frac{1}{4}+\\frac{1}{4}x+\\frac{1}{4}y\\right).\\]$ From these two equations, it is apparent that $y=x-\\frac{1}{4}$. We can then substitute this value for $y$ back into any of the two equations above to get $\\[x=\\frac{1}{4}+\\frac{1}{4}\\left(\\frac{1}{2}x+\\frac{1}{2}\\left(x-\\frac{1}{4}\\right)\\right)+\\frac{1}{2}\\left(\\frac{1}{4}+\\frac{1}{4}x+\\frac{1}{4}\\left(x-\\frac{1}{4}\\right)\\right).\\]$ Although this certainly looks intimidating, we can expand the parentheses and multiply both sides by 16 to eliminate the fractions, which upon simplification yields the equation $\\[16x=5+8x,\\]$ giving us the desired probability $x=\\frac{5}{8}$. The answer is then $\\boxed{\\textbf{(B) }\\frac{5}{8}}$.\n\n- curiousmind888 & TGSN",
        "",
        "IceMatrix's Solution (Starts at 4:40)",
        "https://youtu.be/qNaN0BlIsw0",
        "On The Spot STEM\n\nhttps://youtu.be/xGs7BjQbGYU",
        "https://youtu.be/0m4lbXSUV1I\n\n~savannahsolver",
        "https://youtu.be/IRyWOZQMTV8?t=5173\n\n~ pi_is_3.14",
        "https://www.youtube.com/watch?v=R220vbM_my8\n\n~ amritvignesh0719062.0",
        "https://www.youtube.com/watch?v=TvYoiU_zct8\n\n~ mathgenius2012"
      ],
      "difficulty": "medium",
      "category": "combinatorics"
    },
    {
      "id": 14,
      "question": "Real numbers $x$ and $y$ satisfy $x + y = 4$ and $x \\cdot y = -2$. What is the value of\n$\\[x + \\frac{x^3}{y^2} + \\frac{y^3}{x^2} + y?\\]$",
      "options": [
        "$360\\qquad$",
        "$400\\qquad$",
        "$420\\qquad$",
        "$440\\qquad$",
        "$480$"
      ],
      "correctAnswer": "D",
      "solution": [
        "$\\[x + \\frac{x^3}{y^2} + \\frac{y^3}{x^2} + y=x+\\frac{x^3}{y^2}+y+\\frac{y^3}{x^2}=\\frac{x^3}{x^2}+\\frac{y^3}{x^2}+\\frac{y^3}{y^2}+\\frac{x^3}{y^2}\\]$\n\nContinuing to combine $\\[\\frac{x^3+y^3}{x^2}+\\frac{x^3+y^3}{y^2}=\\frac{(x^2+y^2)(x^3+y^3)}{x^2y^2}=\\frac{(x^2+y^2)(x+y)(x^2-xy+y^2)}{x^2y^2}\\]$ From the givens, it can be concluded that $x^2y^2=4$. Also, $\\[(x+y)^2=x^2+2xy+y^2=16\\]$ This means that $x^2+y^2=20$. Substituting this information into $\\frac{(x^2+y^2)(x+y)(x^2-xy+y^2)}{x^2y^2}$, we have $\\frac{(20)(4)(22)}{4}=20\\cdot 22=\\boxed{\\textbf{(D)}\\ 440}$. ~PCChess",
        "As above, we need to calculate $\\frac{(x^2+y^2)(x^3+y^3)}{x^2y^2}$. Note that $x,y,$ are the roots of $x^2-4x-2$ and so $x^3=4x^2+2x$ and $y^3=4y^2+2y$. Thus $x^3+y^3=4(x^2+y^2)+2(x+y)=4(20)+2(4)=88$ where $x^2+y^2=20$ and $x^2y^2=4$ as in the previous solution. Thus the answer is $\\frac{(20)(88)}{4}=\\boxed{\\textbf{(D)}\\ 440}$. Note( $x^2+y^2=(x+y)^2-2xy=20$, and $x^2y^2 = (xy)^2 = 4$ )",
        "Note that $( x^3 + y^3 ) ( \\frac{1}{y^2} + \\frac{1}{x^2} ) = x + \\frac{x^3}{y^2} + \\frac{y^3}{x^2} + y.$ Now, we only need to find the values of $x^3 + y^3$ and $\\frac{1}{y^2} + \\frac{1}{x^2}.$ Recall that $x^3 + y^3 = (x + y) (x^2 - xy + y^2),$ and that $x^2 - xy + y^2 = (x + y)^2 - 3xy.$ We are able to solve the second equation, and doing so gets us $4^2 - 3(-2) = 22.$ Plugging this into the first equation, we get $x^3 + y^3 = 4(22) = 88.$ In order to find the value of $\\frac{1}{y^2} + \\frac{1}{x^2},$ we find a common denominator so that we can add them together. This gets us $\\frac{x^2}{x^2 y^2} + \\frac{y^2}{x^2 y^2} = \\frac{x^2 + y^2}{(xy)^2}.$ Recalling that $x^2 + y^2 = (x+y)^2 - 2xy$ and solving this equation, we get $4^2 - 2(-2) = 20.$ Plugging this into the first equation, we get $\\frac{1}{y^2} + \\frac{1}{x^2} = \\frac{20}{(-2)^2} = 5.$ Solving the original equation, we get $x + \\frac{x^3}{y^2} + \\frac{y^3}{x^2} + y = (88)(5) = \\boxed{\\textbf{(D)}\\ 440}.$ ~ emerald_block",
        "This is basically bashing using Vieta's formulas to find $x$ and $y$ (which I highly do not recommend, I only wrote this solution for fun).\n\nWe use Vieta's to find a quadratic relating $x$ and $y$. We set $x$ and $y$ to be the roots of the quadratic $Q ( n ) = n^2 - 4n - 2$ (because $x + y = 4$, and $xy = -2$ ). We can solve the quadratic to get the roots $2 + \\sqrt{6}$ and $2 - \\sqrt{6}$. $x$ and $y$ are \"interchangeable\" (WLOG, without loss of generality, we could have $x$ equal one and $y$ equal the other), meaning that it doesn't matter which solution $x$ or $y$ is, because it'll return the same result when plugged in. So we plug in $2 + \\sqrt{6}$ for $x$ and $2 - \\sqrt{6}$ and get $\\boxed{\\textbf{(D)}\\ 440}$ as our answer.\n\n~Baolan\n\n~<B+",
        "This usually wouldn't work for most problems like this, but we're lucky that we can quickly expand and factor this expression in this question.\n\nWe first change the original expression to $4 + \\frac{x^5 + y^5}{x^2 y^2}$, because $x + y = 4$. This is equal to $4 + \\frac{(x + y)(x^4 - x^3 y + x^2 y^2 - x y^3 + y^4)}{4} = x^4 + y^4 - x^3 y - x y^3 + 8$. We can factor and reduce $x^4 + y^4$ to $(x^2 + y^2)^2 - 2 x^2 y^2 = ((x + y)^2 - 2xy)^2 - 8 = 400 - 8 = 392$. Now our expression is just $400 - (x^3 y + x y^3)$. We factor $x^3 y + x y^3$ to get $(xy)(x^2 + y^2) = -40$. So the answer would be $400 - (-40)  = \\boxed{\\textbf{(D)} 440}$.",
        "We first simplify the expression to $\\[x + y + \\frac{x^5 + y^5}{x^2y^2}.\\]$ Then, we can solve for $x$ and $y$ given the system of equations in the problem. Since $xy = -2,$ we can substitute $\\frac{-2}{x}$ for $y$.  Thus, this becomes the equation $\\[x - \\frac{2}{x} = 4.\\]$ Multiplying both sides by $x$, we obtain $x^2 - 2 = 4x,$ or $\\[x^2 - 4x - 2 = 0.\\]$ By the quadratic formula we obtain $x = 2 \\pm \\sqrt{6}$.  We also easily find that given $x = 2 \\pm \\sqrt{6}$, $y$ equals the conjugate of $x$.  Thus, plugging our values in for $x$ and $y$, our expression equals $\\[4 + \\frac{(2 - \\sqrt{6})^5 + (2 + \\sqrt{6})^5}{(2 - \\sqrt{6})^2(2 + \\sqrt{6})^2}\\]$ By the binomial theorem, we observe that every second terms of the expansions $x^5$ and $y^5$ will cancel out (since a positive plus a negative of the same absolute value equals zero). We also observe that the other terms not canceling out are doubled when summing the expansions of $x^5 + y^5$. Thus, our expression equals $\\[4 + \\frac{2(2^5 + \\tbinom{5}{2}2^3 \\times 6 + \\tbinom{5}{4}2 \\times 36)}{(2 - \\sqrt{6})^2(2 + \\sqrt{6})^2}.\\]$ which equals $\\[4 + \\frac{2(872)}{4}\\]$ which equals $\\boxed{\\textbf{(D)} 440}$.\n\n~ fidgetboss_4000",
        "As before, simplify the expression to $\\[x + y + \\frac{x^5 + y^5}{x^2y^2}.\\]$ Since $x + y = 4$ and $x^2y^2 = 4$, we substitute that in to obtain $\\[4 + \\frac{x^5 + y^5}{4}.\\]$ Now, we must solve for $x^5 + y^5$. Start by squaring $x + y$, to obtain $\\[x^2 + 2xy + y^2 = 16\\]$ Simplifying, $x^2 + y^2 = 20$. Squaring once more, we obtain $\\[x^4 + y^4 + 2x^2y^2 = 400\\]$ Once again simplifying, $x^4 + y^4 = 392$. Now, to obtain the fifth powers of $x$ and $y$, we multiply both sides by $x + y$. We now have $\\[x^5 + x^4y + xy^4 + y^5 = 1568\\]$,                                                                                     or $\\[x^5 + y^5 + xy(x^3 + y^3) = 1568\\]$ We now solve for $x^3 + y^3$. $(x + y)^3=x^3 + y^3 + 3xy(x + y) = 64$, so $x^3 + y^3 = 88$.  Plugging this back into $x^5 + x^4y + xy^4 + y^5 = 1568$, we find that $x^5 + y^5 = 1744$, so we have $\\[4 + \\frac{1744}{4}.\\]$. This equals 440, so our answer is $\\boxed{\\textbf{(D)} 440}$.\n\n~Binderclips1",
        "We can use Newton Sums to solve this problem. We start by noticing that we can rewrite the equation as $\\frac{x^3}{y^2} + \\frac{y^3}{x^2} + x + y.$ Then, we know that $x + y = 4,$ so we have $\\frac{x^3}{y^2} + \\frac{y^3}{x^2} + 4.$ We can use the equation $x \\cdot y = -2$ to write $x = \\frac{-2}{y}$ and $y = \\frac{-2}{x}.$ Next, we can plug in these values of $x$ and $y$ to get $\\frac{x^3}{y^2} + \\frac{y^3}{x^2} = \\frac{x^5}{4} + \\frac{y^5}{4},$ which is the same as $\\[\\frac{x^3}{y^2} + \\frac{y^3}{x^2} = \\frac{x^5 + y^5}{4}.\\]$ Then, we use Newton sums where $S_n$ is the elementary symmetric sum of the sequence and $P_n$ is the power sum ( $x^n + y^n$ ). Using this, we can make the following Newton sums: $\\[P_1 = S_1\\]$ $\\[P_2 = P_1 S_1 - 2S_2\\]$ $\\[P_3 = P_2 S_1 - P_1 S_2\\]$ $\\[P_4 = P_3 S_1 - P_2 S_2\\]$ $\\[P_5 = P_4 S_1 - P_3 S_2.\\]$ We also know that $S_1$ is 4 because $x + y$ is four, and we know that $S_2$is$-2$ because $x \\cdot y$is$-2$ as well. Then, we can plug in values! We have $\\[P_1 = S_1 = 4\\]$ $\\[P_2 = P_1 S_1 - 2S_2 = 16 - (-4) = 20\\]$ $\\[P_3 = P_2 S_1 - P_1 S_2 = 80 - (-8) = 88\\]$ $\\[P_4 = P_3 S_1 - P_2 S_2 = 88 \\cdot 4 - (-40) = 392\\]$ $\\[P_5 = P_4 S_1 - P_3 S_2 = 392 \\cdot 4 - (-2) \\cdot 88 = 1744.\\]$ We earlier noted that $\\frac{x^3}{y^2} + \\frac{y^3}{x^2} = \\frac{x^5 + y^5}{4},$ so we have that this equals $\\frac{1744}{4},$ or $436.$ Then, plugging this back into the original equation, this is $436 + 4$ or $440,$ so our answer is $\\boxed{\\textbf{(D)}\\ 440}.$\n\n~Coolpeep",
        "As in the first solution, we get the expression to be $\\frac{x^3+y^3}{x^2} + \\frac{x^3+y^3}{y^2}.$\n\nThen, since the numerators are the same, we can put the two fractions as a common denominator and multiply the numerator by $x^2y^2.$ This gets us $\\frac{(x^2 + y^2)(x^3 + y^3)}{x^2y^2}.$\n\nNow, since we know $x+y=4$ and $xy=-2,$ instead of solving for $x$ and $y,$ we will try to manipulate the above expression them into a manner that we can substitute the sum and product that we know. Also, another form of $x^3+y^3$ is $(x+y)(x^2-xy+y^2).$\n\nThus, we can convert the current expression to $\\frac{(x^2 + y^2)(x+y)(x^2-xy+y^2)}{x^2y^2}.$\n\nDoing some algebraic multiplications, we get $\\frac{((x+y)^2 - 2xy)(x+y)((x+y)^2 - 3xy)}{(xy)^2}.$\n\nSince we know $x+y=4$ and $xy=-2,$ we have $\\frac{(16-(-4))(4)(16-(-6))}{4} = \\frac{20 \\cdot 4 \\cdot 22}{4} = 20 \\cdot 22 = 440.$\n\nTherefore the answer is $\\boxed{\\textbf{(D)} 440}.$\n\n~mathboy282",
        "We give all of the terms in this expression a common denominator. $x + \\frac{x^3}{y^2} + \\frac{y^3}{x^2} + y = \\frac{x^3y^2 + x^5 + y^5 + x^2y^3}{x^2y^2}$. We can find $x^2y^2 = (xy)^2 = (-2)^2 = 4$ and we can find $x^3y^2 + x^2y^3 = x^2y^2(x + y) = 16$. Our expression $\\frac{xy^2 + x^5 + y^5 + x^2y}{x^2y^2}$ is now $\\frac{16 + x^5 + y^5}{4}$. Now all we need to find is $x^5 + y^5$. Using the binomial theorem, $(x + y)^5 = x^5 + 5x^4y + 10x^3y^2 + 10x^2y^3 + 5xy^4 + y^5 = 4^5 = 1024$. The extra terms that we don't need is $5x^4y + 10x^3y^2 + 10x^2y^3 + 5xy^4 = 5xy(x^3 + y^3) + 10x^2y^2(x + y) = -10(x^3 + y^3) + 160$. What's $x^3 + y^3$? We use the same method. Using the binomial theorem, $(x + y)^3 = x^3 + 3x^2y + 3xy^2 + y^3 = x^3 + y^3 + 3xy(x + y) = x^3 + y^3 - 24 = 4^3 = 64$. Now we know that $x^3 + y^3 = 64 + 24 = 88$, and plugging that into$-10(x^3 + y^3) + 160$gives$-10(88) + 160 = -880 + 160 = -720$. Now we see that those extra terms have a sum of$-720$. Thus $(x + y)^5 = x^5 + y^5 - 720 = 1024$ so $x^5 + y^5 = 1024 + 720 = 1744$. Remember our goal: we want to find $\\frac{-8 + x^5 + y^5}{4}$. Using $x^5 + y^5 = 1744$, $\\frac{16 + x^5 + y^5}{4} = \\frac{16 + 1744}{4} = \\frac{1760}{4} = \\boxed{\\textbf{(D)}\\ 440}$.\n\n~ Yrock",
        "Since we know $x+y=4$, we can simplify to $4 + \\frac{x^3}{y^2} + \\frac{y^3}{x^2}$. Then, when you add the fractions, you get $\\frac{x^5 + y^5}{x^2y^2} = \\frac{x^5 + y^5}{4}$. To find $x^5 + y^5$, we expand $(x+y)^5 = 4^5$ and then simplify. $x^5+y^5+5x^4y+5xy^4+10x^3y^2+10x^2y^3 = 1024$. We can use the fact that $xy = -2$ to simplify to $x^5 + y^5-10x^3 - 10y^3 + 40x + 40y = 1024$. We can factor to get $x^5 + y^5 -10(x^3 + y^3) +40(x+y)$. To find $x^3 + y^3$, we simplify $(x+y)^3 = 4^3$. $x^3+y^3+3x^2y+3y^2x = 64$. We can use the same process as we did before and get $x^3 + y^3 -6(x+y) = 64$ (using the fact that $xy = -2$ ). Therefore, $x^3 + y^3 = 88$. Now, plugging it back in to our other expansion, we get $x^5 + y^5 + 160 - 880 = 1024$. $x^5 +y^5 = 1744$. Now to get the final answer, all we need to do is to plug it back into the original equation and get $\\frac{1744}{4} + 4 = \\boxed{\\textbf{(D)}\\ 440}$.\n\n~idk12345678",
        "",
        "https://www.youtube.com/watch?v=x4cF3o3Fzj8&t=376s\n\n~Education, The Study of Everything",
        "https://youtu.be/PNkRlUKWCzg",
        "https://www.youtube.com/watch?v=jlRmDrL_jmk ~Mathematical Dexterity (Don't Worry, Be Hoppy!)",
        "https://youtu.be/ZGwAasE32Y4?t=457\n\n~IceMatrix",
        "https://youtu.be/XEtzvxfFEJk\n\n~savannahsolver",
        "https://youtu.be/ba6w1OhXqOQ?t=3551\n\n~ pi_is_3.14"
      ],
      "difficulty": "medium",
      "category": "algebra"
    },
    {
      "id": 15,
      "question": "A positive integer divisor of $12!$ is chosen at random. The probability that the divisor chosen is a perfect square can be expressed as $\\frac{m}{n}$, where $m$ and $n$ are relatively prime positive integers. What is $m+n$?",
      "options": [
        "$3\\qquad$",
        "$5\\qquad$",
        "$12\\qquad$",
        "$18\\qquad$",
        "$23$"
      ],
      "correctAnswer": "E",
      "solution": [
        "The prime factorization of $12!$ is $2^{10} \\cdot 3^5 \\cdot 5^2 \\cdot 7 \\cdot 11$.  This yields a total of $11 \\cdot 6 \\cdot 3 \\cdot 2 \\cdot 2$ divisors of $12!.$ In order to produce a perfect square divisor, there must be an even exponent for each number in the prime factorization. Note that the divisor can't have any factors of $7$ and $11$ in the prime factorization because there is only one of each in $12!.$ Thus, there are $6 \\cdot 3 \\cdot 2$ perfect squares. (For $2$, you can have $0$, $2$, $4$, $6$, $8$, or $10$ $2$ s, etc.) The probability that the divisor chosen is a perfect square is $\\[\\frac{6\\cdot 3\\cdot 2}{11\\cdot 6\\cdot 3\\cdot 2\\cdot 2}=\\frac{1}{22} \\implies \\frac{m}{n}=\\frac{1}{22} \\implies m\\ +\\ n = 1\\ +\\ 22 = \\boxed{\\textbf{(E) } 23 }\\]$\n\n~mshell214, edited by Rzhpamath",
        "Education, The Study of Everything\n\nhttps://youtu.be/ipZV6QfN3iU\n\nThe Beauty of Math\n\nhttps://youtu.be/ZGwAasE32Y4\n\n~IceMatrix\n\nhttps://youtu.be/XVbBKfbvELw\n\n~savannahsolver",
        "https://youtu.be/wopflrvUN2c?t=407\n\n~ pi_is_3.14"
      ],
      "difficulty": "medium",
      "category": "number-theory"
    },
    {
      "id": 16,
      "question": "A point is chosen at random within the square in the coordinate plane whose vertices are $(0, 0), (2020, 0), (2020, 2020),$ and $(0, 2020)$. The probability that the point is within $d$ units of a lattice point is $\\tfrac{1}{2}$. (A point $(x, y)$ is a lattice point if $x$ and $y$ are both integers.) What is $d$to the nearest tenth$?$",
      "options": [
        "$0.3 \\qquad$",
        "$0.4 \\qquad$",
        "$0.5 \\qquad$",
        "$0.6 \\qquad$",
        "$0.7$"
      ],
      "correctAnswer": "B",
      "solution": [
        "As in the previous solution, we obtain the equation $4 \\cdot \\frac{1}{4} \\cdot \\pi d^2 = \\frac{1}{2}$, which simplifies to $\\pi d^2 = \\frac{1}{2} = 0.5$. Since $\\pi$ is slightly more than $3$, $d^2$ is slightly less than $\\frac{0.5}{3} = 0.1\\bar{6}$. We notice that $0.1\\bar{6}$ is slightly more than $0.4^2 = 0.16$, so $d$ is roughly $\\boxed{\\textbf{(B) } 0.4}.$ ~ emerald_block",
        "As above, we find that we need to estimate $d = \\frac{1}{\\sqrt{2\\pi}}$.\n\nNote that we can approximate $2\\pi \\approx 6.28318 \\approx 6.25$ and so $\\frac{1}{\\sqrt{2\\pi}}$ $\\approx \\frac{1}{\\sqrt{6.25}}=\\frac{1}{2.5}=0.4$.\n\nAnd so our answer is $\\boxed{\\textbf{(B) } 0.4}$.\n\n~Silverdragon",
        "We only need to figure out the probability for a unit square, as it will scale up to the $2020\\times 2020$ square. Since we want to find the probability that a point inside a unit square that is $d$ units away from a lattice point (a corner of the square) is $\\frac{1}{2}$, we can find which answer will come the closest to covering $\\frac{1}{2}$ of the area.\n\nSince the closest is $0.4$ which turns out to be $(0.4)^2\\times \\pi = 0.16 \\times \\pi$ which is about $0.502$, we find that the answer rounded to the nearest tenth is $0.4$ or $\\boxed{\\textbf{(B)}}$.\n\n~RuiyangWu",
        "As per the above diagram, realize that $\\pi d^2 = \\frac{1}{2}$, so $d = \\frac{1}{(\\sqrt{2})(\\sqrt{\\pi})}$.\n\n$\\sqrt{2} \\approx 1.4 = \\frac{7}{5}$.\n\n$\\sqrt{\\pi}$ is between $1.7$ and $1.8$ $((1.7)^2 = 2.89$ and $(1.8)^2 = 3.24)$, so we can say $\\sqrt{\\pi} \\approx 1.75 = \\frac{7}{4}$.\n\nSo $d \\approx \\frac{1}{(\\frac{7}{5})(\\frac{7}{4})} = \\frac{1}{\\frac{49}{20}} = \\frac{20}{49}$. This is slightly above $\\boxed{\\textbf{(B) } 0.4}$, since $\\frac{20}{49} \\approx \\frac{2}{5}$.\n\n-Solution by Joeya",
        "As above, we have the equation $\\pi d^2 = \\frac{1}{2}$, and we want to find the most accurate value of $d$. We resort to the answer choices and can plug those values of $d$ in and see which value of $d$ will lead to the most accurate value of $\\pi$.\n\nStarting off in the middle, we try option C with $d=0.5$. Plugging this in, we get $\\pi \\left(\\frac{1}{2}\\right)^2 = \\frac{1}{2},$ and after simplifying we get $\\pi = \\frac{1}{2} \\cdot 4 = 2.$ That's not very good. We know $\\pi \\approx 3.14.$\n\nLet's see if we can do better. Trying option A with $d = 0.3,$ we get $\\pi = \\frac{1}{2} \\cdot \\frac{100}{9} = \\frac{50}{9} = 5 \\frac{5}{9}.$\n\nHm, let's try option B with $d = 0.4.$ We get $\\pi = \\frac{1}{2} \\cdot \\frac{25}{4} = \\frac{25}{8} = 3 \\frac{1}{8}$. This is very close to $\\pi$ and is the best estimate for $\\pi$ of the 5 options.\n\nTherefore, the answer is $\\boxed{\\textbf{(B) } 0.4}.$ ~ epiconan",
        "PLEASE NOTE: Solution 1 IS rigorous. Say there are $k$ unit squares (it doesn't matter how many). There is a $\\frac{1}k$ probability the point is in some unit square. There is a $\\pi d^2$ probability the point is in the shaded region. So, there is a $\\frac{1}k \\pi d^2 \\cdot k = \\pi d^2$ probability the point is in any shaded region (since there are $k$ unit squares).\n\nLet $n$ be the side length of a square. When $n=1$, the shaded areas represent half of the total area: ![Diagram](/data/images/57dc84e14b0a6c8b35fcfe9d63c0e23d.png)\n\nWhen $n=2$: ![Diagram](/data/images/ff6e114eb081d726c2a60c9716dd6659.png)\n\nFor $n=3$:\n\n![Diagram](/data/images/11c7ea9af663ba5485830a0a0e117c92.png)\n\nWe can calculate the total number of shaded circles given some $n$. There are $(n-1)^2$ full circles on the inside, $4(n-1)$ semicircles on the sides, and $4$ quarter circles for the corners.\n\nFull circles are, of course, worth one circle. Semicircles are worth half a circle each, and quarter circles are worth $\\dfrac14$ of a circle. Thus, weighing our sum gives $(n-1)^2+\\dfrac{4(n-1)}2+\\dfrac44=n^2-2n+1+2(n-1)+1=n^2-2n+2n+2-2=n^2.$ Thus, there is $n^2\\cdot\\pi r^2$ worth of the shaded area for any $n$, and since the area of each circle is $\\pi r^2$ if $r$ is the radius of each.\n\nWe want the ratio of this shaded area to the entire to be $\\dfrac12$. The area of the entire square is $n^2$, so dividing, we see that $\\dfrac{n^2\\cdot\\pi r^2}{n^2}=\\pi r^2=\\dfrac12$.\n\nThe rest is the same as solution $1$.",
        "",
        "Education, The Study of Everything\n\nhttps://youtu.be/napCkujyrac",
        "https://youtu.be/RKlG6oZq9so\n\n~IceMatrix",
        "https://youtu.be/R220vbM_my8?t=238\n\n~ amritvignesh0719062.0"
      ],
      "difficulty": "medium",
      "category": "combinatorics"
    },
    {
      "id": 17,
      "question": "Define $\\[P(x) =(x-1^2)(x-2^2)\\cdots(x-100^2).\\]$ How many integers $n$ are there such that $P(n)\\leq 0$?",
      "options": [
        "$4900 \\qquad$",
        "$4950\\qquad$",
        "$5000\\qquad$",
        "$5050 \\qquad$",
        "$5100$"
      ],
      "correctAnswer": "E",
      "solution": [
        "We perform casework on $P(n)\\leq0:$\n\nTogether, the answer is $100+5000=\\boxed{\\textbf{(E) } 5100}.$\n\n~PCChess (Solution)\n\n~MRENTHUSIASM (Reformatting)",
        "Notice that $P(x)$ is nonpositive when $x$ is between $100^2$ and $99^2, 98^2$ and $97^2, \\cdots$, $2^2$ and $1^2$ (inclusive), because there are an odd number of negatives, which means that the number of values equals $\\[((100+99)(100-99) + 1) + ((98+97)(98-97)+1) + \\cdots + ((2+1)(2-1)+1).\\]$ This reduces to $\\[200 + 196 + 192 + \\cdots + 4 = 4(1+2+\\cdots + 50) = 4 \\cdot\\frac{50 \\cdot 51}{2} = \\boxed{\\textbf{(E) } 5100}.\\]$ ~Zeric\n\n~jesselan (Minor Edits)",
        "We know that $P(x)$ is a $100$-degree function with a positive leading coefficient. That is, $P(x)=x^{100}+ax^{99}+bx^{98}+...+\\text{(constant)}$.\n\nSince the degree of $P(x)$ is even, its end behaviors match. And since the leading coefficient is positive, we know that both ends approach $\\infty$ as $x$ goes in either direction, from which $\\[\\lim_{x\\to-\\infty} P(x)=\\lim_{x\\to\\infty} P(x)=\\infty.\\]$ So the first time $P(x)$ is going to be negative is when it intersects the $x$-axis at an $x$-intercept and it's going to dip below. This happens at $1^2$, which is the smallest intercept.\n\nHowever, when it hits the next intercept, it's going to go back up again into positive territory, we know this happens at $2^2$. And when it hits $3^2$, it's going to dip back into negative territory. Clearly, this is going to continue to snake around the intercepts until $100^2$.\n\nTo get the amount of integers below and/or on the $x$-axis, we simply need to count the integers. For example, the amount of integers in between the $[1^2,2^2]$ interval we got earlier, we subtract and add one. $(2^2-1^2+1)=4$ integers, so there are four integers in this interval that produce a negative result.\n\nDoing this with all of the other intervals, we have $\\[(2^2-1^2+1)+(4^2-3^2+1)+\\cdots+(100^2-99^2+1)=\\boxed{\\textbf{(E) } 5100}\\]$ from Solution 2's result.\n\n~quacker88",
        "We know $P(x) \\leq 0$ when an odd number of its factors are positive and negative. For example, to make the first factor positive, $x \\in [1^2, 2^2]$. then there will be a even number of positive factors. We would do $2^2 - 1^2 + 1 (\\text{inclusive})$ to find all integers that work. In short we can generalize too: $\\begin{align*} x^2 - (x-1)^2 + 1 &= 2x \\\\ x^2 - (x^2 - 2x + 1) + 1 &= 2x \\\\ x^2 - x^2 + 2x - 1 + 1 &= 2x. \\\\ \\end{align*}$ But remember this only works when $x \\in \\{2, 4, 6, 8 \\cdots 98, 100\\}$ because only then will there be a odd amount of positive and negative factors. So we can set $x = 2k$, for $k \\in \\{1, 2, 3, 4, \\cdots 49, 50\\}$ Now we only have to solve: $\\[\\sum_{k=1}^{50}2(2k) = 2\\sum_{k = 1}^{50}2k = 4\\sum_{k = 1}^{50}k = 4 \\cdot \\dfrac{(50)(51)}{2} = 2 \\cdot (50)(51) = \\boxed{\\textbf{(E) } 5100}.\\]$ ~Wiselion",
        "When looking at the question, it should immediately jump out that we need an odd number of terms to be odd. this means that we need to find the number of n such that $(2k+1)^2 \\leq n \\leq (2k+2)^2$ for some $0 \\leq k \\leq 49$ such that $k\\in \\mathbb{Z}/\\mathbb{Z}^-$ $\\newline$ The number of integers $n$ s.t. $n\\in [a,b]$ is $b-a+1$ We want $n\\in [(2k+1)^2,(2k+2)^2]$ $\\newline$ Thus, it is obvious we want to find $\\sum_{k=0}^{49}{((2k+2)^2-(2k+1)^2+1)}$. $\\newline$ If we do some investigation on the term inside the summation, we find that: $\\newline$ $(2k+2)^2-(2k+1)^2+1 = (4k^2+8k+4)-(4k^2+4k+1)+1 = 4k+4$ $\\newline$ thus: $\\sum_{k=0}^{49}{((2k+2)^2-(2k+1)^2+1)} = \\sum_{k=0}^{49}{4(k+1)} = 4\\sum_{k=0}^{49}{(k+1)} = 4\\sum_{k=1}^{50}{k}$ $\\newline$ The reason the last step works is that adding 1 inside the summation effectively shifts the bounds up by 1, as it turns k=0 into k=1, and so on. $\\newline$ $4\\sum_{k=1}^{50}{k} = 4\\frac{(50)(51)}{2} = 2(50)(51) = 100(51) = \\boxed{\\textbf{(E) } 5100}$ $\\newline$ ~stereotypicalmathnerd $\\newline$ Feel free to make changes/LaTeX optimizations",
        "Visualization that makes it easier to see solutions:\n\n![Diagram](/data/images/ade5186f3f93a2cb1541c92c45de70cc.png)",
        "https://www.youtube.com/watch?v=1SFRXR6LbUs&t=4s\n\n~Tips From James Wang",
        "https://youtu.be/hqdnNqds2mw?si=dHhmbLrh3pWWIG9T\n\n~ Pi Academy",
        "https://youtu.be/3dfbWzOfJAI?t=4026\n\n~ pi_is_3.14\n\nhttps://youtu.be/zl5rtHnk0rY\n\n~Education, The Study of Everything\n\nhttps://youtu.be/RKlG6oZq9so\n\n~IceMatrix\n\nhttps://www.youtube.com/watch?v=YDMMhSguq0w&list=PLeFyQ1uCoINM4D5Lgi5Y3KkfvQuYuIbj\n\n-Walt S.\n\nhttps://youtu.be/chDmeTQBxq8\n\n~savannahsolver\n\nhttps://youtu.be/R220vbM_my8?t=463\n\n~ amritvignesh0719062.0"
      ],
      "difficulty": "medium",
      "category": "number-theory"
    },
    {
      "id": 18,
      "question": "Let $(a,b,c,d)$ be an ordered quadruple of not necessarily distinct integers, each one of them in the set $\\{0,1,2,3\\}.$ For how many such quadruples is it true that $a\\cdot d-b\\cdot c$ is odd? (For example, $(0,3,1,1)$ is one such quadruple, because $0\\cdot 1-3\\cdot 1 = -3$ is odd.)",
      "options": [
        "$48 \\qquad$",
        "$64 \\qquad$",
        "$96 \\qquad$",
        "$128 \\qquad$",
        "$192$"
      ],
      "correctAnswer": "C",
      "solution": [
        "In order for $a\\cdot d-b\\cdot c$ to be odd, consider parity. We must have (even)-(odd) or (odd)-(even). There are $2(2 + 4) = 12$ ways to pick numbers to obtain an even product. There are $2 \\cdot 2 = 4$ ways to obtain an odd product. Therefore, the total amount of ways to make $a\\cdot d-b\\cdot c$ odd is $2 \\cdot (12 \\cdot 4) = \\boxed{\\bold{(C)}\\ 96}$.\n\n~Midnight",
        "Consider parity. We need exactly one term to be odd, one term to be even. Because of symmetry, we can set $ad$ to be odd and $bc$ to be even, then multiply by $2.$ If $ad$ is odd, both $a$ and $d$ must be odd, therefore there are $2\\cdot2=4$ possibilities for $ad.$ Consider $bc.$ Let us say that $b$ is even. Then there are $2\\cdot4=8$ possibilities for $bc.$ However, $b$ can be odd, in which case we have $2\\cdot2=4$ more possibilities for $bc.$ Thus there are $12$ ways for us to choose $bc$ and $4$ ways for us to choose $ad.$ Therefore, also considering symmetry, we have $2 \\cdot 4 \\cdot 12= \\boxed{ \\text{(C) } 96}$ total values of $ad-bc.$\n\n~lpieleanu (Reformatting and Minor Edits)",
        "There are 4 ways to choose any number independently and 2 ways to choose any odd number independently. To get an even products, we count: $\\text{P(any number)} \\cdot \\text{P(any number)}-\\text{P(odd)}\\cdot\\text{P(odd)}$, which is $4 \\cdot 4 - 2 \\cdot 2=12$. The number of ways to get an odd product can be counted like so: $\\text{P(odd)}\\cdot\\text{P(odd)}$, which is $2 \\cdot 2$, or $4$. So, for one product to be odd the other to be even: $2 \\cdot 4 \\cdot 12= \\boxed{ \\text{(C) } 96}$ (order matters).\n\n~Anonymous and Arctic_Bunny",
        "We use complementary counting: If the difference is even, then we can subtract those cases. There are a total of $4^4=256$ cases.\n\nFor an even difference, we have (even)-(even) or (odd-odd).\n\nFrom Solution 3:\n\n\"There are 4 ways to choose any number independently and 2 ways to choose any odd number independently. even products:(number)*(number)-(odd)*(odd): $4 \\cdot 4 - 2 \\cdot 2=12$. odd products: (odd)*(odd): $2 \\cdot 2 =4$.\"\n\nWith this, we easily calculate $256-12^2-4^2=\\textbf{(C)96}$.\n\n~kevinmathz",
        "As in solution 1, we must have (even)-(odd) or (odd)-(even). We see that there are two cases, if $ad$ is even and $bc$ is odd and if $ad$ is odd and $bc$ is even. Because of symmetry, we can multiply by two for when $ad$ is odd and $bc$ is even. Let $e$ denote an even number and let $o$ denote an odd number.\n\nIf $ad$ is even and $bc$ is odd, there are three cases:\n\n$\\[(e,o,o,e)\\]$ $\\[(e,o,o,o)\\]$ $\\[(o,o,o,e)\\]$\n\nFor each of these cases, there are $2^4$ ways to choose from the set $(0,1,2,3)$ as there are 2 even's and 2 odd's; because there are three cases, we multiply this by 3. Also, because of there are 2 cases ( $ad$ is even and $bc$ is odd and if $ad$ is odd and $bc$ is even), we multiply this by 2. This gives us:\n\n$2^4 \\cdot 3 \\cdot 2= \\textbf{(C)96}$",
        "For parity reasons, if $ad - bc$ is to be odd, we must have $ad$ odd and $bc$ even or $ad$ even and $bc$ odd. By symmetry, these cases are identical, so we consider the first one and multiply by two at the end. For $ad$ to be odd, we must have both $a$ and $d$ odd, and there are $2 \\cdot 2$ ways to do so. To count the cases where $bc$ is odd, we use PIE. there are $2 \\cdot 4 = 8$ ways for $b$ to be odd and $4 \\cdot 2 = 8$ ways for $c$ to be odd, and there are $2 \\cdot 2 = 4$ ways for both to be odd. Thus, there are $8 + 8 - 4 = 12$ ways for $bc$ to be even. Multiplying out, there are $2 \\cdot 4 \\cdot 12$ ways to have $ad - bc$ odd for a total of $\\boxed{\\textbf{(C)}~96}$.\n\n~ cxsmi",
        "Education, The Study of Everything\n\nhttps://youtu.be/D34FxUr9TvI\n\nhttps://youtu.be/RKlG6oZq9so\n\n~IceMatrix\n\nhttps://youtu.be/3bRjcrkd5mQ?t=1\n\n~ pi_is_3.14"
      ],
      "difficulty": "medium",
      "category": "number-theory"
    },
    {
      "id": 19,
      "question": "As shown in the figure below, a regular dodecahedron (the polyhedron consisting of $12$ congruent regular pentagonal faces) floats in space with two horizontal faces. Note that there is a ring of five slanted faces adjacent to the top face, and a ring of five slanted faces adjacent to the bottom face. How many ways are there to move from the top face to the bottom face via a sequence of adjacent faces so that each face is visited at most once and moves are not permitted from the bottom ring to the top ring? ![Diagram](/data/images/1b0fc5a5d5498e84a2cbba3ec2a24967.png)",
      "options": [
        "$125 \\qquad$",
        "$250 \\qquad$",
        "$405 \\qquad$",
        "$640 \\qquad$",
        "$810$"
      ],
      "correctAnswer": "E",
      "solution": [
        "Since we start at the top face and end at the bottom face without moving from the lower ring to the upper ring or revisiting a face, our journey must consist of the top face, a series of faces in the upper ring, a series of faces in the lower ring, and the bottom face, in that order.\n\nWe have $5$ choices for which face we visit first on the top ring. From there, we have $9$ choices for how far around the top ring we go before moving down: $1,2,3,$ or $4$ faces around clockwise, $1,2,3,$ or $4$ faces around counterclockwise, or immediately going down to the lower ring without visiting any other faces in the upper ring.\n\nWe then have $2$ choices for which lower ring face to visit first (since every upper-ring face is adjacent to exactly $2$ lower-ring faces) and then once again $9$ choices for how to travel around the lower ring. We then proceed to the bottom face, completing the trip.\n\nMultiplying together all the numbers of choices we have, we get $5 \\cdot 9 \\cdot 2 \\cdot 9 = \\boxed{\\textbf{(E) } 810}$.",
        "From the top, we can go down in five different ways to the five faces underneath the first face. From here we can go down or go to the adjacent faces. From the face you went down from the top face, you can either go clockwise or counterclockwise $1$, $2$, $3$,or $4$ times, or you can go straight down. Then from there, you go down into the lower row, which you have two choices, left or right down. From here we have $5 \\cdot 9 \\cdot 2$ ways multiplied by the ways you can move from the bottom ring to the bottom face, but we don't need to know that since from here we can see that $\\boxed{(E)}$ is the only answer choice divisible by $90$, so our answer is $\\boxed{(E)}$. ~Terribleteeth",
        "There are five ways to get to the top ring. Casework:\n\nCase 1: directly go to bottom ring For each of the 5 initial top ring faces, we have two ways of directly going to the bottom ring, as each face on the top is adjacent to two faces on the bottom. There are $5 \\cdot 2 = 10$ paths here.\n\nCase 2: traversing sideways After entering the top ring, we can also choose to travel sideways along the top ring before going to the bottom ring. For each of the 5 initial top ring faces, we can choose 2 directions to go (clockwise or counterclockwise). Once we choose a direction, we can go 1, 2, 3, or 4 faces in that direction. Notice we cannot travel 5 faces because then we would land on the original top ring face, but the problem specifies that we can only travel each face once. Once again, top ring faces are each adjacent to two bottom ring faces, so after traversing sideways we can choose 2 paths to exit. There are $5 \\cdot 2 \\cdot 4 \\cdot 2 = 80$ paths here.\n\nAdding the two cases together, there are 90 ways to get to the bottom ring from the top.\n\nNext, from the bottom ring to the bottom we do casework again:\n\nCase 1: directly go to the bottom For each of the 90 ways we can get to faces on the bottom ring, there is only 1 way to get to the bottom. So there are 90 ways here.\n\nCase 2: traversing sideways For each of the 90 ways we can get to faces on the bottom ring, there are once again 2 ways to choose the direction and 4 ways to choose the amount of faces traveled. However, after traveling the faces there is only 1 way to go to the bottom face. There are $90 \\cdot 2 \\cdot 4 \\cdot 1 = 720$ paths here.\n\nAdding together the cases, there are 810 paths, or answer choice E. ~JH. L",
        "Like Solution 3, we can use casework, but in a different way. We can split the caseworks into the amount of moves we spend on each row (top and bottom, where both rows have 5 faces).\n\nCase 1: 1 move on the top row; There are 5 ways to make 1 move on the top row from the starting point (just moving on each of the five faces). Now we want to look at how many ways we can move towards the bottom. Notice how we have two faces on the bottom row that are adjacent to each of the top faces. If we spend one move on the bottom, there are 2 ways. If we spend two moves on the bottom, there are 4 ways (since order matters, we can flip the direction of these moves). If we spend three moves on the bottom, there are also 4 ways (similar reasoning). If we spend four moves on the bottom, there are 4 ways. And if we spend five moves on the bottom, there are again, 4 ways. In total there are $2 + 4 + 4 + 4 + 4 = 18$ ways to move from the bottom after the top moves are chosen. And since there are 5 ways to make 1 move on the top row, there are $5 \\cdot 18 = 90$ ways.\n\nCase 2: 2 moves on the top row; From just counting, we can see that there are five ways to move once on the top, and after that, two options for the second move (either left or right), so there are $5 \\cdot 2 = 10$ ways. And from using what we obtained in Case 1, there are $10 \\cdot 18 = 180$ ways for this case.\n\nCase 3: three moves on the top row; There are, again, 10 ways to do this. And so, there are $10 \\cdot 18 = 180$ ways for this case to happen.\n\nNow, we can see that there will be 10 ways for the remaining cases of the first move for the top row (because 5 ways to choose the first, and then you can go either left or right, so $5 \\cdot 2 = 10$ ). So for Case 4 and Case 5, there will both also be $10 \\cdot 18 = 180$ ways.\n\nFinally, adding all these cases up, we obtain $90 + 180 + 180 + 180 + 180 = 810$, or $\\boxed{(E)}$ ~Misclicked",
        "",
        "https://youtu.be/HhdpuJt78Hg?t=739\n\n~ pi_is_3.14",
        "Education, The Study of Everything\n\nhttps://youtu.be/av1hZOm5ELU",
        "https://www.youtube.com/watch?v=Y0gezpr8Mrk&list=PLLCzevlMcsWNcTZEaxHe8VaccrhubDOlQ&index=1 ~ MathEx"
      ],
      "difficulty": "medium",
      "category": "combinatorics"
    },
    {
      "id": 20,
      "question": "Quadrilateral $ABCD$ satisfies $\\angle ABC = \\angle ACD = 90^{\\circ}, AC=20,$ and $CD=30.$ Diagonals $\\overline{AC}$ and $\\overline{BD}$ intersect at point $E,$ and $AE=5.$ What is the area of quadrilateral $ABCD?$",
      "options": [
        "$330 \\qquad$",
        "$340 \\qquad$",
        "$350 \\qquad$",
        "$360 \\qquad$",
        "$370$"
      ],
      "correctAnswer": "D",
      "solution": [
        "![Diagram](/data/images/97feeff3b24e92b8347c3791120843e5.png)\n\nIt's crucial to draw a good diagram for this one. Since $AC=20$ and $CD=30$, we get $[ACD]=300$. Now we need to find $[ABC]$ to get the area of the whole quadrilateral. Drop an altitude from $B$ to $AC$ and call the point of intersection $F$. Let $FE=x$. Since $AE=5$, then $AF=5-x$.\n\nBy dropping this altitude, we can also see two similar triangles, $\\triangle BFE \\sim \\triangle DCE$. Since $EC$ is $20-5=15$, and $DC=30$, we get that $BF=2x$.\n\nNow, if we redraw another diagram just of $ABC$, we get that $(2x)^2=(5-x)(15+x)$ because of the altitude geometric mean theorem which states that in any right triangle, the altitude squared is equal to the product of the two lengths that it divides the base into.\n\nExpanding, simplifying, and dividing by the GCF, we get $x^2+2x-15=0$. This factors to $(x+5)(x-3)$, which has roots of $x=-5, 3$. Since lengths cannot be negative, $x=3$. Since $x=3$, that means the altitude $BF=2\\cdot3=6$, or $[ABC]=60$. Thus $[ABCD]=[ACD]+[ABC]=300+60=\\boxed {\\textbf{(D) }360}$\n\n~ Solution by Ultraman ~ Diagram by ciceronii",
        "![Diagram](/data/images/df4bb6f1e16271fa9e89b2b31c13a4bd.png) Let the points be $A(-10,0)$, $\\:B(x,y)$, $\\:C(10,0)$, $\\:D(10,30)$,and $\\:E(-5,0)$, respectively. Since $B$ lies on line $DE$, we know that $y=2x+10$. Furthermore, since $\\angle{ABC}=90^\\circ$, $B$ lies on the circle with diameter $AC$, so $x^2+y^2=100$. Solving for $x$ and $y$ with these equations, we get the solutions $(0,10)$ and $(-8,-6)$. We immediately discard the $(0,10)$ solution as $y$ should be negative. Thus, we conclude that $[ABCD]=[ACD]+[ABC]=\\frac{20\\cdot30}{2}+\\frac{20\\cdot6}{2}=\\boxed{\\textbf{(D)}\\:360}$.",
        "![Diagram](/data/images/2cbce9d3a2ea56c18dd4f13fc5574e90.png)\n\nDraw the circumcircle of $\\triangle ABC.$ Let $BE = x$, and let $F$ be the point where the circumcircle of $\\triangle ABC$ meets $BD.$ By the Pythagorean Theorem, $ED = \\sqrt{1125},$ so $\\frac{75}{x} + DF = \\sqrt{1125} \\implies DF = \\sqrt{1125} - \\frac{75}{x}.$ ( $EF = \\frac{75}{x}$ by the Intersecting Chords Theorem.) From Power of A Point we have $CD^2 = 30^2 = FD \\cdot BD = FD^2 + FD \\cdot BF =$ $(\\sqrt{1125} - \\frac{75}{x})^2 + (\\sqrt{1125} - \\frac{75}{x})(x + \\frac{75}{x}) =$ $(\\sqrt{1125} - \\frac{75}{x})(\\sqrt{1125} + x).$ Solving we get $x = 3\\sqrt{5}.$ $\\sin\\angle CED = \\frac{30}{15\\sqrt{5}}.$ The area of a quadrilateral is half the product of its diagonals times the sine of the angle between them, so the answer is $18\\sqrt{5} \\cdot 20 \\cdot \\frac{30}{15\\sqrt{5}} \\cdot \\frac{1}{2} = 180 \\cdot 2 = \\boxed{360}.$\n\n~ grogg007",
        "Let $\\angle C = \\angle{ACB}$ and $\\angle{B} = \\angle{CBE}.$ Using Law of Sines on $\\triangle{BCE}$ we get $\\[\\dfrac{BE}{\\sin{C}} = \\dfrac{CE}{\\sin{B}} = \\dfrac{15}{\\sin{B}}\\]$ and LoS on $\\triangle{ABE}$ yields $\\[\\dfrac{BE}{\\sin{(90 - C)}} = \\dfrac{5}{\\sin{(90 - B)}} = \\dfrac{BE}{\\cos{C}} = \\dfrac{5}{\\cos{B}}.\\]$ Divide the two to get $\\tan{B} = 3 \\tan{C}.$ Now, $\\[\\tan{\\angle{CED}} = 2 = \\tan{\\angle{B} + \\angle{C}} = \\dfrac{4 \\tan{C}}{1 - 3\\tan^2{C}}\\]$ and solve the quadratic, taking the positive solution (C is acute) to get $\\tan{C} = \\frac{1}{3}.$ So if $AB = a,$ then $BC = 3a$ and $[ABC] = \\frac{3a^2}{2}.$ By Pythagorean Theorem, $10a^2 = 400 \\iff \\frac{3a^2}{2} = 60$ and the answer is $300 + 60 \\iff \\boxed{\\textbf{(D)}}.$\n\n(This solution is incomplete, can someone complete it please) Edit by kc5170\n\nWe could use the famous m-n rule in trigonometry in $\\triangle ABC$ with Point $E$ [Unable to write it here.Could anybody write the expression] . We will find that $\\overrightarrow{BD}$ is an angle bisector of $\\triangle ABC$ (because we will get $\\tan(x) = 1$ ).      Therefore by converse of angle bisector theorem $AB:BC = 1:3$. By using Pythagorean theorem, we have values of $AB$ and $AC$.  Computing $AB \\cdot AC = 120$. Adding the areas of $ABC$ and $ACD$, hence the answer is $\\boxed{\\textbf{(D)}\\:360}$.\n\n~ Math-Amaze, Catoptrics",
        "![Diagram](/data/images/1a91c77ee25c6b12fa96dea2cde20760.png)\n\nDenote $EB$ as $x$. By the Law of Cosines: $\\[AB^2 = 25 + x^2 - 10x\\cos(\\angle DEC)\\]$ $\\[BC^2 = 225 + x^2 + 30x\\cos(\\angle DEC)\\]$\n\nAdding these up yields: $\\[400 = 250 + 2x^2 + 20x\\cos(\\angle DEC) \\Longrightarrow x^2 + \\frac{10x}{\\sqrt{5}} - 75 = 0\\]$ By the quadratic formula, $x = 3\\sqrt5$.\n\nObserve: $\\[[AEB] + [BEC] = \\frac{1}{2}(x)(5)\\sin(\\angle DEC) + \\frac{1}{2}(x)(15)\\sin(180-\\angle DEC) = (3)(20) = 60\\]$.\n\nThus the desired area is $\\frac{1}{2}(30)(20) + 60 = \\boxed{\\textbf{(D) } 360}$\n\n~qwertysri987",
        "Let $C = (0, 0)$ and $D = (0, 30)$. Then $E = (-15, 0), A = (-20, 0),$ and $B$ lies on the line $y=2x+30.$ So the coordinates of $B$ are $\\[(x, 2x+30).\\]$\n\nWe can make this a vector problem. $\\overrightarrow{\\mathbf{B}} = \\begin{pmatrix} x \\\\ 2x+30 \\end{pmatrix}.$ We notice that point $B$ forms a right angle, meaning vectors $\\overrightarrow{\\mathbf{BC}}$ and $\\overrightarrow{\\mathbf{BA}}$ are orthogonal, and their dot-product is $0$.\n\nWe determine $\\overrightarrow{\\mathbf{BC}}$ and $\\overrightarrow{\\mathbf{BA}}$ to be $\\begin{pmatrix} -x \\\\ -2x-30 \\end{pmatrix}$ and $\\begin{pmatrix} -20-x \\\\ -2x-30 \\end{pmatrix}$, respectively. (To get this, we use the fact that $\\overrightarrow{\\mathbf{BC}} = \\overrightarrow{\\mathbf{C}}-\\overrightarrow{\\mathbf{B}}$ and similarly, $\\overrightarrow{\\mathbf{BA}} = \\overrightarrow{\\mathbf{A}} - \\overrightarrow{\\mathbf{B}}.$ )\n\nEquating the cross-product to $0$gets us the quadratic$-x(-20-x)+(-2x-30)(-2x-30)=0.$ The solutions are $x=-18, -10.$ Since $B$ clearly has a more negative x-coordinate than $E$, we take $x=-18$. So $B = (-18, -6).$\n\nFrom here, there are multiple ways to get the area of $\\Delta{ABC}$ to be $60$, and since the area of $\\Delta{ACD}$ is $300$, we get our final answer to be $\\[60 + 300 = \\boxed{\\text{(D) } 360}.\\]$-PureSwag",
        "![Diagram](/data/images/3c3c4dc49f4a5ea29025c7c5b4aa3a9b.png)\n\nLet $F$ be the midpoint of $AC$, and draw $FG // CD$ where $G$ is on $BD$. We have $EF=5,FC=10$.\n\n$\\Delta EFG \\sim \\Delta ECD \\implies FG=10=FA=FC$. Therefore $ABCG$ is a cyclic quadrilateral.\n\nNotice that $\\angle EFG=90^\\circ, EG=\\sqrt{5^2+10^2}=5\\sqrt{5} \\implies BE=\\frac{AE\\cdot EC}{EG}=\\frac{5\\cdot 15}{5\\sqrt{5}}=3\\sqrt{5}$ via Power of a Point.\n\nThe altitude from $B$ to $AC$ is then equal to $GF\\cdot \\frac{BE}{GE}=10\\cdot \\frac{3\\sqrt 5}{5 \\sqrt 5}=6$.\n\nFinally, the total area of $ABCD$ is equal to $\\frac 12 \\cdot 20 \\left(30+6 \\right) =\\boxed{\\text{(D) } 360}.$\n\n~asops",
        "![Diagram](/data/images/2696276c421037e6e07251480badbf03.png)\n\nLet $AB = x$, $BC = y$\n\nLooking at the diagram we have $x^2 + y^2 = 20^2$, $DE = \\sqrt{30^2+15^2} = 15\\sqrt{5}$, $[ACD] = \\frac{1}{2} \\cdot 20 \\cdot 30 = 300$\n\nBecause $\\triangle CEF \\sim \\triangle CAB$, $EF = AB \\cdot \\frac{CE}{CA} = x \\cdot \\frac{15}{20} = \\frac{3x}{4}$\n\n$BF = BC - CF = BC - BC \\cdot \\frac{CE}{CA} = \\frac{1}{4} \\cdot BC = \\frac{y}{4}$\n\n$BE = \\sqrt{ \\left( \\frac{3x}{4} \\right) ^2 + \\left( \\frac{y}{4} \\right) ^2 } = \\frac{ \\sqrt{9x^2 + y^2} }{4}$, substituting $x^2 + y^2 = 400$,  we get $BE = \\frac{ \\sqrt{8x^2 + 400} }{4} = \\frac{ \\sqrt{2x^2 + 100} }{2}$\n\n$[ABC] = \\frac{1}{2} \\cdot x \\cdot y$\n\nBecause $\\triangle ABC$ and $\\triangle ACD$ share the same base, $\\frac{[ABC]}{[ACD]} = \\frac{BE}{DE}$\n\n$[ABC] = [ACD] \\cdot \\frac{BE}{DE} = 300 \\cdot \\frac{ \\frac{ \\sqrt{2x^2 + 100} } {2} }{ 15 \\sqrt{5} }$\n\n$\\frac{1}{2} \\cdot x \\cdot y = 20 \\cdot \\frac{ \\frac{ \\sqrt{2x^2 + 100} } {2} }{ \\sqrt{5} }$\n\n$xy = 4 \\sqrt{10x^2 + 500}$\n\nBy $x^2 + y^2 = 400$, $y = \\sqrt{400 - x^2}$. So, $x \\cdot  \\sqrt{400 - x^2} = 4 \\sqrt{10x^2 + 500}$\n\n$x^2 (400 - x^2) = 16 (10x^2 + 500)$\n\nLet $x^2 = a$, $a (400 - a) = 16 (10a + 500)$, $400a - a^2 = 160a + 8000$, $a^2 - 240a + 8000 = 0$, $(a-200)(a-40) = 0$\n\nBecause $x < 20$, $a$ can only equal 40. $a = 40$, $x = 2 \\sqrt{10}$, $y = 6 \\sqrt{10}$\n\n$[ABC] = \\frac{1}{2} \\cdot 2 \\sqrt{10} \\cdot 6 \\sqrt{10} = 60$\n\n$[ABCD] = [ABC] + [ACD] = 60 + 300 = \\boxed{\\text{(D) } 360}$\n\n~ isabelchen",
        "Drop perpendiculars $\\overline{AF}$ and $\\overline{CG}$ to $\\overline{BD}.$ Notice that since $\\angle AEF=\\angle CEG$ (since they are vertical angles) and $\\angle AFE=\\angle CGE=90^\\circ,$ triangles $AEF$ and $CEG$ are similar. Therefore, we have\n\n$\\[x/EF=CE/AE=15/5=3,\\]$\n\nwhere $EG=x.$ Therefore, $EF=x/3.$\n\nAdditionally, angle chasing shows that triangles $CEG$ and $DCG$ are also similar. This gives $CG/x=DC/CE=30/15=2,$ so $CG=2x.$ Thus, applying the Pythagorean Theorem to triangle $CEG$ gives\n\n$\\[x^2+(2x)^2=15^2,\\]$\n\nso $EG=x=3\\sqrt 5.$ Our pairs of similar triangles then allow us to fill in the following lengths (in this order):\n\n$\\[EF=x/3=\\sqrt 5, CG=2x=6\\sqrt 5, AF=CG/3=2\\sqrt 5, DG=2\\cdot CG=12\\sqrt 5.\\]$\n\nNow, let $BF=y.$ Angle chasing shows that triangle $ABF$ and $BCG$ are similar, so $BG/AF=CG/BF.$ Plugging in known lengths gives\n\n$\\[\\dfrac{y+4\\sqrt 5}{2\\sqrt 5}=\\dfrac{6\\sqrt 5}{y}.\\]$\n\nThis gives $y=2\\sqrt 5.$ Now we know all the lengths that make up $BD,$ which allows us to find\n\n$\\[BD=2\\sqrt 5+\\sqrt 5+3\\sqrt 5+12\\sqrt 5=18\\sqrt 5.\\]$\n\nTherefore,\n\n$\\begin{align*} [ABCD] &= [ABD]+[CBD] \\\\ &= (BD)(AF)/2+(BD)(CG)/2 \\\\ &= (18\\sqrt 5)(2\\sqrt 5)/2+(18\\sqrt 5)(6\\sqrt 5)/2 \\\\ &= \\boxed{\\text{(D) } 360}. \\end{align*}$--vaporwave",
        "![Diagram](/data/images/798ac83b5235dfc31438333929c0864e.png)\n\nset $\\[\\angle ACB = \\theta , C= \\cos(\\theta), S = \\sin(\\theta)\\]$\n\n$\\[\\dfrac{E_y}{E_x} = \\dfrac{30C}  { 20C+30S}  =  \\dfrac{15S} {20C-15C}\\]$\n\n$\\[2SC = \\dfrac35\\]$\n\n$\\begin{align*} [ABCD] &= [ABD]+[CBD] \\\\ &= \\dfrac12\\cdot 20C\\cdot 30C  + \\dfrac12 \\cdot 20S (20C+30S) \\\\ &= 100\\cdot   2SC + 300 \\\\ &= \\boxed{\\text{(D) } 360}. \\end{align*}$\n\n~ luckuso",
        "https://youtu.be/0IN2X0S_PHM?si=_oYbjRpfrZRaqrPk",
        "https://youtu.be/5lb8kk1qbaA",
        "https://www.youtube.com/watch?v=hIdNde2Vln4",
        "https://www.youtube.com/watch?v=sHrjx968ZaM",
        "https://youtu.be/RKlG6oZq9so?t=655",
        "https://youtu.be/R220vbM_my8?t=658 (amritvignesh0719062.0)",
        "https://youtu.be/hDsoyvFWYxc?t=1224 ~ pi_is_3.14"
      ],
      "difficulty": "hard",
      "category": "geometry"
    },
    {
      "id": 21,
      "question": "There exists a unique strictly increasing sequence of nonnegative integers $a_1 < a_2 < … < a_k$ such that $\\[\\frac{2^{289}+1}{2^{17}+1} = 2^{a_1} + 2^{a_2} + … + 2^{a_k}.\\]$ What is $k?$",
      "options": [
        "$117 \\qquad$",
        "$136 \\qquad$",
        "$137 \\qquad$",
        "$273 \\qquad$",
        "$306$"
      ],
      "correctAnswer": "C",
      "solution": [
        "First, substitute $2^{17}$ with $x$.  Then, the given equation becomes $\\frac{x^{17}+1}{x+1}=x^{16}-x^{15}+x^{14}...-x^1+x^0$ by sum of powers factorization. Now consider only $x^{16}-x^{15}$. This equals $x^{15}(x-1)=x^{15} \\cdot (2^{17}-1)$. Note that $2^{17}-1$ equals $2^{16}+2^{15}+...+1$, by difference of powers factorization (or by considering the expansion of $2^{17}=2^{16}+2^{15}+...+2^{2}+2$ ). Thus, we can see that $x^{16}-x^{15}$ forms the sum of 17 different powers of 2.  Applying the same method to each of $x^{14}-x^{13}$, $x^{12}-x^{11}$, ... , $x^{2}-x^{1}$, we can see that each of the pairs forms the sum of 17 different powers of 2. This gives us $17 \\cdot 8=136$. But we must count also the $x^0$ term.  Thus, Our answer is $136+1=\\boxed{\\textbf{(C) } 137}$.\n\n~seanyoon777",
        "Multiply both sides by $2^{17}+1$ to get $\\[2^{289}+1=2^{a_1} + 2^{a_2} + … + 2^{a_k} + 2^{a_1+17} + 2^{a_2+17} + … + 2^{a_k+17}.\\]$\n\nNotice that $a_1 = 0$, since there is a $1$ on the LHS. However, now we have an extra term of $2^{18}$ on the right from $2^{a_1+17}$. To cancel it, we let $a_2 = 18$. The two $2^{18}$ 's now combine into a term of $2^{19}$, so we let $a_3 = 19$. And so on, until we get to $a_{18} = 34$. Now everything we don't want telescopes into $2^{35}$. We already have that term since we let $a_2 = 18 \\implies a_2+17 = 35$. Everything from now on will automatically telescope to $2^{52}$. So we let $a_{19}$ be $52$.\n\nAs you can see, we will have to add $17$ $a_n$ 's at a time, then \"wait\" for the sum to automatically telescope for the next $17$ numbers, etc, until we get to $2^{289}$. We only need to add $a_n$ 's between odd multiples of $17$ and even multiples. The largest even multiple of $17$ below $289$ is $17\\cdot16$, so we will have to add a total of $17\\cdot 8$ $a_n$ 's. However, we must not forget we let $a_1=0$ at the beginning, so our answer is $17\\cdot8+1 = \\boxed{\\textbf{(C) } 137}$.",
        "In order to shorten expressions, $\\#$ will represent $16$ consecutive $0$ s when expressing numbers. Think of the problem in binary. We have $\\frac{1\\#0\\#0\\#0\\#0\\#0\\#0\\#0\\#0\\#0\\#0\\#0\\#0\\#0\\#0\\#0\\#0\\#1_2}{1\\#1_2}$ Note that $(2^{17} + 1) (2^0 + 2^{34} + 2^{68} + \\cdots + 2^{272}) = 2^0(2^{17} + 1) + 2^{34}(2^{17} + 1) + 2^{68}(2^{17} + 1) + \\cdots 2^{272}(2^{17} + 1)$ $= 1\\#1\\#1\\#1\\#1\\#1\\#1\\#1\\#1\\#1\\#1\\#1\\#1\\#1\\#1\\#1\\#1\\#1_2$ and $(2^{17} + 1) (2^{17} + 2^{51} + 2^{85} + \\cdots + 2^{255}) = 2^{17}(2^{17} + 1) + 2^{51}(2^{17} + 1) + 2^{85}(2^{17} + 1) + \\cdots 2^{255}(2^{17} + 1)$ $= 1\\#1\\#1\\#1\\#1\\#1\\#1\\#1\\#1\\#1\\#1\\#1\\#1\\#1\\#1\\#1\\#0_2$ Since $\\phantom{=\\ } 1\\#1\\#1\\#1\\#1\\#1\\#1\\#1\\#1\\#1\\#1\\#1\\#1\\#1\\#1\\#1\\#1\\#1_2$ $-\\ \\phantom{1\\#} 1\\#1\\#1\\#1\\#1\\#1\\#1\\#1\\#1\\#1\\#1\\#1\\#1\\#1\\#1\\#1\\#0_2$ $= 1\\#0\\#0\\#0\\#0\\#0\\#0\\#0\\#0\\#0\\#0\\#0\\#0\\#0\\#0\\#0\\#0\\#1_2$ this means that $(2^{17} + 1) (2^0 + 2^{34} + 2^{68} + \\cdots + 2^{272}) - (2^{17} + 1) (2^{17} + 2^{51} + 2^{85} + \\cdots + 2^{255}) = 2^{289} + 1$ so $\\frac{2^{289}+1}{2^{17}+1} = (2^0 + 2^{34} + 2^{68} + \\cdots + 2^{272}) - (2^{17} + 2^{51} + 2^{85} + \\cdots + 2^{255})$ $= 2^0 + (2^{34} - 2^{17}) + (2^{68} - 2^{51}) + \\cdots + (2^{272} - 2^{255})$ Expressing each of the pairs of the form $2^{n + 17} - 2^n$ in binary, we have $\\phantom{=\\ } 1000000000000000000 \\cdots 0_2$ $-\\ \\phantom{10000000000000000} 10 \\cdots 0_2$ $= \\phantom{1} 111111111111111110 \\cdots 0_2$ or $2^{n + 17} - 2^n = 2^{n + 16} + 2^{n + 15} + 2^{n + 14} + \\cdots + 2^{n}$ This means that each pair has $17$ terms of the form $2^n$. Since there are $8$ of these pairs, there are a total of $8 \\cdot 17 = 136$ terms. Accounting for the $2^0$ term, which was not in the pair, we have a total of $136 + 1 = \\boxed{\\textbf{(C) } 137}$ terms. ~ emerald_block",
        "We can first look at smaller similar cases in binary. We can treat the initial problem as $\\frac{2^{n^2} + 1}{2^n + 1}$ where $n=17$. We can first look at the case $n=3$ or $\\frac{2^9 + 1}{2^3 + 1}$, which is equivalent to $\\frac{1000000001_2}{1001_2}$. If we do long division we find that this equals $111001_2$. Then we can also look at the case $n=5$ or $\\frac{2^25+1}{2^5+1}$. Doing long division on this in binary gives us a quotient that is a repeating pattern of 5 zeros and 5 ones. This pattern does hold, as $111\\text{... n ones ...}1_2 * 10\\text{... n-1 zeroes ...}01_2 = (10_2)^{2n} - 1$. Then at the end, there is a remainder of $10\\text{... n-1 zeroes ...}01_2$, which is the same as the denominator of the original fraction. Thus, for the original problem, there are $\\frac{17-1}{2}$ repeats of 17 zeroes and 17 ones, giving $8 * 17 + 1 = \\boxed{\\textbf{(C) }137}$. ~Hi2937",
        "",
        "https://youtu.be/f7FibYTNSm8\n\n~Education The Study of Everything",
        "https://artofproblemsolving.com/videos/amc/2020amc10a/511",
        "https://www.youtube.com/watch?v=FsCOVzhjUtE&list=PLLCzevlMcsWNcTZEaxHe8VaccrhubDOlQ&index=3 ~ MathEx",
        "https://youtu.be/Ozp3k2464u4\n\n~IceMatrix",
        "https://youtu.be/oDSLaQM6L1o\n\n~savannahsolver"
      ],
      "difficulty": "hard",
      "category": "number-theory"
    },
    {
      "id": 22,
      "question": "For how many positive integers $n \\le 1000$ is $\\[\\left\\lfloor \\dfrac{998}{n} \\right\\rfloor+\\left\\lfloor \\dfrac{999}{n} \\right\\rfloor+\\left\\lfloor \\dfrac{1000}{n}\\right \\rfloor\\]$ not divisible by $3$? (Recall that $\\lfloor x \\rfloor$ is the greatest integer less than or equal to $x$.)",
      "options": [
        "$22 \\qquad$",
        "$23 \\qquad$",
        "$24 \\qquad$",
        "$25 \\qquad$",
        "$26$"
      ],
      "correctAnswer": "A",
      "solution": [
        "If $n$ is a factor of $999$ (and $n \\neq 1$ ), then let $999 = an$ for some positive integer $a.$ Then we get $\\lfloor 998/n \\rfloor = a - 1$, $\\lfloor 999/n \\rfloor =a$, $\\lfloor 1000/n \\rfloor = a$. The sum is $3a - 1,$ which isn't a multiple of 3. If $n$ is a factor of $1000$ (and $n \\neq 1$ ), then let $1000 = an.$ Then we get $\\lfloor 998/n \\rfloor = a - 1$, $\\lfloor 999/n \\rfloor = a - 1$, and $\\lfloor 1000/n \\rfloor = a.$ The sum is $3a - 2,$ which also isn't a multiple of 3.\n\nWe find that the only way for the problem's condition to hold true is if $n$ is a factor of $999$ or $1000$ and $n \\neq 1$.\n\nWe counted $1$ twice. So the answer is $16 + 8 - 2 = \\boxed{22}.$\n\n~ grogg007",
        "Clearly, $n=1$ fails. Except for the special case of $n=1$, $\\[\\left\\lfloor \\frac{1000}{n} \\right\\rfloor - \\left\\lfloor \\frac{998}{n} \\right\\rfloor\\]$ equals either $0$ or $1$. If it equals $0$, this implies that $\\left\\lfloor \\frac{998}{n} \\right\\rfloor = \\left\\lfloor \\frac{999}{n} \\right\\rfloor = \\left\\lfloor \\frac{1000}{n} \\right\\rfloor$, so their sum is clearly a multiple of $3$, so this will always fail. If it equals $1$, the sum of the three floor terms is $3 \\left\\lfloor \\frac{999}{n} \\right\\rfloor \\pm 1$, so it is never a multiple of $3$. Thus, we are looking for all $n \\neq 1$ such that $\\[\\left\\lfloor \\frac{1000}{n} \\right\\rfloor - \\left\\lfloor \\frac{998}{n} \\right\\rfloor = 1.\\]$ This implies that either $\\[\\left\\lfloor \\frac{998}{n} \\right\\rfloor + 1 = \\left\\lfloor \\frac{999}{n} \\right\\rfloor,\\]$ or $\\[\\left\\lfloor \\frac{999}{n} \\right\\rfloor + 1 = \\left\\lfloor \\frac{1000}{n} \\right\\rfloor.\\]$\n\nLet's analyze the first equation of these two. This equation is equivalent to the statement that there is a positive integer $a$ such that $\\[\\frac{998}{n} < a \\leq \\frac{999}{n} \\implies 998 < an \\leq 999 \\implies an = 999 \\implies a = \\frac{999}{n} \\implies n | 999.*\\]$ Analogously, the second equation implies that $\\[n | 1000.\\]$ So our only $n$ that satisfy this condition are $n \\neq 1$ that divide $999$ or $1000$. Using the method to find the number of divisors of a number, we see that $999$ has $8$ divisors and $1000$ has $16$ divisors. Their only common factor is $1$, so there are $8+16-1 = 23$ positive integers that divide either $999$ or $1000$. Since the integer $1$ is a special case and does not count, we must subtract this from our $23$, so our final answer is $23-1 = \\boxed{\\textbf{(A) } 22}.$\n\n~ihatemath123",
        "Counting down $n$ from $1000$, $999$, $998$... we notice that $\\left\\lfloor \\dfrac{998}{n} \\right\\rfloor+\\left\\lfloor \\dfrac{999}{n} \\right\\rfloor+\\left\\lfloor \\dfrac{1000}{n}\\right \\rfloor$ is only not divisible by $3$ when n is a divisor of only $1000$ or $999 (1000, 999, 500, 333$...). Notice how the factors of $998: 1, 2, 499$, and $998$, do not work.\n\nThe prime factorization of $999$ is $3^3\\cdot37$, so $4\\cdot2=8$ factors in total.\n\nThe prime factorization of $1000$ is $2^3\\cdot5^3$, so $4\\cdot4=16$ factors in total.\n\nHowever, $1$ obviously does not work, so we have to subtract $2$ ( $1$ is counted twice) from the total. $8 + 16 - 2$ = $\\boxed{\\textbf{(A)}22}$.\n\n~BLOATED_BAGEL\n\n~Typo fixed by evanhliu2009",
        "First, we notice the following lemma:\n\n$\\textbf{Lemma}$: For $N, n \\in \\mathbb{N}$, $\\left\\lfloor \\frac{N}{n} \\right\\rfloor = \\left\\lfloor \\frac{N-1}{n} \\right\\rfloor + 1$ if $n \\mid N$; and $\\left\\lfloor \\frac{N}{n} \\right\\rfloor = \\left\\lfloor \\frac{N-1}{n} \\right\\rfloor$ if $n \\nmid N.$\n\n$\\textbf{Proof}$: Let $A = kn + r$, with $0 \\leq r < n$. If $n \\mid N$, then $r = 0$. Hence $\\left\\lfloor \\frac{N}{n} \\right\\rfloor = k$, $\\left\\lfloor \\frac{N-1}{n} \\right\\rfloor = \\left\\lfloor \\frac{(k-1)n+n-1}{n} \\right\\rfloor = k-1 + \\left\\lfloor \\frac{n-1}{n} \\right\\rfloor = k-1$, and $\\left\\lfloor \\frac{N}{n} \\right\\rfloor = \\left\\lfloor \\frac{N-1}{n} \\right\\rfloor + 1.$\n\nIf $n \\nmid N$, then $1 \\leq r < n$. Hence $\\left\\lfloor \\frac{N}{n} \\right\\rfloor = k$, $\\left\\lfloor \\frac{N-1}{n} \\right\\rfloor = k + \\left\\lfloor \\frac{r-1}{n} \\right\\rfloor = k$, and $\\left\\lfloor \\frac{N}{n} \\right\\rfloor = \\left\\lfloor \\frac{N-1}{n} \\right\\rfloor.$\n\nFrom the lemma and the given equation, we have four possible cases: $\\[\\left\\lfloor \\frac{998}{n} \\right\\rfloor + 1 = \\left\\lfloor \\frac{999}{n} \\right\\rfloor = \\left\\lfloor \\frac{1000}{n} \\right\\rfloor - 1 \\qquad (1)\\]$ $\\[\\left\\lfloor \\frac{998}{n} \\right\\rfloor + 1 = \\left\\lfloor \\frac{999}{n} \\right\\rfloor + 1 = \\left\\lfloor \\frac{1000}{n} \\right\\rfloor \\qquad (2)\\]$ $\\[\\left\\lfloor \\frac{998}{n} \\right\\rfloor + 1 = \\left\\lfloor \\frac{999}{n} \\right\\rfloor = \\left\\lfloor \\frac{1000}{n} \\right\\rfloor \\qquad (3)\\]$ $\\[\\left\\lfloor \\frac{998}{n} \\right\\rfloor = \\left\\lfloor \\frac{999}{n} \\right\\rfloor = \\left\\lfloor \\frac{1000}{n} \\right\\rfloor \\qquad (4)\\]$\n\nNote that cases (2) and (3) are the cases in which the term, $\\left\\lfloor \\frac{998}{n} \\right\\rfloor + \\left\\lfloor \\frac{999}{n} \\right\\rfloor + \\left\\lfloor \\frac{1000}{n} \\right\\rfloor,$ is not divisible by $3$. So we only need to count the number of $n$ 's for which cases (2) and (3) stand.\n\nCase (2): By the lemma, we have $n \\mid 1000$ and $n \\nmid 999.$ Hence $n$ can be any factor of $1000$ except for $n = 1$. Since $1000 = 2^3 * 5^3,$ there are $(3+1)(3+1) - 1 = 15$ possible values of $n$ for this case.\n\nCase (3): By the lemma, we have $n \\mid 999$ and $n \\nmid 998.$ Hence $n$ can be any factor of $999$ except for $n = 1$. Since $999 = 3^3 * 37^1,$ there are $(3+1)(1+1) - 1 = 7$ possible values of $n$ for this case.\n\nSo in total, we have total of $15+7=\\boxed{\\textbf{(A)}22}$ possible $n$ 's.\n\n~mathboywannabe",
        "Note that $\\left\\lfloor \\frac{998}{n} \\right\\rfloor + \\left\\lfloor \\frac{999}{n} \\right\\rfloor + \\left\\lfloor \\frac{1000}{n} \\right\\rfloor$ is a multiple of $3$ if $\\left\\lfloor \\frac{998}{n} \\right\\rfloor + \\left\\lfloor \\frac{999}{n} \\right\\rfloor + \\left\\lfloor \\frac{1000}{n} \\right\\rfloor$ lies between two consecutive multiples of $n$.\n\n$\\textbf{Explanation:}$\n\nLet's assume that the above expression does indeed lie betweent two consecutive multiples of $n$. This implies that $n$ does not divide either $998, 999$ or $1000$, meaning that when divided by $n$, none of the quotients are whole. In turn, this also means that they will all have the same whole number part.\n\nIf $\\frac{998}{n}, \\frac{999}{n},$ and $\\frac{1000}{n}$ were to have a different whole number part, then $n$ would have to lie within $998$ and $1000$. If this is confusing, think of why $\\frac{6}{5}, \\frac{7}{5}$ and $\\frac{8}{5}$ have the same whole number part ( $1$ in this case). Here, $n=5$. What happens to the whole number part when $n=7$?\n\nSince $\\frac{998}{n}, \\frac{999}{n},$ and $\\frac{1000}{n}$ have identical whole number parts, their floors are identical, since the floor of a number is equal to its whole number part, discarding its fractional component.\n\nLet $k$ be the number we get when we floor $\\frac{998}{n}, \\frac{999}{n},$ or $\\frac{1000}{n}$ if the three of those numbers lie between two consecutive multiples of $n$. Adding them up, we get $3k$ (due to their floors being the same), which is a mulutiple of $3$. So no matter what, we cannot have $\\frac{998}{n}, \\frac{999}{n},$ and $\\frac{1000}{n}$ lie between two consecutive multiples of $n$.\n\nWhat does this mean? It means that there must be some multiple of $n$ within this expression (with some restrictions, as we'll see), in order to prevent the violation of the main restriction. We can proceed with casework now.\n\n$\\textbf{Case 1}$\n\nLet's assume that the multiple of $n$ is located at $\\frac{998}{n}$. Luckily, the only prime factors of $998$ are $2$ and $499$.\n\nWe can observe that $499$ doesn't work, since $\\frac{998}{499}$ and $\\frac{1000}{499}$ will both round down to $2$ when divided by it. However, $2$ does work, since it divides both $998$ and $1000$. The floor of $\\frac{999}{2}$ is $499$, , meaning that when we evaluate the given expression for $n=2$, we will get $2\\cdot{499}+500$ which isn't a multiple of $3$.\n\nThis case works because we have a multiple of $n$ at the end of the expression, as well as the beginning, so the whole number parts of $998, 999$ and $1000$ when divided by $n$ are not all the same, due to $n$ dividing two of these numbers.\n\nThe restriction of $n$ dividing more than one number within the expression is only valid when we're testing the first number in the given expression (otherwise, the other floors wouldn't round down to the same value as the first).\n\nCase $1$ is complete, and we've found that only $2$ works.\n\n$\\textbf{Case 2}$\n\nNow, let's assume that the multiple of $n$ is located at $\\frac{999}{n}$. In this case, if $n$ divides $999$, it doesn't divide $998$ (since two multiples of a number greater than $1$ are never consecutive), nor does it divide $1000$, for the same reason.\n\nThe prime factorization of $999$ is $3^3\\cdot37$, and thus has $(3+1)(1+1)=8$ divisors.\n\nWhen testing a few values of $n$ initially, we observed that $n=1$ causes the expression to be divisible by $3$. Subtracting $1$, we see that there are $7$ values of $n$ that work for this case.\n\n$\\textbf{Case 3}$\n\nFinally, let's assume that the multiple of $n$ is located at $\\frac{1000}{n}.$\n\nOur goal is to have the other multiple of $n$ below whatever $\\frac{998}{n}$ is, so we won't have identical floors throughout the expression.\n\nOnce again, any factor of $1000$, except for $2$ is relatively prime to both $998$ and $999$, so when we floor those two numbers, we get an integer that isn't $500$.\n\n$1000$ factors as $2^3\\cdot{5^3}$, meaning that it has $(3+1)(3+1)=16$ divisors. $1$ and $2$ either don't work or have already been counted, so there are $14$ valid values of $n$ for this case.\n\n$\\textbf{Ending}$\n\nAdding these three cases, we get $1+7+14= \\boxed{\\textbf{A) }22}$ values of $n$.\n\n-Benedict T (countmath1)",
        "Let $\\lfloor \\frac{998}{n} \\rfloor + \\lfloor \\frac{999}{n} \\rfloor + \\lfloor \\frac{1000}{n} \\rfloor$ be (1). Claim : If $n$ is a factor of at least one of 998, 999, 1000, then (1) is NOT divisible by 3.  Proof of the claim :\n\nIf you don't understand this, let's test out some possible values. Evaluating the expression using $n = 1, 2, 3, 4, 5$ show that the expression isn't divisible by 3. And when $n = 6$, we have $\\[\\lfloor \\frac{998}{6} \\rfloor = \\lfloor \\frac{999}{6} \\rfloor = \\lfloor \\frac{1000}{6} \\rfloor = 166\\]$ This justifies that the expression is divisible by 3.\n\nTherefore, let $S$ be the set of numbers (not incl. 1) for which this is divisible by 3, which is $S = \\{2, 3, 4, 5, 8, 9, 10, 20, 27, 37, 40, 50, 100, 111, 200, 333, 400, 499, 500, 999, 1000\\}$. Adding 1 to this gives $21 + 1 = 22$ values. $\\boxed{\\textbf{(A) }22}$ Q. E. D.  ~elpianista227",
        "",
        "Education, The Study of Everything\n\nhttps://youtu.be/LWAYKQQX6KI",
        "https://www.youtube.com/watch?v=_Ej9nnHS07s\n\n~Snore",
        "https://www.youtube.com/watch?v=G5UVS5aM-CY&list=PLLCzevlMcsWNcTZEaxHe8VaccrhubDOlQ&index=4 ~ MathEx",
        "https://artofproblemsolving.com/videos/amc/2020amc10a/517"
      ],
      "difficulty": "hard",
      "category": "number-theory"
    },
    {
      "id": 23,
      "question": "Let $T$ be the triangle in the coordinate plane with vertices $(0,0), (4,0),$ and $(0,3).$ Consider the following five isometries (rigid transformations) of the plane: rotations of $90^{\\circ}, 180^{\\circ},$ and $270^{\\circ}$ counterclockwise around the origin, reflection across the $x$-axis, and reflection across the $y$-axis. How many of the $125$ sequences of three of these transformations (not necessarily distinct) will return $T$ to its original position? (For example, a $180^{\\circ}$ rotation, followed by a reflection across the $x$-axis, followed by a reflection across the $y$-axis will return $T$ to its original position, but a $90^{\\circ}$ rotation, followed by a reflection across the $x$-axis, followed by another reflection across the $x$-axis will not return $T$ to its original position.)",
      "options": [
        "$12 \\qquad$",
        "$15 \\qquad$",
        "$17 \\qquad$",
        "$20 \\qquad$",
        "$25$"
      ],
      "correctAnswer": "A",
      "solution": [
        "![Diagram](/data/images/66a9c223842fe3991dab905e4f048575.png)\n\nFirst, any combination of motions we can make must reflect $T$ an even number of times. This is because every time we reflect $T$, it changes orientation. Once $T$ has been flipped once, no combination of rotations will put it back in place because it is the mirror image; however, flipping it again changes it back to the original orientation. Since we are only allowed $3$ transformations and an even number of them must be reflections, we either reflect $T$ $0$ times or $2$ times.\n\nCase 1: $0$ reflections on $T$.\n\nIn this case, we must use $3$ rotations to return $T$ to its original position. Notice that our set of rotations, $\\{90^\\circ,180^\\circ,270^\\circ\\}$, contains every multiple of $90^\\circ$ except for $0^\\circ$. We can start with any two rotations $a,b$ in $\\{90^\\circ,180^\\circ,270^\\circ\\}$ and there must be exactly one $c \\equiv -a - b \\pmod{360^\\circ}$ such that we can use the three rotations $(a,b,c)$ which ensures that $a + b + c \\equiv 0^\\circ \\pmod{360^\\circ}$. That way, the composition of rotations $a,b,c$ yields a full rotation. For example, if $a = b = 90^\\circ$, then $c \\equiv -90^\\circ - 90^\\circ = -180^\\circ \\pmod{360^\\circ}$, so $c = 180^\\circ$ and the rotations $(90^\\circ,90^\\circ,180^\\circ)$ yields a full rotation.\n\nThe only case in which this fails is when $c$ would have to equal $0^\\circ$. This happens when $(a,b)$ is already a full rotation, namely, $(a,b) = (90^\\circ,270^\\circ),(180^\\circ,180^\\circ),$ or $(270^\\circ,90^\\circ)$. However, we can simply subtract these three cases from the total. Selecting $(a,b)$ from $\\{90^\\circ,180^\\circ,270^\\circ\\}$ yields $3 \\cdot 3 = 9$ choices, and with $3$ that fail, we are left with $6$ combinations for case $1$.\n\nCase 2: $2$ reflections on $T$.\n\nIn this case, we first eliminate the possibility of having two of the same reflection. Since two reflections across the x-axis maps $T$ back to itself, inserting a rotation before, between, or after these two reflections would change $T$ 's final location, meaning that any combination involving two reflections across the x-axis would not map $T$ back to itself. The same applies to two reflections across the y-axis.\n\nTherefore, we must use one reflection about the x-axis, one reflection about the y-axis, and one rotation. Since a reflection about the x-axis changes the sign of the y component, a reflection about the y-axis changes the sign of the x component, and a $180^\\circ$ rotation changes both signs, these three transformation composed (in any order) will suffice. It is therefore only a question of arranging the three, giving us $3! = 6$ combinations for case 2.\n\nCombining both cases we get $6+6=\\boxed{\\textbf{(A)}  12}$.",
        "As in the previous solution, note that we must have either $0$ or $2$ reflections because of orientation since reflection changes orientation that is impossible to fix by rotation. We also know we can't have the same reflection twice, since that would give a net of no change and would require an identity rotation.\n\nSuppose there are no reflections. Denote $90^{\\circ}$ as $1$, $180^{\\circ}$ as $2$, and $270^{\\circ}$ as $3$, just for simplification purposes. We want a combination of $3$ of these that will sum to either $4$ or $8$ ( $0$ and $12$ are impossible since the minimum is $3$ and the max is $9$ ). $4$ can be achieved with any permutation of $(1-1-2)$ and $8$ can be achieved with any permutation of $(2-3-3)$. This case can be done in $3+3=6$ ways.\n\nSuppose there are two reflections. As noted already, they must be different, and as a result will take the triangle to the opposite side of the origin if we don't do any rotation. We have $1$ rotation left that we can do though, and the only one that will return to the original position is $2$, which is $180^{\\circ}$ AKA reflection across origin. Therefore, since all $3$ transformations are distinct. The three transformations can be applied anywhere since they are commutative (think quadrants). This gives $6$ ways.\n\n$6+6=\\boxed{\\textbf{(A)}  12}$.",
        "Define $s$ as a reflection, and $r$ as a $90^{\\circ}$ counterclockwise rotation. Thus, $r^4=s^2=e$, and the five transformations can be represented as ${r, r^2, r^3, r^2s, s}$, and $rs=sr^{-1}$.\n\nNow either $s$ doesn't appear at all or appears twice. For the former case, it's easy to see that only $r, r, r^2$ and $r^2, r^3, r^3$ will work. Both can be permuted in $3$ ways, giving $6$ ways in total.\n\nFor the latter case, note that $s$ can't appear twice, neither does $r^2s$, else we need to get $e$ from ${r, r^2, r^3}$, which is not possible. So $r^2s$ and $s$ must appear once each. The last transformation must be $r^2$. A quick check shows that ${r^2, r^2s, s}$ is permutable, since $r^2s=sr^{-2}=sr^2$ (since $r^4=e$ ). This gives $6$ ways.\n\nThus the answer is $\\boxed{\\textbf{(A)} 12}$.\n\n~Xrider100",
        "https://youtu.be/yAkj_5YMhhQ",
        "https://youtu.be/SBhkM2frTUA",
        "https://artofproblemsolving.com/videos/amc/2020amc10a/513",
        "https://www.youtube.com/watch?v=iXwvTmFvo0c"
      ],
      "difficulty": "hard",
      "category": "geometry"
    },
    {
      "id": 24,
      "question": "Let $n$ be the least positive integer greater than $1000$ for which\n$\\[\\gcd(63, n+120) =21\\quad \\text{and} \\quad \\gcd(n+63, 120)=60.\\]$\nWhat is the sum of the digits of $n$?",
      "options": [
        "$12 \\qquad$",
        "$15 \\qquad$",
        "$18 \\qquad$",
        "$21\\qquad$",
        "$24$"
      ],
      "correctAnswer": "C",
      "solution": [
        "We know that $\\gcd(n+57,63)=21$ and $\\gcd(n-57, 120)= 60$ by the Euclidean Algorithm. Hence, let $n+57=21\\alpha$ and $n-57=60 \\gamma$, where $\\gcd(\\alpha,3)=1$ and $\\gcd(\\gamma,2)=1$. Subtracting the two equations, $38=7\\alpha-20\\gamma$. Letting $\\gamma = 2s+1$, we get $58=7\\alpha-40s$. Taking modulo $40$, we have $\\alpha \\equiv{14} \\pmod{40}$. We are given that $n=21\\alpha -57 >1000$, so $\\alpha \\geq 51$. Notice that if $\\alpha =54$ then the condition $\\gcd(\\alpha,3)=1$ is violated. The next possible value of $\\alpha = 94$ satisfies the given condition, giving us $n=1917$.\n\nAlternatively, we could have said $\\alpha = 40k+14 \\equiv{0} \\pmod{3}$ for $k \\equiv{1} \\pmod{3}$ only, so $k \\equiv{0,2} \\pmod{3}$, giving us our answer. Since the problem asks for the sum of the digits of $n$, our answer is $1+9+1+7=\\boxed{\\textbf{(C) } 18}$.\n\n~Prabh1512",
        "The conditions of the problem reduce to the following: $n+120 = 21k$ and $n+63 = 60\\ell$, where $\\gcd(k,3) = 1$ and $\\gcd(\\ell,2) = 1$. From these equations, we see that $21k - 60\\ell = 57$. Solving this Diophantine equation gives us that $k = 20a + 17$ and $\\ell = 7a + 5$. Since, $n>1000$, we can do some bounding and get that $k > 53$ and $\\ell > 17$. Now we start bashing by plugging in numbers that satisfy these conditions: $a=4$ is the first number that works so we get $\\ell = 33$, $k = 97$. Therefore, we have $n=21(97)-120=60(33)-63=1917$, and our answer is $1+9+1+7=\\boxed{\\textbf{(C) } 18}$.",
        "We first find that $n\\equiv6\\pmod{21}$ and $n\\equiv57\\pmod{60}$, then we get $n=21x+6$ and $n=60y+57$ by definitions, where $x$ and $y$ are integers. It follows that $y$ must be odd, since the GCD will be $120$ instead of $60$ if $y$ is even. Also, the unit digit of $n$ must be $7$, since the unit digit of $60y$ is always $0$ and the unit digit of $57$ is $7$. Therefore, we find that $x$ must end in $1$ to satisfy $n$ having a unit digit of $7$. Also, we find that $x$ must not be a multiple of $3$ or else the GCD will be $63$. Therefore, we test values for $x$ and find that $x=91$ satisfies all these conditions. Therefore, $n=1917$ and $1+9+1+7 = \\boxed{\\textbf{(C) } 18}$.\n\n~happykeeper",
        "After applying the Euclidean Algorithm we get $\\gcd(n - 6, 63) = 21$ and $\\gcd(n - 57, 120) = 60.$ So we have $n - 6 = 21a$ and $n - 57 = 60b$, where $a$ is not a multiple of $3$ and $b$ is not a multiple of $2.$ Setting these equations equal to each other, we get $21a = 60b + 51 \\implies 20b = 7a - 17.$ We note that $a$ must be $\\geq 48$ (since $n$ has to be greater than $1000$ ) and the last digit of $a$ must be $1$ so that $7a - 17$ is a multiple of $10$ and has a possibility of also being a multiple of 20.\n\nSince $a = 91$, $n = 91 \\cdot 21 + 6 = 1917$ (or since $b = 31,$ $n = 31 \\cdot 60 + 57 = 1917).$ The answer is $1 + 9 + 1 + 7 = \\boxed{18}.$\n\n~ grogg007 , isabelchen",
        "We are given that $\\gcd(63, n+120) =21$ and $\\gcd(n+63, 120)=60.$ By applying the Euclidean algorithm in reverse, we have $\\[\\gcd(63, n+120) = \\gcd(63, n+120 + 63) = \\gcd(63, n+183) = 21\\]$ and $\\[\\gcd(n+63, 120) = \\gcd(n+63 + 120, 120) = \\gcd(n+183, 120) = 60.\\]$\n\nWe now know that $n+183$ must be divisible by $21$ and $60,$ so it is divisible by $\\text{lcm}(21, 60) = 420.$ Therefore, $n+183 = 420k$ for some integer $k.$ We know that $3 \\nmid k,$ or else the first condition won't hold ( $\\gcd$ will be $63$ ) and $2 \\nmid k,$ or else the second condition won't hold ( $\\gcd$ will be $120$ ). Since $k = 1$ gives us too small of an answer, then $k=5,$ from which $n = 1917.$ So, the answer is $1+9+1+7 = \\boxed{\\textbf{(C) } 18}.$",
        "$\\gcd(n+63,120)=60$ tells us $n+63\\equiv60\\pmod {120}$. The smallest $n+63$ that satisfies the previous condition and $n>1000$ is $1140$, so we start from there. If $n+63=1140$, then $n+120=1197$. Because $\\gcd(n+120,63)=21$, $n+120\\equiv21\\pmod {63}$ or $n+120\\equiv42\\pmod {63}$. We see that $1197\\equiv0\\pmod {63}$, which does not fulfill the requirement for $n+120$, so we continue by keep on adding $120$ to $1197$, in order to also fulfill the requirement for $n+63$. Soon, we see that $n+120\\pmod {63}$ decreases by $6$ every time we add $120$, so we can quickly see that $n=1917$ because at that point $n+120\\equiv21\\pmod {63}$. We add up all digits of $1917$ to get $\\boxed{\\textbf{(C) } 18}$.\n\n~SmileKat32",
        "We are able to set up the following system of congruences: $\\begin{align*} n &\\equiv 6 \\pmod {21}, \\\\ n &\\equiv 57 \\pmod {60}. \\end{align*}$ Therefore, by definition, we are able to set-up the following system of equations: $\\begin{align*} n &= 21a + 6, \\\\ n &= 60b + 57. \\end{align*}$ Thus, we have $21a + 6 = 60b + 57,$ from which $\\[7a + 2 = 20b + 19.\\]$ We know $7a \\equiv 0 \\pmod {7},$ and since $7a = 20b + 17,$ therefore $20b + 17 \\equiv 0 \\pmod{7}.$ Simplifying this congruence further, we have $\\[b\\equiv 3 \\pmod{7}.\\]$ Thus, by definition, $b = 7x + 3.$ Substituting this back into our original equation, we get $\\[n = 60(7x + 3) + 57 = 420x + 237.\\]$ By definition, we are able to set up the following congruence: $\\[n \\equiv 237 \\pmod{420}.\\]$ Thus, $n = 1917$, so our answer is simply $1+9+1+7=\\boxed{\\textbf{(C) } 18}$.\n\nRemark\n\nSince $n \\equiv -120 \\pmod{21},$ we conclude that $n \\equiv 6 \\pmod{21}.$\n\nSince $n \\equiv -63 \\pmod{60},$ we conclude that $n \\equiv 57 \\pmod{60}.$\n\nRemember that $b \\equiv 3 \\pmod{7}.$\n\nLastly, the reason why $n \\neq 1077$ is $n + 120$ would be divisible by $63$, which is not possible due to the certain condition.\n\n~nikenissan ~Midnight",
        "First, we find $n$. We know that it is greater than $1000$, so we first input $n = 1000$. From the first equation, $\\gcd(63, n + 120) = 21$, we know that if $n$ is correct, after we add $120$ to it, it should be divisible by $21$, but not $63$: $\\[\\frac{n + 120}{21} = \\frac{1120}{21} = 53\\text{ R }7.\\]$ This does not work. To get to the nearest number divisible by $21$, we have to add $14$ to cancel out the remainder. (Note that we don't subtract $7$ to get to $53$; $n$ is already at its lowest possible value!) Adding $14$ to $1000$ gives us $n = 1014$. (Note: $n$ is currently divisible by 63, but that's fine since we'll be changing it in the next step.)\n\nNow using the second equation, $\\gcd(n + 63, 120) = 60$, we know that if $n$ is correct, then $n+63$ is divisible by $60$ but not $120$: $\\[\\frac{n + 63}{60} = \\frac{1077}{60} = 17\\text{ R }57.\\]$ Again, this does not work. This requires some guessing and checking. We can add $21$ over and over again until $n$ is valid. This changes $n$ while also maintaining that $\\frac{n + 120}{21}$ has no remainders.  After adding $21$ once, we get $18 r 18$. By pure luck, adding $21$ two more times gives us $19$ with no remainders.  We now have $1077 + 21 + 21 + 21 = 1140$. However, this number is divisible by $120$. To get the next possible number, we add the LCM of $21$ and $60$ (once again, to maintain divisibility), which is $420$. Unfortunately, $1140 + 420 = 1560$ is still divisible by $120$. Adding $420$ again gives us $1980$, which is valid. However, remember that this is equal to $n + 63$, so subtracting $63$ from $1980$ gives us $1917$, which is $n$.\n\nThe sum of its digits are $1 + 9 + 1 + 7 = \\boxed{\\textbf{(C) } 18}$.\n\n~primegn",
        "By the Euclidean Algorithm, we have $\\begin{alignat*}{8} \\gcd(63,n+120)&=\\hspace{1mm}&&\\gcd(63,\\phantom{ }\\underbrace{n+120-63k_1}_{(n+120) \\ \\mathrm{mod} \\ 63}\\phantom{ })&&=21, \\\\  \\gcd(n+63,120)&=&&\\gcd(\\phantom{ }\\underbrace{n+63-120k_2}_{(n+63) \\ \\mathrm{mod} \\ 120}\\phantom{ },120)&&=60.  \\end{alignat*}$ Clearly, $n+120-63k_1$ must be either $21$ or $42,$ and $n+63-120k_2$ must be $60.$\n\nMore generally, let $t\\in\\{1,2\\},$ so we get $\\begin{align*} n+120-63k_1&=21t, &\\hspace{55.5mm}(1) \\\\ n+63-120k_2&=60. &\\hspace{55.5mm}(2) \\end{align*}$ Subtracting $(2)$ from $(1)$ and then simplifying give $\\begin{align*} 57-63k_1+120k_2&=21t-60 \\\\ 117-63k_1+120k_2&=21t \\\\ 39-21k_1+40k_2&=7t. \\hspace{54mm}(\\bigstar) \\end{align*}$ Taking $(\\bigstar)$ modulo $7$ produces $\\begin{align*} 4+5k_2&\\equiv0\\pmod{7} \\\\ k_2&\\equiv2\\pmod{7}. \\end{align*}$ Recall that $n>1000.$ From $(2),$ it follows that $\\[1063-120k_2<n+63-120k_2=60,\\]$ from which $k_2>8.$ Therefore, the possible values for $k_2$ are $9,16,23,\\ldots.$\n\nWe need to check whether positive integers $k_1$ and $t$ (where $t\\in\\{1,2\\}$ ) exist in $(1):$\n\nFinally, the least such positive integer $n$ is $1917.$ The sum of its digits is $1+9+1+7=\\boxed{\\textbf{(C) } 18}.$\n\n~MRENTHUSIASM",
        "Because we are finding value of $n$ for $n > 1000$, let $n = 1000 + k$.\n\nUsing the Euclidean Algorithm, $\\begin{align*} \\gcd(63, n+120) &= \\gcd(63, 1000 + k + 120) \\\\ &= \\gcd(63, k + 1120 - 63 \\cdot 18) \\\\ &= \\gcd(63, k-14) \\\\ &= 21, \\\\ \\gcd(n+63, 120) &= \\gcd(k + 1000 + 63, 120) \\\\ &= \\gcd(k + 1000 + 63 - 120 \\cdot 9, 120) \\\\ &= \\gcd(k-17, 120) \\\\ &= 60. \\end{align*}$ So, we have $\\begin{align*} k &\\equiv 14 \\pmod{21}, \\\\ k &\\equiv 17 \\pmod{60}. \\end{align*}$ Let $k = 21p + 14 = 60q + 17$, $7p= 20q + 1$ (by the Division Algorithm), $7p = 21q - (q - 1)$, $q - 1$ is a multiple of $7$.\n\nLet $q-1 = 7r$, $q = 7r+1$, $k = 60(7r+1) + 17 = 420r + 77$.\n\n$n = 1000 + k = 420r + 1077$, $n = 1077, 1497, 1917$.\n\nBy substituting $1077$, $1497$, $1917$ into $\\gcd(63, n+120) =21$ and $\\gcd(n+63, 120)=60$, $1077$ and $1497$ aren't valid answers, only $1917$ is. Therefore, the answer is $1+9+1+7=\\boxed{\\textbf{(C) } 18}$.\n\n~ isabelchen (Solution)\n\n~ Plainoldnumbertheory (Minor Edits)\n\n~ Puck_0 (Formatting)",
        "We have $\\begin{align*} \\gcd(63, n+120) &= 21 \\Longrightarrow n + 120 \\equiv 0 \\pmod{21}, \\text{ where } 9 \\nmid n + 120, \\\\ \\gcd(n+63, 120) &= 60 \\Longrightarrow n + 63 \\equiv 0 \\pmod{60}, \\text{ where } 8 \\nmid n + 63. \\end{align*}$ So, we conclude that $n \\equiv 6 \\pmod{21}$ and $n \\equiv 57 \\pmod{60}$, respectively.\n\nBecause the $2$ moduli $21$ and $60$ are not relatively prime, namely $\\gcd{(21, 60)} = 3$, $21 = 3 \\cdot 7$, and $60 = 3 \\cdot 20$, we convert the system of $2$ linear congruences with non-coprime moduli into a system of $3$ linear congruences with coprime moduli: $\\begin{align*} n &\\equiv 0 \\pmod{3}, \\\\ n &\\equiv 6 \\pmod{7}, \\\\ n &\\equiv 17 \\pmod{20}. \\end{align*}$ By Chinese Remainder Theorem , the general solution of system of $3$ linear congruences is $\\[n = 420k + 1077.\\]$ We construct the following table: $\\[\\begin{array}{c|c|c|c} n & 1077 & 1497 & 1917\\\\ \\hline n + 120 & 1197 & 1617 & 2037\\\\ \\hline n + 63 & 1140 & 1560 & 1980\\\\ \\end{array}\\]$ Only $n = 1917$ satisfies $9 \\nmid n + 120$ and $8 \\nmid n + 63$. Therefore, the answer is $1+9+1+7=\\boxed{\\textbf{(C) } 18}$.\n\n~ isabelchen",
        "We know that $n$ ends with the number $7$, since $n+63$ is divisible by $60$, and any number divisible by $10$ (a factor of $60$ ) must end with a $0$. As a result, $n+120$ must also end in $7$. Because $n+63$ must be divisible by $20$, as well (using the same gcd), the tens value of $n$ must be odd. Also, $n+120$ cannot be divisible by $9$, otherwise, its gcd with $63$ will be $63$, instead of $21$.\n\nNow, we can start bashing, using the $\\gcd(63, n+120) =21$. We are given that $n$ must be greater than $1000$, so we can try $n+120$ that is greater than $1120$.\n\nWe try $21 \\cdot 67$, but it has an even tens digit. We then can try the next highest, using $77$, but the $\\gcd(n+63, 120) =120$, instead of $60$.\n\nSince $87$ is divisible by $3$, so when multiplied by $21$, it will be divisible by $9$, we do not have to test it.\n\nThe next biggest is $97$, which works and gives us $n=1917$, which, when the digits are added up, equals $\\boxed{\\textbf{(C) } 18}$.\n\n~parmani",
        "By the Euclidean Algorithm, we have $\\gcd(63, n - 6) = 21$ and $\\gcd(120, n - 57) = 60$. We know that $63 = 21 \\cdot 3$, meaning $n - 6 = 21x$ where $x$ is not divisible by $3$. Similarly, $120 = 60 \\cdot 2$, meaning $n - 57 = 60y$ where $y$ is odd.\n\nSetting the two expressions for $n$ equal: $\\[21x + 6 = 60y + 57,\\]$ so $\\[21x = 60y + 51.\\]$ We can see that $x$ must have a units digit of $1$, since $21x - 51$ must be divisible by $10$ in order to be divisible by $60$.\n\nBecause $n > 1000$, we try $x = 61$, $x = 71$, and finally $x = 91$, which works. Thus $21 \\cdot 91 = n - 6$, so $n = 1917$. The sum of the digits of $n$ is $1 + 9 + 1 + 7 = \\boxed{18}$.\n\n~Voidling",
        "",
        "https://www.youtube.com/watch?v=tk3yOGG2K-s&",
        "https://youtu.be/8mNMKH0T9W0 - Happytwin",
        "https://youtu.be/e5BJKMEIPEM\n\nEducation The Study of Everything",
        "https://www.youtube.com/watch?v=gdGmSyzR908&list=PLLCzevlMcsWNcTZEaxHe8VaccrhubDOlQ&index=5 ~ MathEx",
        "https://youtu.be/R220vbM_my8?t=899 ~ amritvignesh0719062.0"
      ],
      "difficulty": "hard",
      "category": "number-theory"
    },
    {
      "id": 25,
      "question": "Jason rolls three fair standard six-sided dice. Then he looks at the rolls and chooses a subset of the dice (possibly empty, possibly all three dice) to reroll. After rerolling, he wins if and only if the sum of the numbers face up on the three dice is exactly $7.$ Jason always plays to optimize his chances of winning. What is the probability that he chooses to reroll exactly two of the dice?",
      "options": [
        "$\\frac{7}{36} \\qquad$",
        "$\\frac{5}{24} \\qquad$",
        "$\\frac{2}{9} \\qquad$",
        "$\\frac{17}{72} \\qquad$",
        "$\\frac{1}{4}$"
      ],
      "correctAnswer": "A",
      "solution": [
        "Consider the probability that rolling two dice gives a sum of $s$, where $s \\leq 7$. There are $s - 1$ pairs that satisfy this, namely $(1, s - 1), (2, s - 2), \\ldots, (s - 1, 1)$, out of $6^2 = 36$ possible pairs. The probability is $\\frac{s - 1}{36}$.\n\nTherefore, if one die has a value of $a$ and Jason rerolls the other two dice, then the probability of winning is $\\frac{7 - a - 1}{36} = \\frac{6 - a}{36}$.\n\nIn order to maximize the probability of winning, $a$ must be minimized. This means that if Jason rerolls two dice, he must choose the two dice with the maximum values.\n\nThus, we can let $a \\leq b \\leq c$ be the values of the three dice. Consider the case when $a + b < 7$. If $a + b + c = 7$, then we do not need to reroll any dice. Otherwise, if we reroll one die, we can reroll any one dice in the hope that we get the value that makes the sum of the three dice $7$. This happens with probability $\\frac16$. If we reroll two dice, we will roll the two maximum dice, and the probability of winning is $\\frac{6 - a}{36}$, as stated above. However, $\\frac16 > \\frac{6 - a}{36}$, so rolling one die is always better than rolling two dice if $a + b < 7$.\n\nNow consider the case where $a + b \\geq 7$. Rerolling one die will not help us win since the sum of the three dice will always be greater than $7$. If we reroll two dice, the probability of winning is, once again, $\\frac{6 - a}{36}$. To find the probability of winning if we reroll all three dice, we can let each dice have $1$ dot and find the number of ways to distribute the remaining $4$ dots. By stars and bars, there are ${6\\choose2} = 15$ ways to do this, making the probability of winning $\\frac{15}{6^3} = \\frac5{72}$.\n\nIn order for rolling two dice to be more favorable than rolling three dice, $\\frac{6 - a}{36} > \\frac5{72} \\rightarrow a \\leq 3$.\n\nThus, rerolling two dice is optimal if and only if $a \\leq 3$ and $a + b \\geq 7$. The possible triplets $(a, b, c)$ that satisfy these conditions, and the number of ways they can be permuted, are\n\n$(3, 4, 4) \\rightarrow 3$ ways.\n\n$(3, 4, 5) \\rightarrow 6$ ways.\n\n$(3, 4, 6) \\rightarrow 6$ ways.\n\n$(3, 5, 5) \\rightarrow 3$ ways.\n\n$(3, 5, 6) \\rightarrow 6$ ways.\n\n$(3, 6, 6) \\rightarrow 3$ ways.\n\n$(2, 5, 5) \\rightarrow 3$ ways.\n\n$(2, 5, 6) \\rightarrow 6$ ways.\n\n$(2, 6, 6) \\rightarrow 3$ ways.\n\n$(1, 6, 6) \\rightarrow 3$ ways.\n\nThere are $3 + 6 + 6 + 3 + 6 + 3 + 3 + 6 + 3 + 3 = 42$ ways in which rerolling two dice is optimal, out of $6^3 = 216$ possibilities, Therefore, the probability that Jason will reroll two dice is $\\frac{42}{216} = \\boxed{\\textbf{(A) } \\frac{7}{36}}$.",
        "We conclude all of the following after the initial roll:\n\nThe optimal strategy is that:\n\nFinally, the requested probability is $\\[\\frac{3+12+27}{6^3}=\\frac{42}{216}=\\boxed{\\textbf{(A) } \\frac{7}{36}}.\\]$\n\n~MRENTHUSIASM",
        "We count the numerator. Jason will pick up no dice if he already has a $7$ as a sum. We need to assume he does not have a $7$ to begin with. If Jason decides to pick up all the dice to re-roll, by the stars and bars rule ways to distribute, ${n+k-1 \\choose k-1}$, there will be $2$ bars and $4$ stars ( $3$ of them need to be guaranteed because a roll is at least $1$ ) for a probability of $\\frac{15}{216}=\\frac{2.5}{36}$. If Jason picks up $2$ dice and leaves a die showing $k$, he will need the other two to sum to $7-k$. This happens with probability $\\[\\frac{6-k}{36}\\]$ for integers $1 \\leq k \\leq 6$. If the roll is not $7$, Jason will pick up exactly one die to re-roll if there can remain two other dice with sum less than $7$, since this will give him a $\\frac{1}{6}$ chance which is a larger probability than all the cases unless he has a $7$ to begin with. We have $\\[\\frac{1}{6} > \\underline{\\frac{5,4,3}{36}} > \\frac{2.5}{36} > \\frac{2,1,0}{36}.\\]$ We count the underlined part's frequency for the numerator without upsetting the probability greater than it. Let $a$ be the roll we keep. We know $a\\leq3$ since $a=4$ would cause Jason to pick up all the dice. When $a=1$, there are $3$ choices for whether it is rolled $1$ st, $2$ nd, or $3$ rd, and in this case the other two rolls have to be at least $6$ (or he would have only picked up $1$ ). This give $3 \\cdot 1^{2} =3$ ways. Similarly, $a=2$ gives $3 \\cdot 2^{2} =12$ because the $2$ can be rolled in $3$ places and the other two rolls are at least $5$. $a=3$ gives $3 \\cdot 3^{2} =27$.  Summing together gives the numerator of $42$. The denominator is $6^3=216$, so we have $\\frac{42}{216}=\\boxed{\\textbf{(A) } \\frac{7}{36}}$.",
        "We can quickly write out all possible rolls that result in a total of $7$, to get that there is a $\\frac{5}{72}$ chance that rolling three dice will result in a total of $7$.\n\nClaim 1 : If all of Jason's initial outcomes are $4$, $5$ or $6$, Jason is best off rerolling everything.\n\nProof of if part : If Jason rerolls two dice, he would like for the sum of the two outcomes to be $7-\\text{(The initial outcome of the untouched dice)}$. Since in this case, every dice's initial outcome is $4$, $5$ or $6$, this value is $1$, $2$ or $3$. By basic dice probability, the probability that they add to one is $0$; the probability that they add to two is $\\frac{1}{36}$; the probability that they add to three is $\\frac{1}{18}$. Each of these probabilities is less than $\\frac{5}{72}$, (the probability of winning by rerolling everything) so Jason should not reroll one dice in this scenario. Rolling one die is also nonsense in this situation, since the other two dice will already add up to something greater than $7$.\n\nProof of only-if part : If Jason rolls a $1$, $2$ or $3$, even just once, then, the probability that rerolling the other two dice will result in win is $\\frac{5}{36}$, $\\frac{1}{9}$ and $\\frac{1}{12}$, by basic die probability. Each of these is greater than $\\frac{5}{72}$, so if Jason rolls a $1$, $2$ or $3$, he should not reroll everything.\n\nClaim 2 : Iff the sum of any two of the initial dice is less than $7$, Jason is best off rerolling one or zero die.\n\nProof of if part : If the sum of any two of the initial dice is less than $7$, when the other die is rolled, there is always a fixed $\\frac{1}{6}$ chance that this results in a win for Jason (or, he his initial roll already won, so he doesn't have to roll anything). Rerolling that one die is better than rerolling all three dice, since, as we have seen there is a $\\frac{5}{72}$ chance that Jason wins from that. Rerolling that one die is also better than rerolling two dice: by basic die probability, if Jason wishes for the sum of two rerolled dice to equal one value, the maximum probability this happens is $\\frac{1}{6}$, and this is when he wishes for the sum to be $7$; however, since he wishes for the sum of all three dice to be $7$, this will never happen, so the probability that rerolling two dice results in a win is always less than $\\frac{1}{6}$.\n\nProof of only-if part : If the sum of each pair of the three dice is at least $7$, it would make no sense to reroll one die, since the final sum of all three dice will always be greater than $7$. Also, if the sum of each pair of the three dice is at least $7$, the total initial sum must also be greater than $7$, so Jason should not reroll zero dice.\n\nFrom having shown these two claims, we know that Jason should reroll two dice if at least one of them is a $1$, $2$ or $3$, and if the sum of any two of the initial dice is at least $7$. We can write out all the possibilities of initial rolls, account for their permutations, and add everything together to see that there are $42$ total outcomes, where Jason should reroll two dice. Therefore, our final answer is $\\frac{42}{216} = \\boxed{\\textbf{(A) } \\frac{7}{36}}$.\n\n~ ihatemath123",
        "If the sum of the dice is 7, we reroll no dice. If the sum of any two dice is $\\leq 6$, we reroll 1 die because rolling 1 die will give Jason a $\\frac{1}{6}$ chance of winning.  Thus, we consider the scenario where the sum of any two dice is 7 or greater.\n\nIf the smallest die is 1, the other two dice must be 6, which has $3$ possible permutations.\n\nIf the smallest die is 2, the other two dice can be 5 or 6. There are 3 ways to choose the position of the smallest die, 2 ways each to choose the value of the other dice, so there are $2 \\cdot 2 \\cdot 3 = 12$ possible permutations.\n\nIf the smallest die is 3, the other two dice can be 4, 5, or 6. Similarly, there are 3 ways to choose the position of the smallest die, and 3 ways each to choose the value of the other dice, so there are $3 \\cdot 3 \\cdot 3 = 27$ possible permutations.\n\nIf all die are 4 or above, then we reroll 3 dice. When we reroll all 3 dice, the winning rolls are 1,1,5; 1,2,4; 1,3,3; 2,2,3 in some arrangement, for a total of 15 permutations. Thus, the probability of winning after rerolling 3 dice is $\\frac{15}{6^3} = \\frac{5}{72}$. If we reroll only 2 dice with the smallest die being $4$, we would need to roll 1,2 or 2,1 to win, which gives a $\\frac{2}{36} = \\frac{4}{72}$ chance of winning, so this is worse.\n\nIf the smallest die is 5 or 6, rerolling 2 dice gives us even worse odds.\n\nTherefore, the cases where 1, 2, or 3 are the smallest die covers all cases where 2 rerolls is optimal. There are $3+12+27 = 42$ permutations out of 216 total permutations, giving us a probability of $\\frac{42}{216} = \\boxed{\\frac{7}{36}}$.\n\n~JGsomeone, krwang",
        "https://youtu.be/B8pt8jF04ZM",
        "https://artofproblemsolving.com/videos/amc/2020amc10a/516",
        "https://www.youtube.com/watch?v=caUKXO7R0bc"
      ],
      "difficulty": "hard",
      "category": "combinatorics"
    }
  ]
}