Suppse that $X=\{1,2, \ldots, 2^{1996}-1\}$, prove that there exist a subset $A$ that satisfies these conditions: a) $1\in A$ and $2^{1996}-1\in A$; b) Every element of $A$ except $1$ is equal to the sum of two (possibly equal) elements from $A$; c) The maximum number of elements of $A$ is $2012$. [i]Romania[/i]

A set of points of the plane is called [i] obtuse-angled[/i] if every three of it's points are not collinear and every triangle with vertices inside the set has one angle $ >91^o$. Is it correct that every finite [i] obtuse-angled[/i] set can be extended to an infinite [i]obtuse-angled[/i] set? (UK)

Prove that the set of positive integers cannot be partitioned into three nonempty subsets such that, for any two integers $x,y$ taken from two different subsets, the number $x^2-xy+y^2$ belongs to the third subset.

Find the largest real constant $\lambda$ such that \[\frac{\lambda abc}{a+b+c}\leq (a+b)^2+(a+b+4c)^2\] For all positive real numbers $a,b,c.$

The area of the triangle $ABC$ shown in the figure is $1$ unit. Points $D$ and $E$ lie on sides $AC$ and $BC$ respectively, and also are its ''one third'' points closer to $C$. Let $F$ be that $AE$ and $G$ are the midpoints of segment $BD$. What is the area of the marked quadrilateral $ABGF$? [img]https://cdn.artofproblemsolving.com/attachments/4/e/305673f429c86bbc58a8d40272dd6c9a8f0ab2.png[/img]

Let $n$ be an positive integer. Find the smallest integer $k$ with the following property; Given any real numbers $a_1 , \cdots , a_d $ such that $a_1 + a_2 + \cdots + a_d = n$ and $0 \le a_i \le 1$ for $i=1,2,\cdots ,d$, it is possible to partition these numbers into $k$ groups (some of which may be empty) such that the sum of the numbers in each group is at most $1$.

Let $m$ and $n$ be positive integers such that $2^n+3^m$ is divisible by $5$. Prove that $2^m+3^n$ is divisible by $5$.

Let $k$ be a positive integer. Prove that one can partition the set $\{ 0,1,2,3, \cdots ,2^{k+1}-1 \}$ into two disdinct subsets $\{ x_1,x_2, \cdots, x_{2k} \}$ and $\{ y_1, y_2, \cdots, y_{2k} \}$ such that $\sum_{i=1}^{2^k} x_i^m =\sum_{i=1}^{2^k} y_i^m$ for all $m \in \{ 1,2, \cdots, k \}$.

Let $ m_1,m_2,m_3,\dots,m_n$ be a rearrangement of the numbers $ 1,2,\dots,n$. Suppose that $ n$ is odd. Prove that the product \[ \left(m_1\minus{}1\right)\left(m_2\minus{}2\right)\cdots \left(m_n\minus{}n\right)\] is an even integer.

Let $ABC$ be an acute angled triangle. Points $E$ and $F$ are chosen on the sides $AC$ and $AB$, respectively, such that \[BC^2=BA\times BF+CE\times CA.\] Prove that for all such $E$ and $F$, circumcircle of the triangle $AEF$ passes through a fixed point different from $A$.

Prove that for all $n\in\mathbb{N}$ we have $\sum_{k=0}^n\dbinom {n}{k}^2=\dbinom {2n}{n}$.

In $\vartriangle ABC, D$ and $E$ are two points on segment $BC$ such that $BD = CE$ and $\angle BAD = \angle CAE$. Prove that $\vartriangle ABC$ is isosceles

$2022$ teams participated in an underwater polo tournament, each two teams played exactly once against each other. Team receives $2, 1, 0$ points for win, draw, and loss correspondingly. It turned out that all teams got distinct numbers of points. In the final standings the teams were ordered by the total number of points. A few days later, organizers realized that the results in the final standings were wrong due to technical issues: in fact, each match that ended with a draw according to them in fact had a winner, and each match with a winner in fact ended with a draw. It turned out that all teams still had distinct number of points! They corrected the standings, and ordered them by the total number of points. Could the correct order turn out to be the reversed initial order? [i](Proposed by Fedir Yudin)[/i]

