Can there be drawn on a circle of radius $1$ a number of $1975$ distinct points, so that the distance (measured on the chord) between any two points (from the considered points) is a rational number?

Let $P(x)$ be polynomial with integer coefficients. Prove, that if for any natural $k$ holds equality: $ \underbrace{P(P(...P(0)...))}_{n -times}=0$ then $P(0)=0$ or $P(P(0))=0$

How many square yards of carpet are required to cover a rectangular floor that is $12$ feet long and $9$ feet wide? (There are 3 feet in a yard.) $\textbf{(A) }12\qquad\textbf{(B) }36\qquad\textbf{(C) }108\qquad\textbf{(D) }324\qquad \textbf{(E) }972$

The board has a natural number greater than $1$. At each step, Igor writes the number $n +\frac{n}{p}$ instead of the number $n$ on the board , where $p$ is some prime divisor of $n$. Prove that if Igor continues to rewrite the number infinite times, then he will choose infinitely times the number $3$ as a prime divisor of $p$. [hide=original wording]На доске записано какое-то натуральное число, большее 1. На каждом шагу Игорь переписывает имеющееся на доске число n на число n +n/p, где p - это какой-нибудь простой делитель числа n. Доказать, что если Игорь будет продолжать переписывать число бесконечно долго, то он бесконечно много раз выберет в качестве простого делителя p число 3.[/hide]

Let $g_0 = 1$, $g_1 = 2$, $g_2 = 3$, and $g_n = g_{n-1} + 2g_{n-2} + 3g_{n-3}$. For how many $0 \le i \le 100$ is it that $g_i$ is divisible by $5$?

Let $x, y$ be positive reals such that $x \ne y$. Find the minimum possible value of $(x + y)^2 + \frac{54}{xy(x-y)^2}$ .

A round table is surrounded by $n\geqslant 2$ people, each assigned one of the integers $0, 1,\ldots , n-1$ such that no two people have the same number. In each round, everyone adds their number to their right neighbour’s number, and their new number becomes the remainder of the sum when divided by $n{}.$ We call an initial configuration of integers [i]glorious[/i] if everyone’s number remains the same after some finite number of rounds, never changing again. [list=a] [*]For which integers $n\geqslant 2$ is every initial configuration glorious? [*]For which integers $n\geqslant 2$ is there no glorious initial configuration at all? [/list]

Several points are given in the plane. Suppose that for any three of them, there exists an orthogonal coordinate system (determined by the two axes and the unit length) in which these three points have integer coordinates. Prove that there exists an orthogonal coordinate system in which all the given points have integer coordinates.

Given equation ${a^5} - {a^3} + a = 2$, with real $a$ . Prove that $3 < {a^6} < 4$.

