Given an integer $n$, an integer $1 \le a \le n$ is called $n$-[i]well[/i] if \[ \left\lfloor\frac{n}{\left\lfloor n/a \right\rfloor}\right\rfloor = a. \] Let $f(n)$ be the number of $n$-well numbers, for each integer $n \ge 1$. Compute $f(1) + f(2) + \ldots + f(9999)$. [i]Proposed by Ashwin Sah[/i]

An airport contains 25 terminals which are two on two connected by tunnels. There is exactly 50 main tunnels which can be traversed in the two directions, the others are with single direction. A group of four terminals is called [i]good[/i] if of each terminal of the four we can arrive to the 3 others by using only the tunnels connecting them. Find the maximum number of good groups.

Define a $ k$-[i]clique[/i] to be a set of $ k$ people such that every pair of them are acquainted with each other. At a certain party, every pair of 3-cliques has at least one person in common, and there are no 5-cliques. Prove that there are two or fewer people at the party whose departure leaves no 3-clique remaining.

Let be a real number $ a. $ For any real number $ p $ and natural number $ k, $ let be the set $$ A_k(p)=\{ px\in\mathbb{Z}\mid k=\lceil x \rceil \} . $$ Find all real numbers $ b $ such that $ \# A_n(a)=\# A_n(b) , $ for any natural number $ n. $ $ \# $ [i]denotes the cardinal.[/i] [i]Eugen Păltânea[/i]

There are $3N+1$ students with different heights line up for asking questions. Prove that the teacher can drive $2N$ students away such that the remain students satisfies: No one has neighbors whose heights are consecutive.

Let $f(x)$ is such function, that $f(x)=1$ for integer $x$ and $f(x)=0$ for non integer $x$. Build such function using only variable $x$, integer numbers, and operations $+,-,*,/,[.]$(plus, minus, multiply,divide and integer part)

Let ABCD be a trapezoid with $AB \parallel CD, AB = 5, BC = 9, CD = 10,$ and $DA = 7$. Lines $BC$ and $DA$ intersect at point $E$. Let $M$ be the midpoint of $CD$, and let $N$ be the intersection of the circumcircles of $\triangle BMC$ and $\triangle DMA$ (other than $M$). If $EN^2 = \tfrac ab$ for relatively prime positive integers $a$ and $b$, compute $100a + b$.

Show that there are infinitely many positive integers $a$ that cannot be written as $a = a_{1}^{6}+ a_{2}^{6} + \ldots + a_{7}^{6},$ where the $a_i$ are positive integers. State and prove a generalization.

