Let $a,b,c$ be positive real numbers, such that $(ab)^2 + (bc)^2 + (ca)^2 = 3$. Prove that \[ (a^2 - a + 1)(b^2 - b + 1)(c^2 - c + 1) \ge 1. \] [i]Proposed by Florin Stanescu (wer), România[/i]

Baron Munchausen presented a new theorem: if a polynomial $x^{n} - ax^{n-1} + bx^{n-2}+ \dots$ has $n$ positive integer roots then there exist $a$ lines in the plane such that they have exactly $b$ intersection points. Is the baron’s theorem true?

Let $a, b$ be integers such that all the roots of the equation $(x^2+ax+20)(x^2+17x+b) = 0$ are negative integers. What is the smallest possible value of $a + b$ ?

Determine all functions $f \colon \mathbb{R} \to \mathbb{R}$ satisfying $$f(f(x+y)-f(x-y))=y^2f(x)$$ for all $x, y \in \mathbb{R}$.

$\boxed{A5}$Let $n\in{N},n>2$,and suppose $a_1,a_2,...,a_{2n}$ is a permutation of the numbers $1,2,...,2n$ such that $a_1<a_3<...<a_{2n-1}$ and $a_2>a_4>...>a_{2n}.$Prove that \[(a_1-a_2)^2+(a_3-a_4)^2+...+(a_{2n-1}-a_{2n})^2>n^3\]

Let $m$ be a positive integer and $\{a_n\}_{n\geq 0}$ be a sequence given by $a_0 = a \in \mathbb N$, and \[ a_{n+1} = \begin{cases} \displaystyle \frac{a_n}2 & \textrm { if } a_n \equiv 0 \pmod 2, \\ a_n + m & \textrm{ otherwise. } \end{cases} \] Find all values of $a$ such that the sequence is periodical (starting from the beginning).

Given $x,y,z\in \mathbb{R^+}$. Find all sets of $x,y,z$ that correspond to $$x+y+z=x^2+y^2+z^2+18xyz=1$$ [i](Zhuge Liang)[/i]

Let be four real numbers $ x,y,z,t $ satisfying the following system: $$ \left\{ \begin{matrix} \sin x+\sin y+\sin z +\sin t =0 \\ \cos x+\cos y+\cos z+\cos t=0 \end{matrix} \right. $$ Prove that $$ \sin ((1+2k)x) +\sin ((1+2k)y) +\sin ((1+2k)z) +\sin ((1+2k)t) =0, $$ for any integer $ k. $ [i]Aurel Bârsan[/i]

Show that there exists a degree $58$ monic polynomial $$P(x) = x^{58} + a_1x^{57} + \cdots + a_{58}$$ such that $P(x)$ has exactly $29$ positive real roots and $29$ negative real roots and that $\log_{2017} |a_i|$ is a positive integer for all $1 \leq i \leq 58$.

Prove that there exists a positive real number $C$ with the following property: for any integer $n\ge 2$ and any subset $X$ of the set $\{1,2,\ldots,n\}$ such that $|X|\ge 2$, there exist $x,y,z,w \in X$(not necessarily distinct) such that \[0<|xy-zw|<C\alpha ^{-4}\] where $\alpha =\frac{|X|}{n}$.

Let $N \geq 2$ be an integer, and let $\mathbf a$ $= (a_1, \ldots, a_N)$ and $\mathbf b$ $= (b_1, \ldots b_N)$ be sequences of non-negative integers. For each integer $i \not \in \{1, \ldots, N\}$, let $a_i = a_k$ and $b_i = b_k$, where $k \in \{1, \ldots, N\}$ is the integer such that $i-k$ is divisible by $n$. We say $\mathbf a$ is $\mathbf b$-[i]harmonic[/i] if each $a_i$ equals the following arithmetic mean: \[a_i = \frac{1}{2b_i+1} \sum_{s=-b_i}^{b_i} a_{i+s}.\] Suppose that neither $\mathbf a $ nor $\mathbf b$ is a constant sequence, and that both $\mathbf a$ is $\mathbf b$-[i]harmonic[/i] and $\mathbf b$ is $\mathbf a$-[i]harmonic[/i]. Prove that at least $N+1$ of the numbers $a_1, \ldots, a_N,b_1, \ldots, b_N$ are zero.

Determine the minimum value of the expression $2x^4 - 2x^2y^2 + y^4 - 8x^2 + 18$ where $x, y \in R$.

Let $a$ be a real number. Determine, for all $a$, all pairs $(x,y)$ of real numbers such that $(x-y^2)(y-x^2)+x^3+y^3=a $.

Let $A_1A_2 . . . A_n$ be a cyclic convex polygon whose circumcenter is strictly in its interior. Let $B_1, B_2, ..., B_n$ be arbitrary points on the sides $A_1A_2, A_2A_3, ..., A_nA_1$, respectively, other than the vertices. Prove that $\frac{B_1B_2}{A_1A_3}+ \frac{B_2B_3}{A_2A_4}+...+\frac{B_nB_1}{A_nA_2}>1$.

Suppose that $a > b > c > 1$. One of solutions of the equation $\frac{(x - a)(x - b)}{(c - a)(c - b)}+\frac{(x - b)(x - c)}{(a - b)(a - c)}+\frac{(x - c)(x - a)}{(b - c)(b - a)}= x$ is (A): $-1$, (B): $-2$, (C): $0$, (D): $1$, (E): None of the above.

Let $\sum_{i=1}^n a_i x_i =0$, $a_i,x_i\in \mathbb{Z}$. It is known that however we color $\mathbb{Z}$ with finite number of colors, then the given equation has a monochromatic (of one color) solution. Prove that there is some non-empty sum of its coefficients equal to 0.

Let $\alpha$ be given positive real number, find all the functions $f: N^{+} \rightarrow R$ such that $f(k + m) = f(k) + f(m)$ holds for any positive integers $k$, $m$ satisfying $\alpha m \leq k \leq (\alpha + 1)m$.

Prove for any $M>2$, there exists an increasing sequence of positive integers $a_1<a_2<\ldots $ satisfying: 1) $a_i>M^i$ for any $i$; 2) There exists a positive integer $m$ and $b_1,b_2,\ldots ,b_m\in\left\{ -1,1\right\}$, satisfying $n=a_1b_1+a_2b_2+\ldots +a_mb_m$ if and only if $n\in\mathbb{Z}/ \{0\}$.

