[b]p1.[/b] In the group of five people any subgroup of three persons contains at least two friends. Is it possible to divide these five people into two subgroups such that all members of any subgroup are friends? [b]p2.[/b] Coefficients $a,b,c$ in expression $ax^2+bx+c$ are such that $b-c>a$ and $a \ne 0$. Is it true that equation $ax^2+bx+c=0$ always has two distinct real roots? [b]p3.[/b] Point $D$ is a midpoint of the median $AF$ of triangle $ABC$. Line $CD$ intersects $AB$ at point $E$. Distances $|BD|=|BF|$. Show that $|AE|=|DE|$. [b]p4.[/b] Real numbers $a,b$ satisfy inequality $a+b^5>ab^5+1$. Show that $a+b^7>ba^7+1$. [b]p5.[/b] A positive number was rounded up to the integer and got the number that is bigger than the original one by $28\%$. Find the original number (find all solutions). [b]p6.[/b] Divide a $5\times 5$ square along the sides of the cells into $8$ parts in such a way that all parts are different. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Determine the sequence of complex numbers $ \left( x_n\right)_{n\ge 1} $ for which $ 1=x_1, $ and for any natural number $ n, $ the following equality is true: $$ 4\left( x_1x_n+2x_2x_{n-1}+3x_3x_{n-2}+\cdots +nx_nx_1\right) =(1+n)\left( x_1x_2+x_2x_3+\cdots +x_{n-1}x_n +x_nx_{n+1}\right) . $$

For how many positive integers $n$ is $n^3-8n^2+20n-13$ a prime number? $\textbf{(A) }1\qquad\textbf{(B) }2\qquad\textbf{(C) }3\qquad\textbf{(D) }4\qquad\textbf{(E) }\text{more than 4}$

Determine all integers \( x \) for which the expression \( x^2 + 10x + 160 \) is a perfect square.

Find all polynomials $P(x), Q(x)$ with real coefficients such that for all real numbers $a$, $P(a)$ is a root of the equation $x^{2023}+Q(a)x^2+(a^{2024}+a)x+a^3+2025a=0.$

Find all integers $ k$ such that for infinitely many integers $ n \ge 3$ the polynomial \[ P(x) =x^{n+ 1}+ kx^n - 870x^2 + 1945x + 1995\] can be reduced into two polynomials with integer coefficients.

Determine the number of quadratic polynomials $P(x) = p_1x^2 + p_2x - p_3$, where $p_1$, $p_2$, $p_3$ are not necessarily distinct (positive) prime numbers less than $50$, whose roots are distinct rational numbers.

Four sequences of real numbers $(a_n), (b_n), (c_n), (d_n)$ satisfy for all $n$, $$a_{n+1} = a_n +b_n, b_{n+1} = b_n +c_n,$$ $$c_{n+1} = c_n +d_n, d_{n+1} = d_n +a_n.$$ Prove that if $a_{k+m} = a_m, b_{k+m} = b_m, c_{k+m} = c_m, d_{k+m} = d_m$ for some $k\ge 1,n \ge 1$, then $a_2 = b_2 = c_2 = d_2 = 0$.

Let $p$ be an odd prime. Prove that \[\sum^{p-1}_{k=1} k^{2p-1} \equiv \frac{p(p+1)}{2}\pmod{p^2}.\]

Compute the number of real numbers $t$ such that \[t = 50 \sin(t - \lfloor t \rfloor).\] Here $\lfloor \cdot\rfloor$ denotes the greatest integer function. [i]Proposed by David Altizio[/i]

Solve the equations : $$\begin{cases} a + b + c = 0 \\ a^2 + b^2 + c^2 = 1\\a^3 + b^3 +c^3 = 4abc \end{cases}$$ for $ a,b,$ and $c. $

Initially, a pair of numbers $(1,1)$ is written on the board. If for some $x$ and $y$ one of the pairs $(x, y-1)$ and $(x+y, y+1)$ is written on the board, then you can add the other one. Similarly for $(x, xy)$ and $(\frac {1} {x}, y)$. Prove that for each pair that appears on the board, its first number will be positive.

