Let $ Z_1,\,Z_2\dots,\,Z_n$ be $ d$-dimensional independent random (column) vectors with standard normal distribution, $ n \minus{} 1 > d$. Furthermore let \[ \overline Z \equal{} \frac {1}{n}\sum_{i \equal{} 1}^n Z_i,\quad S_n \equal{} \frac {1}{n \minus{} 1}\sum_{i \equal{} 1}^n(Z_i \minus{} \overline Z)(Z_i \minus{} \overline Z)^\top\] be the sample mean and corrected empirical covariance matrix. Consider the standardized samples $ Y_i \equal{} S_n^{ \minus{} 1/2}(Z_i \minus{} \overline Z)$, $ i \equal{} 1,2,\dots,n$. Show that \[ \frac {E|Y_1 \minus{} Y_2|}{E|Z_1 \minus{} Z_2|} > 1,\] and that the ratio does not depend on $ d$, only on $ n$.

In the diagram below, three squares are inscribed in right triangles. Their areas are $A$, $M$, and $N$, as indicated in the diagram. If $M = 5$ and $N = 12$, then $A$ can be expressed as $a + b\sqrt{c}$, where $a$, $b$, and $c$ are positive integers and $c$ is not divisible by the square of any prime. Compute $a + b + c$. [asy] size(250); defaultpen (linewidth (0.7) + fontsize (10)); pair O = origin, A = (1, 1), B = (4/3, 1/3), C = (2/3, 5/3), P = (3/2, 0), Q = (0,3); draw (P--O--Q--cycle^^(0, 5/3)--C--(2/3,1)^^(0,1)--A--(1,0)^^(1,1/3)--B--(4/3,0)); label("$A$", (.5,.5)); label("$M$", (7/6, 1/6)); label("$N$", (1/3, 4/3));[/asy] [i]Proposed by Aaron Lin[/i]

Ted mistakenly wrote $2^m \cdot \sqrt{\frac{1}{4096}}$ as $2\cdot \sqrt[m]{\frac{1}{4096}}$. What is the sum of all real numbers $m$ for which these two expressions have the same value? $\textbf{(A) }5\qquad\textbf{(B) }6\qquad\textbf{(C) }7\qquad\textbf{(D) }8\qquad\textbf{(E) }9$

Prove that there are 100 natural number $a_1 < a_2 < ... < a_{99} < a_{100}$ ( $ a_i < 10^6$) such that A , A+A , 2A , A+2A , 2A + 2A are five sets apart ? $A = \{a_1 , a_2 ,... , a_{99} ,a_{100}\}$ $2A = \{2a_i \vert 1\leq i\leq 100\}$ $A+A = \{a_i + a_j \vert 1\leq i<j\leq 100\}$ $A + 2A = \{a_i + 2a_j \vert 1\leq i,j\leq 100\}$ $2A + 2A = \{2a_i + 2a_j \vert 1\leq i<j\leq 100\}$ (20 ponits )

Suppose that 13 cards numbered $1, 2, 3, \dots, 13$ are arranged in a row. The task is to pick them up in numerically increasing order, working repeatedly from left to right. In the example below, cards 1, 2, 3 are picked up on the first pass, 4 and 5 on the second pass, 6 on the third pass, 7, 8, 9, 10 on the fourth pass, and 11, 12, 13 on the fifth pass. For how many of the $13!$ possible orderings of the cards will the $13$ cards be picked up in exactly two passes? [asy] size(11cm); draw((0,0)--(2,0)--(2,3)--(0,3)--cycle); label("7", (1,1.5)); draw((3,0)--(5,0)--(5,3)--(3,3)--cycle); label("11", (4,1.5)); draw((6,0)--(8,0)--(8,3)--(6,3)--cycle); label("8", (7,1.5)); draw((9,0)--(11,0)--(11,3)--(9,3)--cycle); label("6", (10,1.5)); draw((12,0)--(14,0)--(14,3)--(12,3)--cycle); label("4", (13,1.5)); draw((15,0)--(17,0)--(17,3)--(15,3)--cycle); label("5", (16,1.5)); draw((18,0)--(20,0)--(20,3)--(18,3)--cycle); label("9", (19,1.5)); draw((21,0)--(23,0)--(23,3)--(21,3)--cycle); label("12", (22,1.5)); draw((24,0)--(26,0)--(26,3)--(24,3)--cycle); label("1", (25,1.5)); draw((27,0)--(29,0)--(29,3)--(27,3)--cycle); label("13", (28,1.5)); draw((30,0)--(32,0)--(32,3)--(30,3)--cycle); label("10", (31,1.5)); draw((33,0)--(35,0)--(35,3)--(33,3)--cycle); label("2", (34,1.5)); draw((36,0)--(38,0)--(38,3)--(36,3)--cycle); label("3", (37,1.5)); [/asy] $\textbf{(A) }4082\qquad\textbf{(B) }4095\qquad\textbf{(C) }4096\qquad\textbf{(D) }8178\qquad\textbf{(E) }8191$

