At least $ n - 1$ numbers are removed from the set $\{1, 2, \ldots, 2n - 1\}$ according to the following rules: (i) If $ a$ is removed, so is $ 2a$; (ii) If $ a$ and $ b$ are removed, so is $ a \plus{} b$. Find the way of removing numbers such that the sum of the remaining numbers is maximum possible.

We consider a prism which has the upper and inferior basis the pentagons: $A_{1}A_{2}A_{3}A_{4}A_{5}$ and $B_{1}B_{2}B_{3}B_{4}B_{5}$. Each of the sides of the two pentagons and the segments $A_{i}B_{j}$ with $i,j=1,\ldots,5$ is colored in red or blue. In every triangle which has all sides colored there exists one red side and one blue side. Prove that all the 10 sides of the two basis are colored in the same color.

The diagonals of the inscribed quadrilateral $ABCD$ intersect at the point $O$. The points $P$, $Q$, $R$, and $S$ are the feet of the perpendiculars from $O$ to the sides $AB$, $BC$, $CD$, and $DA$, respectively. Prove the inequality $BD\ge SP+QR$. [i](A. Naradzetski)[/i]

The function $f$ is defined by $f\left(x\right)=x^2+3x$. Find the product of all solutions of the equation $f\left(2x-1\right)=6$.

Let $n$ be a positive integer and $f(x)=a_mx^m+\ldots + a_1X+a_0$, with $m\ge 2$, a polynomial with integer coefficients such that: a) $a_2,a_3\ldots a_m$ are divisible by all prime factors of $n$, b) $a_1$ and $n$ are relatively prime. Prove that for any positive integer $k$, there exists a positive integer $c$, such that $f(c)$ is divisible by $n^k$.

$ABC$ is an isosceles triangle with $AB=AC$ and the angle in $A$ is less than $60^{\circ}$. Let $D$ be a point on $AC$ such that $\angle{DBC}=\angle{BAC}$. $E$ is the intersection between the perpendicular bisector of $BD$ and the line parallel to $BC$ passing through $A$. $F$ is a point on the line $AC$ such that $FA=2AC$ ($A$ is between $F$ and $C$). Show that $EB$ and $AC$ are parallel and that the perpendicular from $F$ to $AB$, the perpendicular from $E$ to $AC$ and $BD$ are concurrent.

Points $A', B', C'$ lie on sides $BC, CA, AB$ of triangle $ABC.$ for a point $X$ one has $\angle AXB =\angle A'C'B' + \angle ACB$ and $\angle BXC = \angle B'A'C' +\angle BAC.$ Prove that the quadrilateral $XA'BC'$ is cyclic.

Given trapezoid $ABCD$ with parallel sides $AB$ and $CD$, let $E$ be a point on line $BC$ outside segment $BC$, such that segment $AE$ intersects segment $CD$. Assume that there exists a point $F$ inside segment $AD$ such that $\angle EAD=\angle CBF$. Denote by $I$ the point of intersection of $CD$ and $EF$, and by $J$ the point of intersection of $AB$ and $EF$. Let $K$ be the midpoint of segment $EF$, and assume that $K$ is different from $I$ and $J$. Prove that $K$ belongs to the circumcircle of $\triangle ABI$ if and only if $K$ belongs to the circumcircle of $\triangle CDJ$.

The positive integer $ n $ verifies $$\frac{1}{1\cdot(\sqrt{2}+\sqrt{1})+\sqrt{1}}+\frac{1}{2\cdot(\sqrt{3}+\sqrt{2})+\sqrt{2}}+\cdots+\frac{1}{n\cdot(\sqrt{n+1}+\sqrt{n})+\sqrt{n}}=\frac{2022}{2023}.$$ Find the sum of digits of number $ n $.

Show that for any positive integer $n$ the polynomial $f(x)=(x^2+x)^{2^n}+1$ cannot be decomposed into the product of two integer non-constant polynomials. [i]Marius Cavachi[/i]

Find the greatest positive integer $m$ with the following property: For every permutation $a_1, a_2, \cdots, a_n,\cdots$ of the set of positive integers, there exists positive integers $i_1<i_2<\cdots <i_m$ such that $a_{i_1}, a_{i_2}, \cdots, a_{i_m}$ is an arithmetic progression with an odd common difference.

Let $ABCDE$ be a pentagon inscribed in a circle such that $AB=CD=3$, $BC=DE=10$, and $AE=14$. The sum of the lengths of all diagonals of $ABCDE$ is equal to $\frac{m}{n}$, where $m$ and $n$ are relatively prime positive integers. What is $m+n$? $\textbf{(A) }129\qquad \textbf{(B) }247\qquad \textbf{(C) }353\qquad \textbf{(D) }391\qquad \textbf{(E) }421\qquad$

Function $f$ is defined on the positive integers by $f(1)=1$, $f(2)=2$ and $$f(n+2)=f(n+2-f(n+1))+f(n+1-f(n))\enspace\text{for }n\ge1.$$ (a) Prove that $f(n+1)-f(n)\in\{0,1\}$ for each $n\ge1$. (b) Show that if $f(n)$ is odd then $f(n+1)=f(n)+1$. (c) For each positive integer $k$ find all $n$ for which $f(n)=2^{k-1}+1$.

Determine all positive integers $n$ such that $\frac{a^2+n^2}{b^2-n^2}$ is a positive integer for some $a,b\in \mathbb{N}$. $Turkey$

