AMC10 2021 B

Since $3\pi\approx9.42$, we multiply $9$ by $2$ for the integers from $1$ to $9$ and the integers from $-1$ to $-9$ and add $1$ to account for $0$ to get $\boxed{\textbf{(D)} ~19}$.

Note that the square root of any number squared is always the absolute value of the squared number because the square root function will only return a nonnegative number. By squaring both $3$ and $2\sqrt{3}$, we see that $2\sqrt{3}>3$, thus $3-2\sqrt{3}$ is negative, so we must take the absolute value of $3-2\sqrt{3}$, which is just $2\sqrt{3}-3$. Knowing this, the first term in the expression equals $2\sqrt{3}-3$ and the second term is $3+2\sqrt3$, and summing the two gives $\boxed{\textbf{(D)} ~4\sqrt{3}}$.

Say there are $j$ juniors and $s$ seniors in the program. Converting percentages to fractions, $\frac{j}{4}$ and $\frac{s}{10}$ are on the debate team, and since an equal number of juniors and seniors are on the debate team, $\frac{j}{4} = \frac{s}{10}.$ Cross-multiplying and simplifying we get $5j=2s.$ Additionally, since there are $28$ students in the program, $j+s = 28.$ It is now a matter of solving the system of equations \[5j=2s\]\[j+s=28,\] and the solution is $j = 8, s = 20.$ Since we want the number of juniors, the answer is \[\boxed{(C) \text{ } 8}.\]

There are $46$ blue students paired with a blue partner. The other $11$ students wearing blue shirts must each be paired with a partner wearing a shirt of the opposite color. There are $64$ yellow students remaining. Therefore the requested number of pairs is $\tfrac{64}{2}=\boxed{\textbf{(B)} ~32}$

First look at the two cousins' ages that multiply to $24$. Since the ages must be single-digit, the ages must either be $3 \text{ and } 8$ or $4 \text{ and } 6.$ Next, look at the two cousins' ages that multiply to $30$. Since the ages must be single-digit, the only ages that work are $5 \text{ and } 6.$ Remembering that all the ages must all be distinct, the only solution that works is when the ages are $3, 8$ and $5, 6$. We are required to find the sum of the ages, which is \[3 + 8 + 5 + 6 = \boxed{\textbf{(B)} ~22}.\]

Let there be $3x$ students in the morning class and $4x$ students in the afternoon class. The total number of students is $3x + 4x = 7x$. The average is $\frac{3x\cdot84 + 4x\cdot70}{7x}=76$. Therefore, the answer is $\boxed{\textbf{(C)} ~76}$.

Suppose that line $\ell$ is horizontal, and each circle lies either north or south to $\ell.$ We construct the circles one by one: 1. Without the loss of generality, we draw the circle with radius $7$ north to $\ell.$ 2. To maximize the area of region $S,$ we draw the circle with radius $5$ south to $\ell.$ 3. Now, we need to subtract the circle with radius $3$ at least. The optimal situation is that the circle with radius $3$ encompasses the circle with radius $1,$ in which we do not need to subtract more. That is, the two smallest circles are on the same side of $\ell,$ but can be on either side. The diagram below shows one possible configuration of the four circles: Together, the answer is $\pi\cdot7^2+\pi\cdot5^2-\pi\cdot3^2=\boxed{\textbf{(D) }65\pi}.$

In the diagram below, the red arrows indicate the progression of numbers. In the second row from the top, the greatest number and the least number are $D$ and $E,$ respectively. Note that the numbers in the yellow cells are consecutive odd perfect squares, as we can prove by induction. By observations, we proceed as follows: \begin{alignat*}{6} A=15^2=225, \ B=13^2=169 \quad &\implies \quad &C &= \hspace{1mm}&&A-14\hspace{1mm} &= 211& \\ \quad &\implies \quad &D &= &&C-1 &= 210& \\ \quad &\implies \quad &E &= &&B-12 &= 157&. \end{alignat*} Therefore, the answer is $D+E=\boxed{\textbf{(A)} ~367}.$

