Find the least positive integer \(M\) for which there exist a positive integer \(n\) and polynomials \(P_1(x)\), \(P_2(x)\), \(\ldots\), \(P_n(x)\) with integer coefficients satisfying \[Mx=P_1(x)^3+P_2(x)^3+\cdots+P_n(x)^3.\] [i]Proposed by Karthik Vedula[/i]

Determine all three-digit numbers $N$ having the property that $N$ is divisible by 11, and $\dfrac{N}{11}$ is equal to the sum of the squares of the digits of $N$.

Let $S = 1 + \frac{1}{\sqrt2}+ \frac{1}{\sqrt3}+\frac{1}{\sqrt4}+...+ \frac{1}{\sqrt{99}}+ \frac{1}{\sqrt{100}}$ . Find $[S]$. You may use the fact that $\sqrt{n} < \frac12 (\sqrt{n} +\sqrt{n+1}) <\sqrt{n+1}$ for all integers $n \ge 1$.

Let $a\in(0,1)$ ,$f(x)=ax^3+(1-4a)x^2+(5a-1)x-5a+3 $ , $g(x)=(1-a)x^3-x^2+(2-a)x-3a-1 $. Prove that:For any real number $x$ ,at least one of $|f(x)|$ and $|g(x)|$ not less than $a+1$.

Find all functions $f : R_{>0} \to R$ such that $f \left(\frac{x}{y}\right) = f(x) + f(y) - f(x)f(y)$ for all $x, y \in R_{>0}$. Here, $R_{>0}$ denotes the set of all positive real numbers. Nguyễn Duy Thái Sơn

Find all $4$-tuple of real numbers $(x, y, z, w)$ that satisfy the following system of equations: $$x^2 + y^2 + z^2 + w^2 = 4$$ $$\frac{1}{x^2} +\frac{1}{y^2} +\frac{1}{z^2 }+\frac{1}{w^2} = 5 -\frac{1}{(xyzw)^2}$$

Determine all positive integers $a,b,c$ satisfying $a^{(b^c)}=(b^a)^c$

