Let $ABC$ be an acute-angled triangle and let $D, E$, and $F$ be the feet of altitudes from $A, B$, and $C$ to sides $BC, CA$, and $AB$, respectively. Denote by $\omega_B$ and $\omega_C$ the incircles of triangles $BDF$ and $CDE$, and let these circles be tangent to segments $DF$ and $DE$ at $M$ and $N$, respectively. Let line $MN$ meet circles $\omega_B$ and $\omega_C$ again at $P \ne M$ and $Q \ne N$, respectively. Prove that $MP = NQ$. (Vietnam)

Let $m, n$ integers such that: $(n-1)^3+n^3+(n+1)^3=m^3$ Prove that 4 divides $n$

We denote by $\mathbb{R}^\plus{}$ the set of all positive real numbers. Find all functions $f: \mathbb R^ \plus{} \rightarrow\mathbb R^ \plus{}$ which have the property: \[f(x)f(y)\equal{}2f(x\plus{}yf(x))\] for all positive real numbers $x$ and $y$. [i]Proposed by Nikolai Nikolov, Bulgaria[/i]

Given a positive integer $k,$ prove that for any integer $n \geq 20k,$ there exist $n - k$ pairwise distinct positive integers whose squares add up to $n(n + 1)(2n + 1)/6.$ [i]The Problem Selection Committee[/i]

$n$ people live in a town, and they are members of some clubs (residents can be members of more than one club). No matter how we choose some (but at least one) clubs, there is a resident of the town who is the member of an odd number of the chosen clubs. Prove that the number of clubs is at most $n$. [i]Proposed by Dömötör Pálvölgyi, Budapest[/i]

Let $a > 1$ be a positive integer and $d > 1$ be a positive integer coprime to $a$. Let $x_1=1$, and for $k\geq 1$, define $$x_{k+1} = \begin{cases} x_k + d &\text{if } a \text{ does not divide } x_k \\ x_k/a & \text{if } a \text{ divides } x_k \end{cases}$$ Find, in terms of $a$ and $d$, the greatest positive integer $n$ for which there exists an index $k$ such that $x_k$ is divisible by $a^n$.

Trapezoid $ABCD$ has $\overline{AB} \parallel \overline{CD}$, $BC = CD = 43$, and $\overline{AD} \perp \overline{BD}$. Let $O$ be the intersection of the diagonals $\overline{AC}$ and $\overline{BD}$, and let $P$ be the midpoint of $\overline{BD}$. GIven that $OP = 11$, the length $AD$ can be written in the form $m\sqrt{n}$, where $m$ and $n$ are positive integers and $n$ is not divisible by the square of any prime. What is $m + n$? $\textbf{(A)}\: 65\qquad\textbf{(B)}\: 132\qquad\textbf{(C)}\: 157\qquad\textbf{(D)}\: 194\qquad\textbf{(E)}\: 215$

Can we find $N$ such that all $m\times n$ rectangles with $m,n>N$ can be tiled with $4\times6$ and $5\times7$ rectangles?

Let $S_0=0$ and let $S_k$ equal $a_1+2a_2+\ldots+ka_k$ for $k\geq 1$. Define $a_i$ to be $1$ if $S_{i-1}<i$ and $-1$ if $S_{i-1}\geq i$. What is the largest $k\leq 2010$ such that $S_k=0$?

Call a two-element subset of $\mathbb{N}$ [i]cute[/i] if it contains exactly one prime number and one composite number. Determine all polynomials $f \in \mathbb{Z}[x]$ such that for every [i]cute[/i] subset $ \{ p,q \}$, the subset $ \{ f(p) + q, f(q) + p \} $ is [i]cute[/i] as well. [i]Proposed by Valentio Iverson (Indonesia)[/i]

[b]a)[/b] Show that there are infinitely many rational numbers $ x>0 $ such that $ \left\{ x^2 \right\} +\{ x \} =0.99. $ [b]b)[/b] Show that there are no rational numbers $ x>0 $ such that $ \left\{ x^2 \right\} +\{ x \} =1. $ $ \{\} $ denotes the usual fractional part.

Let $r_k$ denote the remainder when ${127 \choose k}$ is divided by $8$. Compute$ r_1 + 2r_2 + 3r_3 + · · · + 63r_{63}.$

Sequence $ \{ f_n(a) \}$ satisfies $ \displaystyle f_{n\plus{}1}(a) \equal{} 2 \minus{} \frac{a}{f_n(a)}$, $ f_1(a) \equal{} 2$, $ n\equal{}1,2, \cdots$. If there exists a natural number $ n$, such that $ f_{n\plus{}k}(a) \equal{} f_{k}(a), k\equal{}1,2, \cdots$, then we call the non-zero real $ a$ a $ \textbf{periodic point}$ of $ f_n(a)$. Prove that the sufficient and necessary condition for $ a$ being a $ \textbf{periodic point}$ of $ f_n(a)$ is $ p_n(a\minus{}1)\equal{}0$, where $ \displaystyle p_n(x)\equal{}\sum_{k\equal{}0}^{\left[ \frac{n\minus{}1}{2} \right]} (\minus{}1)^k C_n^{2k\plus{}1}x^k$, here we define $ \displaystyle \frac{a}{0}\equal{} \infty$ and $ \displaystyle \frac{a}{\infty} \equal{} 0$.

