On the table there are $2n$ coins that look the same. It is known that $n$ of them weigh 9 g. each, while the remaining $n$ weigh 10 g. each. It is required to split the coins into $n$ pairs with total weight of each pair 19 g. Prove that this can be done in less than $n$ weighings using a balance without additional weights (the balance shows which pan is heavier or that their weight is equal).

Are there such pairwise distinct natural numbers $ m, n, p, q$ satisfying $ m \plus{} n \equal{} p \plus{} q$ and $ \sqrt{m} \plus{} \sqrt[3]{n} \equal{} \sqrt{p} \plus{} \sqrt[3]{q} > 2004$ ?

Given a polynomial $P$ and a positive integer $k$, we denote the $k$-fold composition of $P$ by $P^{\circ k}$. A polynomial $P$ with real coefficients is called [b]perfect[/b] if for each integer $n$ there is a positive integer $k$ so that $P^{\circ k}(n)$ is an integer. Is it true that for each perfect polynomial $P$, there exists a positive $m$ so that for each integer $n$ there is $0<k\leq m$ for which $P^{\circ k}(n)$ is an integer?

Let $AD$ be an internal angle bisector in triangle $\Delta ABC$. An arbitrary point $M$ is chosen on the closed segment $AD$. A parallel to $BC$ through $M$ cuts $AB$ at $N$. Let $AD, CM$ cut circumcircle of $\Delta ABC$ at $K, L$, respectively. Prove that $K,N,L$ are collinear.

$ABCD$ is a cyclic quadrilateral. Lines $AB,CD$ intersect at $E$, lines $AD,BC$ intersect at $F$, and $EM$ and $FN$ are tangents to the circumcircle of $ABCD$. Two circles are constructed with $E,F$ their centers and $EM, FN$ their radii, respectively. $K$ is one of their intersections. Prove that $EK$ is perpendicular to $FK$.

Let $S$ be a finite set. For a positive integer $n$, we say that a function $f\colon S\to S$ is an [i]$n$-th power[/i] if there exists some function $g\colon S\to S$ such that \[ f(x) = \underbrace{g(g(\ldots g(x)\ldots))}_{\mbox{\scriptsize $g$ applied $n$ times}} \] for each $x\in S$. Suppose that a function $f\colon S\to S$ is an $n$-th power for each positive integer $n$. Is it necessarily true that $f(f(x)) = f(x)$ for each $x\in S$?

The perimeter of a rectangle is $100$ and its diagonal has length $x$. What is the area of this rectangle? $\textbf{(A) }625-x^2\qquad\textbf{(B) }625-\dfrac{x^2}2\qquad\textbf{(C) }1250-x^2\qquad\textbf{(D) }1250-\dfrac{x^2}2\qquad\textbf{(E) }2500-\dfrac{x^2}2$

A triangle has inradius $r$ and circumradius $R$. Its longest altitude has length $H$. Show that if the triangle does not have an obtuse angle, then $H \ge r+R$. When does equality hold?

Prove that if $f:[0,1]\rightarrow[0,1]$ is a continuous function, then the sequence of iterates $x_{n+1}=f(x_{n})$ converges if and only if $$\lim_{n\to \infty}(x_{n+1}-x_{n})=0$$

Let $ABC$ be a triangle with $AB < AC$. A point $P$ on the circumcircle of $ABC$ (on the same side of $BC$ as $A$) is chosen in such a way that $BP = CP$. Let $BP$ and the angle bisector of $\angle BAC$ intersect at $Q$, and let the line through $Q$ and parallel to $BC$ intersect $AC$ at $R$. Prove that $BR = CR$.

Denote by $d(n)$ the number of divisors of the positive integer $n$. A positive integer $n$ is called highly divisible if $d(n) > d(m)$ for all positive integers $m < n$. Two highly divisible integers $m$ and $n$ with $m < n$ are called consecutive if there exists no highly divisible integer $s$ satisfying $m < s < n$. (a) Show that there are only finitely many pairs of consecutive highly divisible integers of the form $(a, b)$ with $a\mid b$. (b) Show that for every prime number $p$ there exist infinitely many positive highly divisible integers $r$ such that $pr$ is also highly divisible.

Statement 1: Line $a\in\alpha$, line $b\in\beta$, and $a,b$ are skew lines. If $c=\alpha\cap\beta$, then $c$ intersects at most one of $a,b$. Statement 2: It's impossible to find infintely many lines, any two of them are skew lines. $\text{(A)}$ Statement 1 is true, Statement 2 is false. $\text{(B)}$ Statement 2 is true, Statement 1 is false. $\text{(C)}$ Both are true. $\text{(D)}$ Neither is true.

The following problem is open in the sense that the answer to part (b) is not currently known. Let $n$ be an odd positive integer and let \[ f_n(x,y,z) = x^n + y^n + z^n + (x+y+z)^n. \] $(a)$ Prove that there exist infinitely many values of $n$ such that \[ f_n(x,y,z) \equiv (x+y)(y+z)(z+x) g_n(x,y,z) h_n(x,y,z) \pmod{2}, \] for some integer polynomials $g_n(x,y,z)$ and $h_n(x,y,z)$, neither of which is constant modulo 2. $(b)$ Determine all values of $n$ such that \[ f_n(x,y,z) \equiv (x+y)(y+z)(z+x) g_n(x,y,z) h_n(x,y,z) \pmod{2}, \] for some integer polynomials $g_n(x,y,z)$ and $h_n(x,y,z)$, neither of which is constant modulo 2. (Two integer polynomials are $\emph{congruent modulo 2}$ if every coefficient of their difference is even. A polynomial is $\emph{constant modulo 2}$ if it is congruent to a constant polynomial modulo 2.)

Let $\{ a_n \}_{n=0}^{\infty}$, $\{ b_n \}_{n=0}^{\infty}$, and $\{ c_n \}_{n=0}^{\infty}$ be sequences of real numbers such that for all $k\geq 1$, \begin{align*} a_k&=\left\lfloor \sqrt{2}+\frac{k-1}{2024} \right\rfloor+a_{k-1} \\ b_k+c_k&=1 \\ a_{k-1}b_k&=a_kc_k. \end{align*} Suppose that $a_0=1$, $b_0=2$, and $c_0=3$. Given that $\sqrt2\approx1.4142$, compute \[ \sum_{k=1}^{2024}(a_kb_k-a_{k-1}c_k). \]

Let the function $f:N^*\to N^*$ such that [b](1)[/b] $(f(m),f(n))\le (m,n)^{2014} , \forall m,n\in N^*$; [b](2)[/b] $n\le f(n)\le n+2014 , \forall n\in N^*$ Show that: there exists the positive integers $N$ such that $ f(n)=n $, for each integer $n \ge N$. (High School Affiliated to Nanjing Normal University )

Say a number is [i]tico[/i] if the sum of it's digits is a multiple of $2003$. $\text{(i)}$ Show that there exists a positive integer $N$ such that the first $2003$ multiples, $N,2N,3N,\ldots 2003N$ are all tico. $\text{(ii)}$ Does there exist a positive integer $N$ such that all it's multiples are tico?