Joseph chooses a permutation of the numbers $1, 2, 3, 4, 5, 6$ uniformly at random. Then, he goes through his permutation, and deletes the numbers which are not the maximum among each of the preceding numbers. For example, if he chooses the permutation $3, 2, 4, 5, 1, 6,$ then he deletes $2$ and $1,$ leaving him with $3, 4, 5, 6.$ The expected number of numbers remaining can be expressed as $m/n$ for relatively prime positive integers $m$ and $n.$ Find $m + n.$

$AB$ is the diameter of semicircle $O$. $C$,$D$ are two arbitrary points on semicircle $O$. Point $P$ lies on line $CD$ such that line $PB$ is tangent to semicircle $O$ at $B$. Line $PO$ intersects line $CA$, $AD$ at point $E$, $F$ respectively. Prove that $OE$=$OF$.

$ \frac{(.2)^{3}}{(.02)^{2}}= $ $ \text{(A)}\ .2\qquad\text{(B)}\ 2\qquad\text{(C)}\ 10\qquad\text{(D)}\ 15\qquad\text{(E)}\ 20 $

Determine the maximum value of $\lambda$ such that if $f(x) = x^3 +ax^2 +bx+c$ is a cubic polynomial with all its roots nonnegative, then \[f(x)\geq\lambda(x -a)^3\] for all $x\geq0$. Find the equality condition.

There are $n\ge 2$ line segments in the plane such that every two segments cross and no three segments meet at a point. Geoff has to choose an endpoint of each segment and place a frog on it facing the other endpoint. Then he will clap his hands $n-1$ times. Every time he claps,each frog will immediately jump forward to the next intersection point on its segment. Frogs never change the direction of their jumps. Geoff wishes to place the frogs in such a way that no two of them will ever occupy the same intersection point at the same time. (a) Prove that Geoff can always fulfill his wish if $n$ is odd. (b) Prove that Geoff can never fulfill his wish if $n$ is even.

Prove that there exist infinitely many positive integers $n$ such that the greatest prime divisor of $n^2+1$ is less than $n \cdot \pi^{-2019}.$

Find all positive real numbers $t$ with the following property: there exists an infinite set $X$ of real numbers such that the inequality \[ \max\{|x-(a-d)|,|y-a|,|z-(a+d)|\}>td\] holds for all (not necessarily distinct) $x,y,z\in X$, all real numbers $a$ and all positive real numbers $d$.

It is known that the reflection of the orthocenter of a triangle $ABC$ about its circumcenter lies on $BC$. Let $A_1$ be the foot of the altitude from $A$. Prove that $A_1$ lies on the circle passing through the midpoints of the altitudes of $ABC$.

A regular hexagon is placed on top of a unit circle such that one vertex coincides with the center of the circle, exactly two vertices lie on the circumference of the circle, and exactly one vertex lies outside of the circle. Determine the area of the hexagon.

Prove that every positive rational number can be represented in the form $\dfrac{a^{3}+b^{3}}{c^{3}+d^{3}}$ where a,b,c,d are positive integers.

In a convex pentagon, let the perpendicular line from a vertex to the opposite side be called an altitude. Prove that if four of the altitudes are concurrent at a point then the fifth altitude also passes through this point.

What is the smallest integer $n$, greater than one, for which the root-mean-square of the first $n$ positive integers is an integer? $\mathbf{Note.}$ The root-mean-square of $n$ numbers $a_1, a_2, \cdots, a_n$ is defined to be \[\left[\frac{a_1^2 + a_2^2 + \cdots + a_n^2}n\right]^{1/2}\]

A game is played on a $23\times 23$ board. The first player controls two white chips which start in the bottom left and top right corners. The second player controls two black ones which start in bottom right and top left corners. The players move alternately. In each move, a player moves one of the chips under control to a square which shares a side with the square the chip is currently in. The first player wins if he can bring the white chips to squares which share a side with each other. Can the second player prevent the first player from winning?

Let $A = (0,0)$, $B=(-1,-1)$, $C=(x,y)$, and $D=(x+1,y)$, where $x > y$ are positive integers. Suppose points $A$, $B$, $C$, $D$ lie on a circle with radius $r$. Denote by $r_1$ and $r_2$ the smallest and second smallest possible values of $r$. Compute $r_1^2 + r_2^2$. [i]Proposed by Lewis Chen[/i]

