The world famous infinite hotel with infinitely many floors (where the floors and the rooms on each floor are numbered with the positive integers) is full of guests: each room is occupied by exactly one guest. The manager of the hotel wants to carpet the corridor on each floor, and an infinite set of carpets of finite length (numbered with the positive integers) was obtained. Every guest marked an infinite number of carpets that they liked. Luckily, any two guests living on a different floor share only a finite number of carpets that they both like. Prove that the carpets can be distributed among the floors in a way that for every guest there are only finitely many carpets they like that are placed on floors different from the one where the guest is. [i]Proposed by András Imolay, Budapest[/i]

Let $a, b, c$ be naturals. The equation $ax^2-bx + c = 0$ has two roots at $[0, 1]$. Prove that $a\ge 5$ and $b\ge 5$.

Given that $ABC$ is a triangle where $AB < AC$. On the half-lines $BA$ and $CA$ we take points $F$ and $E$ respectively such that $BF = CE = BC$. Let $M,N$ and $H$ be the mid-points of the segments $BF,CE$ and $BC$ respectively and $K$ and $O$ be the circumcenters of the triangles $ABC$ and $MNH$ respectively. We assume that $OK$ cuts $BE$ and $HN$ at the points $A_1$ and $B_1$ respectively and that $C_1$ is the point of intersection of $HN$ and $FE$. If the parallel line from $A_1$ to $OC_1$ cuts the line $FE$ at $D$ and the perpendicular from $A_1$ to the line $DB_1$ cuts $FE$ at the point $M_1$, prove that $E$ is the orthocenter of the triangle $A_1OM_1$.

\[\int_{-1}^1 \sqrt{\frac{1+x}{1-x}}+\sqrt{\frac{1-x}{1+x}}\,\mathrm dx\] [i]Proposed by Vlad Oleksenko[/i]

Prove that for all $n \in \mathbb{Z^+}$ and for all positive real numbers satisfying $a_1a_2...a_n=1$ \[ \displaystyle\sum_{i=1}^{n} \frac{a_i}{\sqrt{{a_i}^4+3}} \leq \frac{1}{2}\displaystyle\sum_{i=1}^{n} \frac{1}{a_i} \]

Let $S$ be the set of positive integers $n$ such that \[3\cdot \varphi (n)=n,\] where $\varphi (n)$ is the number of positive integers $k\leq n$ such that $\gcd (k, n)=1$. Find \[\sum_{n\in S} \, \frac{1}{n}.\] [i]Proposed by Nathan Ramesh

Define sequences $\{a_n\},\ \{b_n\}$ by \[a_n=\int_{-\frac {\pi}6}^{\frac{\pi}6} e^{n\sin \theta}d\theta,\ b_n=\int_{-\frac {\pi}6}^{\frac{\pi}6} e^{n\sin \theta}\cos \theta d\theta\ (n=1,\ 2,\ 3,\ \cdots).\] (1) Find $b_n$. (2) Prove that for each $n$, $b_n\leq a_n\leq \frac 2{\sqrt{3}}b_n.$ (3) Find $\lim_{n\to\infty} \frac 1{n}\ln (na_n).$

Find all functions $f$ from the reals to the reals such that \[f\left(f(x)+y\right)=2x+f\left(f(y)-x\right)\] for all real $x,y$.

A sequence $(a_n)$ is defined as follows: $a_1 = p$ is a prime number with exactly $300$ nonzero digits, and for each $n \geq 1, a_{n+1}$ is the decimal period of $1/a_n$ multiplies by $2$. Determine $a_{2003}.$

Let $a,b,c,d$ be real numbers such that $a>b>c>d\geq 0$ and $a + d = b + c$. Show that \[ x^a + x^d \geq x^b + x^c \] for $x>0$.

An acute-angled triangle $ABC$ is given in the plane. The circle with diameter $\, AB \,$ intersects altitude $\, CC' \,$ and its extension at points $\, M \,$ and $\, N \,$, and the circle with diameter $\, AC \,$ intersects altitude $\, BB' \,$ and its extensions at $\, P \,$ and $\, Q \,$. Prove that the points $\, M, N, P, Q \,$ lie on a common circle.

There are $2n$ people ($n \ge 2$) sitting around the round table, with each person getting to know both with his neighbors and exactly opposite him sits a person he does not know. Prove that people can rearrange in such a way that everyone knows one of their two neighbors.

Triangle $\triangle ABC$ is inscribed in circle $\Omega$. Let $I$ denote its incenter and $I_A$ its $A$-excenter. Let $N$ denote the midpoint of arc $BAC$. Line $NI_A$ meets $\Omega$ a second time at $T$. The perpendicular to $AI$ at $I$ meets sides $AC$ and $AB$ at $E$ and $F$ respectively. The circumcircle of $\triangle BFT$ meets $BI_A$ a second time at $P$, and the circumcircle of $\triangle CET$ meets $CI_A$ a second time at $Q$. Prove that $PQ$ passes through the antipodal to $A$ on $\Omega$.

