For a positive integer $n>2$, consider the $n-1$ fractions $$\dfrac21, \dfrac32, \cdots, \dfrac{n}{n-1}$$ The product of these fractions equals $n$, but if you reciprocate (i.e. turn upside down) some of the fractions, the product will change. Can you make the product equal 1? Find all values of $n$ for which this is possible and prove that you have found them all.

Let $a, b, c \in \mathbb{R}^+$ such that $a + b + c = 3$. Prove that $$\sum_{cyc}\left(\frac{a^3+1}{a^2+1}\right)\geq\frac{1}{27}(\sqrt{ab}+\sqrt{bc}+\sqrt{ca})^4.$$

Let $P(x,\ y)\ (x>0,\ y>0)$ be a point on the curve $C: x^2-y^2=1$. If $x=\frac{e^u+e^{-u}}{2}\ (u\geq 0)$, then find the area bounded by the line $OP$, the $x$ axis and the curve $C$ in terms of $u$.

For positive real numbers $x$, $y$ and $z$ holds $x^2+y^2+z^2=1$. Prove that $$\frac{x}{1+x^2}+\frac{y}{1+y^2}+\frac{z}{1+z^2} \leq \frac{3\sqrt{3}}{4}$$

Let $a_1,a_2,a_3,\cdots$ be the sequence of positive integers such that $$a_1=1 , a_{k+1}=a^3_k+1, $$ for all positive integers $k.$ Prove that for every prime number $p$ of the form $3l +2,$ where $l$ is a non-negative integer ,there exists a positive integer $n$ such that $a_n$ is divisible by $p.$

Let $ABCD$ is a tangential quadrilateral such that $AB=CD>BC$. $AC$ meets $BD$ at $L$. Prove that $\widehat{ALB}$ is acute. [hide]According to the jury, they want to propose a more generalized problem is to prove $(AB-CD)^2 < (AD-BC)^2$, but this problem has appeared some time ago[/hide]

Describe all ordered sets of four real numbers $(a, b, c, d)$ for which the values $a + b, b + c, c + d, d + a$ are all non-zero and \[\frac{a+2b+3c}{c+d}=\frac{b+2c+3d}{d+a}=\frac{c+2d+3a}{a+b}=\frac{d+2a+3b}{b+c}.\]

How many natural number $n$ less than $2015$ that is divisible by $\lfloor\sqrt[3]{n}\rfloor$ ?

Let $ABCD$ is a cyclic. $K,L,M,N$ are midpoints of segments $AB$, $BC$ $CD$ and $DA$. $H_{1},H_{2},H_{3},H_{4}$ are orthocenters of $AKN$ $KBL$ $LCM$ and $MND$. Prove that $H_{1}H_{2}H_{3}H_{4}$ is a paralelogram.

Determine all $6$-tuples $(x,y,z,u,v,w)$ of integers satisfying the equation \[x^3+7y^3+49z^3=2u^3+14v^3+98w^3.\]

Lil Wayne, the rain god, determines the weather. If Lil Wayne makes it rain on any given day, the probability that he makes it rain the next day is $75\%$. If Lil Wayne doesn't make it rain on one day, the probability that he makes it rain the next day is $25\%$. He decides not to make it rain today. Find the smallest positive integer $n$ such that the probability that Lil Wayne [i]makes it rain[/i] $n$ days from today is greater than $49.9\%$.

A circle with center $I$ touches sides $AB,BC,CA$ of triangle $ABC$ in points $C_{1},A_{1},B_{1}$. Lines $AI, CI, B_{1}I$ meet $A_{1}C_{1}$ in points $X, Y, Z$ respectively. Prove that $\angle Y B_{1}Z = \angle XB_{1}Z$.

Find all nondecreasing functions $f:\mathbb R\to \mathbb R$ such that, for all $x,y\in \mathbb R$, $$f(f(x))+f(y)=f(x+f(y))+1.$$ [i]Proposed by Carl Schildkraut[/i]

Let $a,b,c\in\mathbb R^{n}, a+b+c=0$ and $\lambda>0$. Prove that \[\prod_{cycle}\frac{|a|+|b|+(2\lambda+1)|c|}{|a|+|b|+|c|}\geq(2\lambda+3)^{3}\]