[hide=D stands for Descartes, L stands for Leibniz]they had two problem sets under those two names[/hide] [b]D1.[/b] What is the solution to the equation $3 \cdot x \cdot 5 = 4 \cdot 5 \cdot 6$? [b]D2.[/b] Mr. Rose is making Platonic solids! If there are five different types of Platonic solids, and each Platonic solid can be one of three colors, how many different colored Platonic solids can Mr. Rose make? [b]D3.[/b] What fraction of the multiples of $5$ between $1$ and $100$ inclusive are also multiples of $20$? [b]D4.[/b] What is the maximum number of times a circle can intersect a triangle? [b]D5 / L1.[/b] At an interesting supermarket, the nth apple you purchase costs $n$ dollars, while pears are $3$ dollars each. Given that Layla has exactly enough money to purchase either $k$ apples or $2k$ pears for $k > 0$, how much money does Layla have? [b]D6 / L3.[/b] For how many positive integers $1 \le n \le 10$ does there exist a prime $p$ such that the sum of the digits of $p$ is $n$? [b]D7 / L2.[/b] Real numbers $a, b, c$ are selected uniformly and independently at random between $0$ and $1$. What is the probability that $a \ge b \le c$? [b]D8.[/b] How many ordered pairs of positive integers $(x, y)$ satisfy $lcm(x, y) = 500$? [b]D9 / L4.[/b] There are $50$ dogs in the local animal shelter. Each dog is enemies with at least $2$ other dogs. Steven wants to adopt as many dogs as possible, but he doesn’t want to adopt any pair of enemies, since they will cause a ruckus. Considering all possible enemy networks among the dogs, find the maximum number of dogs that Steven can possibly adopt. [b]D10 / L7.[/b] Unit circles $a, b, c$ satisfy $d(a, b) = 1$, $d(b, c) = 2$, and $d(c, a) = 3,$ where $d(x, y)$ is defined to be the minimum distance between any two points on circles $x$ and $y$. Find the radius of the smallest circle entirely containing $a$, $b$, and $c$. [b]D11 / L8.[/b] The numbers $1$ through $5$ are written on a chalkboard. Every second, Sara erases two numbers $a$ and $b$ such that $a \ge b$ and writes $\sqrt{a^2 - b^2}$ on the board. Let M and m be the maximum and minimum possible values on the board when there is only one number left, respectively. Find the ordered pair $(M, m)$. [b]D12 / L9.[/b] $N$ people stand in a line. Bella says, “There exists an assignment of nonnegative numbers to the $N$ people so that the sum of all the numbers is $1$ and the sum of any three consecutive people’s numbers does not exceed $1/2019$.” If Bella is right, find the minimum value of $N$ possible. [b]D13 / L10.[/b] In triangle $\vartriangle ABC$, $D$ is on $AC$ such that $BD$ is an altitude, and $E$ is on $AB$ such that $CE$ is an altitude. Let F be the intersection of $BD$ and $CE$. If $EF = 2FC$, $BF = 8DF$, and $DC = 3$, then find the area of $\vartriangle CDF$. [b]D14 / L11.[/b] Consider nonnegative real numbers $a_1, ..., a_6$ such that $a_1 +... + a_6 = 20$. Find the minimum possible value of $$\sqrt{a^2_1 + 1^2} +\sqrt{a^2_2 + 2^2} +\sqrt{a^2_3 + 3^2} +\sqrt{a^2_4 + 4^2} +\sqrt{a^2_5 + 5^2} +\sqrt{a^2_6 + 6^2}.$$ [b]D15 / L13.[/b] Find an $a < 1000000$ so that both $a$ and $101a$ are triangular numbers. (A triangular number is a number that can be written as $1 + 2 +... + n$ for some $n \ge 1$.) Note: There are multiple possible answers to this problem. You only need to find one. [b]L6.[/b] How many ordered pairs of positive integers $(x, y)$, where $x$ is a perfect square and $y$ is a perfect cube, satisfy $lcm(x, y) = 81000000$? [b]L12.[/b] Given two points $A$ and $B$ in the plane with $AB = 1$, define $f(C)$ to be the incenter of triangle $ABC$, if it exists. Find the area of the region of points $f(f(X))$ where $X$ is arbitrary. [b]L14.[/b] Leptina and Zandar play a game. At the four corners of a square, the numbers $1, 2, 3$, and $4$ are written in clockwise order. On Leptina’s turn, she must swap a pair of adjacent numbers. On Zandar’s turn, he must choose two adjacent numbers $a$ and $b$ with $a \ge b$ and replace $a$ with $ a - b$. Zandar wants to reduce the sum of the numbers at the four corners of the square to $2$ in as few turns as possible, and Leptina wants to delay this as long as possible. If Leptina goes first and both players play optimally, find the minimum number of turns Zandar can take after which Zandar is guaranteed to have reduced the sum of the numbers to $2$. [b]L15.[/b] There exist polynomials $P, Q$ and real numbers $c_0, c_1, c_2, ... , c_{10}$ so that the three polynomials $P, Q$, and $$c_0P^{10} + c_1P^9Q + c_2P^8Q^2 + ... + c_{10}Q^{10}$$ are all polynomials of degree 2019. Suppose that $c_0 = 1$, $c_1 = -7$, $c_2 = 22$. Find all possible values of $c_{10}$. Note: The answer(s) are rational numbers. It suffices to give the prime factorization(s) of the numerator(s) and denominator(s). PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

For any permutation $p$ of the set $\{1,2,...,n\}$, let us denote $d(p) = |p(1)-1|+|p(2)-2|+...+|p(n)-n|$. Let $i(p)$ be the number of inversions of $p$, i.e. the number of pairs $1 \le i < j \le n$ with $p(i) > p(j)$. Prove that $d(p)\le 2i(p)$$.

Starting with the sequence $F_1 = (1,2,3,4, \ldots)$ of the natural numbers further sequences are generated as follows: $F_{n+1}$ is created from $F_n$ by the following rule: the order of elements remains unchanged, the elements from $F_n$ which are divisible by $n$ are increased by 1 and the other elements from $F_n$ remain unchanged. Example: $F_2 = (2,3,4,5 \ldots)$ and $F_3 = (3,3,5,5, \ldots)$. Determine all natural numbers $n$ such that exactly the first $n-1$ elements of $F_n$ take the value $n.$

