Let $n\ge 2$ be an integer. Show that there exists a subset $A\in \{1,2,\ldots ,n\}$ such that: i) The number of elements of $A$ is at most $2\lfloor\sqrt{n}\rfloor+1$ ii) $\{ |x-y| \mid x,y\in A, x\not= y\} = \{ 1,2,\ldots n-1 \}$ [i]Radu Todor[/i]

Given are $100$ positive integers whose sum equals their product. Determine the minimum number of $1$s that may occur among the $100$ numbers.

If $ y\equal{}x^2\plus{}px\plus{}q$, then if the least possible value of $ y$ is zero $ q$ is equal to: $ \textbf{(A)}\ 0 \qquad \textbf{(B)}\ \frac{p^2}{4} \qquad \textbf{(C)}\ \frac{p}{2} \qquad \textbf{(D)}\ \minus{}\frac{p}{2} \qquad \textbf{(E)}\ \frac{p^2}{4}\minus{}q$

In rectangular coordinate system, if $m(x^2+y^2+2y+1)=(x-2y+3)^2$ refers to an ellipse, then the range value of $m$ is $\text{(A)}(0,1)\qquad\text{(B)}(1,+\infty)\qquad\text{(C)}(0,5)\qquad\text{(D)}(5,+\infty)$

A man has three daughters. The product of their ages is $168$, and he remembers that the sum of their ages is the number of trees in his yard. He counts the trees but cannot determine any of their ages. What are all possible ages of his oldest daughter?

Let $ABCD$ be a cyclic quadrilateral with $\angle BAD < \angle ADC$. Let $M$ be the midpoint of the arc $CD$ not containing $A$. Suppose there is a point $P$ inside $ABCD$ such that $\angle ADB = \angle CPD$ and $\angle ADP = \angle PCB$. Prove that lines $AD, PM$, and $BC$ are concurrent.

We put pebbles on some unit squares of a $2013 \times 2013$ chessboard such that every unit square contains at most one pebble. Determine the minimum number of pebbles on the chessboard, if each $19\times 19$ square formed by unit squares contains at least $21$ pebbles.

Let $x, y, z$ be non-negative real numbers whose sum is $ 1$. Prove that: $$\sqrt[3]{x - y + z^3} + \sqrt[3]{y - z + x^3} + \sqrt[3]{z - x + y^3} \le 1$$

Consider a cyclic quadrilateral $ABCD$ and define points $X = AB \cap CD$, $Y = AD \cap BC$, and suppose that there exists a circle with center $Z$ inscribed in $ABCD$. Show that the $Z$ belongs to the circle with diameter $XY$ , which is orthogonal to circumcircle of $ABCD$.

For some positive integer $n$, $n$ is considered a $\textbf{unique}$ number if for any other positive integer $m\neq n$, $\{\dfrac{2^n}{n^2}\}\neq\{\dfrac{2^m}{m^2}\}$ holds. Prove that there is an infinite list consisting of composite unique numbers whose elements are pairwise coprime.

Determine whether there exist two infinite point sequences $ A_1,A_2,\ldots$ and $ B_1,B_2,\ldots$ in the plane, such that for all $i,j,k$ with $ 1\le i < j < k$, (i) $ B_k$ is on the line that passes through $ A_i$ and $ A_j$ if and only if $ k=i+j$. (ii) $ A_k$ is on the line that passes through $ B_i$ and $ B_j$ if and only if $ k=i+j$. [i](Proposed by Gerhard Woeginger, Austria)[/i]

For every edge of a tetrahedron, we consider a plane through its midpoint that is perpendicular to the opposite edge. Prove that these six planes intersect in a point symmetric to the circumcenter of the tetrahedron with respect to its centroid.

[u]Set 1 [/u] [b]1.1[/b] Compute the number of real numbers x such that the sequence $x$, $x^2$, $x^3$,$ x^4$, $x^5$, $...$ eventually repeats. (To be clear, we say a sequence “eventually repeats” if there is some block of consecutive digits that repeats past some point—for instance, the sequence $1$, $2$, $3$, $4$, $5$, $6$, $5$, $6$, $5$, $6$, $...$ is eventually repeating with repeating block $5$, $6$.) [b]1.2[/b] Let $T$ be the answer to the previous problem. Nicole has a broken calculator which, when told to multiply $a$ by $b$, starts by multiplying $a$ by $b$, but then multiplies that product by b again, and then adds $b$ to the result. Nicole inputs the computation “$k \times k$” into the calculator for some real number $k$ and gets an answer of $10T$. If she instead used a working calculator, what answer should she have gotten? [b]1.3[/b] Let $T$ be the answer to the previous problem. Find the positive difference between the largest and smallest perfect squares that can be written as $x^2 + y^2$ for integers $x, y$ satisfying $\sqrt{T} \le x \le T$ and $\sqrt{T} \le y \le T$. PS. You should use hide for answers.