The distance between the $5^\text{th}$ and $26^\text{th}$ exits on an interstate highway is $118$ miles. If any two exits are at least $5$ miles apart, then what is the largest number of miles there can be between two consecutive exits that are between the $5^\text{th}$ and $26^\text{th}$ exits? $\text{(A)}\ 8 \qquad \text{(B)}\ 13 \qquad \text{(C)}\ 18 \qquad \text{(D)}\ 47 \qquad \text{(E)}\ 98$

One tiles a floor of $a \times b$ dm$^2$ with square tiles, $a,b \in N$. Tiles do not overlap, and sides of floor and tiles are parallel. Using tiles of $2\times 2$ dm$^2$ leaves the same amount of floor uncovered as using tiles of $4\times 4$ dm$^2$. Using $3\times 3$ dm$^2$ tiles leaves $29$ dm$^2$ floor uncovered. Determine $a$ and $b$.

Triangle $ABC$ has perimeter $1$. Its three altitudes form the side lengths of a triangle. Find the set of all possible values of $\min(AB,BC,CA)$.

A paint brush is swept along both diagonals of a square to produce the symmetric painted area, as shown. Half the area of the square is painted. What is the ratio of the side length of the square to the brush width? [asy]unitsize(15mm); defaultpen(linewidth(.8pt)); path P=(-sqrt(2)/2,1)--(0,1-sqrt(2)/2)--(sqrt(2)/2,1); path Pc=(-sqrt(2)/2,1)--(0,1-sqrt(2)/2)--(sqrt(2)/2,1)--cycle; path S=(-1,-1)--(-1,1)--(1,1)--(1,-1)--cycle; fill(S,gray); for(int i=0;i<4;++i) { fill(rotate(90*i)*Pc,white); draw(rotate(90*i)*P); } draw(S);[/asy]$ \textbf{(A)}\ 2\sqrt {2} \plus{} 1 \qquad \textbf{(B)}\ 3\sqrt {2}\qquad \textbf{(C)}\ 2\sqrt {2} \plus{} 2 \qquad \textbf{(D)}\ 3\sqrt {2} \plus{} 1 \qquad \textbf{(E)}\ 3\sqrt {2} \plus{} 2$

Let $ABCD$ by a cyclic quadrilateral with circumcenter $O$. Let $P$ be the point of intersection of the diagonals $AC$ and $BD$, and $K, L, M, N$ the circumcenters of triangles $AOP, BOP$, $COP, DOP$, respectively. Prove that $KL = MN$.

$AK$ and $BL$ are altitudes of an acute triangle $ABC$. Point $P$ is chosen on the segment $AK$ so that $LK=LP$. The parallel to $BC$ through $P$ meets the parallel to $PL$ through $B$ at point $Q$. Prove that $\angle AQB = \angle ACB$. [i](S. Berlov)[/i]

A triangle $ABC$ with $AB>AC$ is given, $AD$ is the A-angle bisector with point $D$ on $BC$ and point $I$ is the incenter of triangle $ABC$. Point M is the midpoint of segment $AD$ and point $F$ is the second intersection of $MB$ with the circumcirle of triangle $BIC$. Prove that $AF\bot FC$.

Andrew has a four-digit number whose last digit is $2$. Given that this number is divisible by $9$, determine the number of possible values for this number that Andrew could have. Note that leading zeros are not allowed.

In a particular European city, there are only $7$ day tickets and $30$ day tickets to the public transport. The former costs $7.03$ euro and the latter costs $30$ euro. Aina the Algebraist decides to buy at once those tickets that she can travel by the public transport the whole three year (2014-2016, 1096 days) visiting in the city. What is the cheapest solution?

Find all functions $f : \mathbb{Z} \to \mathbb{Z}$ such that: - $f$ is strictly increasing, - there exists $M \in \mathbb{N}$ such that $f(x+1) - f(x) < M$ for all $x \in \mathbb{N}$, - for every $x \in \mathbb{Z}$, there exists $y \in \mathbb{Z}$ such that \[ f(y) = \frac{f(x) + f(x + 2024)}{2}. \] [i]Proposed by Pavle Martinović[/i]

[b]p1.[/b] In triangle $ABC$, the median $BM$ is drawn. The length $|BM| = |AB|/2$. The angle $\angle ABM = 50^o$. Find the angle $\angle ABC$. [b]p2.[/b] Is there a positive integer $n$ which is divisible by each of $1, 2,3,..., 2018$ except for two numbers whose difference is$ 7$? [b]p3.[/b] Twenty numbers are placed around the circle in such a way that any number is the average of its two neighbors. Prove that all of the numbers are equal. [b]p4.[/b] A finite number of frogs occupy distinct integer points on the real line. At each turn, a single frog jumps by $1$ to the right so that all frogs again occupy distinct points. For some initial configuration, the frogs can make $n$ moves in $m$ ways. Prove that if they jump by $1$ to the left (instead of right) then the number of ways to make $n$ moves is also $m$. [b]p5.[/b] A square box of chocolates is divided into $49$ equal square cells, each containing either dark or white chocolate. At each move Alex eats two chocolates of the same kind if they are in adjacent cells (sharing a side or a vertex). What is the maximal number of chocolates Alex can eat regardless of distribution of chocolates in the box? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].