The circle $k_a$ touches the extensions of sides $AB$ and $BC$, as well as the circumscribed circle of the triangle $ABC$ (from the outside). We denote the intersection of $k_a$ with the circumscribed circle of the triangle $ABC$ by $A'$. Analogously, we define points $B'$ and $C'$. Prove that the lines $AA',BB'$ and $CC'$ intersect in one point.

Points $X$ and $Y$ on the unit circle centered at $O = (0,0)$ are at $(-1,0)$ and $(0,-1)$ respectively. Points $P$ and $Q$ are on the unit circle such that $\angle P XO = \angle QY O = 30^o$. Let $Z$ be the intersection of line $X P$ and line $Y Q$. The area bounded by segment $Z P$, segment $ZQ$, and arc $PQ$ can be expressed as $a\pi -b$ where $a$ and $b$ are rational numbers. Find $\frac{1}{ab}$ .

Complex numbers $a$, $b$ and $c$ are the zeros of a polynomial $P(z) = z^3+qz+r$, and $|a|^2+|b|^2+|c|^2=250$. The points corresponding to $a$, $b$, and $c$ in the complex plane are the vertices of a right triangle with hypotenuse $h$. Find $h^2$.

Let $a,b,c,d$ be non-zero integers, such that the only quadruple of integers $(x, y, z, t)$ satisfying the equation \[ax^2+by^2+cz^2+dt^2=0\] is $x=y=z=t=0$. Does it follow that the numbers $a,b,c,d$ have the same sign?

Each side face of a dodecahedron lies in a uniquely determined plane. Those planes cut the space in a finite number of disjoint [i]regions[/i]. Find the number of such regions.

Determine all infinite sets $A$ of positive integers with the following propety: If $a,b \in A$ and $a \ge b$ then $\left\lfloor \frac{a}{b} \right\rfloor \in A$

Is it possible to fill a table $1\times n$ with pairwise distinct integers such that for any $k = 1, 2,\ldots, n$ one can find a rectangle $1\times k$ in which the sum of the numbers equals $0$ if a) $n= 11$; b) $n= 12$?

Given a triangle $ABC$ with angle $A$ obtuse and with altitudes of length $h$ and $k$ as shown in the diagram, prove that $a+h\ge b+k$. Find under what conditions $a+h=b+k$. [asy] size(6cm); pair A = dir(105), C = dir(170), B = dir(10), D = foot(B, A, C), E = foot(A, B, C); draw(A--B--C--cycle); draw(B--D--A--E); dot(A); dot(B); dot(C); dot(D); dot(E); label("$A$", A, dir(110)); label("$B$", B, B); label("$C$", C, C); label("$D$", D, D); label("$E$", E, dir(45)); label("$h$", A--E, dir(0)); label("$k$", B--D, dir(45)); [/asy]

The following addition problem is not correct if the numbers are interpreted as base 10 numbers. In what number base is the problem correct? $66+ 87+ 85 +48 = 132$

Let $a, b$ and $c$ be pairwise relatively prime natural numbers. Find all possible values of $\frac{(a + b)(b + c)(c + a)}{abc}$ if known what it is integer.

$21$ bandits live in the city of Warmridge, each of them having some enemies among the others. Initially each bandit has $240$ bullets, and duels with all of his enemies. Every bandit distributes his bullets evenly between his enemies, this means that he takes the same number of bullets to each of his duels, and uses each of his bullets in only one duel. In case the number of his bullets is not divisible by the number of his enemies, he takes as many bullets to each duel as possible, but takes the same number of bullets to every duel, so it is possible that in the end the bandit will have some remaining bullets. Shooting is banned in the city, therefore a duel consists only of comparing the number of bullets in the guns of the opponents, and the winner is whoever has more bullets. After the duel the sheriff takes the bullets of the winner and as an act of protest the loser shoots all of his bullets into the air. What is the largest possible number of bullets the sheriff can have after all of the duels have ended? Being someones enemy is mutual. If two opponents have the same number of bullets in their guns during a duel, then the sheriff takes the bullets of the bandit who has the wider hat among them. Example: If a bandit has $13$ enemies then he takes $18$ bullets with himself to each duel, and they will have $6$ leftover bullets after finishing all their duels.