Let $F$ be the set of all polynomials $\Gamma$ such that all the coefficients of $\Gamma (x)$ are integers and $\Gamma (x) = 1$ has integer roots. Given a positive intger $k$, find the smallest integer $m(k) > 1$ such that there exist $\Gamma \in F$ for which $\Gamma (x) = m(k)$ has exactly $k$ distinct integer roots.

Find all functions $f : \mathbb{R} \mapsto \mathbb{R}$ such that $f(xy+f(x)) = xf(y) +f(x)$ for all $x,y \in \mathbb{R}$.

Let $P_n(x)=a_0 + a_1x + \cdots + a_nx^n$, with $n \geq 2$, be a real-coefficient polynomial. Prove that if there exists $a > 0$ such that \begin{align*} P_n(x) = (x + a)^2 \left( \sum_{i=0}^{n-2} b_i x^i \right), \end{align*} where $b_i$ are positive real numbers, then there exists some $i$, with $1 \leq i \leq n-1$, such that \[a_i^2 - 4a_{i-1}a_{i+1} \leq 0.\]

$10$ integers are written in a row. A second row of $10$ integers is formed as follows: the integer written under each integer $A$ of the first row is equal to the total number of integers that stand to the right side of $A$ (in the first row) and are strictly greater than A. A third row is formed by the same way under the second one, and so on. (a) Prove that after several steps a “zero row” (i.e. a row consisting entirely of zeros) appears. (b) What is the maximal possible number of non-zero rows (i.e. rows in which at least one entry is not zero)? (S Tokarev)

Let $x$ be a positive real number and let $k$ be a positive integer. Assume that $x^k+\frac{1}{x^k}$ and $x^{k+1}+\frac{1}{x^{k+1}}$ are both rational numbers. Prove that $x+\frac{1}{x}$ is also a rational number.

Let $ P(x)$ be a polynomial with integer coefficients such that \[ P(m_1) \equal{} P(m_2) \equal{} P(m_3) \equal{} P(m_4) \equal{} 7\] for given distinct integers $ m_1,m_2,m_3,$ and $ m_4.$ Show that there is no integer m such that $ P(m) \equal{} 14.$

Prove that if $ n $ is a natural number greater than $ 2 $, then $$\sqrt[n + 1]{n+1} < \sqrt[n]{n}.$$

Point $O$ is inside triangle $ABC$ such that $\angle AOB = \angle BOC = \angle COA = 120^\circ .$ Prove that \[\frac{AO^2}{BC}+\frac{BO^2}{CA}+\frac{CO^2}{AB} \geq \frac{AO+BO+CO}{\sqrt 3}.\]

Let the polynomials $ w_n $ be given by the formulas: $$ w_1(x) = x^2 - 1, \quad w_{n+1}(x) = w_n(x)^2 - 1, \quad (n = 1, 2, \ldots)$$ and let $a$ be a real number. How many different real solutions does the equation $ w_n(x) = a $ have?

Alicia bought some number of disposable masks, of which she uses one per day. After she uses each of her masks, she throws out half of them (rounding up if necessary) and reuses each of the remaining masks, repeating this process until she runs out of masks. If her masks lasted her $222$ days, how many masks did she start out with?

Find all functions $ f: \mathbb{N^{*}}\to \mathbb{N^{*}}$ satisfying \[ \left(f^{2}\left(m\right)+f\left(n\right)\right) \mid \left(m^{2}+n\right)^{2}\] for any two positive integers $ m$ and $ n$. [i]Remark.[/i] The abbreviation $ \mathbb{N^{*}}$ stands for the set of all positive integers: $ \mathbb{N^{*}}=\left\{1,2,3,...\right\}$. By $ f^{2}\left(m\right)$, we mean $ \left(f\left(m\right)\right)^{2}$ (and not $ f\left(f\left(m\right)\right)$). [i]Proposed by Mohsen Jamali, Iran[/i]

Define the distance between real numbers $x$ and $y$ by $d(x,y) =\sqrt{([x]-[y])^2+(\{x\}-\{y\})^2}$ . Determine (as a union of intervals) the set of real numbers whose distance from $3/2$ is less than $202/100$ .

Find the number of all real functions $f$ which map the sum of $n$ elements into the sum of their images, such that $f^{n-1}$ is a constant function and $f^{n-2}$ is not. Here $f^0(x) = x$ and $f^k = f \circ f^{k-1}$ for $k \ge 1$.

The Bernoulli sequence $\{B_{n}\}_{n \ge 0}$ is defined by \[B_{0}=1, \; B_{n}=-\frac{1}{n+1}\sum^{n}_{k=0}{{n+1}\choose k}B_{k}\;\; (n \ge 1)\] Show that for all $n \in \mathbb{N}$, \[(-1)^{n}B_{n}-\sum \frac{1}{p},\] is an integer where the summation is done over all primes $p$ such that $p| 2k-1$.

