Let $1=d_1<d_2<\ldots<d_{2m}=n$ be the divisors of a positive integer $n$, where $n$ is not a perfect square. Consider the determinant $$D=\begin{vmatrix}n+d_1&n&\ldots&n\\n&n+d_2&\ldots&n\\\ldots&\ldots&&\ldots\\n&n&\ldots&n+d_{2m}\end{vmatrix}.$$ (a) Prove that $n^m$ divides $D$. (b) Prove that $1+d_1+d_2+\ldots+d_{2m}$ divides $D$.

There are $100$ points on the plane, all pairwise distances between which are different. Is there always a polyline with vertices at these points, passing through each point once, in which the link lengths increase monotonously?

For her zeroth project at Magic School, Emilia needs to grow six perfectly-shaped apple trees. First she plants six tree saplings at the end of Day $0$. On each day afterwards, Emilia attempts to use her magic to turn each sapling into a perfectly-shaped apple tree, and for each sapling she succeeds in turning it into a perfectly-shaped apple tree that day with a probability of $\frac{1}{2}$. (Once a sapling is turned into a perfectly-shaped apple tree, it will stay a perfectly-shaped apple tree.) The expected number of days it will take Emilia to obtain six perfectly-shaped apple trees is $\frac{m}{n}$ for relatively prime positive integers $m$ and $n$. Find $100m+n$. [i]Proposed by Yannick Yao[/i]

[b]p1.[/b] Two players play the following game. On the lowest left square of an $8\times 8$ chessboard there is a rook. The first player is allowed to move the rook up or to the right by an arbitrary number of squares. The second player is also allowed to move the rook up or to the right by an arbitrary number of squares. Then the first player is allowed to do this again, and so on. The one who moves the rook to the upper right square wins. Who has a winning strategy? [b]p2.[/b] In Crocodile Country there are banknotes of $1$ dollar, $10$ dollars, $100$ dollars, and $1,000$ dollars. Is it possible to get 1,000,000 dollars by using $250,000$ banknotes? [b]p3.[/b] Fifteen positive numbers (not necessarily whole numbers) are placed around the circle. It is known that the sum of every four consecutive numbers is $30$. Prove that each number is less than $15$. [b]p4.[/b] Donald Duck has $100$ sticks, each of which has length $1$ cm or $3$ cm. Prove that he can break into $2$ pieces no more than one stick, after which he can compose a rectangle using all sticks. [b]p5.[/b] Three consecutive $2$ digit numbers are written next to each other. It turns out that the resulting $6$ digit number is divisible by $17$. Find all such numbers. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $a$ denote the positive real root of the polynomial $x^2 -3x-2$. Compute the remainder when $\lfloor a^{1000}\rfloor $ is divided by the prime number $997$. Here, $\lfloor r\rfloor$ denotes the greatest integer less than $r$.

Prove that if $n$ can be written as $n=a^2+ab+b^2$, then also $7n$ can be written that way.

Let $n>1$ be a given integer. The Mint issues coins of $n$ different values $a_1, a_2, ..., a_n$, where each $a_i$ is a positive integer (the number of coins of each value is unlimited). A set of values $\{a_1, a_2,..., a_n\}$ is called [i]lucky[/i], if the sum $a_1+ a_2+...+ a_n$ can be collected in a unique way (namely, by taking one coin of each value). (a) Prove that there exists a lucky set of values $\{a_1, a_2, ..., a_n\}$ with $$a_1+ a_2+...+ a_n < n \cdot 2^n.$$ (b) Prove that every lucky set of values $\{a_1, a_2,..., a_n\}$ satisfies $$a_1+ a_2+...+ a_n >n \cdot 2^{n-1}.$$ Proposed by Ilya Bogdanov

Show that $$\log_2\pi+\log_4\pi<\frac52.$$

Determine the largest positive integer $n$ such that the following statement is true: There exists $n$ real polynomials, $P_1(x),\ldots,P_n(x)$ such that the sum of any two of them have no real roots but the sum of any three does.

In how many distinguishable ways can $10$ distinct pool balls be formed into a pyramid ($6$ on the bottom, $3$ in the middle, one on top), assuming that all rotations of the pyramid are indistinguishable?

Let $A$ be the largest subset of $\{1,\dots,n\}$ such that for each $x\in A$, $x$ divides at most one other element in $A$. Prove that \[\frac{2n}3\leq |A|\leq \left\lceil \frac{3n}4\right\rceil. \]

