Prove that for three arbitrary infinite sequences, of natural numbers $a_1,a_2,...,a_n,... $ , $b_1,b_2,...,b_n,... $, $c_1,c_2,...,c_n,...$ there exist numbers $p$ and $q$ such, that $a_p \ge a_q$, $b_p \ge b_q$ and $c_p \ge c_q$.

Without using a calculator, find out which number is greater: $$29^{200}\cdot 2^{151} \,\,\, or \,\,\, 5^{279} \cdot 3^{300}$$

[b]8.1[/b] $x$ and $y$ are the roots of the equation $t^2-ct-c=0$. Prove that holds the inequality $x^3 + y^3 + (xy)^3 \ge 0.$ [b]8.2.[/b] Two circles touch internally at point $A$ . Through a point $B$ of the inner circle, different from $A$, a tangent to this circle intersecting the outer circle at points C and $D$. Prove that $AB$ is a bisector of angle $CAD$. [img]https://cdn.artofproblemsolving.com/attachments/2/8/3bab4b5c57639f24a6fd737f2386a5e05e6bc7.png[/img] [b]8.3[/b] Prove that $2^{3^{100}} + 1$ is divisible by $3^{101}$. [b]8.4 / 7.5[/b] An entire arc of circle is drawn through the vertices $A$ and $C$ of the rectangle $ABCD$ lying inside the rectangle. Draw a line parallel to $AB$ intersecting $BC$ at point $P$, $AD$ at point $Q$, and the arc $AC$ at point $R$ so that the sum of the areas of the figures $AQR$ and $CPR$ is the smallest. [img]https://cdn.artofproblemsolving.com/attachments/1/4/9b5a594f82a96d7eff750e15ca6801a5fc0bf1.png [/img] [b]8.5[/b] In a certain group of people, everyone has one enemy and one Friend. Prove that these people can be divided into two companies so that in every company there will be neither enemies nor friends. [b]8.6[/b] Numbers $a_1, a_2, . . . , a_{100}$ are such that $$a_1 - 2a_2 + a_3 \le 0$$ $$a_2-2a_3 + a_ 4 \le 0$$ $$...$$ $$a_{98}-2a_{99 }+ a_{100} \le 0$$ and at the same time $a_1 = a_{100}\ge 0$. Prove that all these numbers are non-negative. PS. You should use hide for answers.Collected [url=https://artofproblemsolving.com/community/c3988083_1967_leningrad_math_olympiad]here[/url].

For any positive integer $k$, denote the sum of digits of $k$ in its decimal representation by $S(k)$. Find all polynomials $P(x)$ with integer coefficients such that for any positive integer $n \ge 2017$, the integer $P(n)$ is positive and $S(P(n)) = P(S(n))$.

Find the maximum possible value of $k$ for which there exist distinct reals $x_1,x_2,\ldots ,x_k $ greater than $1$ such that for all $1 \leq i, j \leq k$, $$x_i^{\lfloor x_j \rfloor }= x_j^{\lfloor x_i\rfloor}.$$ [i]Proposed by Morteza Saghafian[/i]

The arithmetic mean (average) of the first $n$ positive integers is: $ \textbf{(A)}\ \frac{n}{2} \qquad\textbf{(B)}\ \frac{n^2}{2}\qquad\textbf{(C)}\ n\qquad\textbf{(D)}\ \frac{n-1}{2}\qquad\textbf{(E)}\ \frac{n+1}{2} $

[b]p1.[/b] Find all solutions $a, b, c, d, e, f, g$ if it is known that they represent distinct digits and satisfy the following: $\begin{tabular}{ccccccc} & & & a & b & c & d \\ x & & & & & a & b \\ \hline & & c & d & b & d & b \\ + & c & e & b & f & b & \\ \hline & c & g & a & e & g & b \\ \end{tabular}$ [b]p2.[/b] $5$ numbers are placed on the circle. It is known that the sum of any two neighboring numbers is not divisible by $3$ and the sum of any three consecutive numbers is not divisible by $3$. How many numbers on the circle are divisible by $3$? [b]p3.[/b] $n$ teams played in a volleyball tournament. Each team played precisely one game with all other teams. If $x_j$ is the number of victories and $y_j$ is the number of losses of the $j$th team, show that $$\sum^n_{j=1}x^2_j=\sum^n_{j=1} y^2_j $$ [b]p4.[/b] Three cars participated in the car race: a Ford $[F]$, a Toyota $[T]$, and a Honda $[H]$. They began the race with $F$ first, then $T$, and $H$ last. During the race, $F$ was passed a total of $3$ times, $T$ was passed $5$ times, and $H$ was passed $8$ times. In what order did the cars finish? [b]p5.[/b] The side of the square is $4$ cm. Find the sum of the areas of the six half-disks shown on the picture. [img]https://cdn.artofproblemsolving.com/attachments/c/b/73be41b9435973d1c53a20ad2eb436b1384d69.png[/img] PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

The natural number $m\geq 2$ is given.Sequence of natural numbers $(b_0,b_1,\ldots,b_m)$ is called concave if $b_k+b_{k-2}\le2b_{k-1}$ for all $2\le k\le m.$ Prove that there exist not greater than $2^m$ concave sequences starting with $b_0 =1$ or $b_0 =2$