The final image of $P$ is $(-6,3)$. We know the reflection rule for reflecting over $y=-x$ is $(x,y) \rightarrow (-y, -x)$. So before the reflection and after rotation the point is $(-3,6)$. By definition of rotation, the slope between $(-3,6)$ and $(1,5)$ must be perpendicular to the slope between $(a,b)$ and $(1,5)$. The first slope is $\frac{5-6}{1-(-3)} = \frac{-1}{4}$. This means the slope of $P$ and $(1,5)$ is $4$. Rotations also preserve distance to the center of rotation, and since we only "travelled" up and down by the slope once to get from $(-3,6)$ to $(1,5)$ it follows we shall only use the slope once to travel from $(1,5)$ to $P$. Therefore point $P$ is located at $(1+1, 5+4) = (2,9)$. The answer is $9-2 = 7 = \boxed{\textbf{(D)} ~7}$.

The volume of a cone is $\frac{1}{3} \cdot\pi \cdot r^2 \cdot h$ where $r$ is the base radius and $h$ is the height. The water completely fills up the cone so the volume of the water is $\frac{1}{3}\cdot18\cdot144\pi = 6\cdot144\pi$. The volume of a cylinder is $\pi \cdot r^2 \cdot h$ so the volume of the water in the cylinder would be $24\cdot24\cdot\pi\cdot h$. We can equate these two expressions because the water volume stays the same like this $24\cdot24\cdot\pi\cdot h = 6\cdot144\pi$. We get $4h = 6$ and $h=\frac{6}{4}$. So the answer is $\boxed{\textbf{(A)} ~1.5}.$

Let the side lengths of the rectangular pan be $m$ and $n$. It follows that $(m-2)(n-2) = \frac{mn}{2}$, since half of the brownie pieces are in the interior. This gives $2(m-2)(n-2) = mn \iff mn - 4m - 4n + 8 = 0$. Adding $8$ to both sides and applying Simon's Favorite Factoring Trick, we obtain $(m-4)(n-4) = 8$. Since $m$ and $n$ are both positive, we obtain $(m, n) = (5, 12), (6, 8)$ (up to ordering). By inspection, $5 \cdot 12 = \boxed{\textbf{(D) }60}$ maximizes the number of brownies.

Prime factorize $N$ to get $N=2^{3} \cdot 3^{5} \cdot 5\cdot 7\cdot 17^{2}$. For each odd divisor $n$ of $N$, there exist even divisors $2n, 4n, 8n$ of $N$, therefore the ratio is $1:(2+4+8)=\boxed{\textbf{(C)} ~1 : 14}$

We can start by setting up an equation to convert $\underline{32d}$ base $n$ to base 10. To convert this to base 10, it would be $3{n}^2+2n+d.$ Because it is equal to 263, we can set this equation to 263. Finally, subtract $d$ from both sides to get $3{n}^2+2n = 263-d$. We can also set up equations to convert $\underline{324}$ base $n$ and $\underline{11d1}$ base 6 to base 10. The equation to covert $\underline{324}$ base $n$ to base 10 is $3{n}^2+2n+4.$ The equation to convert $\underline{11d1}$ base 6 to base 10 is ${6}^3+{6}^2+6d+1.$ Simplify ${6}^3+{6}^2+6d+1$ so it becomes $6d+253.$ Setting the above equations equal to each other, we have \[3{n}^2+2n+4 = 6d+253.\] Subtracting 4 from both sides gets $3{n}^2+2n = 6d+249.$ We can then use equations \[3{n}^2+2n = 263-d\] \[3{n}^2+2n = 6d+249\] to solve for $d$. Set $263-d$ equal to $6d+249$ and solve to find that $d=2$. Plug $d=2$ back into the equation $3{n}^2+2n = 263-d$. Subtract 261 from both sides to get your final equation of $3{n}^2+2n-261 = 0.$ We solve using the quadratic formula to find that the solutions are $9$ and $-29/3.$ Because the base must be positive, $n=9.$ Adding 2 to 9 gets $\boxed{\textbf{(B)} ~11}$

Since two parallel chords have the same length ($38$), they must be equidistant from the center of the circle. Let the perpendicular distance of each chord from the center of the circle be $d$. Thus, the distance from the center of the circle to the chord of length $34$ is \[2d + d = 3d\] The distance between each of the chords is $2d$. Let the radius of the circle be $r$. Drawing radii to the points where the lines intersect the circle, we obtain two different right triangles: - One with base $\dfrac{38}{2} = 19$, height $d$, and hypotenuse $r$ ($\triangle RAO$ in the diagram) - Another with base $\dfrac{34}{2} = 17$, height $3d$, and hypotenuse $r$ ($\triangle LBO$ in the diagram) By the Pythagorean theorem, we obtain the following system of equations: \begin{align*} 19^2 + d^2 &= r^2, \\ 17^2 + (3d)^2 &= r^2. \end{align*} That is, \begin{align*} 361 + d^2 &= r^2, \\ 289 + 9d^2 &= r^2. \end{align*} Set the right-hand sides equal: \[ 361 + d^2 = 289 + 9d^2 \] \[ 361 - 289 = 9d^2 - d^2 \] \[ 72 = 8d^2 \] \[ d^2 = 9 \implies d = 3. \] Thus, \[ 2d = 6. \]

