Find all integer pairs $(a,b)$ such that $a\cdot b$ divides $a^2+b^2+3$.

Let $n$ be a positive integer such that $2n+1$ and $3n+1$ are both perfect squares. Show that $5n+3$ is a composite number.

Find pairs of positive integers $(n, k)$ satisfying \[(n + 1)^k - 1 = n!\]

Let $f : Z_{\ge 0} \to Z_{\ge 0}$ be a function which satisfies for all integer $n \ge 0$: (a) $f(2n + 1)^2 - f(2n)^2 = 6f(n) + 1$, (b) $f(2n) \ge f(n)$ where $Z_{\ge 0}$ is the set of nonnegative integers. Solve the equation $f(n) = 1000$

There are two identical clocks on the wall, one showing the current Moscow time and the other showing current local time. The minimum distance between the ends of their hour hands equals $m$ and the maximum distance equals $M$. Find the distance between the centres of the clocks. (S Fomin, Leningrad)

Let $d$ be a positive divisor of the number $A = 1024^{1024}+5$ and suppose that $d$ can be expressed as $d = 2x^2+2xy+3y^2$ for some integers $x,y$. Which remainder we can have when divide $d$ by $20$ ?

We consider the division of a chess board $8 \times 8$ in p disjoint rectangles which satisfy the conditions: [b]a)[/b] every rectangle is formed from a number of full squares (not partial) from the 64 and the number of white squares is equal to the number of black squares. [b]b)[/b] the numbers $\ a_{1}, \ldots, a_{p}$ of white squares from $p$ rectangles satisfy $a_1, , \ldots, a_p.$ Find the greatest value of $p$ for which there exists such a division and then for that value of $p,$ all the sequences $a_{1}, \ldots, a_{p}$ for which we can have such a division. [color=#008000]Moderator says: see [url]https://artofproblemsolving.com/community/c6h58591[/url][/color]

In a nonisosceles triangle $ABC$, point $I$ is its incentre and $\Gamma$ is its circumcircle. Points $E$ and $D$ lie on $\Gamma$ and the circumcircle of triangle $BIC$ respectively such that $AE$ and $ID$ are both perpendicular to $BC$. Let $M$ be the midpoint of $BC$, $N$ be the midpoint of arc $BC$ on $\Gamma$ containing $A$, $F$ is the point of tangency of the $A-$excircle on $BC$, and $G$ is the intersection of line $DE$ with $\Gamma$. Prove that lines $GM$ and $NF$ intersect at a point located on $\Gamma$. (Possibly proposed by Farras Faddila)

Let $ABCD$ be a trapezoid, with $AD \parallel BC$, let $M$ be the midpoint of $AD$, and let $C_1$ be symmetric point to $C$ with respect to line $BD$. Segment $BM$ meets diagonal $AC$ at point $K$, and ray $C_1K$ meets line $BD$ at point $H$. Prove that $\angle{AHD}$ is a right angle. [i]Proposed by Giorgi Arabidze, Georgia[/i]

The triangle $ABC$ is right in $A$ and $R$ is the midpoint of the hypotenuse $BC$ . On the major leg $AB$ the point $P$ is marked such that $CP = BP$ and on the segment $BP$ the point $Q$ is marked such that the triangle $PQR$ is equilateral. If the area of triangle $ABC$ is $27$, calculate the area of triangle $PQR$ .

A sequence of integers $a_1,a_2,\ldots $ is such that $a_1=1,a_2=2$ and for $n\ge 1$, \[a_{n+2}=\left\{\begin{array}{cl}5a_{n+1}-3a_{n}, &\text{if}\ a_n\cdot a_{n+1}\ \text{is even},\\ a_{n+1}-a_{n}, &\text{if}\ a_n\cdot a_{n+1}\ \text{is odd},\end{array}\right. \] Prove that $a_n\not= 0$ for all $n$.

In a triangle $ABC$, let $a,b,c$ be its sides and $m,n,p$ be the corresponding medians. For every $\alpha>0$, let $\lambda(\alpha)$ be the real number such that $$a^\alpha+b^\alpha+c^\alpha=\lambda(\alpha)^\alpha\left(m^\alpha+n^\alpha+p^\alpha\right)^\alpha.$$ (a) Compute $\lambda(2)$. (b) Find the limit of $\lambda(\alpha)$ as $\alpha$ approaches $0$. (c) For which triangles $ABC$ is $\lambda(\alpha)$ independent of $\alpha$?

In a certain state there were 2004 cities connected by roads so that from any city one could get to any other. It is known that when it is prohibited to travel on any of the roads, the least of them any city could be reached to any other. The Minister of Transport and the Minister of Internal Affairs take turns introducing restrictions on the roads while there is possibility, one-way traffic (on one road per turn), and minister, after whose move it became impossible to leave any city to reach any other, immediately resigns. First the Minister of Transport walks. Can any of the ministers force the resignation of another, regardless of his performance? [hide=original wording]В некотором государстве было 2004 города, соединенных дорогами так, что из любого города можно было добраться до любого другого. Известно, что при запрещенном проезде по любой из дорог, по-прежнему из любого города можно было добраться до любого другого. Министр транспорта и министр внутренних дел по очереди вводят на дорогах, пока есть возможность, одностороннее движение (на одной дороге за ход), причем министр, после хода которого из какого-либо города стало невозможно добраться до какого-либо другого, немедленно уходит в отставку. Первым ходит министр транспорта. Может ли кто-либо из министров добиться отставки другого независимо от его игры?[/hide]

A circle which is tangent to sides $AB$ and $BC$ of triangle $ABC$ is also tangent to its circumcircle at point $T$. If $I$ in the incenter of triangle $ABC$, show that $\angle ATI=\angle CTI$.

We say that an integer $a$ is a quadratic, cubic, or quintic residue modulo $n$ if there exists an integer $x$ such that $x^2\equiv a \pmod n$, $x^3 \equiv a \pmod n$, or $x^5 \equiv a \pmod n$, respectively. Further, an integer $a$ is a primitive residue modulo $n$ if it is exactly one of these three types of residues modulo $n$. How many integers $1 \le a \le 2015$ are primitive residues modulo $2015$? [i] Proposed by Michael Ren [/i]

Let a set $X$ be given which consists of $2 \cdot n$ distinct real numbers ($n \geq 3$). Consider a set $K$ consisting of some pairs $(x, y)$ of distinct numbers $x, y \in X$, satisfying the two conditions: [b]I.[/b] If $(x, y) \in K$ then $(y, x) \not \in K$. [b]II.[/b] Every number $x \in X$ belongs to at most 19 pairs of $K$. Show that we can divide the set $X$ into 5 non-empty disjoint sets $X_1, X_2, X_3, X_4, X_5$ in such a way that for each $i = 1, 2, 3, 4, 5$ the number of pairs $(x, y) \in K$ where $x, y$ both belong to $X_i$ is not greater than $3 \cdot n$.

The $ 52$ cards in a deck are numbered $ 1, 2, \ldots, 52$. Alex, Blair, Corey, and Dylan each picks a card from the deck without replacement and with each card being equally likely to be picked, The two persons with lower numbered cards from a team, and the two persons with higher numbered cards form another team. Let $ p(a)$ be the probability that Alex and Dylan are on the same team, given that Alex picks one of the cards $ a$ and $ a\plus{}9$, and Dylan picks the other of these two cards. The minimum value of $ p(a)$ for which $ p(a)\ge\frac12$ can be written as $ \frac{m}{n}$. where $ m$ and $ n$ are relatively prime positive integers. Find $ m\plus{}n$.

There are $4$ distinct codes used in an intelligence station, one of them applied in each week. No two codes used in two adjacent weeks are the same code. Knowing that code $A$ is used in the first week, find the probability that code $A$ is used in the seventh week.

Let $a, b$, and $c$ be integers that satisfy $2a + 3b = 52$, $3b + c = 41$, and $bc = 60$. Find $a + b + c$

Prove that if a diagonal is drawn in a quadrilateral inscribed in a circle, the sum of the radii of the circles inscribed in the two triangles thus formed is the same, no matter which diagonal is drawn.

The circle inscribed in the triangle $ABC$ touches the side BC at point $K$. Prove that the segment $AK$ is longer than the diameter of the circle.

Given is an acute triangle $ABC$. $M$ is an arbitrary point at the side $AB$ and $N$ is midpoint of $AC$. The foots of the perpendiculars from $A$ to $MC$ and $MN$ are points $P$ and $Q$. Prove that center of the circumcircle of triangle $PQN$ lies on the fixed line for all points $M$ from the side $AB$.

Let $ABCD$ be a quadrilateral inscribed in the circle $O$. For a point $E\in O$, its projections $K,L,M,N$ on the lines $DA,AB,BC,CD$, respectively, are considered. Prove that if $N$ is the orthocentre of the triangle $KLM$ for some point $E$, different from $A,B,C,D$, then this holds for every point $E$ of the circle.

For any positive integer $n$, let $f(n)$ be the number of possible choices of signs $+\ \text{or}\ - $ in the algebraic expression $\pm 1\pm 2\ldots \pm n$, such that the obtained sum is zero. Show that $f(n)$ satisfies the following conditions: a) $f(n)=0$ for $n=1\pmod{4}$ or $n=2\pmod{4}$. b) $2^{\frac{n}{2}-1}\le f(n)\le 2^n-2^{\lfloor\frac{n}{2}\rfloor+1}$, for $n=0\pmod{4}$ or $n=3\pmod{4}$. [i]Ioan Tomsecu[/i]

Prove that any positive real numbers a,b,c satisfy the inequlaity $$\frac{1}{(a+b)b}+\frac{1}{(b+c)c}+\frac{1}{(c+a)a}\ge \frac{9}{2(ab+bc+ca)}$$ I.Voronovich