The odometer of a family car shows 15,951 miles. The driver noticed that this number is palindromic: it reads the same backward as forwards. "Curious," the driver said to himself, "it will be a long time before that happens again." Surprised, he saw his third palindromic odometer reading (not counting 15,951) exactly five hours later. How many miles per hour was the car traveling in those 5 hours (assuming speed was constant)?

Which of the following polynomials does not divide $x^{60} - 1$? $ \textbf{a)}\ x^2+x+1 \qquad\textbf{b)}\ x^4-1 \qquad\textbf{c)}\ x^5-1 \qquad\textbf{d)}\ x^{15}-1 \qquad\textbf{e)}\ \text{None of above} $

Let $k\ge2$ be an integer. Find the smallest integer $n \ge k+1$ with the property that there exists a set of $n$ distinct real numbers such that each of its elements can be written as a sum of $k$ other distinct elements of the set.

$a, b, c, d$ are positive integers, and $r=1-\frac{a}{b}-\frac{c}{d}$. And, $a+c \le 1982, r \ge 0$. Prove that $r>\frac{1}{1983^3}$.

For any permutation $ f : \{ 1, 2, \cdots , n \} \to \{1, 2, \cdots , n \} $, and define \[ A = \{ i | i > f(i) \} \] \[ B = \{ (i, j) | i<j \le f(j) < f(i) \ or \ f(j) < f(i) < i < j \} \] \[ C = \{ (i, j) | i<j \le f(i) < f(j) \ or \ f(i) < f(j) < i < j \} \] \[ D = \{ (i, j) | i< j \ and \ f(i) > f(j)\} \] Prove that $ |A| + 2|B| + |C| = |D| $.

Prove that each positive integer is equal to a difference of two positive integers with the same number of the prime divisors.

One right pyramid has a base that is a regular hexagon with side length $1$, and the height of the pyramid is $8$. Two other right pyramids have bases that are regular hexagons with side length $4$, and the heights of those pyramids are both $7$. The three pyramids sit on a plane so that their bases are adjacent to each other and meet at a single common vertex. A sphere with radius $4$ rests above the plane supported by these three pyramids. The distance that the center of the sphere is from the plane can be written as $\frac{p\sqrt{q}}{r}$ , where $p, q$, and $r$ are relatively prime positive integers, and $q$ is not divisible by the square of any prime. Find $p+q+r$.

Meghal is playing a game with $2016$ rounds $1, 2, ..., 201$6. In round $n$, two rectangular double-sided mirrors are arranged such that they share a common edge and the angle between the faces is $\frac{2\pi}{n+2}$. Meghal shoots a laser at these mirrors and her score for the round is the number of points on the two mirrors at which the laser beam touches a mirror. What is the maximum possible score Meghal could have after she finishes the game?

Let $x \neq y$ be positive reals satisfying $x^3+2013y=y^3+2013x$, and let $M = \left( \sqrt{3}+1 \right)x + 2y$. Determine the maximum possible value of $M^2$. [i]Proposed by Varun Mohan[/i]

For $1\leq n\leq 2016$, how many integers $n$ satisfying the condition: the reminder divided by $20$ is smaller than the one divided by $16$.

Find the area of a triangle with side lengths $\sqrt{13},\sqrt{29},$ and $\sqrt{34}.$ The area can be expressed as $\frac{m}{n}$ for $m,n$ relatively prime positive integers, then find $m+n.$ [i]Proposed by Kaylee Ji[/i]

The integer n is a number expressed as the sum of an even number of different positive integers less than or equal to 2000. 1+2+ · · · +2000 Find all of the following positive integers that cannot be the value of n.

