A finite set $S$ of points in the coordinate plane is called [i]overdetermined[/i] if $|S|\ge 2$ and there exists a nonzero polynomial $P(t)$, with real coefficients and of degree at most $|S|-2$, satisfying $P(x)=y$ for every point $(x,y)\in S$. For each integer $n\ge 2$, find the largest integer $k$ (in terms of $n$) such that there exists a set of $n$ distinct points that is [i]not[/i] overdetermined, but has $k$ overdetermined subsets. [i]Proposed by Carl Schildkraut[/i]

The number selection game is the following single-player game. Originally, on the table there were positive integers $1, 2,...,22$ (All positive integers not exceeding $22$ appear exactly once). In each move, the player chooses the three numbers $a, b, c$ that are on the table, then the selected numbers $a, b, c$ disappear but a new number $a + b + c$ appears; At the same time, the player's score is added $(a + b)(b+c)(c + a)$. The initial score was $0$. The game ends after $10$ moves (when there are only two numbers left on the board). Call $M, m$ respectively the highest and the lowest possible score of a game. Determine the value of $\dfrac{M}{m}$.

Two circles are externally tangent. Lines $\overline{PAB}$ and $\overline{PA'B'}$ are common tangents with $A$ and $A'$ on the smaller circle and $B$ and $B'$ on the larger circle. If $PA = AB = 4$, then the area of the smaller circle is [asy] size(250); defaultpen(fontsize(10pt)+linewidth(.8pt)); pair O=origin, Q=(0,-3sqrt(2)), P=(0,-6sqrt(2)), A=(-4/3,3.77-6sqrt(2)), B=(-8/3,7.54-6sqrt(2)), C=(4/3,3.77-6sqrt(2)), D=(8/3,7.54-6sqrt(2)); draw(Arc(O,2sqrt(2),0,360)); draw(Arc(Q,sqrt(2),0,360)); dot(A); dot(B); dot(C); dot(D); dot(P); draw(B--A--P--C--D); label("$A$",A,dir(A)); label("$B$",B,dir(B)); label("$A'$",C,dir(C)); label("$B'$",D,dir(D)); label("$P$",P,S);[/asy] $ \textbf{(A)}\ 1.44\pi\qquad\textbf{(B)}\ 2\pi\qquad\textbf{(C)}\ 2.56\pi\qquad\textbf{(D)}\ \sqrt{8}\pi\qquad\textbf{(E)}\ 4\pi $

A circle passes through the three vertices of an isosceles triangle that has two sides of length $ 3$ and a base of length $ 2$. What is the area of this circle? $ \textbf{(A)}\ 2\pi\qquad \textbf{(B)}\ \frac {5}{2}\pi\qquad \textbf{(C)}\ \frac {81}{32}\pi\qquad \textbf{(D)}\ 3\pi\qquad \textbf{(E)}\ \frac {7}{2}\pi$

Each cell of an infinite table (infinite in all directions) is colored with one of $n$ given colors. All six cells of any $2\times 3$ (or $3 \times 2$) rectangle have different colors. Find the smallest possible value of $n$.

In the triangle $ABC$, $| BC | = 1$ and there is exactly one point $D$ on the side $BC$ such that $|DA|^2 = |DB| \cdot |DC|$. Determine all possible values of the perimeter of the triangle $ABC$.

Suppose we have $10$ balls and $10$ colors. For each ball, we (independently) color it one of the $10$ colors, then group the balls together by color at the end. If $S$ is the expected value of the square of the number of distinct colors used on the balls, find the sum of the digits of $S$ written as a decimal. [i]Proposed by Michael Kural[/i]

Without using a calculator, find out which number is greater: $$29^{200}\cdot 2^{151} \,\,\, or \,\,\, 5^{279} \cdot 3^{300}$$

Let $a$ and $b$ be real numbers for which the following is true: $acscx + b cot x \ge 1$, for all $0 <x < \pi$ Find the least value of $a^2 + b$.

Let $ABC$ be an acute scalene triangle with orthocenter $H$ and circumcenter $O$. Let the line through $A$ tangent to the circumcircle of triangle $AHO$ intersect the circumcircle of triangle $ABC$ at $A$ and $P \neq A$. Let the circumcircles of triangles $AOP$ and $BHP$ intersect at $P$ and $Q \neq P$. Let line $PQ$ intersect segment $BO$ at $X$. Suppose that $BX=2$, $OX=1$, and $BC=5$. Then $AB \cdot AC = \sqrt{k}+m\sqrt{n}$ for positive integers $k$, $m$, and $n$, where neither $k$ nor $n$ is divisible by the square of any integer greater than $1$. Compute $100k+10m+n$. [i]Proposed by Luke Robitaille[/i]

Let $0<c<1$ be a given real number. Determine the least constant $K$ such that the following holds: For all positive real $M$ that is greater than $1$, there exists a strictly increasing sequence $x_0, x_1, \ldots, x_n$ (of arbitrary length) such that $x_0=1, x_n\geq M$ and \[\sum_{i=0}^{n-1}\frac{\left(x_{i+1}-x_i\right)^c}{x_i^{c+1}}\leq K.\] (From 2020 IMOCSL A5. I think this problem is particularly beautiful so I want to make a separate thread for it :D )

Let $p$ be an odd prime and $S_{q} = \frac{1}{2*3*4} + \frac{1}{5*6*7} + ... + \frac{1}{q(q+1)(q+2)}$, where $q = \frac{3p-5}{2}$. We write $\frac{1}{2}-2S_{q}$ in the form $\frac{m}{n}$, where $m$ and $n$ are integers. Prove that $m \equiv n (mod p)$

$29$ quadratic polynomials $f_1(x), \ldots, f_{29}(x)$ and $15$ real numbers $x_1<x_2<\ldots<x_{15}$ are given. Prove that for some two given polynomials $f_i(x)$ and $f_j(x)$ the following inequality holds: $$\sum_{k=1}^{14} (f_i(x_{k+1})-f_i(x_k))(f_j(x_{k+1})-f_j(x_k))>0$$ [i]A. Voidelevich[/i]

Determine the real value of $t$ that minimizes the expression \[ \sqrt{t^2 + (t^2 - 1)^2} + \sqrt{(t-14)^2 + (t^2 - 46)^2}. \]

Two right cones each have base radius 4 and height 3, such that the apex of each cone is the center of the base of the other cone. Find the surface area of the union of the cones.

If $x_k \in \mathbb{R}$ ($k=1, 2, \cdots , n$) and $m \in \mathbb{N}$ then [list=1] [*] $\sum \limits_{cyc} \left (x_1^2 -x_1x_2+x_2^2 \right )^m \leq 3^m \sum \limits_{k=1}^n x_k^{2m}$ [*] $\prod \limits_{cyc} \left (x_1^2 -x_1x_2+x_2^2 \right )^m \leq \left (\frac{3^m}{n}\right )^m \left (\sum \limits_{k=1}^n x_k^{2m}\right )^n$ [/list]