A positive integer \( n \), which has at least one proper divisor, is divisible by the arithmetic mean of the smallest and largest of its proper divisors (which may coincide). What can be the number of divisors of \( n \)? [i]A proper divisor of a positive integer \( n \) is any of its divisors other than \( 1 \) and \( n \).[/i] [i]Proposed by Mykhailo Shtandenko[/i]

In the acute-angled triangle $ABC$, the point $F$ is the foot of the altitude from $A$, and $P$ is a point on the segment $AF$. The lines through $P$ parallel to $AC$ and $AB$ meet $BC$ at $D$ and $E$, respectively. Points $X \ne A$ and $Y \ne A$ lie on the circles $ABD$ and $ACE$, respectively, such that $DA = DX$ and $EA = EY$. Prove that $B, C, X,$ and $Y$ are concyclic.

Let $n \ge 4$ and $k$ be positive integers. We consider $n$ lines in the plane between which there are not two parallel nor three concurrent. In each of the $\frac{n(n-1)}{2}$ points of intersection of these lines, $k$ coins are placed. Ana and Beto play the following game in turns: each player, in turn, chooses one of those points that does not share one of the $n$ lines with the point chosen immediately before by the other player, and removes a coin from that point. Ana starts and can choose any point. The player who cannot make his move loses. Determine based on $n$ and $k$ who has a winning strategy.

Kevin colors a ninja star on a piece of graph paper where each small square has area $1$ square inch. Find the area of the region colored, in square inches. [img]https://cdn.artofproblemsolving.com/attachments/3/3/86f0ae7465e99d3e4bd3a816201383b98dc429.png[/img]

In a right-angled triangle $ABC$ ($\angle A = 90^o$), the perpendicular bisector of $BC$ intersects the line $AC$ in $K$ and the perpendicular bisector of $BK$ intersects the line $AB$ in $L$. If the line $CL$ be the internal bisector of angle $C$, find all possible values for angles $B$ and $C$. by Mahdi Etesami Fard

Find all real numbers $x,y,z$ such that satisfied the following equalities at same time: $\sqrt{x^3-y}=z-1 \wedge \sqrt{y^3-z}=x-1\wedge \sqrt{z^3-x}=y-1$

Find all functions $f: \mathbb{R} \rightarrow \mathbb{R}$ such that $$f(f(x)-f(y))+2f(xy)=x^2f(x)+f(y^2)$$ for all real numbers $x,y$.

Let $C$ be the set of points $(x,y)$ with integer coordinates in the plane where $1\leq x\leq 900$ and $1\leq y\leq 1000$. A polygon $P$ with vertices in $C$ is called [i]emerald[/i] if $P$ has exactly zero or two vertices in each row and each column and all the internal angles of $P$ are $90^\circ$ or $270^\circ$. Find the greatest value of $k$ such that we can color $k$ points in $C$ such that any subset of these $k$ points is not the set of vertices of an [i]emerald[/i] polygon. [img]https://cdn.discordapp.com/attachments/954427908359876608/1299737432010395678/image.png?ex=671e4a4f&is=671cf8cf&hm=ce008541975226a0e9ea53a93592a7469d8569baca945c1c207d4a722126bb60&[/img] On the left, an example of an emerald polygon; on the right, an example of a non-emerald polygon.

[color=darkred]On a table there are $k\ge 2$ piles having $n_1,n_2,\ldots,n_k$ pencils respectively. A [i]move[/i] consists in choosing two piles having $a$ and $b$ pencils respectively, $a\ge b$ and transferring $b$ pencils from the first pile to the second one. Find the necessary and sufficient condition for $n_1,n_2,\ldots,n_k$ , such that there exists a succession of moves through which all pencils are transferred to the same pile.[/color]

Let $f(n)$ be a function from integers to integers. Suppose $f(11) = 1$, and $f(a)f(b) = f(a +b) + f(a - b)$, for all integers $a, b$. Find $f(2013)$.

a) Let $ n_{1},n_{2},\dots$ be a sequence of natural number such that $ n_{i}\geq2$ and $ \epsilon_{1},\epsilon_{2},\dots$ be a sequence such that $ \epsilon_{i}\in\{1,2\}$. Prove that the sequence: \[ \sqrt[n_{1}]{\epsilon_{1}\plus{}\sqrt[n_{2}]{\epsilon_{2}\plus{}\dots\plus{}\sqrt[n_{k}]{\epsilon_{k}}}}\]is convergent and its limit is in $ (1,2]$. Define $ \sqrt[n_{1}]{\epsilon_{1}\plus{}\sqrt[n_{2}]{\epsilon_{2}\plus{}\dots}}$ to be this limit. b) Prove that for each $ x\in(1,2]$ there exist sequences $ n_{1},n_{2},\dots\in\mathbb N$ and $ n_{i}\geq2$ and $ \epsilon_{1},\epsilon_{2},\dots$, such that $ n_{i}\geq2$ and $ \epsilon_{i}\in\{1,2\}$, and $ x\equal{}\sqrt[n_{1}]{\epsilon_{1}\plus{}\sqrt[n_{2}]{\epsilon_{2}\plus{}\dots}}$

For positive real numbers $s$, let $\tau(s)$ denote the set of all obtuse triangles that have area $s$ and two sides with lengths $4$ and $10$. The set of all $s$ for which $\tau(s)$ is nonempty, but all triangles in $\tau(s)$ are congruent, is an interval $[a,b)$. Find $a^2+b^2$.

$f: \mathbb{R} \rightarrow \mathbb{R}$ is a function such that for $\forall x,y\in \mathbb{R}$ the equation $f(xy+x+y)=f(xy)+f(x)+f(y)$ is true. Prove that $f(x+y)=f(x)+f(y)$ for $\forall$ $x,y\in \mathbb{R}$.

Show that there exists no function $f : Z \to Z$ such that for all $m, n \in Z$ $$f(m + f(n)) = f(m) - n.$$

Determine all polynomials $P(x)$ with real coefficients and which satisfy the following properties: i) $P(0) = 1$ ii) for any real numbers $x$ and $y,$ \[|y^2-P(x)|\le 2|x|\quad\text{if and only if}\quad |x^2-P(y)|\le 2|y|.\]

Let $\omega$ be the incircle of scalene triangle $ABC$. Let $\omega$ be tangent to $AB$ and $AC$ at points $X$ and $Y$. Construct points $X^\prime$ and $Y^\prime$ on line segments $AB$ and $AC$ respectively such that $AX^\prime=XB$ and $AY^\prime=YC$. Let line $CX^\prime$ intersects $\omega$ at points $P,Q$ such that $P$ is closer to $C$ than $Q$. Also let $R^\prime$ be the intersection of lines $CX^\prime$ and $BY^\prime$. Prove that $CP=RX^\prime$.