Prove that there exist nonconstant polynomials $f, g$ with integer coefficients, such that for infinitely many primes $p$, $p \nmid f(x)-g(y)$ for any integers $x, y$.

Let be a function $ f:(0,\infty )\longrightarrow\mathbb{R} $ satisfying the following two properties: $ \text{(i) } 2\lfloor x \rfloor \le f(x) \le 2 \lfloor x \rfloor +2,\quad\forall x\in (0,\infty ) $ $ \text{(ii) } f\circ f $ is monotone Can $ f $ be non-monotone? Justify.

Let $a, b, c$ be positive real numbers such that $$a^2 + b^2 + c^2 = \frac{1}{4}.$$ Prove that $$\frac{1}{\sqrt{b^2 + c^2}} + \frac{1}{\sqrt{c^2 + a^2}} + \frac{1}{\sqrt{a^2 + b^2}} \le \frac{\sqrt{2}}{(a + b)(b + c)(c + a)}.$$ [i]Proposed by Petar Filipovski, Macedonia[/i]

Find all functions $f: \mathbb{Q} \mapsto \mathbb{C}$ satisfying (i) For any $x_1, x_2, \ldots, x_{1988} \in \mathbb{Q}$, $f(x_{1} + x_{2} + \ldots + x_{1988}) = f(x_1)f(x_2) \ldots f(x_{1988})$. (ii) $\overline{f(1988)}f(x) = f(1988)\overline{f(x)}$ for all $x \in \mathbb{Q}$.

In a national park there is a group of sequoia trees, all of which have a positive integer age. Their average age is $41$ years. After a $2010$ year old building was destroyed by lightning, the average age drops to $40$ years. How many trees were originally in the group? At most, how many of them were exactly $2010$ years old? (W. Janous, WRG Ursulinen, Innsbruck)

The numbers $1, 2, 3, . . . , 16$ must be placed in the $16$ squares in such a way that the sum of the numbers in each of the four rows and columns is the same. What is the smallest possible sum of the four numbers in the corner squares? [img]https://cdn.artofproblemsolving.com/attachments/c/2/fad1837625fd71e8ea333f9f9477f0bd120e05.png[/img]

In a Greek village of $100$ inhabitants in the beginning there lived $12$ Olympians and $88$ humans, they were the first generation. The Olympians are $100\%$ gods while humans are $0\%$ gods. In each generation they formed $50$ couples and each couple had $2$ children, who form the next generation (also consisting of $100$ members). From the second generation onwards, every person’s percentage of godness is the average of the percentages of his/her parents’ percentages. (For example the children of $25\%$ and $12.5\% $gods are $18.75\%$ gods.) a) Which is the earliest generation in which it is possible that there are equally many $100\%$ gods as $ 0\%$ gods? b) At most how many members of the fifth generation are at least 25% gods?

Find all pairs of integers, $n$ and $k$, $2 < k < n$, such that the binomial coefficients \[\binom{n}{k-1}, \binom{n}{k}, \binom{n}{k+1}\] form an increasing arithmetic series.

Let $ n$ be a positive integer. Given an integer coefficient polynomial $ f(x)$, define its [i]signature modulo $ n$[/i] to be the (ordered) sequence $ f(1), \ldots , f(n)$ modulo $ n$. Of the $ n^n$ such $ n$-term sequences of integers modulo $ n$, how many are the signature of some polynomial $ f(x)$ if a) $ n$ is a positive integer not divisible by the square of a prime. b) $ n$ is a positive integer not divisible by the cube of a prime.

Determine if there exist functions $f, g : R \to R$ satisfying for every $x \in R$ the following equations $f(g(x)) = x^3$ and $g(f(x)) = x^2$.

Find a function $f: \mathbb N \to \mathbb N$ such that for all positive integers $n$, \[ f(f(n))\equal{}n^2.\]

Let $ a,b,c$ be positive numbers, satisfying $ abc\geq 1$. Prove that \[ a^{3} \plus{} b^{3} \plus{} c^{3} \geq ab \plus{} bc \plus{} ca.\]

A polynomial is called Fermat polynomial if it can be written as the sum of squares of two polynomials with integer coefficients. Suppose that $f(x)$ is a Fermat polynomial such that $f(0)=1000$. Prove that $f(x)+2x$ is not a fermat polynomial

Show that there exists an integer polynomial $P$ such that $P(1) = 2024$ and the set of prime divisors of {$P(2^k)$},$k=0,1,2,.....$ is an infinite set.

Find the smallest real number $M$ with the following property: Given nine nonnegative real numbers with sum $1$, it is possible to arrange them in the cells of a $3 \times 3$ square so that the product of each row or column is at most $M$. [i]Evan O' Dorney.[/i]

Find all injective functions $ f : \mathbb{N} \to \mathbb{N}$ which satisfy \[ f(f(n)) \le\frac{n \plus{} f(n)}{2}\] for each $ n \in \mathbb{N}$.

Determine all functions $f : R \to R$ such that for all $x, y \in R$ holds $$f(xf(x) + f(y)) = y + f(x)^2$$