Find the number of three-element subsets of $\{1, 2, 3,...,13\}$ that contain at least one element that is a multiple of $2$, at least one element that is a multiple of $3$, and at least one element that is a multiple of $5$ such as $\{2,3, 5\}$ or $\{6, 10,13\}$.

Show that there is a digit unequal to 2 in the decimal represesentation of $ \sqrt [3]{3}$ between the $ 1000000$-th und $ 3141592$-th position after decimal point.

An isosceles $\triangle ABC$ has $\angle BAC =\angle ABC =72^{o}$. The angle bisector $AL$ meets the line through $C$ parallel to $AB$ at $D$. $a)$ Prove that the circumcenter of $\triangle ADC$ lies on $BD$. $b)$ Prove that $\frac {BE} {BL}$ is irrational.

Let $a,b,c$ be distinct positive real numbers such that $\frac{1}{1+a}+\frac{1}{1+b}+\frac{1}{1+c}\leq 1$. Prove that $$2\left(\sqrt{\frac{a+b}{ac}}+\sqrt{\frac{b+c}{ba}}+\sqrt{\frac{c+a}{cb}}\right)<\frac{a^3}{(a-b)(a-c)}+\frac{b^3}{(b-c)(b-a)}+\frac{c^3}{(c-a)(c-b)}.$$

On some planet, there are $2^N$ countries $(N \geq 4).$ Each country has a flag $N$ units wide and one unit high composed of $N$ fields of size $1 \times 1,$ each field being either yellow or blue. No two countries have the same flag. We say that a set of $N$ flags is diverse if these flags can be arranged into an $N \times N$ square so that all $N$ fields on its main diagonal will have the same color. Determine the smallest positive integer $M$ such that among any $M$ distinct flags, there exist $N$ flags forming a diverse set. [i]Proposed by Tonći Kokan, Croatia[/i]

Number $ 0$ is written on the board. Two players alternate writing signs and numbers to the right, where the first player always writes either $ \plus{}$ or $ \minus{}$ sign, while the second player writes one of the numbers $ 1, 2, ... , 1993$,writing each of these numbers exactly once. The game ends after $ 1993$ moves. Then the second player wins the score equal to the absolute value of the expression obtained thereby on the board. What largest score can he always win?

Is there a set of distinct integers $X$ containing all the primes less than $2007$ such that the product of the elements of $X$ equals the sum of the squares of those elements?

Let be nine nonzero decimal digits $ a_1,a_2,a_3,b_1,b_2,b_3,c_1,c_2,c_3 $ chosen such that the polynom $$ \left( 100a_1+10a_2+a_3 \right) X^2 +\left( 100b_1+10b_2+b_3 \right) X +100c_1+10c_2+c_3 $$ admits at least a real solution. Prove that at least one of the polynoms $ a_iX^2+b_iX+c_i\quad (i\in\{1,2,3\}) $ admits at least a real solution. [i]Nicolae Mușuroia[/i]

Given a permutation of $1,2,3,\dots,n$, with consecutive elements $a,b,c$ (in that order), we may perform either of the [i]moves[/i]: [list] [*] If $a$ is the median of $a$, $b$, and $c$, we may replace $a,b,c$ with $b,c,a$ (in that order) [*] If $c$ is the median of $a$, $b$, and $c$, we may replace $a,b,c$ with $c,a,b$ (in that order) [/list] What is the least number of sets in a partition of all $n!$ permutations, such that any two permutations in the same set are obtainable from each other by a sequence of moves? [i]Proposed by Milan Haiman[/i]

Let $A$ be the set of natural numbers $n$ such that the distance of the real number $n\sqrt{2022} - \frac13$ from the nearest integer is at most $\frac1{2022}$. Show that the equation $$20x + 21y = 22z$$ has no solutions over the set $A$.

Let $ F_n$ be a set of all possible connected figures, that consist of $ n$ unit cells. For each element $ f_n$ of this set, let $ S(f_n)$ be the area of that minimal rectangle that covers $ f_n$ and each side of the rectangle is parallel to the corresponding side of the cell. Find $ max(S(f_n))$,where $ f_n\in F_n$? Remark: Two cells are called connected if they have a common edge.

Let be a function $ s:\mathbb{N}^2\longrightarrow \mathbb{N} $ that sends $ (m,n) $ to the number of solutions in $ \mathbb{N}^n $ of the equation: $$ x_1+x_2+\cdots +x_n=m $$ [b]1)[/b] Prove that: $$ s(m+1,n+1)=s(m,n)+s(m,n+1) =\prod_{r=1}^n\frac{m-r+1}{r} ,\quad\forall m,n\in\mathbb{N} $$ [b]2)[/b] Find $ \max\left\{ a_1a_2\cdots a_{20}\bigg| a_1+a_2+\cdots +a_{20}=2007, a_1,a_2,\ldots a_{20}\in\mathbb{N} \right\} . $