Consider the polynomials $P(x)=x^4-3x^3+x-3,\,\,\,\,Q(x)=x^2-2x-3 \,\,\,\, R(x)=-x^2-5x+a$ i) Find $a \in $R such that polynomial $R(x)$ is dividide by $x-2$ ii) Factor polynomials $P(x),Q(x)$ iii) Prove that exrpession $-x^2+x+\frac{P(x)}{Q(x)}+15$ is a perfect square.

This line graph represents the price of a trading card during the first $6$ months of $1993$. [asy] unitsize(18); for (int a = 0; a <= 6; ++a) { draw((4*a,0)--(4*a,10)); } for (int a = 0; a <= 5; ++a) { draw((0,2*a)--(24,2*a)); } draw((0,5)--(4,4)--(8,8)--(12,3)--(16,9)--(20,6)--(24,2),linewidth(1.5)); label("$Jan$",(2,0),S); label("$Feb$",(6,0),S); label("$Mar$",(10,0),S); label("$Apr$",(14,0),S); label("$May$",(18,0),S); label("$Jun$",(22,0),S); label("$\textbf{1993 PRICES FOR A TRADING CARD}$",(12,10),N); label("$\begin{tabular}{c}\textbf{P} \\ \textbf{R} \\ \textbf{I} \\ \textbf{C} \\ \textbf{E} \end{tabular}$",(-2,5),W); label("$1$",(0,2),W); label("$2$",(0,4),W); label("$3$",(0,6),W); label("$4$",(0,8),W); label("$5$",(0,10),W); [/asy] The greatest monthly drop in price occurred during $\text{(A)}\ \text{January} \qquad \text{(B)}\ \text{March} \qquad \text{(C)}\ \text{April} \qquad \text{(D)}\ \text{May} \qquad \text{(E)}\ \text{June}$

Jeffrey stands on a straight horizontal bridge that measures $20000$ meters across. He wishes to place a pole vertically at the center of the bridge so that the sum of the distances from the top of the pole to the two ends of the bridge is $20001$ meters. To the nearest meter, how long of a pole does Jeffrey need?

Jane tells you that she is thinking of a three-digit number that is greater than $500$ that has exactly $20$ positive divisors. If Jane tells you the sum of the positive divisors of her number, you would not be able to figure out her number. If, instead, Jane had told you the sum of the \textit{prime} divisors of her number, then you also would not have been able to figure out her number. What is Jane's number? (Note: the sum of the prime divisors of $12$ is $2 + 3 = 5$, not $2 + 2 + 3 = 7$.)

Given a trihedral angle Sxyz. A plane (P) not through S cuts Sx,Sy,Sz respectively at A,B,C. On the plane (P), outside triangle ABC, construct triangles DAB,EBC,FCA which are confruent to the triangles SAB,SBC,SCA respectively. Let (T) be the sphere lying inside Sxyz, but not inside the tetrahedron SABC, toucheing the planes containing the faces of SABC. Prove that (T) touches the plane (P) at the circumcenter of triangle DEF.

Prove that for positive real numbers $a, b, c$ the following inequality holds: \begin{align*} \frac{a}{9bc+1}+\frac{b}{9ca+1}+\frac{c}{9ab+1}\geq \frac{a+b+c}{1+(a+b+c)^2} \end{align*} When does equality occur?

How many positive integer solutions does the following system of equations have? $$\begin{cases}\sqrt{2020}(\sqrt{a}+\sqrt{b})=\sqrt{(c+2020)(d+2020)}\\\sqrt{2020}(\sqrt{b}+\sqrt{c})=\sqrt{(d+2020)(a+2020)}\\\sqrt{2020}(\sqrt{c}+\sqrt{d})=\sqrt{(a+2020)(b+2020)}\\\sqrt{2020}(\sqrt{d}+\sqrt{a})=\sqrt{(b+2020)(c+2020)}\\ \end{cases}$$

Find the number of ordered triples of sets $(T_1, T_2, T_3)$ such that 1. each of $T_1, T_2$, and $T_3$ is a subset of $\{1, 2, 3, 4\}$, 2. $T_1 \subseteq T_2 \cup T_3$, 3. $T_2 \subseteq T_1 \cup T_3$, and 4. $T_3\subseteq T_1 \cup T_2$.