Find the positive integer $n$ such that \[ \underbrace{f(f(\cdots f}_{2013 \ f\text{'s}}(n)\cdots ))=2014^2+1 \] where $f(n)$ denotes the $n$th positive integer which is not a perfect square. [i]Proposed by David Stoner[/i]

The diagonals of a cyclic quadrilateral $ABCD$ intersect at $P$, and there exist a circle $\Gamma$ tangent to the extensions of $AB,BC,AD,DC$ at $X,Y,Z,T$ respectively. Circle $\Omega$ passes through points $A,B$, and is externally tangent to circle $\Gamma$ at $S$. Prove that $SP\perp ST$.

Let $a, b$ and $c$ be positive integers satisfying the equation $(a, b) + [a, b]=2021^c$. If $|a-b|$ is a prime number, prove that the number $(a+b)^2+4$ is composite. [i]Proposed by Serbia[/i]

For $f(x)$ a positive , monotone decreasing function defined in $[0,1],$ prove that $$ \int_{0}^{1} f(x) dx \cdot \int_{0}^{1} xf(x)^{2} dx \leq \int_{0}^{1} f(x)^{2} dx \cdot \int_{0}^{1} xf(x) dx.$$

When Ringo places his marbles into bags with $6$ marbles per bag, he has $4$ marbles left over. When Paul does the same with his marbles, he has $3$ marbles left over. Ringo and Paul pool their marbles and place them into as many bags as possible, with $6$ marbles per bag. How many marbles will be left over? $ \textbf{(A)}\ 1\qquad\textbf{(B)}\ 2\qquad\textbf{(C)}\ 3\qquad\textbf{(D)}\ 4\qquad\textbf{(E)}\ 5 $

Renata the robot packs boxes in a warehouse. Each box is a cube of side length $1$ foot. The warehouse floor is a square, $12$ feet on each side, and is divided into a $12$-by-$12$ grid of square tiles $1$ foot on a side. Each tile can either support one box or be empty. The warehouse has exactly one door, which opens onto one of the corner tiles. Renata fits on a tile and can roll between tiles that share a side. To access a box, Renata must be able to roll along a path of empty tiles starting at the door and ending at a tile sharing a side with that box. [list=a] [*]Show how Renata can pack $91$ boxes into the warehouse and still be able to access any box. [*]Show that Renata [b]cannot[/b] pack $95$ boxes into the warehouse and still be able to access any box.[/list]

Triangle $\triangle{ABC}$ is isosceles with $AB = AC$. Let the incircle of $\triangle{ABC}$ intersect $BC$ and $AC$ at $D$ and $E$ respectively. Let $F \neq A$ be the point such that $DF = DA$ and $EF = EA$. If $AF = 8$ and the circumradius of $\triangle{AED}$ is $5$, find the area of $\triangle{ABC}$. [i]Proposed by Anthony Yang and Andy Xu[/i]

a) Given $2019$ different integers wich have no odd prime divisor less than $37$, prove there exists two of these numbers such that their sum has no odd prime divisor less than $37$. b)Does the result hold if we change $37$ to $38$ ?

Do there exist positive integers $x, y$, such that $x+y, x^2+y^2, x^3+y^3$ are all perfect squares?

As shown in the figure, quadrilateral $ ABCD$ is inscribed in a circle with $ AC$ as its diameter, $ BD \perp AC,$ and $ E$ the intersection of $ AC$ and $ BD.$ Extend line segment $ DA$ and $ BA$ through $ A$ to $ F$ and $ G$ respectively, such that $ DG \parallel{} BF.$ Extend $ GF$ to $ H$ such that $ CH \perp GH.$ Prove that points $ B, E, F$ and $ H$ lie on one circle. [asy] defaultpen(linewidth(0.8)+fontsize(10));size(150); real a=4, b=6.5, c=9, d=a*c/b, g=14, f=sqrt(a^2+b^2)*sqrt(a^2+d^2)/g; pair E=origin, A=(0,a), B=(-b,0), C=(0,-c), D=(d,0), G=A+g*dir(B--A), F=A+f*dir(D--A), M=midpoint(G--C); path c1=circumcircle(A,B,C), c2=Circle(M, abs(M-G)); pair Hf=F+10*dir(G--F), H=intersectionpoint(F--Hf, c2); dot(A^^B^^C^^D^^E^^F^^G^^H); draw(c1^^c2^^G--D--C--A--G--F--D--B--A^^F--H--C--B--F); draw(H--B^^F--E^^G--C, linetype("2 2")); pair point= E; label("$A$", A, dir(point--A)); label("$B$", B, dir(point--B)); label("$C$", C, dir(point--C)); label("$D$", D, dir(point--D)); label("$F$", F, dir(point--F)); label("$G$", G, dir(point--G)); label("$H$", H, dir(point--H)); label("$E$", E, NE);[/asy]

Jen randomly picks $4$ distinct elements from $\{1, 2, 3, 4, 5, 6, 7, 8, 9, 10\}$. The lottery machine also picks $4$ distinct elements. If the lottery machine picks at least $2$ of Jen’s numbers, Jen wins a prize. If the lottery machine’s numbers are all $4$ of Jen’s, Jen wins the Grand Prize. Given that Jen wins a prize, what is the probability she wins a Grand Prize?

Find all prime numbers $p,q$ for which $pq$ divides $(5^p-2^p)(5^q-2^q)$.

Let $D$ be the foot of the altitude of triangle $ABC$ drawn from vertex $A$. Let $E$ and $F$ be points symmetric to $D$ w.r.t. lines $AB$ and $AC$, respectively. Let $R_1$ and $R_2$ be the circumradii of triangles $BDE$ and $CDF$, respectively, and let $r_1$ and $r_2$ be the inradii of the same triangles. Prove that $|S_{ABD} - S_{ACD}| > |R_1r_1 - R_2r_2|$

Let $a,b,c$ be constants and $a,b,c$ are positive real numbers. Prove that the equations $2x+y+z=\sqrt{c^2+z^2}+\sqrt{c^2+y^2}$ $x+2y+z=\sqrt{b^2+x^2}+\sqrt{b^2+z^2}$ $x+y+2z=\sqrt{a^2+x^2}+\sqrt{a^2+y^2}$ have exactly one real solution $(x,y,z)$ with $x,y,z \geq 0$.

How many real numbers $x$ are solutions to the following equation? \[ 2003^x + 2004^x = 2005^x \]

The number $n$ is "good", if there is three divisors of $n$($d_1, d_2, d_3$), such that $d_1^2+d_2^2+d_3^2=n$ a) Prove that all good number is divisible by $3$ b) Determine if there are infinite good numbers.

a) If $K$ is a finite extension of the field $F$ and $K=F(\alpha,\beta)$ show that $[K: F]\leq [F(\alpha): F][F(\beta): F]$ b) If $gcd([F(\alpha): F],[F(\beta): F])=1$ then does the above inequality always become equality? c) By giving an example show that if $gcd([F(\alpha): F],[F(\beta): F])\neq 1$ then equality might happen.