The positive integers $p$, $q$ are such that for each real number $x$ $(x+1)^p (x-3)^q=x^n+a_1 x^{n-1}+a_2 x^{n-2}+\dots +a_{n-1} x+a_n$ where $n=p+q$ and $a_1,\dots ,a_n$ are real numbers. Prove that there exists infinitely many pairs $(p,q)$ for which $a_1=a_2$.

Determine the smallest integer $n$ for which there exist integers $x_1,\ldots,x_n$ and positive integers $a_1,\ldots,a_n$ so that \begin{align*} x_1+\cdots+x_n &=0,\\ a_1x_1+\cdots+a_nx_n&>0, \text{ and }\\ a_1^2x_1+\cdots+a_n^2x_n &<0. \end{align*}

Determine all real numbers $ a$ such that there is a function $ f: \mathbb{R} \rightarrow \mathbb{R}$ satisfying \[ x\plus{}f(y)\equal{}af(y\plus{}f(x))\] for all real numbers $ x$ and $ y$. [i]Hery Susanto, Malang[/i]

Let $a > 0$. If the system $$\begin{cases} a^x + a^y + a^z = 14 - a \\ x + y + z = 1 \end{cases}$$ has a solution in real numbers, prove that $a \le 8$.

Find all polynomials $P(x)$ and $Q(x)$ with real coefficients such that $$P(Q(x))=P(x)^{2017}$$ for all real numbers $x$.

Given are 10 quadric equations $x^2+a_1x+b_1=0$, $x^2+a_2x+b_2=0$,..., $x^2+a_{10}x+b_{10}=0$. It is known that each of these equations has two distinct real roots and the set of all solutions is ${1,2,...10,-1,-2...,-10}$. Find the minimum value of $b_1+b_2+...+b_{10}$

Find all functions $f :R \to R$ such that for all real numbers $x$ and $y$ $$f(x^3+y^3)=f(x^3)+3x^3f(x)f(y)+3f(x)(f(y))^2+y^6f(y)$$

Find how many different solutions depending on $a$ has the system of equations : $$\begin{cases} x+z=2a \\ y+u+xz=a-3 \\ yz+xu=2a \\ yu=1 \end{cases}$$

Let $ f(x)$and $ g(y)$ be two monic polynomials of degree=$ n$ having complex coefficients. We know that there exist complex numbers $ a_i,b_i,c_i \forall 1\le i \le n$, such that $ f(x)\minus{}g(y)\equal{}\prod_{i\equal{}1}^n{(a_ix\plus{}b_iy\plus{}c_i)}$. Prove that there exists $ a,b,c\in\mathbb{C}$ such that $ f(x)\equal{}(x\plus{}a)^n\plus{}c\text{ and }g(y)\equal{}(y\plus{}b)^n\plus{}c$.

Among all sets of real numbers $\{ x_1 , x_2 , ... , x_{20} \}$ from the open interval $(0, 1 )$ such that $$x_1x_2...x_{20}= ( 1 - x_1 ) ( 1 -x_2 ) ... (1 - x_{20} )$$ find the one for which $x_1 x_2... x_{20}$ is maximal. (A Cherniatiev)

The positive integers are grouped as follows: $1, 2+3, 4+5+6, 7+8+9+10,\dots$. Find the value of the $n$-th sum.

On the graphic of the function $y=x^2$ were selected $1000$ pairwise distinct points, abscissas of which are integer numbers from the segment $[0; 100000]$. Prove that it is possible to choose six different selected points $A$, $B$, $C$, $A'$, $B'$, $C'$ such that areas of triangles $ABC$ and $A'B'C'$ are equals. [i]A. Tereshin[/i]

Let $A$ be an infinite set of real numbers containing at least one irrational number. Prove that for every natural number $n > 1$ there exists a subset $S$ of $A$ with n elements such that the sum of the elements of $S$ is an irrational number.

Let $I$ be an open interval of length $\frac{1}{n}$, where $n$ is a positive integer. Find the maximum possible number of rational numbers of the form $\frac{a}{b}$ where $1 \le b \le n$ that lie in $I$.

Find all $g:\mathbb{R}\to\mathbb{R}$ so that there exists a unique $f:\mathbb{R}\to\mathbb{R}$ satisfying $f(0)=g(0)$ and \[f(x+g(y))+f(-x-g(-y))=g(x+f(y))+g(-x-f(-y))\] for all $x,y\in\mathbb{R}$. [i] Proposed by usjl[/i]