There are 94 safes and 94 keys. Each key can open only one safe, and each safe can be opened by only one key. We place randomly one key into each safe. 92 safes are then randomly chosen, and then locked. What is the probability that we can open all the safes with the two keys in the two remaining safes? (Once a safe is opened, the key inside the safe can be used to open another safe.)

What is the largest positive integer that cannot be expressed as a sum of non-negative integer multiple of $13$, $17$, and $23$?

Let $S$ be a great circle with pole $P$. On any great circle through $P$, two points $A$ and $B$ are chosen equidistant from $P$. For any [i] spherical triangle [/i] $ABC$ (the sides are great circles ares), where $C$ is on $S$, prove that the great circle are $CP$ is the angle bisector of angle $C$. [b] Note. [/b] A great circle on a sphere is one whose center is the center of the sphere. A pole of the great circle $S$ is a point $P$ on the sphere such that the diameter through $P$ is perpendicular to the plane of $S$.

Richard and Shreyas are arm wrestling against each other. They will play $10$ rounds, and in each round, there is exactly one winner. If the same person wins in consecutive rounds, these rounds are considered part of the same “streak”. How many possible outcomes are there in which there are strictly more than $3$ streaks? For example, if we denote Richard winning by $R$ and Shreyas winning by $S,$ $SSRSSRRRRR$ is one such outcome, with $4$ streaks.

What is the value of $1234+2341+3412+4123$? $\textbf{(A) } 10,000 \qquad \textbf{(B) }10,010 \qquad \textbf{(C) }10,110 \qquad \textbf{(D) }11,000 \qquad \textbf{(E) }11,110$

A lampshade is made in the form of the lateral surface of the frustum of a right circular cone. The height of the frustum is $3\sqrt{3}$ inches, its top diameter is 6 inches, and its bottom diameter is 12 inches. A bug is at the bottom of the lampshade and there is a glob of honey on the top edge of the lampshade at the spot farthest from the bug. The bug wants to crawl to the honey, but it must stay on the surface of the lampshade. What is the length in inches of its shortest path to the honey? [center] [img]https://cdn.artofproblemsolving.com/attachments/b/4/23f9bc88ea057cb2676f2b8b373330b0f5df69.png[/img][/center] $\textbf{(A) } 6 + 3\pi\qquad \textbf{(B) }6 + 6\pi\qquad \textbf{(C) } 6\sqrt3 \qquad \textbf{(D) } 6\sqrt5 \qquad \textbf{(E) } 6\sqrt3 + \pi$

Determine all real numbers $x$, such that $x^n+x^{-n}$ is an integer for all integers $n$.

Solve the system of equations in real numbers: \[ \begin{cases} x-y+z-w=2 \\ x^2-y^2+z^2-w^2=6 \\ x^3-y^3+z^3-w^3=20 \\ x^4-y^4+z^4-w^4=66 \end{cases} \]

A sequence of real numbers $a_0, a_1, \dots$ satisfies the condition\[\sum\limits_{n=0}^{m}a_n\cdot(-1)^n\cdot\dbinom{m}{n}=0\]for all large enough positive integers $m$. Prove that there exists a polynomial $P$ such that $a_n=P(n)$ for all $n\ge0$.

Let $f(x) = x^3 + ax^2 + bx + c$ have solutions that are distinct negative integers. If $a+b+c = 2014$, find $c$.

Find all polynomials $P(x)$ with real coefficieints such that $P\left(x^2\right)=P(x)P(x-1)$ for all $x\in\mathbb R$.

Let $P$ and $Q$ be points on $AC$ and $AB$, respectively, of triangle $\triangle ABC$ such that $PB=PC$ and $PQ\perp AB$. Suppose $\frac{AQ}{QB}=\frac{AP}{PB}.$ Find $\angle CBA$, in degrees. [i]Proposed by Nathan Ramesh

Label one disk "$1$", two disks "$2$", three disks "$3$"$, ...,$ fifty disks "$50$". Put these $1+2+3+ \cdots+50=1275$ labeled disks in a box. Disks are then drawn from the box at random without replacement. The minimum number of disks that must be drawn to guarantee drawing at least ten disks with the same label is $ \textbf{(A)}\ 10 \qquad\textbf{(B)}\ 51 \qquad\textbf{(C)}\ 415 \qquad\textbf{(D)}\ 451 \qquad\textbf{(E)}\ 501 $

A scalene triangle $ABC$ is given. It is known that $I$ is the center of the inscribed circle in this triangle, $D, E, F$ points are the touchpoints of this circle with the sides $AB, BC, CA$, respectively. Let $P$ be the intersection point of lines $DE$ and $AI$. Prove that $CP \perp AI$. (Vtalsh Winds)

