Find the greatest integer less than or equal to $\sum_{k=1}^{2^{1983}} k^{\frac{1}{1983} -1}.$

Indicate the moment in time when for the first time after midnight the angle between the minute and hour hands will be equal to $1^o$, despite the fact that the minute hand shows an integer number of minutes.

Determine all functions $f: \mathbb{R} \to \mathbb{R}$ such that the inequality \[ f(x^2)-f(y^2) \le (f(x)+y)(x-f(y)) \] holds for all real numbers $x$ and $y$.

Let $x, y, z$ be positive real numbers whose sum is $2013$. Find the maximum possible value of $$\frac{(x^2+y^2+z^2)(x^3+y^3+z^3)}{ (x^4+y^4+z^4)}.$$

Let $f : R \to R$ be a function satisfying the equation $f(x^2 + x + 3) + 2f(x^2 - 3x + 5) =6x^2 - 10x + 17$ for all real numbers $x$. What is the value of $f(85)$?

Suppose function $f:[0,\infty)\to[0,\infty)$ satisfies (1)$\forall x,y \geq 0,$ we have $f(x)f(y)\leq y^2f(\frac{x}{2})+x^2f(\frac{y}{2})$; (2)$\forall 0 \leq x \leq 1, f(x) \leq 2016$. Prove that $f(x)\leq x^2$ for all $x\geq 0$.

Paca-Vaca decided to note every day a single quadratic polynomial of the form $x^2+ax+b$, where $a$ and $b$ are positive integers, less or equal than $100$. He follows the rule that the polynomial he writes must not have any common roots with the polynomials previously noted. What is the maximum amount of days Paca-Vaca can follow this plan?

The numbers $2, 2, ..., 2$ are written on a blackboard (the number $2$ is repeated $n$ times). One step consists of choosing two numbers from the blackboard, denoting them as $a$ and $b$, and replacing them with $\sqrt{\frac{ab + 1}{2}}$. $(a)$ If $x$ is the number left on the blackboard after $n - 1$ applications of the above operation, prove that $x \ge \sqrt{\frac{n + 3}{n}}$. $(b)$ Prove that there are infinitely many numbers for which the equality holds and infinitely many for which the inequality is strict.

Let $a,b,c$ be positive numbers. Prove that a triangle with sides $a,b,c$ exists if and only if the system of equations $$\begin{cases}\dfrac{y}{z}+\dfrac{z}{y}=\dfrac{a}{x} \\ \\ \dfrac{z}{x}+\dfrac{x}{z}=\dfrac{b}{y} \\ \\ \dfrac{x}{y}+\dfrac{y}{x}=\dfrac{c}{z}\end{cases}$$ has a real solution.

Let $a,b,c$ be positive reals such that $abc=1$. Prove the inequality $$\frac{4a-1}{(2b+1)^2} + \frac{4b-1}{(2c+1)^2} + \frac{4c-1}{(2a+1)^2}\geqslant 1.$$

For each integer $n \ge 2$, find all integer solutions of the following system of equations: \[x_1 = (x_2 + x_3 + x_4 + ... + x_n)^{2018}\] \[x_2 = (x_1 + x_3 + x_4 + ... + x_n)^{2018}\] \[\vdots\] \[x_n = (x_1 + x_2 + x_3 + ... + x_{n - 1})^{2018}\]

Find the maximum value for the area of a heptagon with all vertices on a circle and two diagonals perpendicular.

Let $x, y, z$ be positive reals. Prove that $$\frac{xz}{x^2 + xy + y^2 + 6z^2} + \frac{zx}{z^2 + zy + y^2 + 6x^2} + \frac{xy}{x^2 + xz + z^2 + 6y^2} \le \frac13$$

If $x$ is a positive rational number show that $x$ can be uniquely expressed in the form $x = \sum^n_{k=1} \frac{a_k}{k!}$ where $a_1, a_2, \ldots$ are integers, $0 \leq a_n \leq n - 1$, for $n > 1,$ and the series terminates. Show that $x$ can be expressed as the sum of reciprocals of different integers, each of which is greater than $10^6.$