Matthias covered a $7 \times 7$ square board, divided into $1 \times 1$ squares, with pieces of the following three types without gaps or overlaps, and without going off the board. [img]https://cdn.artofproblemsolving.com/attachments/9/9/8a2e63f723cbdf188f22344054f364f1924d47.gif[/img] Each type $1$ piece covers exactly $3$ squares and each type $2$ or type $3$ piece covers exactly $4$ squares. Determine the number of pieces of type $1$ that Matías could have used. (Pieces can be rotated and flipped.)

There are two positive numbers that may be inserted between $3$ and $9$ such that the first three are in geometric progression while the last three are in arithmetic progression. The sum of those two positive numbers is $\textbf{(A) }13\textstyle\frac{1}{2}\qquad\textbf{(B) }11\frac{1}{4}\qquad\textbf{(C) }10\frac{1}{2}\qquad\textbf{(D) }10\qquad \textbf{(E) }9\frac{1}{2}$

A $\pm 1$-[i]sequence[/i] is a sequence of $2022$ numbers $a_1, \ldots, a_{2022},$ each equal to either $+1$ or $-1$. Determine the largest $C$ so that, for any $\pm 1$-sequence, there exists an integer $k$ and indices $1 \le t_1 < \ldots < t_k \le 2022$ so that $t_{i+1} - t_i \le 2$ for all $i$, and $$\left| \sum_{i = 1}^{k} a_{t_i} \right| \ge C.$$

Let $ABC$ be a triangle, satisfying $2AC=AB+BC$. If $O$ and $I$ are its circumcenter and incenter, show that $\angle OIB=90^{\circ}$.

Assign to each side $b$ of a convex polygon $P$ the maximum area of a triangle that has $b$ as a side and is contained in $P$. Show that the sum of the areas assigned to the sides of $P$ is at least twice the area of $P$.

Given an acute triangle $ABC$ with $AB <AC$. The ex-circles of triangle $ABC$ opposite $B$ and $C$ are centered on $B_1$ and $C_1$, respectively. Let $D$ be the midpoint of $B_1C_1$. Suppose that $E$ is the point of intersection of $AB$ and $CD$, and $F$ is the point of intersection of $AC$ and $BD$. If $EF$ intersects $BC$ at point $G$, prove that $AG$ is the bisector of $\angle BAC$.

Let $S$ be the set of all ordered triples $(p,q,r)$ of prime numbers for which at least one rational number $x$ satisfies $px^2+qx+r=0.$ Which primes appear in seven or more elements of $S?$

a) One has a set of stones with weights $1, 2, \ldots, 20$ grams. Find all $k$ for which it is possible to place $k$ and the rest $20-k$ stones from the set respectively on the two pans of a balance so that equilibrium is achieved. b) One has a set of stones with weights $1, 2, \ldots, 51$ grams. Find all $k$ for which it is possible to place $k$ and the rest $51-k$ stones from the set respectively on the two pans of a balance so that equilibrium is achieved. c) One has a set of stones with weights $1, 2, \ldots, n$ grams ($n\in\mathbb{N}$). Find all $n$ and $k$ for which it is possible to place $k$ and the rest $n-k$ stones from the set respectively on the two pans of a balance so that equilibrium is achieved. [size=75] a) and b) were proposed at the festival, c) is a generalization[/size]

Prove that for any integers $n,p$, $0<n\leq p$, all the roots of the polynomial below are real: \[P_{n,p}(x)=\sum_{j=0}^n {p\choose j}{p\choose {n-j}}x^j\]

Given is a square of sides $3\sqrt7 \times 3\sqrt7$. Find the minimal positive integer $n$ such that no matter how we put $n$ unit disks inside the given square, without overlapping, there exists a line that intersects $4$ disks.

Given that $x$ and $y$ satisfy the two equations \begin{align*}\frac1x+\frac1y&=4\\\\\frac2x+\frac3y&=7\end{align*} evaluate $\dfrac{7-4y}x$.