Let $n(r)$ be the maximum possible number of points with integer coordinates on a circle with radius $r$ in Cartesian plane. Prove that $n(r) < 6\sqrt[3]{3 \pi r^2}.$

Given $\vartriangle ABC$ with circumcenter $O$. Let $D$ be a point satisfying $\angle ABD = \angle DCA$ and $M$ be the midpoint of $AD$. Suppose that $BM,CM$ intersect circle $(O)$ at another points $E, F$, respectively. Let $P$ be a point on $EF$ so that $AP$ is tangent to circle $(O)$. Prove that $A, P,M,O$ are concyclic. [img]https://2.bp.blogspot.com/-gSgUG6oywAU/XnSKTnH1yqI/AAAAAAAALdw/3NuPFuouCUMO_6KbydE-KIt6gCJ4OgWdACK4BGAYYCw/s320/imoc2017%2Bg7.png[/img]

Does there exist a sequence $ F(1), F(2), F(3), \ldots$ of non-negative integers that simultaneously satisfies the following three conditions? [b](a)[/b] Each of the integers $ 0, 1, 2, \ldots$ occurs in the sequence. [b](b)[/b] Each positive integer occurs in the sequence infinitely often. [b](c)[/b] For any $ n \geq 2,$ \[ F(F(n^{163})) \equal{} F(F(n)) \plus{} F(F(361)). \]

[b]6.1. [/b] Three workers can do some work. Second and the third can together complete it twice as fast as the first, the first and the third can together complete it three times faster than the second. At what time since the first and second can do this job faster than the third? [b]6.2.[/b] Prove that the greatest common divisor of the sum of two numbers and their least common multiple is equal to their greatest common divisor the numbers themselves. [b]6.3.[/b] There were 20 schoolchildren at the consultation and 20 problems were dealt with. It turned out that each student solved two problems and each problem was solved by two schoolchildren. Prove that it is possible to organize the analysis in this way tasks so that everyone solves one problem and all tasks are solved. [hide=original wording] Наконсультациибыло20школьниковиразбиралось20задач. Оказалось, что каждый школьник решил две задачи и каждую задачу решило два школьника. Докажите, что можно так организовать разбор задач, чтобыкаждыйрассказалоднузадачуивсезадачибылирассказаны.[/hide] [b]6.4[/b].Two people Α and Β must get from point Μ to point Ν,located 15 km from M. On foot they can move at a speed of 6 km/h. In addition, they have a bicycle at their disposal, on which υou can drive at a speed of 15 km/h. A and B depart from Μ at the same time, A walks, and B rides a bicycle until meeting pedestrian C, going from N to M. Then B walks and C rides a bicycle to meeting with A, hands him a bicycle, on which he arrives at N. When must pedestrian C leave Nfor A and B to arrive at N simultaneously if he walks at the same speed as A and B? [b]6.5./ 7.1[/b] Prove that out of any six people there will always be three pairs of acquaintances or three pairs of strangers. PS. You should use hide for answers.Collected [url=https://artofproblemsolving.com/community/c3983442_1961_leningrad_math_olympiad]here[/url].

Given that $z$ is a complex number such that $z+\frac 1z=2\cos 3^\circ,$ find the least integer that is greater than $z^{2000}+\frac 1{z^{2000}}.$

Ria writes down the numbers $1,2,\cdots, 101$ in red and blue pens. The largest blue number is equal to the number of numbers written in blue and the smallest red number is equal to half the number of numbers in red. How many numbers did Ria write with red pen?

We say that an ordered pair $(a,b)$ of positive integers with $a>b$ is square-ish if both $a+b$ and $a-b$ are perfect squares. For example, $(17,8)$ is square-ish because $17+8=25$ and $17-8=9$ are both perfect squares. How many square-ish pairs $(a,b)$ with $a+b<100$ are there? [i]Proposed by Nathan Xiong[/i]

For all $n>1$. Find all polynomials with complex coefficient and degree more than one such that $(p(x)-x)^2$ divides $p^n(x)-x$. ($p^0(x)=x , p^i(x)=p(p^{i-1}(x))$) [i]Proposed by Navid Safaie[/i]

The square $ABCD$ is inscribed in a circle. Points $E$ and $F$ are located on the side of the square, and points $G$ and $H$ are located on the smaller arc $AB$ of the circle so that the $EFGH$ is a square. Find the area ratio of these squares.

For a positive integer $n$, let $d(n)$ be the number of positive divisors of $n$, and let $\varphi(n)$ be the number of positive integers not exceeding $n$ which are coprime to $n$. Does there exist a constant $C$ such that $$ \frac {\varphi ( d(n))}{d(\varphi(n))}\le C$$ for all $n\ge 1$ [i]Cyprus[/i]

Paul starts at $1$ and counts by threes: $1, 4, 7, 10, ... $. At the same time and at the same speed, Penny counts backwards from $2017$ by fives: $2017, 2012, 2007, 2002,...$ . Find the one number that both Paul and Penny count at the same time.

Let $ABC$ be a triangle with $\angle A=60^\circ$; $AD$, $BE$, and $CF$ be its bisectors; $P, Q$ be the projections of $A$ to $EF$ and $BC$ respectively; and $R$ be the second common point of the circle $DEF$ with $AD$. Prove that $P, Q, R$ are collinear.

Let $k_{1},k_{2}, k_{3}$ -Excircles triangle $A_{1}A_{2}A_{3}$ with area $S$. $ k_{1}$ touch side $A_{2}A_{3} $ at the point $B_{1}$ Direct $A_{1}B_{1}$ intersect $k_{1}$ at the points $B_{1}$ and $C_{1}$.Let $S_{1}$ - area of ​​the quadrilateral $A_{1}A_{2}C_{1}A_{3}$ Similarly, we define $S_{2}, S_{3}$. Prove that $\frac{1}{S}\le \frac{1}{S_{1}}+\frac{1}{S_{2}}+\frac{1}{S_{2}}$

Inside the acute triangle $ABC$ the point $P{}$ in on height $AA_1{}$. Lines $BP{}$ and $CP{}$ intersect the sides $AC{}$ and $AB{}$, respectively, in points $B_1{}$ and $C_1{}$. Prove that: [b]a)[/b] $AA_1{}$ is the bisector of the angle $B_1A_1C_1;$ [b]b)[/b] if the lines $BC$ and $B_1C_1$ are concurrent, then the position of theri intersection does not depend on $P.$