Thirty numbers are placed on a circle. For every number $A$ we have: $A$ equals the absolute value of $(B- C)$, where $B$ and $C$ follow $A$ clockwise. The total sum of the numbers equals $1$. Find all the numbers. (Folklore)

Given such positive real numbers $a, b$ and $c$, that the system of equations: $ \{\begin{matrix}a^2x+b^2y+c^2z=1&&\\xy+yz+zx=1&&\end{matrix} $ has exactly one solution of real numbers $(x, y, z)$. Prove, that there is a triangle, which borders lengths are equal to $a, b$ and $c$.

Do there exist $10$ real numbers, not all of which are equal, each of which is equal to the square of the sum of the remaining $9$ numbers? [i]Proposed by Bogdan Rublov[/i]

Let $a$, $b$ and $c$ be positive real numbers satisfying $abc=1$. Prove that the following inequality holds: $$\frac{a+b+c}{3}\geq\frac{a}{a^2b+2}+\frac{b}{b^2c+2}+\frac{c}{c^2a+2}.$$

Which number is greater: $\frac{2.00 000 000 004}{(1.00 000 000 004)^2 + 2.00 000 000 004}$ or $\frac{2.00 000 000 002}{(1.00 000 000 002)^2 + 2.00 000 000 002}$ ?

Let $A$ be a set of real numbers which verifies: \[ a)\ 1 \in A \\ b) \ x\in A\implies x^2\in A\\ c)\ x^2-4x+4\in A\implies x\in A \] Show that $2000+\sqrt{2001}\in A$.

A magician intends to perform the following trick. She announces a positive integer $n$, along with $2n$ real numbers $x_1 < \dots < x_{2n}$, to the audience. A member of the audience then secretly chooses a polynomial $P(x)$ of degree $n$ with real coefficients, computes the $2n$ values $P(x_1), \dots , P(x_{2n})$, and writes down these $2n$ values on the blackboard in non-decreasing order. After that the magician announces the secret polynomial to the audience. Can the magician find a strategy to perform such a trick?

Find all functions $f:\mathbb{N}\rightarrow(0,\infty)$ such that $f(4)=4$ and \[\frac{1}{f(1)f(2)}+\frac{1}{f(2)f(3)}+\cdots+\frac{1}{f(n)f(n+1)}=\frac{f(n)}{f(n+1)},~\forall n\in\mathbb{N},\] where $\mathbb{N}=\{1,2,\dots\}$ is the set of positive integers.

[b]p1.[/b] Find all solutions $a, b, c, d, e, f$ if it is known that they represent distinct digits and satisfy the following: $\begin{tabular}{ccccc} & a & b & c & a \\ + & & d & d & e \\ & & & d & e \\ \hline d & f & f & d & d \\ \end{tabular}$ [b]p2.[/b] Snowhite wrote on a piece of paper a whole number greater than $1$ and multiplied it by itself. She obtained a number, all digits of which are $1$: $n^2 = 111...111$ Does she know how to multiply? [b]p3.[/b] Two players play the following game on an $8\times 8$ chessboard. The first player can put a bishop on an arbitrary square. Then the second player can put another bishop on a free square that is not controlled by the first bishop. Then the first player can put a new bishop on a free square that is not controlled by the bishops on the board. Then the second player can do the same, etc. A player who cannot put a new bishop on the board loses the game. Who has a winning strategy? [b]p4.[/b] Four girls Marry, Jill, Ann and Susan participated in the concert. They sang songs. Every song was performed by three girls. Mary sang $8$ songs, more then anybody. Susan sang $5$ songs less then all other girls. How many songs were performed at the concert? [b]p5.[/b] Pinocchio has a $10\times 10$ table of numbers. He took the sums of the numbers in each row and each such sum was positive. Then he took the sum of the numbers in each columns and each such sum was negative. Can you trust Pinocchio's calculations? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Determine all complex numbers $z$ such that \[\Bigl|z-\bigl|z+|z|\bigr|\Bigr|-|z|\sqrt3\ge0\] and draw the set of all such $z$ in complex plane.

Find all functions $f: \mathbb{R}^+\rightarrow \mathbb{R}^+$ with the following property: $a,b,$ and $c$ are lengths of sides of a triangle, if and only if $f(a),f(b),$ and $f(c)$ are lengths of sides of a triangle.