[b]Q.[/b] Determine all the functions $f: \mathbb{R} \rightarrow \mathbb{R}$ such that $$f(x) \geqslant x+1, \forall\ x \in \mathbb{R}\quad \text{and}\quad f(x+y) \geqslant f(x) f(y), \forall\ x, y \in \mathbb{R}$$ [i]Proposed by TuZo[/i]

In the decimal expression of a $ 2009$-digit natural number there are only the digits $ 5$ and $ 8$. Prove that we can get a $ 2008$-digit number divisible by $ 11$ if we remove just one digit from the number.

Two identically oriented equilateral triangles, $ABC$ with center $S$ and $A'B'C$, are given in the plane. We also have $A' \neq S$ and $B' \neq S$. If $M$ is the midpoint of $A'B$ and $N$ the midpoint of $AB'$, prove that the triangles $SB'M$ and $SA'N$ are similar.

* Given a regular dodecahedron. Find how many ways are there to draw a plane through it so that its section of the dodecahedron is a regular hexagon?

Let $a,b,c$ be sides of a triangle such that $a\geq b \geq c$. prove that: $\sqrt{a(a+b-\sqrt{ab})}+\sqrt{b(a+c-\sqrt{ac})}+\sqrt{c(b+c-\sqrt{bc})}\geq a+b+c$

There are $n$ cities in a country. Between any two cities there is at most one road. Suppose that the total number of roads is $n.$ Prove that there is a city such that starting from there it is possible to come back to it without ever travelling the same road twice.

Quadrilateral$ ABCD$ has two diagonals $AC,BD$ that are mutually perpendicular. Let $M$ be the Miquel point of the complete quadrilateral formed by lines $AB,BC,CD,DA$. Suppose that $L$ is the intersection of two circles $(MAC)$ and $(MBD)$. Prove that the circumcenters of triangles $LAB,LBC,LCD,LDA$ are on the same circle called $\omega$ and that three circles $(MAC), (MBD), \omega$ are pairwise orthogonal. Nguyễn Văn Linh

Find all continuous functions $f: \mathbb{R}\rightarrow\mathbb{R}$ such that \[f(x)^3 = -\frac x{12}\cdot\left(x^2+7x\cdot f(x)+16\cdot f(x)^2\right),\ \forall x \in \mathbb{R}.\]

The area of a rectangle is $64$ cm$^2$, and the radius of its circumscribed circle is $7$ cm. What is the perimeter of the rectangle in centimetres?

$ABCDEF$ is a convex hexagon with all its sides equal. Also $\angle A + \angle C + \angle E = \angle B + \angle D + \angle F$. Show that $\angle A = \angle D$, $\angle B = \angle E$ and $\angle C = \angle F$.

A set of positive integers is called [i]fragrant[/i] if it contains at least two elements and each of its elements has a prime factor in common with at least one of the other elements. Let $P(n)=n^2+n+1$. What is the least possible positive integer value of $b$ such that there exists a non-negative integer $a$ for which the set $$\{P(a+1),P(a+2),\ldots,P(a+b)\}$$ is fragrant?

We know $\mathbb Z_{210} \cong \mathbb Z_2 \times \mathbb Z_3 \times \mathbb Z_5 \times \mathbb Z_7$. Moreover,\begin{align*} 53 & \equiv 1 \pmod{2} \\ 53 & \equiv 2 \pmod{3} \\ 53 & \equiv 3 \pmod{5} \\ 53 & \equiv 4 \pmod{7}. \end{align*} Let \[ M = \left( \begin{array}{ccc} 53 & 158 & 53 \\ 23 & 93 & 53 \\ 50 & 170 & 53 \end{array} \right). \] Based on the above, find $\overline{(M \mod{2})(M \mod{3})(M \mod{5})(M \mod{7})}$.

At a conference there are $n$ mathematicians. Each of them knows exactly $k$ fellow mathematicians. Find the smallest value of $k$ such that there are at least three mathematicians that are acquainted each with the other two. [color=#BF0000]Rewording of the last line for clarification:[/color] Find the smallest value of $k$ such that there (always) exists $3$ mathematicians $X,Y,Z$ such that $X$ and $Y$ know each other, $X$ and $Z$ know each other and $Y$ and $Z$ know each other.

Elmo and Elmo's clone are playing a game. Initially, $n\geq 3$ points are given on a circle. On a player's turn, that player must draw a triangle using three unused points as vertices, without creating any crossing edges. The first player who cannot move loses. If Elmo's clone goes first and players alternate turns, who wins? (Your answer may be in terms of $n$.) [i]Proposed by Milan Haiman[/i]