[u]Round 9[/u] [b]p25.[/b] A positive integer is called spicy if it is divisible by the sum if its digits. Find the number of spicy integers between $100$ and $200$ inclusive. [b]p26.[/b] Rectangle $ABCD$ has points $E$ and $F$ on sides $AB$ and $BC$, respectively. Given that $\frac{AE}{BE} = \frac{BF}{FC} =\frac12$, $\angle ADE = 30^o$, and $[DEF] = 25$, find the area of rectangle $ABCD$. [b]p27.[/b] Find the largest value of $n$ for which $3^n$ divides ${100 \choose 33}$. [u]Round 10[/u] [b]p28.[/b] Isosceles trapezoid $ABCD$ is inscribed in a circle such that $AB \parallel CD$, $AB = 2$, $CD = 4$, and $AC = 9$. What is the radius of the circle? [b]p29.[/b] Find the product of all possible positive integers $n$ less than $11$ such that in a group of $n$ people, it is possible for every person to be friends with exactly $3$ other people within the group. Assume that friendship is amutual relationship. [b]p30.[/b] Compute the infinite product $$\left( 1+ \frac{1}{2^1} \right) \left( 1+ \frac{1}{2^2} \right) \left( 1+ \frac{1}{2^4} \right) \left( 1+ \frac{1}{2^8} \right) \left( 1+ \frac{1}{2^{16}} \right) ...$$ [u]Round 11[/u] [b]p31.[/b] Find the sum of all possible values of $x y$ if $x +\frac{1}{y}= 12$ and $\frac{1}{x}+ y = 8$. [b]p32.[/b] Find the number of ordered pairs $(a,b)$, where $0 < a,b < 1999$, that satisfy $a^2 +b^2 \equiv ab$ (mod $1999$) [b]p33.[/b] Let $f :N\to Q$ be a function such that $f(1) =0$, $f (2) = 1$ and $f (n) = \frac{f(n-1)+f (n-2)}{2}$ . Evaluate $$\lim_{n\to \infty} f (n).$$ [u]Round 12[/u] [b]p34.[/b] Estimate the sumof the digits of $2018^{2018}$. The number of points you will receive is calculated using the formula $\max \,(0,15-\log_{10}(A-E))$, where $A$ is the true value and $E$ is your estimate. [b]p35.[/b] Let $C(m,n)$ denote the number of ways to tile an $m$ by $n$ rectangle with $1\times 2$ tiles. Estimate $\log_{10}(C(100, 2))$. The number of points you will recieve is calculated using the formula $\max \,(0,15- \log_{10}(A-E))$, where $A$ is the true value and $E$ is your estimate. [b]p36.[/b] Estimate $\log_2 {1000 \choose 500}$. The number of points you earn is equal to $\max \,(0,15-|A-E|)$, where $A$ is the true value and $E$ is your estimate. PS. You should use hide for answers. Rounds 1-4 have been posted [url=https://artofproblemsolving.com/community/c3h3165983p28809209]here [/url] and 5-8 [url=https://artofproblemsolving.com/community/c3h3165992p28809294]here[/url].. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Fourteen students each write an integer number on the board. When they later meet their math teacher Homer Grog, they tell him that no matter what number they erased on the board, then the remaining numbers could be divided into three groups at once sum. They also tell him that the numbers on the board were integer numbers. Is it now possible for Homer Grog to determine what numbers the students wrote on the board?

Point $M$ lies inside triangle $ABC$. Prove that for any other point $N$ lying inside the triangle $ABC$, at least one of the following three inequalities is fulfilled: $AN>AM, BN>BM, CN>CM$.

Each of the numbers $n$, $n+1$, $n+2$, $n+3$ is divisible by its sum of digits in its decimal representation. How many different values can the tens column of $n$ have, if the number in ones column of $n$ is $8$? $ \textbf{(A)}\ 1 \qquad\textbf{(B)}\ 2 \qquad\textbf{(C)}\ 3 \qquad\textbf{(D)}\ 4 \qquad\textbf{(E)}\ 5 $

Triangle $ABC$ has $\angle{A}=90^\circ$, $\angle{C}=30^\circ$, and $AC=12$. Let the circumcircle of this triangle be $W$. Define $D$ to be the point on arc $BC$ not containing $A$ so that $\angle{CAD}=60^\circ$. Define points $E$ and $F$ to be the foots of the perpendiculars from $D$ to lines $AB$ and $AC$, respectively. Let $J$ be the intersection of line $EF$ with $W$, where $J$ is on the minor arc $AC$. The line $DF$ intersects $W$ at $H$ other than $D$. The area of the triangle $FHJ$ is in the form $\frac{a}{b}(\sqrt{c}-\sqrt{d})$ for positive integers $a,b,c,d,$ where $a,b$ are relatively prime, and the sum of $a,b,c,d$ is minimal. Find $a+b+c+d$.

Let $S_n$ be the number of sequences $(a_1, a_2, \ldots, a_n),$ where $a_i \in \{0,1\},$ in which no six consecutive blocks are equal. Prove that $S_n \rightarrow \infty$ when $n \rightarrow \infty.$

Let $P(x)$ be a polynomial of degree $n$ with real coefficients and let $a\geq 3$. Prove that \[\max_{0\leq j \leq n+1}\left | a^j-P(j) \right |\geq 1\]

Let $\boxed{N}$ mean the number of whole number divisors of $N$. For example, $\boxed{3}=2$ because 3 has two divisors, 1 and 3. Find the value of \[\boxed{\boxed{11}\times\boxed{20}}.\] $\textbf{(A)}\ 6 \qquad \textbf{(B)}\ 8 \qquad \textbf{(C)}\ 12 \qquad \textbf{(D)}\ 16 \qquad \textbf{(E)}\ 24$

You have many identical cube-shaped wooden blocks. You have four colors of paint to use, and you paint each face of each block a solid color so that each block has at least one face painted with each of the four colors. Find the number of distinguishable ways you could paint the blocks. (Two blocks are distinguishable if you cannot rotate one block so that it looks identical to the other block.)

Let $p > 1$ be a natural number. Consider the set $F_p$ of all non-constant sequences of non-negative integers that satisfy the recursive relation $a_{n+1} = (p+1)a_n - pa_{n-1}$ for all $n > 0$. Show that there exists a sequence ($a_n$) in $F_p$ with the property that for every other sequence ($b_n$) in $F_p$, the inequality $a_n \le b_n$ holds for all $n$.

The radius $r$ of a circle is increasing at a rate of $2$ meters per minute. Find the rate of change, in $\text{meters}^2/\text{minute}$, of the area when $r$ is $6$ meters.

Let $k$ be a positive integer. Arnaldo and Bernaldo play a game in a table $2020\times 2020$, initially all the cells are empty. In each round a player chooses a empty cell and put one red token or one blue token, Arnaldo wins if in some moment, there are $k$ consecutive cells in the same row or column with tokens of same color, if all the cells have a token and there aren't $k$ consecutive cells(row or column) with same color, then Bernaldo wins. If the players play alternately and Arnaldo goes first, determine for which values of $k$, Arnaldo has the winning strategy.

Find the remainder when $2^{1990}$ is divided by $1990.$

Prove that there are infinitely many positive integers $m$ such that the number of odd distinct prime factor of $m(m+3)$ is a multiple of $3$.

Find, with proof, all real-valued functions $y=g(x)$ defined and continuous on $[0,\infty)$, positive on $(0,\infty)$, such that for all $x>0$ the $y$-coordinate of the centroid of the region $$R_x=\{(s,t)\mid0\le s\le x,\enspace0\le t\le g(s)\}$$is the same as the average value of $g$ on $[0,x]$.

A tetrahedron $ABCD$ with acute-angled faces is inscribed in a sphere with center $O$. A line passing through $O$ perpendicular to plane $ABC$ crosses the sphere at point $D'$ that lies on the opposide side of plane $ABC$ than point $D$. Line $DD'$ crosses plane $ABC$ in point $P$ that lies inside the triangle $ABC$. Prove, that if $\angle APB=2\angle ACB$, then $\angle ADD'=\angle BDD'$.