Solve: $$ \left\{ \begin{matrix} x+y=\sqrt{4z -1} \\ y+z=\sqrt{4x -1} \\ z+x=\sqrt{4y -1}\end{matrix}\right. . $$

Let $a, b, c$ be positive real numbers such that $a\le b \le c \le 2a$. Find the maximum possible value of $$\frac{b}{a} +\frac{c}{b} +\frac{a}{c}.$$

Let $a$ be a given positive integer. We consider the sequence $(x_n)_{n \ge 1}$ defined by $x_n=\frac{1}{1+na},$ for every positive integer $n.$ Prove that for any integer $k \ge 3,$ there exist positive integers $n_1<n_2<\ldots<n_k$ such that the numbers $x_{n_1},x_{n_2},\ldots,x_{n_k}$ are consecutive terms in an arithmetic progression.

Let $n$ be a positive integer. Suppose that the following simultaneous equations $$\begin{cases} \sin x_1 + \sin x_2+ ...+ \sin x_n = 0 \\ \sin x_1 + 2\sin x_2+ ...+ n \sin x_n = 100 \end{cases}$$ has a solution, where $x_1 x_2,.., x_n$ are the unknowns. Find the smallest possible positive integer $n$. Justify your answer.

Prove that if $(x+\sqrt{x^2 +1}) (y+\sqrt{y^2 +1}) = 1$, then $x+y = 0$.

[b]p1.[/b] A triangle $ABC$ is drawn in the plane. A point $D$ is chosen inside the triangle. Show that the sum of distances $AD+BD+CD$ is less than the perimeter of the triangle. [b]p2.[/b] In a triangle $ABC$ the bisector of the angle $C$ intersects the side $AB$ at $M$, and the bisector of the angle $A$ intersects $CM$ at the point $T$. Suppose that the segments $CM$ and $AT$ divided the triangle $ABC$ into three isosceles triangles. Find the angles of the triangle $ABC$. [b]p3.[/b] You are given $100$ weights of masses $1, 2, 3,..., 99, 100$. Can one distribute them into $10$ piles having the following property: the heavier the pile, the fewer weights it contains? [b]p4.[/b] Each cell of a $10\times 10$ table contains a number. In each line the greatest number (or one of the largest, if more than one) is underscored, and in each column the smallest (or one of the smallest) is also underscored. It turned out that all of the underscored numbers are underscored exactly twice. Prove that all numbers stored in the table are equal to each other. [b]p5.[/b] Two stores have warehouses in which wheat is stored. There are $16$ more tons of wheat in the first warehouse than in the second. Every night exactly at midnight the owner of each store steals from his rival, taking a quarter of the wheat in his rival's warehouse and dragging it to his own. After $10$ days, the thieves are caught. Which warehouse has more wheat at this point and by how much? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Find all real numbers $x,y$ satisfying the following system of equations \begin{align*} x^4 +y^4 & =17(x+y)^2 \\ xy & =2(x+y). \end{align*}

Chandler the Octopus along with his friends Maisy the Bear and Jeff the Frog are solving LMT problems. It takes Maisy $3$ minutes to solve a problem, Chandler $4$ minutes to solve a problem and Jeff $5$ minutes to solve a problem. They start at $12:00$ pm, and Chandler has a dentist appointment from $12:10$ pm to $12:30$, after which he comes back and continues solving LMT problems. The time it will take for them to finish solving $50$ LMT problems, in hours, is $m/n$ ,where $m$ and $n$ are relatively prime positive integers. Find $m +n$. [b]Note:[/b] they may collaborate on problems. [i]Proposed by Aditya Rao[/i]

Prove that there exist infinitely many positive integers $d$ such that we can find a polynomial $P\in\mathbb{Z}[x]$ of degree $d$ and $N\in\mathbb{N}$ such that for all integers $x>N$ and any prime $p$, we have $$\nu_p(P(x)^3+3P(x)^2-3)<\frac{d\cdot\log(x)}{2024^{2024}}.$$ [i]Proposed by Marius Cerlat[/i]

For some natural numbers $a, b, c$ and $d$ the following equations holds: $$\frac{a}{c}= \frac{b}{d}= \frac{ab + 1}{cd + 1} .$$ Prove that $a = c$ and $b = d$.

Are there any real numbers $a,b,c$ such that $a+b+c=6$, $ab+bc+ca=9$ and $a^4+b^4+c^4=260$? What about if we let $a^4+b^4+c^4=210$? [i] (Andrei Bâra)[/i]