Is it possible to place some circles inside a square side length $1$, such that no two circles intersect and the sum of their radii is $2007$?

[color=darkred]Find all differentiable functions $f\colon [0,\infty)\to [0,\infty)$ for which $f(0)=0$ and $f^{\prime}(x^2)=f(x)$ for any $x\in [0,\infty)$ .[/color]

Find all positive integers $n$ for wich $\phi(\phi (n))$ divides $n$.

$ m$ and $ n$ are positive integers. In a $ 8 \times 8$ chessboard, $ (m,n)$ denotes the number of grids a Horse can jump in a chessboard ($ m$ horizontal $ n$ vertical or $ n$ horizontal $ m$ vertical ). If a $ (m,n) \textbf{Horse}$ starts from one grid, passes every grid once and only once, then we call this kind of Horse jump route a $ \textbf{H Route}$. For example, the $ (1,2) \textbf{Horse}$ has its $ \textbf{H Route}$. Find the smallest positive integer $ t$, such that from any grid of the chessboard, the $ (t,t\plus{}1) \textbf{Horse}$ does not has any $ \textbf{H Route}$.

For a triangle $T = ABC$ we take the point $X$ on the side $(AB)$ such that $AX/AB=4/5$, the point $Y$ on the segment $(CX)$ such that $CY = 2YX$ and, if possible, the point $Z$ on the ray ($CA$ such that $\widehat{CXZ} = 180 - \widehat{ABC}$. We denote by $\Sigma$ the set of all triangles $T$ for which $\widehat{XYZ} = 45$. Prove that all triangles from $\Sigma$ are similar and find the measure of their smallest angle.

What is the minimum $k{}$ for which among any three nonzero real numbers there are two numbers $a{}$ and $b{}$ such that either $|a-b|\leqslant k$ or $|1/a-1/b|\leqslant k$? [i]Maxim Didin[/i]

Considering the three-digit natural numbers, how many of them, when adding two of their digits, are double of their remainder? Justify your answer.

Let $ABCD$ be a trapezoid with bases $AB,CD$ such that $CD=k \cdot AB$ ($0<k<1$). Point $P$ is such that $\angle PAB=\angle CAD$ and $\angle PBA=\angle DBC$. Prove that $PA+PB \leq \dfrac{1}{\sqrt{1-k^2}} \cdot AB$.

Let $x_1,x_2,...,x_n$ ($n \ge 2$) be positive numbers with the sum $1$. Prove that $$\sum_{i=1}^{n} \frac{1}{\sqrt{1-x_i}} \ge n\sqrt{\frac{n}{n-1}} $$

A triangle $ ABC$ is inscribed in a circle $ C(O,R)$ and has incenter $ I$. Lines $ AI,BI,CI$ meet the circumcircle $ (O)$ of triangle $ ABC$ at points $ D,E,F$ respectively. The circles with diameter $ ID,IE,IF$ meet the sides $ BC,CA, AB$ at pairs of points $ (A_1,A_2), (B_1, B_2), (C_1, C_2)$ respectively. Prove that the six points $ A_1,A_2, B_1, B_2, C_1, C_2$ are concyclic. Babis

A function $ f$ defined on the positive integers (and taking positive integers values) is given by: $ \begin{matrix} f(1) \equal{} 1, f(3) \equal{} 3 \\ f(2 \cdot n) \equal{} f(n) \\ f(4 \cdot n \plus{} 1) \equal{} 2 \cdot f(2 \cdot n \plus{} 1) \minus{} f(n) \\ f(4 \cdot n \plus{} 3) \equal{} 3 \cdot f(2 \cdot n \plus{} 1) \minus{} 2 \cdot f(n), \end{matrix}$ for all positive integers $ n.$ Determine with proof the number of positive integers $ \leq 1988$ for which $ f(n) \equal{} n.$

Find all differentiable functions $f:\mathbb{R}\to\mathbb{R}$ such that \[f'(x)=\frac{f(x+n)-f(x)}n\] for all real numbers $x$ and all positive integers $n.$

The altitude from a vertex of a given tetrahedron intersects the opposite face in its orthocenter. Prove that all four altitudes of the tetrahedron are concurrent.

A rectangle-shaped puzzle is assembled with $2000$ pieces that are all equal rectangles, and similar to the large rectangle, so that the sides of the small rectangles are parallel to those of the large one. The shortest side of each piece measures $1$. Determine what is the minimum possible value of the area of the large rectangle.

Squares $ABCD$ and $BEFG$ are located as shown in the figure. It turned out that points $A, G$ and $E$ lie on the same straight line. Prove that then the points $D, F$ and $E$ also lie on the same line. [img]https://cdn.artofproblemsolving.com/attachments/4/2/9faf29a399d3a622c84f5d4a3cfcf5e99539c0.png[/img]

Let $\mathbb{Q}_{>0}$ denote the set of all positive rational numbers. Determine all functions $f:\mathbb{Q}_{>0}\to \mathbb{Q}_{>0}$ satisfying $$f(x^2f(y)^2)=f(x)^2f(y)$$ for all $x,y\in\mathbb{Q}_{>0}$

Peter and Basil together thought of ten quadratic trinomials. Then, Basil began calling consecutive natural numbers starting with some natural number. After each called number, Peter chose one of the ten polynomials at random and plugged in the called number. The results were recorded on the board. They eventually form a sequence. After they finished, their sequence was arithmetic. What is the greatest number of numbers that Basil could have called out?

Assume every side length of a triangle $ABC$ is more than $2$ and two of its angles are given by $\angle ABC = 57^\circ$ and $ACB = 63^\circ$. Point $P$ is chosen on side $BC$ with $BP:PC = 2:1$. Points $M,N$ are chosen on sides $AB$ and $AC$, respectively so that $BM = 2$ and $CN = 1$. Let $Q$ be the point on segment $MN$ for which $MQ:QN = 2:1$. Find the value of $PQ$. Your answer must be in simplest form.

The vertices of a triangle $DEF$ lie on different sides of a triangle $ABC$. The lengths of the tangents from the incenter of $DEF$ to the excircles of $ABC$ are equal. Prove that $4S_{DEF} \ge S_{ABC}$. [i]Note: By $S_{XYZ}$ we denote the area of triangle $XYZ$.[/i]

Given an integer $ m\geq$ 2, m positive integers $ a_1,a_2,...a_m$. Prove that there exist infinitely many positive integers n, such that $ a_{1}1^{n} \plus{} a_{2}2^{n} \plus{} ... \plus{} a_{m}m^{n}$ is composite.

We attach to the vertices of a regular hexagon the numbers $1$, $0$, $0$, $0$, $0$, $0$. Now, we are allowed to transform the numbers by the following rules: (a) We can add an arbitrary integer to the numbers at two opposite vertices. (b) We can add an arbitrary integer to the numbers at three vertices forming an equilateral triangle. (c) We can subtract an integer $t$ from one of the six numbers and simultaneously add $t$ to the two neighbouring numbers. Can we, just by acting several times according to these rules, get a cyclic permutation of the initial numbers? (I. e., we started with $1$, $0$, $0$, $0$, $0$, $0$; can we now get $0$, $1$, $0$, $0$, $0$, $0$, or $0$, $0$, $1$, $0$, $0$, $0$, or $0$, $0$, $0$, $1$, $0$, $0$, or $0$, $0$, $0$, $0$, $1$, $0$, or $0$, $0$, $0$, $0$, $0$, $1$ ?)

Haydn picks two different integers between $1$ and $100$, inclusive, uniformly at random. The probability that their product is divisible by $4$ can be expressed in the form $m/n$ , where $m$ and $n$ are relatively prime positive integers. Compute $m + n$.

Suppose that $ABCD$ is a rectangle with sides of length $12$ and $18$. Let $S$ be the region of points contained in $ABCD$ which are closer to the center of the rectangle than to any of its vertices. Find the area of $S$.

Of six cities $S_1,S_2,...,S_6$ and two airlines $A$ and $B$ it is given that for every pair $(S_i,S_j)$ (where $i \ne j$) exactly one of the airlines has a connection from $S_i$ to $S_j$ and maintains back. (a) Prove that the air net of one of the companies contains a triangle. (b) Prove that in the two air nets there are even two triangles. [hide=]original wording]Van zes steden $S_1,S_2,...,S_6$ en twee luchtvaartmaatschappijen $A$ en $B$ is gegeven, dat voor ieder paar $(S_i,S_j)$ (waar $i \ne j$) precies één van de maatschappijen een verbinding van $S_i$ naar $S_j$ en terug onderhoudt, (a) Bewijs, dat het luchtnet van één van de maaschappijen een driehoek bevat; (b) Bewijs, dat er in de twee luchtnetten zelfs twee driehoeken zijn.[/hide]

Consider all points with integer coordinates in the carthesian plane. If one draws a circle with M(0,0) and a well-chose radius r, the circles goes through some of those points. (like circle with $r=2\sqrt2$ goes through 4 points) Prove that $\forall n\in \mathbb{N}, \exists r$ so that the circle with midpoint 0,0 and radius $r$ goes through at least $n$ points.