Find $\lim_{n\to\infty} \int_0^1 x^2e^{-\left(\frac{x}{n}\right)^2}dx.$

Consider the following sequence $$(a_n)_{n=1}^{\infty}=(1,1,2,1,2,3,1,2,3,4,1,2,3,4,5,1,\dots)$$ Find all pairs $(\alpha, \beta)$ of positive real numbers such that $\lim_{n\to \infty}\frac{\displaystyle\sum_{k=1}^n a_k}{n^{\alpha}}=\beta$. (Proposed by Tomas Barta, Charles University, Prague)

Let it be is a wooden unit cube. We cut along every plane which is perpendicular to the segment joining two distinct vertices and bisects it. How many pieces do we get?

Let $a$ and $b$ be nonnegative real numbers. Prove that \[\sqrt{2}\left(\sqrt{a(a+b)^3}+b\sqrt{a^2+b^2}\right) \le 3(a^2+b^2).\]

Initially, the numbers $2$ and $5$ are written on the board. A \emph{move} consists of replacing one of the two numbers on the board with their sum. Is it possible to obtain (in a finite numer of moves) a situation in which the two integers written on the board are consecutive? Justify your answer.

Find all positive integers $k$ such that for the first $k$ prime numbers $2, 3, \ldots, p_k$ there exist positive integers $a$ and $n>1$, such that $2\cdot 3\cdot\ldots\cdot p_k - 1=a^n$. [i]V. Senderov[/i]

Three travel companies provide transportation between $n$ cities, such that each connection between a pair of cities is covered by one company only. Prove that, for $n \geq 11$, there must exist a round-trip through some four cities, using the services of a same company, while for $n < 11$ this is not anymore necessarily true. [i]Dan Schwarz[/i]

Compute the last digit of $(5^{20}+2)^3.$

Let $S$ be a set of 100 integers. Suppose that for all positive integers $x$ and $y$ (possibly equal) such that $x + y$ is in $S$, either $x$ or $y$ (or both) is in $S$. Prove that the sum of the numbers in $S$ is at most 10,000.

Let $ABC$ be an acute-angled triangle. Let $AD,BE,CF$ be internal bisectors with $D, E, F$ on $BC, CA, AB$ respectively. Prove that \[\frac{EF}{BC}+\frac{FD}{CA}+\frac{DE}{AB}\geq 1+\frac{r}{R}\]

A point object of mass $m$ is connected to a cylinder of radius $R$ via a massless rope. At time $t = 0$ the object is moving with an initial velocity $v_0$ perpendicular to the rope, the rope has a length $L_0$, and the rope has a non-zero tension. All motion occurs on a horizontal frictionless surface. The cylinder remains stationary on the surface and does not rotate. The object moves in such a way that the rope slowly winds up around the cylinder. The rope will break when the tension exceeds $T_{max}$. Express your answers in terms of $T_{max}$, $m$, $L_0$, $R$, and $v_0$. [asy] size(200); real L=6; filldraw(CR((0,0),1),gray(0.7),black); path P=nullpath; for(int t=0;t<370;++t) { pair X=dir(180-t)+(L-t/180)*dir(90-t); if(X.y>L) X=(X.x,L); P=P--X; } draw(P,dashed,EndArrow(size=7)); draw((-1,0)--(-1,L)--(2,L),EndArrow(size=7)); filldraw(CR((-1,L),0.25),gray(0.7),black);[/asy] What is the angular momentum of the object with respect to the axis of the cylinder at the instant that the rope breaks? $ \textbf{(A)}\ mv_0R $ $ \textbf{(B)}\ \frac{m^2v_0^3}{T_{max}} $ $ \textbf{(C)}\ mv_0L_0 $ $ \textbf{(D)}\ \frac{T_{max}R^2}{v_0} $ $ \textbf{(E)}\ \text{none of the above} $

Consider fractions $\frac{a}{b}$ where $a$ and $b$ are positive integers. (a) Prove that for every positive integer $n$, there exists such a fraction $\frac{a}{b}$ such that $\sqrt{n} \le \frac{a}{b} \le \sqrt{n+1}$ and $b \le \sqrt{n}+1$. (b) Show that there are infinitely many positive integers $n$ such that no such fraction $\frac{a}{b}$ satisfies $\sqrt{n} \le \frac{a}{b} \le \sqrt{n+1}$ and $b \le \sqrt{n}$.