Given the numbers $a_1, a_2, ... , a_n$ such that $$0\le a_1\le a_2\le 2a_1 , a_2\le a_3\le 2a_2 , ... , a_{n-1}\le a_n\le 2a_{n-1}$$ Prove that in the sum $s=\pm a1\pm a2\pm ...\pm a_n$ You can choose appropriate signs to make $0\le s\le a_1$.

Suppose that a sequence $a_1,a_2,\ldots$ of positive real numbers satisfies \[a_{k+1}\geq\frac{ka_k}{a_k^2+(k-1)}\] for every positive integer $k$. Prove that $a_1+a_2+\ldots+a_n\geq n$ for every $n\geq2$.

Find the function $f(x)$ that satisfies the equation $$f'(x) + x^2f(x) = 0$$ knowing that $f(1) = e$. Graph this function and calculate the tangent of the curve at the point of abscissa $1$.

Do there exist numbers $a,b \in R$ and surjective function $f: R \to R$ such that $f(f(x)) = bx f(x) +a$ for all real $x$? I.Voronovich

For a polynomial $ P$ of degree 2000 with distinct real coefficients let $ M(P)$ be the set of all polynomials that can be produced from $ P$ by permutation of its coefficients. A polynomial $ P$ will be called [b]$ n$-independent[/b] if $ P(n) \equal{} 0$ and we can get from any $ Q \in M(P)$ a polynomial $ Q_1$ such that $ Q_1(n) \equal{} 0$ by interchanging at most one pair of coefficients of $ Q.$ Find all integers $ n$ for which $ n$-independent polynomials exist.

Given real numbers $x$ and $y$, such that $$x^4 y^2 + y^4 + 2 x^3 y + 6 x^2 y + x^2 + 8 \le 0 .$$ Prove that $x \ge - \frac16$

A sequence of polynomials $\{f_n\}_{n=0}^{\infty}$ is defined recursively by $f_0(x)=1$, $f_1(x)=1+x$, and \[(k+1)f_{k+1}(x)-(x+1)f_k(x)+(x-k)f_{k-1}(x)=0, \quad k=1,2,\ldots\] Prove that $f_k(k)=2^k$ for all $k\geq 0$.

Equations of non-intersecting curves are $y = ax^2 + bx + c$ and $y = dx^2 + ex + f$ where $ad < 0.$ Prove that there is a line of the plane which does not meet either of the curves.

Consider a sequence of polynomials $P_0(x), P_1(x), P_2(x), \ldots, P_n(x), \ldots$, where $P_0(x) = 2, P_1(x) = x$ and for every $n \geq 1$ the following equality holds: \[P_{n+1}(x) + P_{n-1}(x) = xP_n(x).\] Prove that there exist three real numbers $a, b, c$ such that for all $n \geq 1,$ \[(x^2 - 4)[P_n^2(x) - 4] = [aP_{n+1}(x) + bP_n(x) + cP_{n-1}(x)]^2.\]

Consider a polynomial $P(x) = x^4+x^3-3x^2+x+2$. Prove that at least one of the coefficients of $(P(x))^k$, ($k$ is any positive integer) is negative. (5)

Let $G$ be a finite group and $f: G \to G$ a map, such that $f (xy) = f (x) f (y)$ for all $x, y \in G$ and $f (x) = x^{-1}$ for more than $\frac34$ of all $x \in G$ is fulfilled. Show that $f (x) =x^{-1}$ even holds for all $x \in G$ holds.

Let $p$ be a (positive) prime number. Suppose that real numbers $a_1, a_2, . . ., a_{p+1}$ have the property that, whenever one of the numbers is deleted, the remaining numbers can be partitioned into two classes with the same arithmetic mean. Show that these numbers must be equal.

For a multiple of $ kb$ of $ b$ let $ a \% kb$ be the greatest number such that $ a \% kb \equal{} a \bmod b$ which is smaller than $ kb$ and not greater than $ a$ itself. Let $ n \in \mathbb{Z}^ \plus{} .$ Determine all integer pairs $ (a,b)$ with: \[ a\%b \plus{} a\%2b \plus{} a\%3b \plus{} \ldots \plus{} a\%nb \equal{} a \plus{} b \]