A set $S$ is constructed as follows. To begin, $S=\{0,10\}$. Repeatedly, as long as possible, if $x$ is an integer root of some polynomial $a_nx^n+a_{n-1}x^{n-1}+\cdots+a_1x+a_0$ for some $n\geq 1$, all of whose coefficients $a_i$ are elements of $S$, then $x$ is put into $S$. When no more elements can be added to $S$, how many elements does $S$ have? $\textbf{(A) } 4 \qquad \textbf{(B) } 5 \qquad \textbf{(C) } 7 \qquad \textbf{(D) } 9 \qquad \textbf{(E) } 11$

Prove that \[1+\frac{2^1}{1-2^1}+\frac{2^2}{(1-2^1)(1-2^2)}+\cdots+\frac{2^{2016}}{(1-2^1)\cdots(1-2^{2016})}>0.\]

An ant is on the bottom edge of a right circular cone with base area $\pi$ and slant length $6$. What is the shortest distance that the ant has to travel to loop around the cone and come back to its starting position?

An [i]$n$-type triangle[/i] where $n\geqslant 2$ is formed by the cells of a $(2n+1)\times(2n+1)$ board, situated under both main diagonals. For instance, a $3$-type triangle looks like this:[img]https://i.ibb.co/k4fmwWY/Screenshot-2024-07-31-153932.png[/img]Determine the maximal length of a sequence with pairwise distinct cells in an $n$-type triangle, such that, beggining with the second one, any cell of the sequence has a common side with the previous one. [i]Cristi Săvescu[/i]

Two-thirds of the people in a room are seated in three-fourths of the chairs. The rest of the people are standing. If there are $6$ empty chairs, how many people are in the room? $\textbf{(A)}\ 12\qquad \textbf{(B)}\ 18\qquad \textbf{(C)}\ 24\qquad \textbf{(D)}\ 27\qquad \textbf{(E)}\ 36$

In a triangle $ABC$ assume $AB = AC$, and let $D$ and $E$ be points on the extension of segment $BA$ beyond $A$ and on the segment $BC$, respectively, such that the lines $CD$ and $AE$ are parallel. Prove $CD \ge \frac{4h}{BC}CE$, where $h$ is the height from $A$ in triangle $ABC$. When does equality hold?

$2048$ frogs are sitting in a circle and each have a $\$1$ bill. After each minute, each frog will independently give away each of their $\$1$ bills to either the closest frog to their left or the closest frog to their right with equal probability. If a frog has $\$0$ at the end of any given minute, then they will not give any money but may receive money. The expected number of frogs to have at least $\$1$ after $3$ minutes can be denoted as a common fraction in the form $\tfrac{a}{b}.$ Find $a+b.$

We want to colour all the squares of an $ nxn$ board of red or black. The colorations should be such that any subsquare of $ 2x2$ of the board have exactly two squares of each color. If $ n\geq 2$ how many such colorations are possible?

Let $c_1,c_2,\ldots,c_n$ be real numbers such that $$c_1^k+c_2^k+\ldots+c_n^k>0\qquad\text{for all }k=1,2,\ldots$$Let us put $$f(x)=\frac1{(1-c_1x)(1-c_2x)\cdots(1-c_nx)}.$$$z\in\mathbb C$ Show that $f^{(k)}(0)>0$ for all $k=1,2,\ldots$.

Find all prime numbers which can be presented as a sum of two primes and difference of two primes at the same time.

Jeck and Lisa are playing a game on table dimensions $m \times n$ , where $m , n >2$. Lisa starts so that she puts knight figurine on arbitrary square of table.After that Jeck and Lisa put new figurine on table by the following rules: [b]1.[/b] Jeck puts queen figurine on any empty square of a table which is two squares vertically and one square horizontally distant, or one square vertically and two squares horizontally distant from last knight figurine which Lisa put on the table [b]2.[/b] Lisa puts knight figurine on any empty square of a table which is in the same row, column or diagonal as last queen figurine Jeck put on the table. Player which cannot put his figurine loses. For which pairs of $(m,n)$ Lisa has winning strategy? [i] Proposed by Stijn Cambie[/i]

$\text{ }$ [asy] unitsize(11); for(int i=0; i<6; ++i) { if(i<5) draw( (i, 0)--(i,5) ); else draw( (i, 0)--(i,2) ); if(i < 3) draw((0,i)--(5,i)); else draw((0,i)--(4,i)); } [/asy] We are dividing the above figure into parts with shapes: [asy] unitsize(11); draw((0,0)--(0,2)); draw((1,0)--(1,2)); draw((2,1)--(2,2)); draw((0,0)--(1,0)); draw((0,1)--(2,1)); draw((0,2)--(2,2)); [/asy][asy] unitsize(11); draw((0,0)--(0,2)); draw((1,0)--(1,2)); draw((2,1)--(2,2)); draw((3,1)--(3,2)); draw((0,0)--(1,0)); draw((0,1)--(3,1)); draw((0,2)--(3,2)); [/asy] After that division, find the number of [asy] unitsize(11); draw((0,0)--(0,2)); draw((1,0)--(1,2)); draw((2,1)--(2,2)); draw((0,0)--(1,0)); draw((0,1)--(2,1)); draw((0,2)--(2,2)); [/asy] shaped parts.