Let $ A$ be the subset of the set of positive integers, having the following $ 2$ properties: 1) If $ a$ belong to $ A$,than all of the divisors of $ a$ also belong to $ A$; 2) If $ a$ and $ b$, $ 1 < a < b$, belong to $ A$, than $ 1 \plus{} ab$ is also in $ A$; Prove that if $ A$ contains at least $ 3$ positive integers, than $ A$ contains all positive integers.

Let $ a,b$ and $ c $ be positive real numbers with $ abc = 1 $. Prove that \[ \sqrt{ 9 + 16a^2}+\sqrt{ 9 + 16b^2}+\sqrt{ 9 + 16c^2} \ge 3 +4(a+b+c)\]

If $x,y,z$ satisfy the system of equations \[xy+yz+zx=23\] \[\frac{y}{x+y}+\frac{z}{y+z}+\frac{x}{z+x}=-1\] \[\frac{z^2x}{x+y}+\frac{x^2y}{y+z}+\frac{y^2z}{z+x}=202\] Find the value of $x^2+y^2+z^2$. [i]Proposed by Harry Kim[/i]

Straight rod of 2 meter length is cut into $N$ sticks. The length of each piece is an integer number of centimeters. For which smallest $N$ can one guarantee that it is possible to form the contour of some rectangle, while using all sticks and not breaking them further? (Author: A. Magazinov)

Let $a$ and $b$ be positive real numbers with the sum equal to $1$. Prove that if $a^3$ and $b^3$ are rational, so are $a$ and $b$.

For a positive integer $N$, let $c_1 < c_2 < \cdots < c_m$ be all positive integers smaller than $N$ that are coprime to $N$. Find all $N \geqslant 3$ such that $$\gcd( N, c_i + c_{i+1}) \neq 1$$ for all $1 \leqslant i \leqslant m-1$ \\[i]Here $\gcd(a, b)$ is the largest positive integer that divides both $a$ and $b$. Integers $a$ and $b$ are coprime if $\gcd(a, b) = 1$.[/i] \\ [i]Proposed by Paulius Aleknavičius, Lithuania[/i]

Let $n\in\mathbb{N}^*$. $2n+3$ points on the plane are given so that no 3 lie on a line and no 4 lie on a circle. Is it possible to find 3 points so that the interior of the circle passing through them would contain exactly $n$ of the remaining points.

Find all primes $p$ such that ${100 \choose p} + 7$ is divisible by $p$.

The figure below shows a ring made of six small sections which you are to paint on a wall. You have four paint colors available and will paint each of the six sections a solid color. Find the number of ways you can choose to paint each of the six sections if no two adjacent section can be painted with the same color. [asy] size(3cm); draw(unitcircle); draw(scale(0.6)*unitcircle); for(int i = 0; i < 6; ++i){ draw(dir(60*i)--0.6*dir(60*i)); } [/asy]

Prove that three discs of radius $1$ cannot cover entirely a square surface of side $2$, but they can cover more than $99.75\%$ of it.

Find all the pairs of integers $ (a,b)$ satisfying $ ab(a \minus{} b)\not \equal{} 0$ such that there exists a subset $ Z_{0}$ of set of integers $ Z,$ for any integer $ n$, exactly one among three integers $ n,n \plus{} a,n \plus{} b$ belongs to $ Z_{0}$.

Let $N$ be the number of ways to place the integers $1$ through $12$ in the $12$ cells of a $2\times 6$ grid so that for any two cells sharing a side, the difference between the numbers in those cells is not divisible by $3$. One way to do this is shown below. Find the number of positive integer divisors of $N$. [asy] size(160); defaultpen(linewidth(0.6)); for(int j=0;j<=6;j=j+1) { draw((j,0)--(j,2)); } for(int i=0;i<=2;i=i+1) { draw((0,i)--(6,i)); } for(int k=1;k<=12;k=k+1) { label("$"+((string) k)+"$",(floor((k-1)/2)+0.5,k%2+0.5)); } [/asy]

Prove that if $ 0 \leq \alpha < \frac{\pi}{2} $ and $ 0 \leq \beta < \frac{\pi}{2} $, then $$ tg \frac{\alpha + \beta}{2} \leq \frac{tg \alpha + tg \beta}{2}.$$

