Navvye/Olympiad-Problems-CSV huggingface dataset:
Problem: The diagram below shows the circular face of a clock with radius $20$ cm and a circular disk with radius $10$ cm externally tangent to the clock face at $12$ o' clock. The disk has an arrow painted on it, initially pointing in the upward vertical direction. Let the disk roll clockwise around the clock face. At what point on the clock face will the disk be tangent when the arrow is next pointing in the upward vertical direction?
[asy]size(170);defaultpen(linewidth(0.9)+fontsize(13pt));draw(unitcircle^^circle((0,1.5),0.5)); path arrow = origin--(-0.13,-0.35)--(-0.06,-0.35)--(-0.06,-0.7)--(0.06,-0.7)--(0.06,-0.35)--(0.13,-0.35)--cycle; for(int i=1;i<=12;i=i+1){draw(0.9*dir(90-30*i)--dir(90-30*i));label("$"+(string) i+"$",0.78*dir(90-30*i));} dot(origin);draw(shift((0,1.87))*arrow);draw(arc(origin,1.5,68,30),EndArrow(size=12));[/asy]
$\textbf{(A) }\text{2 o' clock} \qquad\textbf{(B) }\text{3 o' clock} \qquad\textbf{(C) }\text{4 o' clock} \qquad\textbf{(D) }\text{6 o' clock} \qquad\textbf{(E) }\text{8 o' clock}$

Solution: The rotation factor of the arrow is the sum of the rates of the regular rotation of the arrow (360° every 360° rotation = 1) and the rotation of the disk around the clock with twice the circumference (360° every 180° = 2). Thus, the rotation factor of the arrow is 3, and so our answer corresponds to 360°/3 = 120°, which is 4 o' clock. $\boxed{4}$

Answer: C 4
Problem: The diagram below shows the circular face of a clock with radius $20$ cm and a circular disk with radius $10$ cm externally tangent to the clock face at $12$ o' clock. The disk has an arrow painted on it, initially pointing in the upward vertical direction. Let the disk roll clockwise around the clock face. At what point on the clock face will the disk be tangent when the arrow is next pointing in the upward vertical direction?
[asy]size(170);defaultpen(linewidth(0.9)+fontsize(13pt));draw(unitcircle^^circle((0,1.5),0.5)); path arrow = origin--(-0.13,-0.35)--(-0.06,-0.35)--(-0.06,-0.7)--(0.06,-0.7)--(0.06,-0.35)--(0.13,-0.35)--cycle; for(int i=1;i<=12;i=i+1){draw(0.9*dir(90-30*i)--dir(90-30*i));label("$"+(string) i+"$",0.78*dir(90-30*i));} dot(origin);draw(shift((0,1.87))*arrow);draw(arc(origin,1.5,68,30),EndArrow(size=12));[/asy]
$\textbf{(A) }\text{2 o' clock} \qquad\textbf{(B) }\text{3 o' clock} \qquad\textbf{(C) }\text{4 o' clock} \qquad\textbf{(D) }\text{6 o' clock} \qquad\textbf{(E) }\text{8 o' clock}$

Solution: The arrow travels a path of radius 30 (20 from the interior clock and 10 from the radius of the disk itself). We note that 1 complete rotation of 360 degrees is needed for the arrow to appear up again, so, therefore, the disk must travel its circumference before the arrow goes up. Its circumference is $20\pi$ , so that is $20\pi$ traveled on a $60\pi$ arrow path. This is a ratio of 1/3, so the angle it carves is 120 degrees, which leads us to the correct answer of  4 o' clock. $\boxed{4}$

Answer: C 4
Problem: The diagram below shows the circular face of a clock with radius $20$ cm and a circular disk with radius $10$ cm externally tangent to the clock face at $12$ o' clock. The disk has an arrow painted on it, initially pointing in the upward vertical direction. Let the disk roll clockwise around the clock face. At what point on the clock face will the disk be tangent when the arrow is next pointing in the upward vertical direction?
[asy]size(170);defaultpen(linewidth(0.9)+fontsize(13pt));draw(unitcircle^^circle((0,1.5),0.5)); path arrow = origin--(-0.13,-0.35)--(-0.06,-0.35)--(-0.06,-0.7)--(0.06,-0.7)--(0.06,-0.35)--(0.13,-0.35)--cycle; for(int i=1;i<=12;i=i+1){draw(0.9*dir(90-30*i)--dir(90-30*i));label("$"+(string) i+"$",0.78*dir(90-30*i));} dot(origin);draw(shift((0,1.87))*arrow);draw(arc(origin,1.5,68,30),EndArrow(size=12));[/asy]
$\textbf{(A) }\text{2 o' clock} \qquad\textbf{(B) }\text{3 o' clock} \qquad\textbf{(C) }\text{4 o' clock} \qquad\textbf{(D) }\text{6 o' clock} \qquad\textbf{(E) }\text{8 o' clock}$

Solution: We can approach this problem with angle measures. As the circumference of the disk is $10\pi,$ and the clock $20 \pi,$ we have that 30 degrees, or the angular measure between hours, of the disk is only 15 degrees of the clock. This yields that every two hour ticks that the clock rotates, on the third one, the ticks will meet. However, the disk must rotate 360 degrees in order to come back to its original position, so the angular measure that the disk has covered relative to the clock is simply $12 \cdot 15 \cdot \frac{2}{3},$ or $120^\circ$ from the 12 starting point, so $\boxed{4}$

Answer: C 4
Problem: The diagram below shows the circular face of a clock with radius $20$ cm and a circular disk with radius $10$ cm externally tangent to the clock face at $12$ o' clock. The disk has an arrow painted on it, initially pointing in the upward vertical direction. Let the disk roll clockwise around the clock face. At what point on the clock face will the disk be tangent when the arrow is next pointing in the upward vertical direction?
[asy]size(170);defaultpen(linewidth(0.9)+fontsize(13pt));draw(unitcircle^^circle((0,1.5),0.5)); path arrow = origin--(-0.13,-0.35)--(-0.06,-0.35)--(-0.06,-0.7)--(0.06,-0.7)--(0.06,-0.35)--(0.13,-0.35)--cycle; for(int i=1;i<=12;i=i+1){draw(0.9*dir(90-30*i)--dir(90-30*i));label("$"+(string) i+"$",0.78*dir(90-30*i));} dot(origin);draw(shift((0,1.87))*arrow);draw(arc(origin,1.5,68,30),EndArrow(size=12));[/asy]
$\textbf{(A) }\text{2 o' clock} \qquad\textbf{(B) }\text{3 o' clock} \qquad\textbf{(C) }\text{4 o' clock} \qquad\textbf{(D) }\text{6 o' clock} \qquad\textbf{(E) }\text{8 o' clock}$

Solution: If the big clock were a flat plane, then the smaller clock could travel $\dfrac{40\pi}{20\pi}=2$ full revolutions.
But we also need to account for rotation. If we mark a red dot on the bottom of the small clock/bottom of the arrow, and then drag it around the clock, the direction of the arrow would still change. After traveling around the big clock, the small clock would travel $1$ full rotation.
Considering these two movements, the small clock travels 3 full rotations around the big clock so the arrow is next pointing upwards at $\dfrac{12 \text{ o'clock}}{3}=\boxed{4}$

Answer: C 4
Problem: The diagram below shows the circular face of a clock with radius $20$ cm and a circular disk with radius $10$ cm externally tangent to the clock face at $12$ o' clock. The disk has an arrow painted on it, initially pointing in the upward vertical direction. Let the disk roll clockwise around the clock face. At what point on the clock face will the disk be tangent when the arrow is next pointing in the upward vertical direction?
[asy]size(170);defaultpen(linewidth(0.9)+fontsize(13pt));draw(unitcircle^^circle((0,1.5),0.5)); path arrow = origin--(-0.13,-0.35)--(-0.06,-0.35)--(-0.06,-0.7)--(0.06,-0.7)--(0.06,-0.35)--(0.13,-0.35)--cycle; for(int i=1;i<=12;i=i+1){draw(0.9*dir(90-30*i)--dir(90-30*i));label("$"+(string) i+"$",0.78*dir(90-30*i));} dot(origin);draw(shift((0,1.87))*arrow);draw(arc(origin,1.5,68,30),EndArrow(size=12));[/asy]
$\textbf{(A) }\text{2 o' clock} \qquad\textbf{(B) }\text{3 o' clock} \qquad\textbf{(C) }\text{4 o' clock} \qquad\textbf{(D) }\text{6 o' clock} \qquad\textbf{(E) }\text{8 o' clock}$

Solution: The center of rotation is in the center of the smaller circle, but extends to the center of the larger circle. That means the circumference of the circle in relation to the arrow is $60 \pi$ . The other circle is $20 \pi$ and so that is $\frac{1}{3}$ . So $\frac{12}{3} = 4$ which is $\boxed{4}$

Answer: C 4
Problem: The diagram below shows the circular face of a clock with radius $20$ cm and a circular disk with radius $10$ cm externally tangent to the clock face at $12$ o' clock. The disk has an arrow painted on it, initially pointing in the upward vertical direction. Let the disk roll clockwise around the clock face. At what point on the clock face will the disk be tangent when the arrow is next pointing in the upward vertical direction?
[asy]size(170);defaultpen(linewidth(0.9)+fontsize(13pt));draw(unitcircle^^circle((0,1.5),0.5)); path arrow = origin--(-0.13,-0.35)--(-0.06,-0.35)--(-0.06,-0.7)--(0.06,-0.7)--(0.06,-0.35)--(0.13,-0.35)--cycle; for(int i=1;i<=12;i=i+1){draw(0.9*dir(90-30*i)--dir(90-30*i));label("$"+(string) i+"$",0.78*dir(90-30*i));} dot(origin);draw(shift((0,1.87))*arrow);draw(arc(origin,1.5,68,30),EndArrow(size=12));[/asy]
$\textbf{(A) }\text{2 o' clock} \qquad\textbf{(B) }\text{3 o' clock} \qquad\textbf{(C) }\text{4 o' clock} \qquad\textbf{(D) }\text{6 o' clock} \qquad\textbf{(E) }\text{8 o' clock}$

Solution: Let the center of the disk be Planet X with orbit eccentricity $0$ and the center of the clock be the Sun. Note that the question would then be asking for the solar day of Planet X, rather than the sidereal day. Because planet X is rotating around its axis in the same direction as it is revolving around the Sun, the solar day can be calculated as $d_{solar}=\frac{1}{\frac{1}{y}+\frac{1}{d_{siderial}}}$ , where $y$ is the length of the year of Planet X and $d_{siderial}$ is one sidereal day. It is easy to see that $y=12$ and $d_{siderial}=6$ , therefore the answer is $\frac{1}{\frac{1}{12}+\frac{1}{6}}=\frac{1}{\frac{1}{4}}=\boxed{4}$ ~sigmapie

Answer: C 4
Problem: Consider the set of all fractions $\frac{x}{y}$ , where $x$ and $y$ are relatively prime positive integers. How many of these fractions have the property that if both numerator and denominator are increased by $1$ , the value of the fraction is increased by $10\%$
$\textbf{(A) }0\qquad\textbf{(B) }1\qquad\textbf{(C) }2\qquad\textbf{(D) }3\qquad\textbf{(E) }\text{infinitely many}$

Solution: You can create the equation $\frac{x+1}{y+1}=\frac{11x}{10y}$
Cross multiplying and combining like terms gives $xy + 11x - 10y = 0$
This can be factored into $(x - 10)(y + 11) = -110$
$x$ and $y$ must be positive, so $x > 0$ and $y > 0$ , so $x - 10> -10$ and $y + 11 > 11$
Using the factors of 110, we can get the factor pairs: $(-1, 110),$ $(-2, 55),$ and $(-5, 22).$
But we can't stop here because $x$ and $y$ must be relatively prime.
$(-1, 110)$ gives $x = 9$ and $y = 99$ $9$ and $99$ are not relatively prime, so this doesn't work.
$(-2, 55)$ gives $x = 8$ and $y = 44$ . This doesn't work.
$(-5, 22)$ gives $x = 5$ and $y = 11$ . This does work.
We found one valid solution so the answer is $\boxed{1}$

Answer: B 1
Problem: Consider the set of all fractions $\frac{x}{y}$ , where $x$ and $y$ are relatively prime positive integers. How many of these fractions have the property that if both numerator and denominator are increased by $1$ , the value of the fraction is increased by $10\%$
$\textbf{(A) }0\qquad\textbf{(B) }1\qquad\textbf{(C) }2\qquad\textbf{(D) }3\qquad\textbf{(E) }\text{infinitely many}$

Solution: The condition required is $\frac{x+1}{y+1}=\frac{11}{10}\cdot\frac{x}{y}$
Observe that $x+1 > \frac{11}{10}\cdot x$ so $x$ is at most $9.$
By multiplying by $\frac{y+1}{x}$ and simplifying we can rewrite the condition as $y=\frac{11x}{10-x}$ .  Since $x$ and $y$ are integer, this only has solutions for $x\in\{5,8,9\}$ .  However, only the first yields a $y$ that is relative prime to $x$
There is only one valid solution so the answer is $\boxed{1}$

Answer: B 1
Problem: Hexadecimal (base-16) numbers are written using numeric digits $0$ through $9$ as well as the letters $A$ through $F$ to represent $10$ through $15$ . Among the first $1000$ positive integers, there are $n$ whose hexadecimal representation contains only numeric digits. What is the sum of the digits of $n$
$\textbf{(A) }17\qquad\textbf{(B) }18\qquad\textbf{(C) }19\qquad\textbf{(D) }20\qquad\textbf{(E) }21$

Solution: Notice that $1000$ is $3E8$ when converted to hexadecimal ( $3 \cdot 16^2 + 14 \cdot 16^1 + 8 \cdot 16^0$ ). We will proceed by constructing numbers that consist of only numeric digits in hexadecimal.
The first digit could be $0,$ $1,$ $2,$ or $3,$ and the second two could be any digit $0 - 9$ , giving $4 \cdot 10 \cdot 10 = 400$ combinations. However, this includes $000,$ so this number must be diminished by $1.$ Therefore, there are $399$ valid $n$ corresponding to those $399$ positive integers less than $1000$ that consist of only numeric digits.  (Notice that $399$ is the least hexadecimal number using only decimal digits before $3E8$ .)  Therefore, our answer is $3 + 9 + 9 = \boxed{21}$

Answer: E 21
Problem: Hexadecimal (base-16) numbers are written using numeric digits $0$ through $9$ as well as the letters $A$ through $F$ to represent $10$ through $15$ . Among the first $1000$ positive integers, there are $n$ whose hexadecimal representation contains only numeric digits. What is the sum of the digits of $n$
$\textbf{(A) }17\qquad\textbf{(B) }18\qquad\textbf{(C) }19\qquad\textbf{(D) }20\qquad\textbf{(E) }21$

Solution: First, we set a bound by writing $1000$ in base- $16$ $1000_{10}=3E8_{16}$ . Therefore, we are considering numbers with a maximum of $3$ digits, and a maximum of $3$ in the $256$ ths-place (the first place in a $3$ -digit number).
Case $1$ $1$ -digit numbers:
There are evidently $9$ numbers that fit this category.
Case $2$ $2$ -digit numbers:
There are $9\cdot10=90$ numbers that fit this category.
Case $3$ $3$ -digit numbers:
There are $3\cdot10\cdot10=300$ numbers that fit this category
Adding these up, we get $9+90+300=399$ numbers. $3 + 9 + 9 = \boxed{21}$ ~sosiaops

Answer: E 21
Problem: Hexadecimal (base-16) numbers are written using numeric digits $0$ through $9$ as well as the letters $A$ through $F$ to represent $10$ through $15$ . Among the first $1000$ positive integers, there are $n$ whose hexadecimal representation contains only numeric digits. What is the sum of the digits of $n$
$\textbf{(A) }17\qquad\textbf{(B) }18\qquad\textbf{(C) }19\qquad\textbf{(D) }20\qquad\textbf{(E) }21$

Solution: We can quickly see that $400$ in hexadecimal = $0+0+256*4$ = 1024. If we go down to 399 in hexadecimal, we have $9+9*16+3*256$ which is $921$ , which is obviously less than 1000. Therefore, the answer is $3+9+9$ $\boxed{21}$

Answer: E 21
Problem: A rectangle with positive integer side lengths in $\text{cm}$ has area $A$ $\text{cm}^2$ and perimeter $P$ $\text{cm}$ . Which of the following numbers cannot equal $A+P$
$\textbf{(A) }100\qquad\textbf{(B) }102\qquad\textbf{(C) }104\qquad\textbf{(D) }106\qquad\textbf{(E) }108$

Solution: Let the rectangle's length be $a$ and its width be $b$ . Its area is $ab$ and the perimeter is $2a+2b$
Then $A + P = ab + 2a + 2b$ . Factoring, we have $(a + 2)(b + 2) - 4$
The only one of the answer choices that cannot be expressed in this form is $102$ , as $102 + 4$ is twice a prime. There would then be no way to express $106$ as $(a + 2)(b + 2)$ , keeping $a$ and $b$ as positive integers.
Our answer is then $\boxed{102}$

Answer: B 102
Problem: The zeroes of the function $f(x)=x^2-ax+2a$ are integers. What is the sum of the possible values of $a?$
$\textbf{(A)}\ 7\qquad\textbf{(B)}\ 8\qquad\textbf{(C)}\ 16\qquad\textbf{(D)}\ 17\qquad\textbf{(E)}\ 18$

Solution: By Vieta's Formula, $a$ is the sum of the integral zeros of the function, and so $a$ is integral.
Because the zeros are integral, the discriminant of the function, $a^2 - 8a$ , is a perfect square, say $k^2$ . Then adding 16 to both sides and completing the square yields \[(a - 4)^2 = k^2 + 16.\] Therefore $(a-4)^2 - k^2 = 16$ and \[((a-4) - k)((a-4) + k) = 16.\] Let $(a-4) - k = u$ and $(a-4) + k = v$ ; then, $a-4 = \dfrac{u+v}{2}$ and so $a = \dfrac{u+v}{2} + 4$ . Listing all possible $(u, v)$ pairs (not counting transpositions because this does not affect ( $u + v$ ), $(2, 8), (4, 4), (-2, -8), (-4, -4)$ , yields $a = 9, 8, -1, 0$ . These $a$ sum to $16$ , so our answer is $\boxed{16}$

Answer: C 16
Problem: The zeroes of the function $f(x)=x^2-ax+2a$ are integers. What is the sum of the possible values of $a?$
$\textbf{(A)}\ 7\qquad\textbf{(B)}\ 8\qquad\textbf{(C)}\ 16\qquad\textbf{(D)}\ 17\qquad\textbf{(E)}\ 18$

Solution: Let $r_1$ and $r_2$ be the integer zeroes of the quadratic. Since the coefficient of the $x^2$ term is $1$ , the quadratic can be written as \[(x - r_1)(x - r_2)=x^2 - (r_1 + r_2)x + r_1r_2\]
By comparing this with $x^2 - ax + 2a$ \[r_1 + r_2 = a\text{ and }r_1r_2 = 2a.\]
Plugging the first equation in the second, \[r_1r_2 = 2 (r_1 + r_2).\] Rearranging gives \[r_1r_2 - 2r_1 - 2r_2 = 0\implies (r_1 - 2)(r_2 - 2) = 4.\] These factors can be $(1, 4), (-1, -4), (4, 1), (-4, -1), (2, 2),$ or $(-2, -2).$
We want the number of distinct $a = r_1 + r_2$ , and these factors gives $a = -1, 0, 8, 9$ . So the answer is $-1 + 0 + 8 + 9 = \boxed{16}$

Answer: C 16
Problem: For some positive integers $p$ , there is a quadrilateral $ABCD$ with positive integer side lengths, perimeter $p$ , right angles at $B$ and $C$ $AB=2$ , and $CD=AD$ .  How many different values of $p<2015$ are possible?
$\textbf{(A) }30\qquad\textbf{(B) }31\qquad\textbf{(C) }61\qquad\textbf{(D) }62\qquad\textbf{(E) }63$

Solution: Let $BC = x$ and $CD = AD = y$ be positive integers. Drop a perpendicular from $A$ to $CD$ to show that, using the Pythagorean Theorem, that \[x^2 + (y - 2)^2 = y^2.\] Simplifying yields $x^2 - 4y + 4 = 0$ , so $x^2 = 4(y - 1)$ . Thus, $y$ is one more than a perfect square.
The perimeter $p = 2 + x + 2y = 2y + 2\sqrt{y - 1} + 2$ must be less than 2015. Simple calculations demonstrate that $y = 31^2 + 1 = 962$ is valid, but $y = 32^2 + 1 = 1025$ is not. On the lower side, $y = 1$ does not work (because $x > 0$ ), but $y = 1^2 + 1$ does work. Hence, there are 31 valid $y$ (all $y$ such that $y = n^2 + 1$ for $1 \le n \le 31$ ), and so our answer is $\boxed{31}$

Answer: B 31
Problem: For some positive integers $p$ , there is a quadrilateral $ABCD$ with positive integer side lengths, perimeter $p$ , right angles at $B$ and $C$ $AB=2$ , and $CD=AD$ .  How many different values of $p<2015$ are possible?
$\textbf{(A) }30\qquad\textbf{(B) }31\qquad\textbf{(C) }61\qquad\textbf{(D) }62\qquad\textbf{(E) }63$

Solution: Let $BC = x$ and $CD = AD = z$ be positive integers. Drop a perpendicular from $A$ to $CD$ . Denote the intersection point of the perpendicular and $CD$ as $E$
$AE$ 's length is $x$ , as well.
Call $ED$ $y$ .
By the Pythagorean Theorem, $x^2 + y^2 = (y + 2)^2$ .
And so: $x^2 = 4y + 4$ , or $y = (x^2-4)/4$
Writing this down and testing, it appears that this holds for all $x$ . However, since there is a dividend of 4, the numerator must be divisible by 4 to conform to the criteria that the side lengths are positive integers.
In effect, $x$ must be a multiple of 2 to let the side lengths be integers. We test, and soon reach 62. It gives us $p = 1988$ , which is less than 2015. However, 64 gives us $2116 > 2015$ , so we know 62 is the largest we can go up to. Count all the even numbers from 2 to 62, and we get $\boxed{31}$

Answer: B 31
Problem: Let $S$ be a square of side length $1$ .  Two points are chosen independently at random on the sides of $S$ .  The probability that the straight-line distance between the points is at least $\dfrac{1}{2}$ is $\dfrac{a-b\pi}{c}$ , where $a$ $b$ , and $c$ are positive integers with $\gcd(a,b,c)=1$ .  What is $a+b+c$
$\textbf{(A) }59\qquad\textbf{(B) }60\qquad\textbf{(C) }61\qquad\textbf{(D) }62\qquad\textbf{(E) }63$

Solution: Divide the boundary of the square into halves, thereby forming $8$ segments. Without loss of generality, let the first point $A$ be in the bottom-left segment. Then, it is easy to see that any point in the $5$ segments not bordering the bottom-left segment will be distance at least $\dfrac{1}{2}$ apart from $A$ . Now, consider choosing the second point on the bottom-right segment. The probability for it to be distance at least $0.5$ apart from $A$ is $\dfrac{0 + 1}{2} = \dfrac{1}{2}$ because of linearity of the given probability. (Alternatively, one can set up a coordinate system and use geometric probability.)
If the second point $B$ is on the left-bottom segment, then if $A$ is distance $x$ away from the left-bottom vertex, then $B$ must be up to $\dfrac{1}{2} - \sqrt{0.25 - x^2}$ away from the left-middle point. Thus, using an averaging argument we find that the probability in this case is \[\frac{1}{\left( \frac{1}{2} \right)^2} \int_0^{\frac{1}{2}} \dfrac{1}{2} - \sqrt{0.25 - x^2} dx = 4\left( \frac{1}{4} - \frac{\pi}{16} \right) = 1 - \frac{\pi}{4}.\]
(Alternatively, one can equate the problem to finding all valid $(x, y)$ with $0 < x, y < \dfrac{1}{2}$ such that $x^2 + y^2 \ge \dfrac{1}{4}$ , i.e. $(x, y)$ is outside the unit circle with radius $0.5.$
Thus, averaging the probabilities gives \[P = \frac{1}{8} \left( 5 + \frac{1}{2} + 1 - \frac{\pi}{4} \right) = \frac{1}{32} \left( 26 - \pi \right).\]
Thus our answer is $\boxed{59}$

Answer: A 59
Problem: Let $S$ be a square of side length $1$ .  Two points are chosen independently at random on the sides of $S$ .  The probability that the straight-line distance between the points is at least $\dfrac{1}{2}$ is $\dfrac{a-b\pi}{c}$ , where $a$ $b$ , and $c$ are positive integers with $\gcd(a,b,c)=1$ .  What is $a+b+c$
$\textbf{(A) }59\qquad\textbf{(B) }60\qquad\textbf{(C) }61\qquad\textbf{(D) }62\qquad\textbf{(E) }63$

Solution: Let our points be called Point A and Point B. Let us first choose Point A to be on some side of the square. We have three cases:
Case 1: Point B is on the same side as Point A: This setup occurs with probability $\dfrac{1}{4}.$ This is the standard geometric probability problem. Since Point A and Point B can be anywhere on the side, we can't really "count" all of the possibilities. Hence, we translate the problem to a problem involving areas, which can be a finite value while still "containing" infinitely many points. Let side of a square be a number line from $0$ to $1,$ and $a$ and $b$ be the values representing the positions of Point A and Point B respectively. Our problem now asks for the probability that $|a-b| \geq 1/2.$ Graphing the inequality on a coordinate plane with $a$ and $b$ as the $x$ and $y$ -axes gives us a "good area" of $1/4$ out of a "total area" of $1.$ Hence, the probability the inequality is satisfied is $1/4 \div 1 = 1/4.$
Case 2: Point B is on a side adjacent to the side with Point A: This setup occurs with probability $\dfrac{1}{2}.$ This is a slight deviation of the same geometric probability principle. This time, let the common vertex of the two sides be $0,$ and the sides have side length $1.$ Again, let $a$ and $b$ be the values representing the positions of Point A and Point B respectively, so the Pythagorean Theorem yields $\sqrt{a^2+b^2}\geq 1/2,$ graphing into a quarter circle of radius $1/2,$ and a total area that is $1.$ Hence, our probability is $1-\frac{\pi(1/2)^2}{4} = \frac{16-\pi}{16}.$
Case 3: Point B is on a side opposite to the side with Point A: This setup occurs with probability $\dfrac{1}{4}.$ Clearly, the distance between Point A and Point B are at least 1, so it must be at least $1/2.$ The probability in this case is $1.$
Now taking the probabilities of the setups into account, our final probability is \[\frac{1}{4}\cdot \left( \frac{1}{4} \right)+ \frac{1}{2}\cdot \left(\frac{16-\pi}{16}\right) + \frac{1}{4}\cdot \left(1\right)=\frac{26-\pi}{32}.\] Thus $(a,b,c)=(26,1,32),$ so $a+b+c= \boxed{59}$

Answer: A 59
Problem: Isaac has written down one integer two times and another integer three times. The sum of the five numbers is $100$ , and one of the numbers is $28.$ What is the other number?
$\textbf{(A) }8\qquad\textbf{(B) }11\qquad\textbf{(C) }14\qquad\textbf{(D) }15\qquad\textbf{(E) }18$

Solution: Let the first number be $x$ and the second be $y$ . We have $2x+3y=100$ . We are given one of the numbers is $28$ . If $x$ were to be $28$ $y$ would not be an integer, thus $y=28$ $2x+3(28)=100$ , which gives $x=\boxed{8}$

Answer: A 8