Find the number of positive integers $n \le 2014$ such that there exists integer $x$ that satisfies the condition that $\frac{x+n}{x-n}$ is an odd perfect square.

Let $O$ be the center of the circle $\omega$ circumscribed around the acute-angled triangle $\vartriangle ABC$, and $W$ be the midpoint of the arc $BC$ of the circle $\omega$, which does not contain the point $A$, and $H$ be the point of intersection of the heights of the triangle $\vartriangle ABC$. Find the angle $\angle BAC$, if $WO = WH$. (O. Clurman)

Let $ ABCDE$ be a regular pentagon of side length $ 1$. Let $ F$ be the midpoint of $ AB$ and let $ G$ and $ H$ be the points on sides $ CD$ and $ DE$ respectively $ \angle GFD \equal{} \angle HFD \equal{} 30^{\circ}$. Show that the triangle $ GFH$ is equilateral. A square of side $ a$ is inscribed in $ \triangle GFH$ with one side of the square along $ GH$. Prove that: $ FG \equal{} t \equal{} \frac {2 \cos 18^{\circ} \cos^2 36^{\circ}}{\cos 6^{\circ}}$ and $ a \equal{} \frac {t \sqrt {3}}{2 \plus{} \sqrt {3}}$.

Let $N$ be the set of positive integers. Find all the functions $f: N\to N$ with $f (1) = 2$ and such that $max \{f(m)+f(n), m+n\}$ divides $min\{2m+2n,f (m+ n)+1\}$ for all $m, n$ positive integers

Let $\triangle ABC$ be an acute triangle of circumcentre $O$. Let the tangents to the circumcircle of $\triangle ABC$ in points $B$ and $C$ meet at point $P$. The circle of centre $P$ and radius $PB=PC$ meets the internal angle bisector of $\angle BAC$ inside $\triangle ABC$ at point $S$, and $OS \cap BC = D$. The projections of $S$ on $AC$ and $AB$ respectively are $E$ and $F$. Prove that $AD$, $BE$ and $CF$ are concurrent. [i]Author: Cosmin Pohoata[/i]

Consider the set of all permutations, $\mathcal{P}$, of $\{1,2,\ldots,2022\}$. For permutation $P\in \mathcal{P}$, let $P_1$ denote the first element in $P$. Let $\text{sgn}(P)$ denote the sign of the permutation. Compute the following number modulo 1000: $$\displaystyle\sum_{P\in\mathcal{P}}\dfrac{P_1\cdot\text{sgn}(P)^{P_1}}{2020!}.$$ (The [i]sign[/i] of a permutation $P$ is $(-1)^k$, where $k$ is the minimum number of two-element swaps needed to reach that permutation). [i]Proposed by Nairit Sarkar[/i]

A one-player game is played as follows: There is a bowl at each integer on the $Ox$-axis. All the bowls are initially empty, except for that at the origin, which contains $n \geq 2$ stones. A move is either (A) to remove two stones from a bowl and place one in each of the two adjacent bowls, or (B) to remove a stone from each of two adjacent bowls and to add one stone to the bowl immediately to their left. Show that only a finite number of moves can be made and that the final position (when no more moves are possible) is independent of the moves made (for a given $n$).

Let $p$ be a prime and $k$ be a positive integer. Set $S$ contains all positive integers $a$ satisfying $1\le a \le p-1$, and there exists positive integer $x$ such that $x^k\equiv a \pmod p$. Suppose that $3\le |S| \le p-2$. Prove that the elements of $S$, when arranged in increasing order, does not form an arithmetic progression.

Find all natural numbers $N$ consisting of exactly $1112$ digits (in decimal notation) such that: (a) The sum of the digits of $N$ is divisible by $2000$; (b) The sum of the digits of $N+1$ is divisible by $2000$; (c) $1$ is a digit of $N$.

Determine the smallest integer $n > 1$ with the property that $n^2(n - 1)$ is divisible by 2009.