Let $p_{n}$ denote the $n$th prime number. For all $n \ge 6$, prove that \[\pi \left( \sqrt{p_{1}p_{2}\cdots p_{n}}\right) > 2n.\]

On the world conference of parties of liars and truth-lovers there were $32$ participants which were sitting in four rows with $8$ chairs each. During a break each participant claimed that among his neighbors (by row or column) there are members of both parties. It is known that liars always lie, whereas truth-lovers always tell truth. What is the smallest number of liars at the conference for which this situation is possible?

$f$ is a real-valued function defined on the reals such that $f(x) \le x$ and $f(x + y) \le f(x) + f(y)$ for all $x, y$. Prove that $f(x) = x$ for all $x$.

[b]p1.[/b] Three camps are located in the vertices of an equilateral triangle. The roads connecting camps are along the sides of the triangle. Captain America is inside the triangle and he needs to know the distances between camps. Being able to see the roads he has found that the sum of the shortest distances from his location to the roads is 50 miles. Can you help Captain America to evaluate the distances between the camps? [b]p2.[/b] $N$ regions are located in the plane, every pair of them have a non-empty overlap. Each region is a connected set, that means every two points inside the region can be connected by a curve all points of which belong to the region. Iron Man has one charge remaining to make a laser shot. Is it possible for him to make the shot that goes through all $N$ regions? [b]p3.[/b] Money in Wonderland comes in $\$5$ and $\$7$ bills. (a) What is the smallest amount of money you need to buy a slice of pizza that costs $\$1$ and get back your change in full? (The pizza man has plenty of $\$5$ and $\$7$ bills.) For example, having $\$7$ won't do since the pizza man can only give you $\$5$ back. (b) Vending machines in Wonderland accept only exact payment (do not give back change). List all positive integer numbers which CANNOT be used as prices in such vending machines. (That is, find the sums of money that cannot be paid by exact change.) [b]p4.[/b] (a) Put $5$ points on the plane so that each $3$ of them are vertices of an isosceles triangle (i.e., a triangle with two equal sides), and no three points lie on the same line. (b) Do the same with $6$ points. [b]p5.[/b] Numbers $1,2,3,…,100$ are randomly divided in two groups $50$ numbers in each. In the first group the numbers are written in increasing order and denoted $a_1,a_2, ..., a_{50}$. In the second group the numberss are written in decreasing order and denoted $b_1,b_2, ..., b_{50}$. Thus $a_1<a_2<...<a_{50}$ and $ b_1>b_2>...>b_{50}$. Evaluate $|a_1-b_1|+|a_2-b_2|+...+|a_{50}-b_{50}|$. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $P$ and $P '$ be two unequal regular $n-$gons and $A$ and $A'$two points inside $P$ and$ P '$, respectively.Suppose $\{ d_1 , d_2 , \cdots d_n \}$ are the distances from $A $ to the vertices of $P$ and $\{ d'_1 , d'_2 , \cdots d'_n \}$ are defines similarly for $P',A'$. Is it possible for $\{ d'_1 , d'_2 , \cdots d'_n \}$ to be a permutation of $\{ d_1 , d_2 , \cdots d_n \}$ ?

Let $x, y$, and $z$ be real numbers satisfying $x + y + z = xyz.$ Prove that \[x(1 - y^2)(1 - z^2) + y(1 -z^2)(1 - x^2) + z(1 - x^2)(1 - y^2) = 4xyz.\]

Let $f : \mathbb{Z} \to \mathbb{R}$ be a function satisfying $f(x) + f(y) + f(z) \ge 0$ for all integers $x, y, z$ with $x + y + z = 0$. Prove that \[ f(-2017) + f(-2016) + \cdots + f(2016) + f(2017) \ge 0. \]

In the isosceles triangle $\vartriangle ABC$ is $AB = AC$. Let $D$ be the midpoint of the segment $BC$. The points $P$ and $Q$ are respectively on the lines $AD$ and $AB$ (with $Q \ne B$) so that $PQ = PC$. Show that $\angle PQC =\frac12 \angle A $

Find all $ f:\mathbb{Z}\rightarrow\mathbb{Z} $ such that \[ f(2m+f(m)+f(m)f(n))=nf(m)+m \] $ \forall m,n\in\mathbb{Z} $

On the sides of the parallelogram $ABCD$ outside it are constructed equilateral triangles $ABM$, $BCN$, $CDP$, $ADQ$. Prove that $MNPQ$ is a parallelogram.

Let $1<n\in\mathbb{N}$ and $1\le a\in\mathbb{R}$ and there are $n$ number of $x_i, i\in\mathbb{N}, 1\le i\le n$ such that $x_1=1$ and $\frac{x_{i}}{x_{i-1}}=a+\alpha _ i$ for $2\le i\le n$, where $\alpha _i\le \frac{1}{i(i+1)}$. Prove that $\sqrt[n-1]{x_n}< a+\frac{1}{n-1}$.

Find all positive integers $k$ for which the equation: $$ \text{lcm}(m,n)-\text{gcd}(m,n)=k(m-n)$$ has no solution in integers positive $(m,n)$ with $m\neq n$.