We consider positive integers $n$ having at least six positive divisors. Let the positive divisors of $n$ be arranged in a sequence $(d_i)_{1\le i\le k}$ with $$1=d_1<d_2<\dots <d_k=n\quad (k\ge 6).$$ Find all positive integers $n$ such that $$n=d_5^2+d_6^2.$$

Let $\mathbb{N}$ be the set of all positive integers. Find all functions $f : \mathbb{N} \rightarrow \mathbb{N}$ such that $f(x) + y$ and $f(y) + x$ have the same number of $1$'s in their binary representations, for any $x,y \in \mathbb{N}$.

Prove that a real number $x$ is rational if and only if the sequence $x, x+1, x+2, x+3, ..., x+n, ...$ contains, at least least three terms in geometric progression.

Find all $x;y\in\mathbb{Z}$ satisfying the following condition: $$x^3=y^4+9x^2$$

Ten gamblers start playing with the same amount of money. In turn they cast five dice. If the dice show a total of $n$, the player must pay each other player $\frac{1}{n}$ times the sum which that player owns at the moment. They throw and pay one after the other. At the $10^{\text{th}}$ round (i.e. after each player has cast the five die once), the dice shows a total of $12$ and after the payment it turns out that every player has exactly the same sum as he had in the beginning. Is it possible to determine the totals shown by the dice at the nine former rounds?

At each vertex of a $13$-sided polygon we write one of the numbers $1,2,3,…, 12,13$, without repeating. Then, on each side of the polygon we write the difference of the numbers of the vertices of its ends (the largest minus the smallest). For example, if two consecutive vertices of the polygon have the numbers $2$ and $11$, the number $9$ is written on the side they determine. a) Is it possible to number the vertices of the polygon so that only the numbers $3, 4$ and $5$ are written on the sides? b) Is it possible to number the vertices of the polygon so that only the numbers $3, 4$ and $6$ are written on the sides?

Let $n$ be a positive integer. Find as many as possible zeros as last digits the following expression: $1^n + 2^n + 3^n + 4^n$.

Decide whether there is an integer $n > 1$ with the following properties: (a) $n$ is not a prime number. (b) For all integers $a$, $a^n - a$ is divisible by $n$

In trapezoid $ABCD$ , the sides $AB$ and $CD$ are equal. The perimeter of $ABCD$ is [asy] draw((0,0)--(4,3)--(12,3)--(16,0)--cycle); draw((4,3)--(4,0),dashed); draw((3.2,0)--(3.2,.8)--(4,.8)); label("$A$",(0,0),SW); label("$B$",(4,3),NW); label("$C$",(12,3),NE); label("$D$",(16,0),SE); label("$8$",(8,3),N); label("$16$",(8,0),S); label("$3$",(4,1.5),E);[/asy] $ \text{(A)}\ 27\qquad\text{(B)}\ 30\qquad\text{(C)}\ 32\qquad\text{(D)}\ 34\qquad\text{(E)}\ 48 $

[b]p1.[/b] What is the maximal number of pieces of two shapes, [img]https://cdn.artofproblemsolving.com/attachments/a/5/6c567cf6a04b0aa9e998dbae3803b6eeb24a35.png[/img] and [img]https://cdn.artofproblemsolving.com/attachments/8/a/7a7754d0f2517c93c5bb931fb7b5ae8f5e3217.png[/img], that can be used to tile a $7\times 7$ square? [b]p2.[/b] Six shooters participate in a shooting competition. Every participant has $5$ shots. Each shot adds from $1$ to $10$ points to shooter’s score. Every person can score totally for all five shots from $5$ to $50$ points. Each participant gets $7$ points for at least one of his shots. The scores of all participants are different. We enumerate the shooters $1$ to $6$ according to their scores, the person with maximal score obtains number $1$, the next one obtains number $2$, the person with minimal score obtains number $6$. What score does obtain the participant number $3$? The total number of all obtained points is $264$. [b]p2.[/b] There are exactly $n$ students in a high school. Girls send messages to boys. The first girl sent messages to $5$ boys, the second to $7$ boys, the third to $6$ boys, the fourth to $8$ boys, the fifth to $7$ boys, the sixth to $9$ boys, the seventh to $8$, etc. The last girl sent messages to all the boys. Prove that $n$ is divisible by $3$. [b]p4.[/b] In what minimal number of triangles can one cut a $25 \times 12$ rectangle in such a way that one can tile by these triangles a $20 \times 15$ rectangle. [b]p5.[/b] There are $2014$ stones in a pile. Two players play the following game. First, player $A$ takes some number of stones (from $1$ to $30$) from the pile, then player B takes $1$ or $2$ stones, then player $A$ takes $2$ or $3$ stones, then player $B$ takes $3$ or $4$ stones, then player A takes $4$ or $5$ stones, etc. The player who gets the last stone is the winner. If no player gets the last stone (there is at least one stone in the pile but the next move is not allowed) then the game results in a draw. Who wins the game using the right strategy? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