Allison has a coin which comes up heads $\frac23$ of the time. She flips it $5$ times. What is the probability that she sees more heads than tails?

Find all primes $p$ and $q$ such that $3p^{q-1}+1$ divides $11^p+17^p$ Proposed by Stanislav Dimitrov,Bulgaria

In the triangle ABC, D is the foot of the altitude from A to BC, and M is the midpoint of the line segment BC. The three angles ∠BAD, ∠DAM and ∠MAC are all equal. Find the angles of the triangle ABC.

For which positive integers $n$ does there exist a positive integer $m$ such that among the numbers $m + n, 2m + (n - 1), \dots, nm + 1$, there are no two that share a common factor greater than $1$?

Four distinct lines $L_1,L_2,L_3,L_4$ are given in the plane: $L_1$ and $L_2$ are respectively parallel to $L_3$ and $L_4$. Find the locus of a point moving so that the sum of its perpendicular distances from the four lines is constant.

A positive number $ x$ has the property that $ x\%$ of $ x$ is $ 4$. What is $ x$? $ \textbf{(A)}\ 2 \qquad \textbf{(B)}\ 4 \qquad \textbf{(C)}\ 10 \qquad \textbf{(D)}\ 20 \qquad \textbf{(E)}\ 40$

Define a [i]beautiful number[/i] to be an integer of the form $a^n$, where $a\in\{3,4,5,6\}$ and $n$ is a positive integer. Prove that each integer greater than $2$ can be expressed as the sum of pairwise distinct beautiful numbers. [i]Proposed by Matthew Babbitt[/i]

Evaluate the sum $\sqrt{1-\frac{1}{2}\cdot\sqrt{1\cdot3}}+\sqrt{2-\frac{1}{2}\cdot\sqrt{3\cdot5}}+\sqrt{3-\frac{1}{2}\cdot\sqrt{5\cdot7}}+\dots+\sqrt{40-\frac{1}{2}\cdot\sqrt{79\cdot81}}$.

In a blackboard there are $K$ circles in a row such that one of the numbers $1,...,K$ is assigned to each circle from the left to the right. Change of situation of a circle is to write in it or erase the number which is assigned to it.At the beginning no number is written in its own circle. For every positive divisor $d$ of $K$ ,$1\leq d\leq K$ we change the situation of the circles in which their assigned numbers are divisible by $d$,performing for each divisor $d$ $K$ changes of situation. Determine the value of $K$ for which the following holds;when this procedure is applied once for all positive divisors of $K$ ,then all numbers $1,2,3,...,K$ are written in the circles they were assigned in.

If $f(x)=\cos(x)-1+\frac{x^2}2$, then $\textbf{(A)}~f(x)\text{ is an increasing function on the real line}$ $\textbf{(B)}~f(x)\text{ is a decreasing function on the real line}$ $\textbf{(C)}~f(x)\text{ is increasing on }-\infty<x\le0\text{ and decreasing on }0\le x<\infty$ $\textbf{(D)}~f(x)\text{ is decreasing on }-\infty<x\le0\text{ and increasing on }0\le x<\infty$

In a set $X$ of n people, some know each other and others do not, where the relationship to know is symmetric; that is, if $ A$ knows $ B$. then $ B$ knows $ A$. On the other hand, given any$ 4$ people: $A, B, C$ and $D$: if $A$ knows $B$, $B$ knows $C$ and $C$ knows $D$, then it happens at least one of the following three: $A$ knows $C, B$ knows $D$ or $A$ knows $D$. Prove that $X$ can be partition into two sets $Y$ and $Z$ so that all elements of $Y$ know all those of $Z$ or no element in $Y$ knows any in $Z$.

let $ABCD$ be a cyclic quadrilateral with $E$,an interior point such that $AB=AD=AE=BC$. Let $DE$ meet the circumcircle of $BEC$ again at $F$. Suppose a common tangent to the circumcircle of $BEC$ and $DEC$ touch the circles at $F$ and $G$ respectively. Show that $GE$ is the external angle bisector of angle $BEF$

Let $n$ be the number of possible ways to place six orange balls, six black balls, and six white balls in a circle (two placements are considered equivalent if one can be rotated to fit the other). What is the remainder when $n$ is divided by $1000$?