Show an example of $15$ nonzero natural numbers with the property that if each one of them is increased by one, then the product of all increased numbers is $2015$ times higher than the product of the initial numbers

Let $\triangle ABC$ be an acute-angled triangle with $AB \not= AC$. Let $H$ be the orthocenter of triangle $ABC$, and let $M$ be the midpoint of the side $BC$. Let $D$ be a point on the side $AB$ and $E$ a point on the side $AC$ such that $AE=AD$ and the points $D$, $H$, $E$ are on the same line. Prove that the line $HM$ is perpendicular to the common chord of the circumscribed circles of triangle $\triangle ABC$ and triangle $\triangle ADE$.

Let $ABC$ be an acute scalene triangle, $H$ its orthocenter and $G$ its geocenter. The circumference with diameter $AH$ cuts the circumcircle of $BHC$ in $A'$ ($A' \neq H$). Points $B'$ and $C'$ are defined similarly. Show that the points $A'$, $B'$, $C'$, and $G$ lie in one circumference.

A strictly decreasing function $f:(0, \infty)\Rightarrow (0, \infty)$ attaining all positive values and positive numbers $a_1\ne b_1$ are given. Numbers $a_2, b_2, a_3, b_3, ...$ satisfy $$a_{n+1}=a_n+f(b_n),\;\;\;\;\;\;\;b_{n+1}=b_n+f(a_n)$$ for every $n\geq 1$. Prove that there exists a positive integer $n$ satisfying $|a_n-b_n| >2025$.

Let $M$ be a positive integer. $f(x):=x^3+ax^2+bx+c\in\mathbb Z[x]$ satisfy $|a|,|b|,|c|\le M.$ $x_1,x_2$ are different roots of $f.$ Prove that $$|x_1-x_2|>\frac 1{M^2+3M+1}.$$ [i]Created by Jingjun Han[/i]

Find the number of subsets of $\{ 1,2,3,4,5,6,7,8 \}$ that are subsets of neither $\{1,2,3,4,5\}$ nor $\{4,5,6,7,8\}$.

Given positive integer $ m \geq 17$, $ 2m$ contestants participate in a circular competition. In each round, we devide the $ 2m$ contestants into $ m$ groups, and the two contestants in one group play against each other. The groups are re-divided in the next round. The contestants compete for $ 2m\minus{}1$ rounds so that each contestant has played a game with all the $ 2m\minus{}1$ players. Find the least possible positive integer $ n$, so that there exists a valid competition and after $ n$ rounds, for any $ 4$ contestants, non of them has played with the others or there have been at least $ 2$ games played within those $ 4$.

Two bees start at the same spot and fly at the same rate in the following directions. Bee $A$ travels $1$ foot north, then $1$ foot east, then $1$ foot upwards, and then continues to repeat this pattern. Bee $B$ travels $1$ foot south, then $1$ foot west, and then continues to repeat this pattern. In what directions are the bees traveling when they are exactly $10$ feet away from each other? $\textbf{(A) }A \text{ east}, B \text{ west} \qquad \textbf{(B) } A\text{ north}, B\text{ south} \qquad \textbf{(C) } A\text{ north}, B\text{ west} \qquad \textbf{(D) } A\text{ up}, B\text{ south} \qquad \textbf{(E) } A\text{ up}, B\text{ west}$

Carson the farmer has a plot of land full of crops in the shape of a $6 \times 6$ grid of squares. Each day, he uniformly at random chooses a row or a column of the plot that he hasn’t chosen before and harvests all of the remaining crops in the row or column. Compute the expected number of connected components that the remaining crops form after $6$ days. If all crops have been harvested, we say there are $0$ connected components.

Let $f:[0, \infty) \to (0, \infty)$ be an increasing function and $g:[0, \infty) \to \mathbb{R}$ be a two times differentiable function such that $g''$ is continuous and $g''(x)+f(x)g(x) = 0, \: \forall x \geq 0.$ $\textbf{a)}$ Provide an example of such functions, with $g \neq 0.$ $\textbf{b)}$ Prove that $g$ is bounded.

Let $ABCD$ be a convex quadrilateral with $\angle ABC>90$, $CDA>90$ and $\angle DAB=\angle BCD$. Denote by $E$ and $F$ the reflections of $A$ in lines $BC$ and $CD$, respectively. Suppose that the segments $AE$ and $AF$ meet the line $BD$ at $K$ and $L$, respectively. Prove that the circumcircles of triangles $BEK$ and $DFL$ are tangent to each other. $\emph{Slovakia}$