Rectangle $ABCD$ has sides $\overline{AB}$ of length $4$ and $\overline{CB}$ of length $3.$ Divide $\overline{AB}$ into $168$ congruent segments with points $A=P_0,$ $P_1,$ $\ldots,$ $P_{168}=B,$ and divide $\overline{CB}$ into $168$ congruent segments with points $C=Q_0,$ $Q_1,$ $\ldots,$ $Q_{168}=B.$ For $1\leq k\leq167,$ draw the segments $\overline{P_kQ_k}.$ Repeat this construction on the sides $\overline{AD}$ and $\overline{CD},$ and then draw the diagonal $\overline{AC}.$ Find the sum of the lengths of the $335$ parallel segments drawn.
Expanding $(1+0.2)^{1000}$ by the binomial theorem and doing no further manipulation gives $$
\begin{aligned}&\binom{1000}{0}(0.2)^0+\binom{1000}{1}(0.2)^1\\&+\binom{1000}{2}(0.2)^2+\cdots\\&+\binom{1000}{1000}(0.2)^{1000}\\&=A_0+A_1+\cdots+A_{1000},\end{aligned}
$$ where $A_k=\binom{1000}{k}(0.2)^k$ for $k=0,$ $1,$ $2,$ $\ldots,$ $1000.$ For which $k$ is $A_k$ the largest?
Given a rational number, write it as a fraction in lowest terms and calculate the product of the resulting numerator and denominator. For how many rational numbers between $0$ and $1$ will $20!$ be the resulting product?
Suppose $r$ is a real number for which $$
\begin{aligned}&\left\lfloor r+\frac{19}{100}\right\rfloor+\left\lfloor r+\frac{20}{100}\right\rfloor\\&\quad+\left\lfloor r+\frac{21}{100}\right\rfloor+\cdots\\&\quad+\left\lfloor r+\frac{91}{100}\right\rfloor=546.\end{aligned}
$$ Find $\lfloor100r\rfloor.$ (For real $x,$ $\lfloor x\rfloor$ is the greatest integer less than or equal to $x.$)
Find $A^2,$ where $A$ is the sum of the absolute values of all roots of the following equation: $$
x=\sqrt{19}+\cfrac{91}{\sqrt{19}+\cfrac{91}{\sqrt{19}+\cfrac{91}{\sqrt{19}+\cfrac{91}{\sqrt{19}+\cfrac{91}{x}}}}}.
$$
Two three-letter strings, $aaa$ and $bbb,$ are transmitted electronically. Each string is sent letter by letter. Due to faulty equipment, each of the six letters has a $\frac{1}{3}$ chance of being received incorrectly, as an $a$ when it should have been a $b,$ or as a $b$ when it should be an $a.$ However, whether a given letter is received correctly or incorrectly is independent of the reception of any other letter.
Let $S_a$ be the three-letter string received when $aaa$ is transmitted and let $S_b$ be the three-letter string received when $bbb$ is transmitted. Let $p$ be the probability that $S_a$ comes before $S_b$ in alphabetical order. When $p$ is written as a fraction in lowest terms, what is its numerator?
Twelve congruent disks are placed on a circle $C$ of radius $1$ in such a way that the twelve disks cover $C,$ no two of the disks overlap, and so that each of the twelve disks is tangent to its two neighbors. The resulting arrangement of disks is shown in the figure below. The sum of the areas of the twelve disks can be written in the form $\pi(a-b\sqrt c),$ where $a,$ $b,$ $c$ are positive integers and $c$ is not divisible by the square of any prime. Find $a+b+c.$
Rhombus $PQRS$ is inscribed in rectangle $ABCD$ so that vertices $P,$ $Q,$ $R,$ and $S$ are interior points on sides $\overline{AB},$ $\overline{BC},$ $\overline{CD},$ and $\overline{DA},$ respectively. It is given that $PB=15,$ $BQ=20,$ $PR=30,$ and $QS=40.$ Let $\frac{m}{n},$ in lowest terms, denote the perimeter of $ABCD.$ Find $m+n.$
A drawer contains a mixture of red socks and blue socks, at most $1991$ in all. It so happens that, when two socks are selected randomly without replacement, there is a probability of exactly $\frac{1}{2}$ that both are red or both are blue. What is the largest possible number of red socks in the drawer that is consistent with this data?
A hexagon is inscribed in a circle. Five of the sides have length $81$ and the sixth, denoted by $\overline{AB},$ has length $31.$ Find the sum of the lengths of the three diagonals that can be drawn from $A.$
For positive integer $n,$ define $S_n$ to be the minimum value of the sum $$
\sum_{k=1}^n\sqrt{(2k-1)^2+a_k^2},
$$ where $a_1,$ $a_2,$ $\ldots,$ $a_n$ are positive real numbers whose sum is $17.$ There is a unique positive integer $n$ for which $S_n$ is also an integer. Find this $n.$