A ray emanating from the vertex $A$ of the triangle $ABC$ intersects the side $BC$ at $X$ and the circumcircle of triangle $ABC$ at $Y$. Prove that $\frac{1}{AX}+\frac{1}{XY}\geq \frac{4}{BC}$.

In how many ways can the following figure be tiled with $2 \times 1$ dominos? [asy] defaultpen(linewidth(.8)); size(5.5cm); int i; for(i = 1; i<6; i = i+1) { draw((.5 + i,6-i)--(.5 + i,i-6)--(-(.5 + i),i-6)--(-(.5 + i),6-i)--cycle);} draw((.5,5)--(.5,-5)^^(-.5,5)--(-.5,-5)^^(5.5,0)--(-5.5,0)); [/asy] [i]Proposed by Lewis Chen[/i]

Find all prime numbers $p,q$, for which $p^{q+1}+q^{p+1}$ is a perfect square. [i]Proposed by P. Boyvalenkov[/i]

The sum of the base-$ 10$ logarithms of the divisors of $ 10^n$ is $ 792$. What is $ n$? $ \textbf{(A)}\ 11\qquad \textbf{(B)}\ 12\qquad \textbf{(C)}\ 13\qquad \textbf{(D)}\ 14\qquad \textbf{(E)}\ 15$

For a positive integer $n$, let $S(n) $be the set of complex numbers $z = x+iy$ ($x,y \in R$) with $ |z| = 1$ satisfying $(x+iy)^n+(x-iy)^n = 2x^n$ . (a) Determine $S(n)$ for $n = 2,3,4$. (b) Find an upper bound (depending on $n$) of the number of elements of $S(n)$ for $n > 5$.

Let $n > 1$ be a positive integer. Find all $n$-tuples $(a_1 , a_2 ,\ldots, a_n )$ of positive integers which are pairwise distinct, pairwise coprime, and such that for each $i$ in the range $1 \le i \le n$, \[(a_1 + a_2 + \ldots + a_n )|(a_1^i + a_2^i + \ldots + a_n^i )\].

In tetrahedron $ABCD$, vertex $D$ is connected with $D_0$, the centrod if $\triangle ABC$. Line parallel to $DD_0$ are drawn through $A,B$ and $C$. These lines intersect the planes $BCD, CAD$ and $ABD$ in points $A_2, B_1,$ and $C_1$, respectively. Prove that the volume of $ABCD$ is one third the volume of $A_1B_1C_1D_0$. Is the result if point $D_o$ is selected anywhere within $\triangle ABC$?

Prove that if in a triangle the orthocenter, the centroid and the incenter are collinear, then the triangle is isosceles.

Point $P_1$ is located $600$ miles West of point $P_2$. At $7:00\text{AM}$ a car departs from $P_1$ and drives East at a speed of $50$mph. At $8:00\text{AM}$ another car departs from $P_2$ and drives West at a constant speed of $x$ miles per hour. If the cars meet each other exactly halfway between $P_1$ and $P_2$, what is the value of $x$?

In some school $64$ students participate in five different subject olympiads. In each olympiad at least $19$ students take part; none of them is a participant of more than three olympiads. Prove that if every three olympiads have a common participant, then there are two olympiads having at least five participants in common.

Let $a$ and $b$ be distinct positive integers such that $3^a + 2$ is divisible by $3^b + 2$. Prove that $a > b^2$. [i]Proposed by Tynyshbek Anuarbekov, Kazakhstan[/i]

Henry decides one morning to do a workout, and he walks $\tfrac{3}{4}$ of the way from his home to his gym. The gym is $2$ kilometers away from Henry's home. At that point, he changes his mind and walks $\tfrac{3}{4}$ of the way from where he is back toward home. When he reaches that point, he changes his mind again and walks $\tfrac{3}{4}$ of the distance from there back toward the gym. If Henry keeps changing his mind when he has walked $\tfrac{3}{4}$ of the distance toward either the gym or home from the point where he last changed his mind, he will get very close to walking back and forth between a point $A$ kilometers from home and a point $B$ kilometers from home. What is $|A-B|$? $\textbf{(A) } \frac{2}{3} \qquad \textbf{(B) } 1 \qquad \textbf{(C) } 1\frac{1}{5} \qquad \textbf{(D) } 1\frac{1}{4} \qquad \textbf{(E) } 1\frac{1}{2}$