For how many pairs of primes $(p, q)$, is $p^2 + 2pq^2 + 1$ also a prime?

Since counting the numbers from 1 to 100 wasn't enough to stymie Gauss, his teacher devised another clever problem that he was sure would stump Gauss. Defining $\zeta_{15} = e^{2\pi i/15}$ where $i = \sqrt{-1}$, the teacher wrote the 15 complex numbers $\zeta_{15}^k$ for integer $0 \le k < 15$ on the board. Then, he told Gauss: On every turn, erase two random numbers $a, b$, chosen uniformly randomly, from the board and then write the term $2ab - a - b + 1$ on the board instead. Repeat this until you have one number left. What is the expected value of the last number remaining on the board?

Decompose the expression into real factors: \[E = 1 - \sin^5(x) - \cos^5(x).\]

[b]p1.[/b] Two players play the following game. On the lowest left square of an $8 \times 8$ chessboard there is a rook (castle). The first player is allowed to move the rook up or to the right by an arbitrary number of squares. The second layer is also allowed to move the rook up or to the right by an arbitrary number of squares. Then the first player is allowed to do this again, and so on. The one who moves the rook to the upper right square wins. Who has a winning strategy? [b]p2.[/b] Find the smallest positive whole number that ends with $17$, is divisible by $17$, and the sum of its digits is $17$. [b]p3.[/b] Three consecutive $2$-digit numbers are written next to each other. It turns out that the resulting $6$-digit number is divisible by $17$. Find all such numbers. [b]p4.[/b] Let $ABCD$ be a convex quadrilateral (a quadrilateral $ABCD$ is called convex if the diagonals $AC$ and $BD$ intersect). Suppose that $\angle CBD = \angle CAB$ and $\angle ACD = \angle BDA$ . Prove that $\angle ABC = \angle ADC$. [b]p5.[/b] A circle of radius $1$ is cut into four equal arcs, which are then arranged to make the shape shown on the picture. What is its area? [img]https://cdn.artofproblemsolving.com/attachments/f/3/49c3fe8b218ab0a5378ecc635b797a912723f9.png[/img] PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Determine all real numbers $x$ such that $$\frac{2002\lfloor x\rfloor}{\lfloor-x\rfloor+x}>\frac{\lfloor2x\rfloor}{x-\lfloor1+x\rfloor}.$$

Katherine makes Benj play a game called $50$ Cent. Benj starts with $\$0.50$, and every century thereafter has a $50\%$ chance of doubling his money and a $50\%$ chance of having his money reset to $\$0.50$. What is the expected value of the amount of money Benj will have, in dollars, after $50$ centuries?

Find all possible integer values of the sum: $$\frac{a}{b}+ \frac{2023 \times b}{4 \times a},$$ where $a$ and $b$ are positive integers with no prime factors in common.