If the sum $ 1 \plus{} 2 \plus{} 3 \plus{} \cdots \plus{} K$ is a perfect square $ N^2$ and if $ N$ is less than $ 100$, then the possible values for $ K$ are: $ \textbf{(A)}\ \text{only }1 \qquad\textbf{(B)}\ 1\text{ and }8 \qquad\textbf{(C)}\ \text{only }8 \qquad\textbf{(D)}\ 8\text{ and }49 \qquad\textbf{(E)}\ 1,8,\text{ and }49$

Prove that there are not intgers $a$ and $b$ with conditions, i) $16a-9b$ is a prime number. ii) $ab$ is a perfect square. iii) $a+b$ is also perfect square.

Let $O$ be the center of the circle of the triangle $ABC$ with $AB \ne AC$. Furthermore, let $S$ and $T$ be points on the rays $AB$ and $AC$, such that $\angle ASO = \angle ACO$ and $\angle ATO = \angle ABO$. Show that $ST$ bisects the segment $BC$.

Suppose $2016$ points of the circumference of a circle are colored red and the remaining points are colored blue . Given any natural number $n\ge 3$, prove that there is a regular $n$-sided polygon all of whose vertices are blue.

Consider a cube and two of its vertices $A$ and $B$, which are the endpoints of a face diagonal. A [i]path [/i] is a sequence of cube angles, each step of one angle along a cube edge is walked to one of the three adjacent angles. Let $a$ be the number of paths of length $2012$ that starts at point $A$ and ends at $A$ and let b be the number of ways of length $2012$ that starts in $A$ and ends in $B$. Decide which of the two numbers $a$ and $b$ is the larger.

There are $n$ points in the plane such that at least $99\%$ of quadrilaterals with vertices from these points are convex. Can we find a convex polygon in the plane having at least $90\%$ of the points as vertices? [i]Proposed by Morteza Saghafian - Iran[/i]

Inside the equilateral triangle $ABC$ lies the point $T$. Prove that $TA$, $TB$ and $TC$ are the lengths of the sides of a triangle.

Let $ABC$ be a triangle inscribed in the ellipse $\frac{x^2}{4} +\frac{y^2}{9}= 1$. If its centroid is the origin $(0,0)$, find its area.

Call a set of positive integers "conspiratorial" if no three of them are pairwise relatively prime. What is the largest number of elements in any "conspiratorial" subset of the integers $1$ to $16$?

$MD$ is a chord of length $2$ in a circle of radius $1,$ and $L$ is chosen on the circle so that the area of $\triangle MLD$ is the maximized. Find $\angle MLD.$

A rectangle has area $1100$. If the length is increased by ten percent and the width is decreased by ten percent, what is the area of the new rectangle?

It is known that there is a number $S$ such that if $ a+b+c+d = S$ and $\frac{1}{a}+ \frac{1}{b}+ \frac{1}{c}+ \frac{1}{d} = S$ $(a, b, c, d$ are different from zero and one$)$, then $\frac{1}{a- 1} ++ \frac{1}{b- 1} + \frac{1}{c- 1} + \frac{1}{d -1} = S.$ Find $S$.

Consider a positive integer, $N = 9 + 99 + 999 + ... +\underbrace{999...9}_{2018}$. How many times does the digit $1$ occur in its decimal representation?

Given the positive real numbers $a_{1},a_{2},\dots,a_{n},$ such that $n>2$ and $a_{1}+a_{2}+\dots+a_{n}=1,$ prove that the inequality \[ \frac{a_{2}\cdot a_{3}\cdot\dots\cdot a_{n}}{a_{1}+n-2}+\frac{a_{1}\cdot a_{3}\cdot\dots\cdot a_{n}}{a_{2}+n-2}+\dots+\frac{a_{1}\cdot a_{2}\cdot\dots\cdot a_{n-1}}{a_{n}+n-2}\leq\frac{1}{\left(n-1\right)^{2}}\] does holds.

Let $ABC$ be a triangle with $AB = 13$, $BC = 14$, and $AC = 15$. Let$ D$ and $E$ be the feet of the altitudes from $A$ and $B$, respectively. Find the circumference of the circumcircle of $\vartriangle CDE$