Prove that, for any integer $g > 2$, there is a unique three-digit number $\overline{abc}_g$ in base $g$ whose representation in some base $h = g \pm 1$ is $\overline{cba}_h$.

What is the largest real number $C$ that satisfies the inequality $x^2 \geq C \lfloor x \rfloor (x-\lfloor x \rfloor)$ for every real $x$? $ \textbf{(A)}\ 0 \qquad\textbf{(B)}\ 1 \qquad\textbf{(C)}\ 4 \qquad\textbf{(D)}\ 9 \qquad\textbf{(E)}\ 25 $

A word of length $n$ is an ordered sequence $x_1x_2\ldots x_n$ where $x_i$ is a letter from the set $\{ a,b,c \}$. Denote by $A_n$ the set of words of length $n$ which do not contain any block $x_ix_{i+1}, i=1,2,\ldots ,n-1,$ of the form $aa$ or $bb$ and by $B_n$ the set of words of length $n$ in which none of the subsequences $x_ix_{i+1}x_{i+2}, i=1,2,\ldots n-2,$ contains all the letters $a,b,c$. Prove that $|B_{n+1}|=3|A_n|$. [i]Vasile Pop[/i]

Given an infinity chess board and a knight on it. On how many different fields the knight can be after $n$ steps¿

Triangle ABC has incircle w centered as S that touches the sides BC,CA and AB at P,Q and R respectively. AB isn't equal AC, the lines QR and BC intersects at point M, the circle that passes through points B and C touches the circle w at point N, circumcircle of triangle MNP intersects with line AP at L (L isn't equal to P). Then prove that S,L and M lie on the same line

Six members of the team of Fatalia for the International Mathematical Olympiad are selected from $13$ candidates. At the TST the candidates got $a_1,a_2, \ldots, a_{13}$ points with $a_i \neq a_j$ if $i \neq j$. The team leader has already $6$ candidates and now wants to see them and nobody other in the team. With that end in view he constructs a polynomial $P(x)$ and finds the creative potential of each candidate by the formula $c_i = P(a_i)$. For what minimum $n$ can he always find a polynomial $P(x)$ of degree not exceeding $n$ such that the creative potential of all $6$ candidates is strictly more than that of the $7$ others? [i]Proposed by F. Petrov, K. Sukhov[/i]

Suppose triangle $ABC$ is right-angled at $B$. The altitude from $B$ intersects the side $AC$ at point $D$. If points $E$ and $F$ are the midpoints of $BD$ and $CD$, prove that $AE \perp BF$.

For positive integers $a_1 < a_2 < \dots < a_n$ prove that $$\frac{1}{\operatorname{lcm}(a_1, a_2)}+\frac{1}{\operatorname{lcm}(a_2, a_3)}+\dots+\frac{1}{\operatorname{lcm}(a_{n-1}, a_n)} \leq 1-\frac{1}{2^{n-1}}.$$ [i]Proposed by Evan Chang (squareman), USA[/i]

The four sides of a skew quadrangle and the two segments joining the midpoints of the opposite sides are realized by rigid bars. The bars are linked by hinges. Prove that this apparatus is not rigid. P.S: The 1949 Miklos Schweitzer competition had only 8 problems!

Let $p$ be the [i]potentioral[/i] function, from positive integers to positive integers, defined by $p(1) = 1$ and $p(n + 1) = p(n)$, if $n + 1$ is not a perfect power and $p(n + 1) = (n + 1) \cdot p(n)$, otherwise. Is there a positive integer $N$ such that, for all $n > N,$ $p(n) > 2^n$?

The points $A=(4,\tfrac{1}{4})$ and $B=(-5,-\tfrac{1}{5})$ lie on the hyperbola $xy=1.$ The circle with diameter $AB$ intersects this hyperbola again at points $X$ and $Y.$ Compute $XY.$