Let $S$ be a finite set of integers. We define $d_2(S)$ and $d_3(S)$ as: $\bullet$ $d_2(S)$ is the number of elements $a \in S$ such that there exist $x, y \in \mathbb{Z}$ such that $x^2-y^2 = a$ $\bullet$ $d_3(S)$ is the number of elements $a \in S$ such that there exist $x, y \in \mathbb{Z}$ such that $x^3-y^3 = a$ (a) Let $m$ be an integer and $S = \{m, m+1, \ldots, m+2019\}$. Prove: $$d_2(S) > \frac{13}{7} d_3(S)$$ (b) Let $S_n = \{1, 2, \ldots, n\}$ with $n$ a positive integer. Prove that there exists a $N$ so that for all $n > N$: $$ d_2(S_n) > 4 \cdot d_3(S_n) $$

Let $ABCD$ be a convex quadrilateral such that $\angle{ABD}=\angle{BCD}=90^\circ,$ and let $M$ be the midpoint of segment $BD.$ Suppose that $CM=2$ and $AM=3.$ Compute $AD.$

A surjective function $g: \mathbb{C} \to \mathbb C$ is given. Find all functions $f: \mathbb{C} \to \mathbb C$ such that for all $x,y\in \mathbb C$ we have $$ |f(x)+g(y)| = | f(y) + g(x)|. $$ Proposed by [i]Mojtaba Zare, Amirabbas Mohammadi[/i]

[b]p1.[/b] Given two irreducible fractions. The denominator of the first fraction is $4$, the denominator of the second fraction is $6$. What can the denominator of the product of these fractions be equal to if the product is represented as an irreducible fraction? [b]p2.[/b] Three horses compete in the race. The player can bet a certain amount of money on each horse. Bets on the first horse are accepted in the ratio $1: 4$. This means that if the first horse wins, then the player gets back the money bet on this horse, and four more times the same amount. Bets on the second horse are accepted in the ratio $1:3$, on the third -$ 1:1$. Money bet on a losing horse is not returned. Is it possible to bet in such a way as to win whatever the outcome of the race? [b]p3.[/b] A quadrilateral is inscribed in a circle, such that the center of the circle, point $O$, is lies inside it. Let $K$, $L$, $M$, $N$ be the midpoints of the sides of the quadrilateral, following in this order. Prove that the bisectors of angles $\angle KOM$ and $\angle LOC$ are perpendicular (Fig.). [img]https://cdn.artofproblemsolving.com/attachments/b/8/ea4380698eba7f4cc2639ce20e3057e0294a7c.png[/img] [b]p4.[/b] Prove that the number$$\underbrace{33...33}_{1999 \,\,\,3s}1$$ is not divisible by $7$. [b]p5.[/b] In triangle $ABC$, the median drawn from vertex $A$ to side $BC$ is four times smaller than side $AB$ and forms an angle of $60^o$ with it. Find the greatest angle of this triangle. [b]p6.[/b] Given a $7\times 8$ rectangle made up of 1x1 cells. Cut it into figures consisting of $1\times 1$ cells, so that each figure consists of no more than $5$ cells and the total length of the cuts is minimal (give an example and prove that this cannot be done with a smaller total length of the cuts). You can only cut along the boundaries of the cells. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c2416727_soros_olympiad_in_mathematics]here.[/url]

The diagram below shows a sequence of equally spaced parallel lines with a triangle whose vertices lie on these lines. The segment $\overline{CD}$ is $6$ units longer than the segment $\overline{AB}$. Find the length of segment $\overline{EF}$. [img]https://cdn.artofproblemsolving.com/attachments/8/0/abac87d63d366bf4c4e913fdb1022798379a73.png[/img]

Suppose that $A$, $B$, $C$, and $D$ are distinct points, no three of which lie on a line, in the Euclidean plane. Show that if the squares of the lengths of the line segments $AB$, $AC$, $AD$, $BC$, $BD$, and $CD$ are rational numbers, then the quotient \[\frac{\mathrm{area}(\triangle ABC)}{\mathrm{area}(\triangle ABD)}\] is a rational number.