We square $x+\frac{1}{x}=\sqrt5$ to get $x^2+2+\frac{1}{x^2}=5$. We subtract 2 on both sides for $x^2+\frac{1}{x^2}=3$ and square again, and see that $x^4+2+\frac{1}{x^4}=9$ so $x^4+\frac{1}{x^4}=7$. We can factor out $x^7$ from our original expression of $x^{11}-7x^7+x^3$ to get that it is equal to $x^7(x^4-7+\frac{1}{x^4})$. Therefore because $x^4+\frac{1}{x^4}$ is 7, it is equal to $x^7(0)=\boxed{\textbf{(B) } 0}$.

The divisibility rule of $15$ is that the number must be congruent to $0$ mod $3$ and congruent to $0$ mod $5$. Being divisible by $5$ means that it must end with a $5$ or a $0$. We can rule out the case when the number ends with a $0$ immediately because the only integer that is uphill and ends with a $0$ is $0$ which is not positive. So now we know that the number ends with a $5$. Looking at the answer choices, the answer choices are all pretty small, so we can generate all of the numbers that are uphill and are divisible by $3$. These numbers are $15, 45, 135, 345, 1245, 12345$, or $\boxed{\textbf{(C)} ~6}$ numbers.

By logical deduction, we consider the scores from lowest to highest: \begin{align*} \text{Oscar's score is 4.} &\implies \text{Oscar is given cards 1 and 3.} \\ &\implies \text{Aditi is given cards 2 and 5.} \\ &\implies \text{Ravon is given cards 4 and 7.} && (\bigstar) \\ &\implies \text{Tyrone is given cards 6 and 10.} \\ &\implies \text{Kim is given cards 8 and 9.} \end{align*} Therefore, the answer is $\boxed{\textbf{(C) }\text{Ravon was given card 4.}}$ Certainly, if we read the answer choices sooner, then we can stop at $(\bigstar)$ and pick $\textbf{(C)}.$

Since 3 out of 6 of the numbers are even, there is a $\frac36$ chance that the first number we choose is even. Since the number rolled first is irrelevant, we don't have to consider it. Therefore there are 2 even numbers out of the 5 choices left. There is a $\frac{2}{5}$ chance that the next number that is distinct from the first is even. There is a $\frac{1}{4}$ chance that the next number distinct from the first two is even. (There is only one even integer left. ) With all the even integers taken, the next integer rolled must be odd. $\frac{3}{6} \cdot \frac{2}{5} \cdot \frac{1}{4} = \frac{1}{20}$, so the answer is $\boxed{\textbf{(C) }\frac{1}{20}}.$

We can then say that A+S(n)n+1=32, S(n)n=35, and B+S(n)n+1=40. Expanding gives us A+S(n)=32n+32, S(n)=35n, and B+S(n)=40n+40. Substituting S(n)=35n to all gives us A+35n=32n+32 and B+35n=40n+40. Solving for A and B gives A=−3n+32 and B=5n+40. We now need to find S(n)+A+Bn+2. We substitute everything to get 35n+(−3n+32)+(5n+40)n+2, or 37n+72n+2. Say that the answer to this is Z. Then, Z needs to be a number that makes n a positive integer. The only options that work is $\boxed{\textbf{(C) }36.6}$ and $\boxed{\textbf{(D) }36.8}$. However, if 36.6 is an option, we get n=3. So that means that A is 23 and B is 55, and S(n)=105. But if there is 3 terms, then the middle number is 105, but we said that B is the largest number in the set, so therefore our answer cannot be $\boxed{\textbf{(C) }36.6}$ and is instead $\boxed{\textbf{(D) }36.8}$ and now, we're finished! If A is smaller than B by 72 therefore from the equation on the top you can find out that N=8 using substitution the plug it in to the equation 37n+72n+2 then you will get that Z = $\boxed{\textbf{(D) }36.8}$.

Draw diagonals $AC$ and $AD$ to split the pentagon into three parts. We can compute the area for each triangle and sum them up at the end. For triangles $ABC$ and $ADE$, they each have area $2\cdot\frac{1}{2}\cdot\frac{4\sqrt{3}}{4}=\sqrt{3}$. For triangle $ACD$, we can see that $AC=AD=2\sqrt{3}$ and $CD=2$. Using Pythagorean Theorem, the altitude for this triangle is $\sqrt{11}$, so the area is $\sqrt{11}$. Adding each part up, we get $2\sqrt{3}+\sqrt{11}=\sqrt{12}+\sqrt{11} \implies \boxed{\textbf{(D)} ~23}$. Note: Another easier way to find the areas would be to use the formula $A=\frac12ab\sin C$ - erringbubble

We can set the point on $CD$ where the fold occurs as point $F$. Then, we can set $FD$ as $x$, and $CF$ as $1-x$ because of symmetry due to the fold. It can be recognized that this is a right triangle, and solving for $x$, we get, \[x^2 + \left(\frac{1}{3}\right)^2 = (1-x)^2 \rightarrow x^2 + \frac{1}{9} = x^2 - 2x + 1 \rightarrow x=\frac{4}{9}\] We know this is a 3-4-5 triangle because the side lengths are $\frac{3}{9}, \frac{4}{9}, \frac{5}{9}$. We also know that $EAC'$ is similar to $C'DF$ because angle $EC'F$ is a right angle. Now, we can use similarity to find out that the perimeter is just the perimeter of $C'DF \times \frac{AC'}{DF}$. That's just $\frac{4}{3} \times \frac{\frac{2}{3}}{\frac{4}{9}} = \frac{4}{3} \times \frac{3}{2} = 2$. Therefore, the final answer is $\boxed{\textbf{(A)} ~2}$

Let our denominator be $(5!)^3$, so we consider all possible distributions. We use PIE (Principle of Inclusion and Exclusion) to count the successful ones. When we have at $1$ box with all $3$ blocks the same color in that box, there are $_{5} C _{1} \cdot _{5} P _{1} \cdot (4!)^3$ ways for the distributions to occur ($_{5} C _{1}$ for selecting one of the five boxes for a uniform color, $_{5} P _{1}$ for choosing the color for that box, $4!$ for each of the three people to place their remaining items). However, we overcounted those distributions where two boxes had uniform color, and there are $_{5} C _{2} \cdot _{5} P _{2} \cdot (3!)^3$ ways for the distributions to occur ($_{5} C _{2}$ for selecting two of the five boxes for a uniform color, $_{5} P _{2}$ for choosing the color for those boxes, $3!$ for each of the three people to place their remaining items). Again, we need to re-add back in the distributions with three boxes of uniform color... and so on so forth. Our success by PIE is \[_{5} C _{1} \cdot _{5} P _{1} \cdot (4!)^3 - _{5} C _{2} \cdot _{5} P _{2} \cdot (3!)^3 + _{5} C _{3} \cdot _{5} P _{3} \cdot (2!)^3 - _{5} C _{4} \cdot _{5} P _{4} \cdot (1!)^3 + _{5} C _{5} \cdot _{5} P _{5} \cdot (0!)^3 = 120 \cdot 2556.\] \[\frac{120 \cdot 2556}{120^3}=\frac{71}{400},\] yielding an answer of $\boxed{\textbf{(D) }471}$. As In Solution 1, the probability is \[\frac{\binom{5}{1}\cdot 5\cdot (4!)^3 - \binom{5}{2}\cdot 5\cdot 4\cdot (3!)^3 + \binom{5}{3}\cdot 5\cdot 4\cdot 3\cdot (2!)^3 - \binom{5}{4}\cdot 5\cdot 4\cdot 3\cdot 2\cdot (1!)^3 + \binom{5}{5}\cdot 5\cdot 4\cdot 3\cdot 2\cdot 1}{(5!)^3}\] \[= \frac{5\cdot 5\cdot (4!)^3 - 10\cdot 5\cdot 4\cdot (3!)^3 + 10\cdot 5\cdot 4\cdot 3\cdot (2!)^3 - 5\cdot 5! + 5!}{(5!)^3}.\] Dividing by $5!$, we get \[\frac{5\cdot (4!)^2 - 10\cdot (3!)^2 + 10\cdot (2!)^2 - 5 + 1}{(5!)^2}.\] Dividing by $4$, we get \[\frac{5\cdot 6\cdot 24 - 10\cdot 9 + 10 - 1}{30\cdot 120}.\] Dividing by $9$, we get \[\frac{5\cdot 2\cdot 8 - 10 + 1}{10\cdot 40} = \frac{71}{400} \implies \boxed{\textbf{(D) }471}.\]

To find the probability, we look at the $\frac{\text{success region}}{\text{total possible region}}$. For the coin to be completely contained within the square, we must have the distance from the center of the coin to a side of the square to be at least $\frac{1}{2}$, as it's the radius of the coin. This implies the $\text{total possible region}$ is a square with side length $8 - \frac{1}{2} - \frac{1}{2} = 7$, with an area of $49$. Now, we consider cases where needs to land to partially cover a black region. Near The Center Square We can have the center of the coin land within $\frac{1}{2}$ outside of the center square, or inside of the center square. So, we have a region with $\frac{1}{2}$ emanating from every point on the exterior of the square, forming four quarter circles and four rectangles. The four quarter circles combine to make a full circle of radius $\frac{1}{2}$, so the area is $\frac{\pi}{4}$. The area of a rectangle is $2 \sqrt 2 \cdot \frac{1}{2} = \sqrt 2$, so $4$ of them combine to an area of $4 \sqrt 2$. The area of the black square is simply $\left(2\sqrt 2\right)^2 = 8$. So, for this case, we have a combined total of $8 + 4\sqrt 2 + \frac{\pi}{4}$. Onto the second (and last) case. Near A Triangle We can also have the coin land within $\frac{1}{2}$ outside of one of the triangles. By symmetry, we can just find the successful region for one of them, then multiply by $4$. Consider the above diagram. We can draw an altitude from the bottom corner of the square to hit the hypotenuse of the green triangle. The length of this when passing through the black region is $\sqrt 2$, and when passing through the white region (while being contained in the green triangle) is $\frac{1}{2}$. However, we have to subtract off when it doesn't pass through the red square. Then, it's the hypotenuse of a small isosceles right triangle with side lengths of $\dfrac{1}{2}$ which is $\dfrac{\sqrt{2}}{2}.$ So, the altitude of the green triangle is $\sqrt 2 + \frac{1}{2} - \frac{\sqrt 2}{2} = \frac{\sqrt 2 + 1}{2}$. Then, recall, the area of an isosceles right triangle is $h^2$, where $h$ is the altitude from the right angle. So, squaring this, we get $\frac{3 + 2\sqrt 2}{4}$. Now, we have to multiply this by $4$ to account for all of the black triangles, to get $3 + 2\sqrt 2$ as the final area for this case. Finishing Then, to have the coin touching a black region, we add up the area of our successful regions, or $8 + 4\sqrt 2 + \frac{\pi}{4} + 3 + 2\sqrt 2 = 11 + 6\sqrt 2 + \frac{\pi}{4} = \frac{44 + 24\sqrt 2 + \pi}{4}$. The total region is $49$, so our probability is $\frac{\frac{44 + 24\sqrt 2 + \pi}{4}}{49} = \frac{44 + 24\sqrt 2 + \pi}{196}$, which implies $a+b = 44+24 = 68$. This corresponds to answer choice $\boxed{\textbf{(C)} ~68}$. Error creating thumbnail: Unable to save thumbnail to destination

We say that a game state is an N-position if it is winning for the next player (the player to move), and a P-position if it is winning for the other player. We are trying to find which of the given states is a P-position. First we note that symmetrical positions are P-positions, as the second player can win by mirroring the first player's moves. It follows that $(6, 1, 1)$ is an N-position, since we can win by moving to $(2, 2, 1, 1)$; this rules out $\textbf{(A)}$. We next look at $(6, 2, 1)$. The possible next states are \[(6, 2), (6, 1, 1), (6, 1), (5, 2, 1), (4, 2, 1, 1), (4, 2, 1), (3, 2, 2, 1), (3, 2, 1, 1), (2, 2, 2, 1).\] None of these are symmetrical, so we might reasonably suspect that they are all N-positions. Indeed, it just so happens that for all of these states except $(6, 2)$ and $(6, 1)$, we can win by moving to $(2, 2, 1, 1)$; it remains to check that $(6, 2)$ and $(6, 1)$ are N-positions. To save ourselves work, it would be nice if we could find a single P-position directly reachable from both $(6, 2)$ and $(6, 1)$. We notice that $(3, 2, 1)$ is directly reachable from both states, so it would suffice to show that $(3, 2, 1)$ is a P-position. Indeed, the possible next states are \[(3, 2), (3, 1, 1), (3, 1), (2, 2, 1), (2, 1, 1, 1), (2, 1, 1),\] which allow for the following refutations: \begin{align*} &(3, 2) \to (2, 2), && &&(3, 1, 1) \to (1, 1, 1, 1), && &&(3, 1) \to (1, 1), \\ &(2, 2, 1) \to (2, 2), && &&(2, 1, 1, 1) \to (1, 1, 1, 1), && &&(2, 1, 1) \to (1, 1). \end{align*} Hence, $(3, 2, 1)$ is a P-position, so $(6, 2)$ and $(6, 1)$ are both N-positions, along with all other possible next states from $(6, 2, 1)$ as noted before. Thus, $(6, 2, 1)$ is a P-position, so our answer is $\boxed{\textbf{(B)}}$.

First, we find a numerical representation for the number of lattice points in $S$ that are under the line $y=mx.$ For any value of $x,$ the highest lattice point under $y=mx$ is $\lfloor mx \rfloor.$ Because every lattice point from $(x, 1)$ to $(x, \lfloor mx \rfloor)$ is under the line, the total number of lattice points under the line is $\sum_{x=1}^{30}(\lfloor mx \rfloor).$ Now, we proceed by finding lower and upper bounds for $m.$ To find the lower bound, we start with an approximation. If $300$ lattice points are below the line, then around $\frac{1}{3}$ of the area formed by $S$ is under the line. By using the formula for a triangle's area, we find that when $x=30, y \approx 20.$ Solving for $m$ assuming that $(30, 20)$ is a point on the line, we get $m = \frac{2}{3}.$ Plugging in $m$ to $\sum_{x=1}^{30}(\lfloor mx \rfloor),$ we get: \[\sum_{x=1}^{30}(\lfloor \frac{2}{3}x \rfloor) = 0 + 1 + 2 + 2 + 3 + \cdots + 18 + 18 + 19 + 20\] We have a repeat every $3$ values (every time $y=\frac{2}{3}x$ goes through a lattice point). Thus, we can use arithmetic sequences to calculate the value above: \[\sum_{x=1}^{30}(\lfloor \frac{2}{3}x \rfloor) = 0 + 1 + 2 + 2 + 3 + \cdots + 18 + 18 + 19 + 20\]\[=\frac{20(21)}{2} + 2 + 4 + 6 + \cdots + 18\]\[=210 + \frac{20}{2}\cdot 9\]\[=300\] This means that $\frac{2}{3}$ is a possible value of $m.$ Furthermore, it is the lower bound for $m.$ This is because $y=\frac{2}{3}x$ goes through many points (such as $(21, 14)$). If $m$ was lower, $y=mx$ would no longer go through some of these points, and there would be less than $300$ lattice points under it. Now, we find an upper bound for $m.$ Imagine increasing $m$ slowly and rotating the line $y=mx,$ starting from the lower bound of $m=\frac{2}{3}.$The upper bound for $m$ occurs when $y=mx$ intersects a lattice point again (look at this problem to get a better idea of what's happening: https://artofproblemsolving.com/wiki/index.php/2011_AMC_10B_Problems/Problem_24). In other words, we are looking for the first $m > \frac{2}{3}$ that is expressible as a ratio of positive integers $\frac{p}{q}$ with $q \le 30.$ For each $q=1,\dots,30$, the smallest multiple of $\frac{1}{q}$ which exceeds $\frac{2}{3}$ is $1, \frac{2}{2}, \frac{3}{3}, \frac{3}{4}, \frac{4}{5}, \cdots , \frac{19}{27}, \frac{19}{28}, \frac{20}{29}, \frac{21}{30}$ respectively, and the smallest of these is $\frac{19}{28}.$ Alternatively, see the method of finding upper bounds in solution 2. The lower bound is $\frac{2}{3}$ and the upper bound is $\frac{19}{28}.$ Their difference is $\frac{1}{84},$ so the answer is $1 + 84 = \boxed{85}.$