You are bargaining with a salesperson for the price of an item. Your first offer is $a$ dollars and theirs is $b$ dollars. After you raise your offer by a certain percentage and they lower their offer by the same percentage, you arrive at an agreed price. What is that price, in terms of $a$ and $b$?

Find the least positive integer \(M\) for which there exist a positive integer \(n\) and polynomials \(P_1(x)\), \(P_2(x)\), \(\ldots\), \(P_n(x)\) with integer coefficients satisfying \[Mx=P_1(x)^3+P_2(x)^3+\cdots+P_n(x)^3.\] [i]Proposed by Karthik Vedula[/i]

Let $k \ge 1$ be a positive integer. Prove that there exist exactly $3^{k-1}$ natural numbers $n$ with the following properties: (i) $n$ has exactly $k$ digits (in decimal representation), (ii) all the digits of $n$ are odd, (iii) $n$ is divisible by $5$, (iv) the number $m = n/5$ has $k$ odd digits

Let $ x $ be a real number such that $ x^3 $ and $ x^2+x $ are rational numbers. Prove that $ x $ is rational.

Circles $ w_{1}$ and $ w_{2}$ with centres $ O_{1}$ and $ O_{2}$ are externally tangent at point $ D$ and internally tangent to a circle $ w$ at points $ E$ and $ F$ respectively. Line $ t$ is the common tangent of $ w_{1}$ and $ w_{2}$ at $ D$. Let $ AB$ be the diameter of $ w$ perpendicular to $ t$, so that $ A, E, O_{1}$ are on the same side of $ t$. Prove that lines $ AO_{1}$, $ BO_{2}$, $ EF$ and $ t$ are concurrent.

Two distinct positive integers are called [i]close [/i] if their greatest common divisor equals their difference. Show that for any $n$, there exists a set $S$ of $n$ elements such that any two elements of $S$ are close.

[b]p1.[/b] Sherry starts with a three-digit positive integer. She subtracts $7$ from it, then multiplies the result by $7$, and then adds $7$ to that. If she ends up with $2023$, what number did she start with? [b]p2.[/b] Square $ABCD$ has side length $1$. Point $X$ lies on $\overline{AB}$ such that $\frac{AX}{XB} = 2$, and point $Y$ lies on $\overline{DX}$ such that $\frac{DY}{YX} = 3$. Compute the area of triangle $DAY$ . [b]p3.[/b] A fair six-sided die is labeled $1-6$ such that opposite faces sum to $7$. The die is rolled, but before you can look at the outcome, the die gets tipped over to an adjacent face. If the new face shows a $4$, what is the probability the original roll was a $1$? PS. You should use hide for answers.

Let $ABC$ be an equilateral triangle with $AB=a$ and $M\in(AB)$ a fixed point. Points $N\in(AC)$ and $P\in(BC)$ are taken such that the perimeter of $MNP$ is minimal. If the ratio between the areas of triangles $MNP$ and $ABC$ is $\textstyle\frac{7}{30},$ find the perimeter of triangle $MNP.$

Let $n$ be a natural number. Prove that a necessary and sufficient condition for the equation $z^{n+1}-z^n-1=0$ to have a complex root whose modulus is equal to $1$ is that $n+2$ is divisible by $6$.

Determine the number of triples $0 \le k,m,n \le 100$ of integers such that \[ 2^mn - 2^nm = 2^k. \]

Let $ a_1$, $ a_2$, $ \ldots$, $ a_n$ be distinct positive integers, $ n\ge 3$. Prove that there exist distinct indices $ i$ and $ j$ such that $ a_i \plus{} a_j$ does not divide any of the numbers $ 3a_1$, $ 3a_2$, $ \ldots$, $ 3a_n$. [i]Proposed by Mohsen Jamaali, Iran[/i]

Compute \[\log_2\left(\prod_{a=1}^{2015}\prod_{b=1}^{2015}\left(1+e^{2\pi iab/2015}\right)\right)\] Here $i$ is the imaginary unit (that is, $i^2=-1$).