Let $x,y,z$ be positive numbers such that $x^2+y^2+z^2=1$. Prove that $$\frac x{1-x^2}+\frac y{1-y^2}+\frac z{1-z^2}\ge\frac{3\sqrt3}2$$

On average, for every 4 sports cars sold at the local dealership, 7 sedans are sold. The dealership predicts that it will sell 28 sports cars next month. How many sedans does it expect to sell? $ \textbf{(A)}\ 7 \qquad \textbf{(B)}\ 32 \qquad \textbf{(C)}\ 35 \qquad \textbf{(D)}\ 49 \qquad \textbf{(E)}\ 112$

Define a "ternary sequence" is a sequence that every number is $0,1$ or $2$. ternary sequence $(x_1,x_2,x_3,\cdots,x_n)$, define its difference to be $$(|x_1-x_2|,|x_2-x_3|,\cdots,|x_{n-1}-x_n|)$$ A difference will make the length of the sequence decrease by $1$, so we define the "feature value" of a ternary sequence with length $n$ is the number left after $n-1$ differences. How many ternary sequences has length $2023$ and feature value $0$? [i]Proposed by CSJL[/i]

Two beasts, Rosencrans and Gildenstern, play a game. They have a circle with $n$ points ($n \ge 5$) on it. On their turn, each beast (starting with Rosencrans) draws a chord between a pair of points in such a way that any two chords have a shared point. (The chords either intersect or have a common endpoint.) For example, two potential legal moves for the second player are drawn below with dotted lines. [asy] unitsize(0.7cm); draw(circle((0,0),1)); dot((0,-1)); pair A = (-1/2,-(sqrt(3))/2); dot(A); pair B = ((sqrt(2))/2,-(sqrt(2))/2); dot(B); pair C = ((sqrt(3))/2,1/2); dot(C); draw(A--C); pair D = (-(sqrt(0.05)),sqrt(0.95)); dot(D); pair E = (-(sqrt(0.2)),sqrt(0.8)); dot(E); draw(B--E,dotted); draw(C--D,dotted); [/asy] The game ends when a player cannot draw a chord. The last beast to draw a chord wins. For which $n$ does Rosencrans win?

When the roots of the polynomial \[P(x)=\prod_{i=1}^{10}(x-i)^{i}\] are removed from the real number line, what remains is the union of $11$ disjoint open intervals. On how many of those intervals is $P(x)$ positive? $\textbf{(A)}~3\qquad\textbf{(B)}~4\qquad\textbf{(C)}~5\qquad\textbf{(D)}~6\qquad\textbf{(E)}~7$

Let a [i]triplet [/i] be some set of three distinct pairwise parallel lines. $20$ triplets are drawn on a plane. Find the maximum number of regions these $60$ lines can divide the plane into.

Let $ ABCD$ be an isosceles trapezium. Determine the geometric location of all points $ P$ such that \[ |PA| \cdot |PC| \equal{} |PB| \cdot |PD|.\]

A set of $ 25$ square blocks is arranged into a $ 5\times 5$ square. How many different combinations of $ 3$ blocks can be selected from that set so that no two are in the same row or column? $ \textbf{(A)}\ 100\qquad \textbf{(B)}\ 125\qquad \textbf{(C)}\ 600\qquad \textbf{(D)}\ 2300\qquad \textbf{(E)}\ 3600$

For a real number $a$ and an integer $n(\geq 2)$, define $$S_n (a) = n^a \sum_{k=1}^{n-1} \frac{1}{k^{2019} (n-k)^{2019}}$$ Find every value of $a$ s.t. sequence $\{S_n(a)\}_{n\geq 2}$ converges to a positive real.

Prove that there exist infinitely many integers $n$ such that $n^2+1$ is squarefree.

Let $p$ be a prime, and $n > p$ be an integer. Prove that \[ \binom{n+p-1}{p} - \binom{n}{p} \] is divisible by $n$.

Suppose $a,b$ are positive real numbers such that $a+a^2 = 1$ and $b^2+b^4=1$. Compute $a^2+b^2$. [i]Proposed by Thomas Lam[/i]

Find all polynomials $P(x)$ such that $2P(2x^2 -1) = P(x)^2 -1$ for all $x$.

Let $T$ be a regular tetrahedron. Let $t$ be the regular tetrahedron whose vertices are the centers of the faces of $T$. Let $O$ be the circumcenter of either tetrahedron. Given a point $P$ different from $O$, let $m(P)$ be the midpoint of the points of intersection of the ray $\overrightarrow{OP}$ with $t$ and $T$. Let $S$ be the set of eight points $m(P)$ where $P$ is a vertex of either $t$ or $T$. What is the volume of the convex hull of $S$ divided by the volume of $t$?

Let $ f:\mathbb{Z}_{>0}\rightarrow\mathbb{R} $ be a function such that for all $n > 1$ there is a prime divisor $p$ of $n$ such that \[ f(n)=f\left(\frac{n}{p}\right)-f(p). \] Furthermore, it is given that $ f(2^{2014})+f(3^{2015})+f(5^{2016})=2013 $. Determine $ f(2014^2)+f(2015^3)+f(2016^5) $.

Suppose that zeros and ones are written in the cells of an $n\times n$ board, in such a way that the four cells in the intersection of any two rows and any two columns contain at least one zero. Prove that the number of ones does not exceed $\frac n2\left(1+\sqrt{4n-3}\right)$.