For each non-constant integer polynomial $P(x)$, let’s define $$M_{P(x)} = \underset{x\in [0,2021]}{\max} |P(x)|.$$ 1. Find the minimum value of $M_{P(x)}$ when deg $P(x) = 1$. 2. Suppose that $P(x) \in Z[x]$ when deg $P(x) = n$ and $2 \le n \le 2022$. Prove that $M_{P(x)} \ge 1011$.

Find all pairs of integers $a,b$ for which there exists a polynomial $P(x) \in \mathbb{Z}[X]$ such that product $(x^2+ax+b)\cdot P(x)$ is a polynomial of a form \[ x^n+c_{n-1}x^{n-1}+\cdots+c_1x+c_0 \] where each of $c_0,c_1,\ldots,c_{n-1}$ is equal to $1$ or $-1$.

p1. Is there any natural number n such that $n^2 + 5n + 1$ is divisible by $49$ ? Explain. p2. It is known that the parabola $y = ax^2 + bx + c$ passes through the points $(-3,4)$ and $(3,16)$, and does not cut the $x$-axis. Find all possible abscissa values ​​for the vertex point of the parabola. p3. It is known that $T.ABC$ is a regular triangular pyramid with side lengths of $2$ cm. The points $P, Q, R$, and $S$ are the centroids of triangles $ABC$, $TAB$, $TBC$ and $TCA$, respectively . Determine the volume of the triangular pyramid $P.QRS$ . p4. At an event invited $13$ special guests consisting of $ 8$ people men and $5$ women. Especially for all those special guests provided $13$ seats in a special row. If it is not expected two women sitting next to each other, determine the number of sitting positions possible for all those special guests. p5. A table of size $n$ rows and $n$ columns will be filled with numbers $ 1$ or $-1$ so that the product of all the numbers in each row and the product of all the numbers in each column is $-1$. How many different ways to fill the table?

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

Let $a,b,c$ be real numbers such that $$a^2-bc=b^2-ca=c^2-ab=2$$. Find the value of $$ab+bc+ca$$ and find at least one triplet $(a,b,c)$ that satisfy those conditions.

Let $ P $ be a point in the interior of a triangle $ ABC $, and let $ D, E, F $ be the point of intersection of the line $ AP $ and the side $ BC $ of the triangle, of the line $ BP $ and the side $ CA $, and of the line $ CP $ and the side $ AB $, respectively. Prove that the area of the triangle $ ABC $ must be $ 6 $ if the area of each of the triangles $ PFA, PDB $ and $ PEC $ is $ 1 $.

Two linear functions $f(x)$ and $g(x)$ satisfy the properties that for all $x$, $\bullet$ $f(x) + g(x) = 2$ $\bullet$ $f(f(x)) = g(g(x))$ and $f(0) = 2022$. Compute $f(1)$.

Consider $x_1 > 0, y_1 > 0, x_2 < 0, y_2 > 0, x_3 < 0, y_3 < 0, x_4 > 0, y_4 < 0.$ Suppose that for each $i = 1, ... ,4$ we have $ (x_i -a)^2 +(y_i -b)^2 \le c^2$. Prove that $a^2 + b^2 < c^2$. Restate this fact in the form of geometric result in plane geometry.

Find the least possible cardinality of a set $A$ of natural numbers, the smallest and greatest of which are $1$ and $100$, and having the property that every element of $A$ except for $1$ equals the sum of two elements of $A$.

Let be some rational numbers with the property that their sum, as well as the product of any two of them is integer. Prove that all these are integers.

Find all polynomials $P(x)$ with real coefficients such that \[P(a)\in\mathbb{Z}\ \ \ \text{implies that}\ \ \ a\in\mathbb{Z}.\]

[b]i.)[/b] Let $g(x) = x^5 + x^4 + x^3 + x^2 + x + 1.$ What is the remainder when the polynomial $g(x^{12}$ is divided by the polynomial $g(x)$? [b]ii.)[/b] If $k$ is a positive number and $f$ is a function such that, for every positive number $x, f(x^2 + 1 )^{\sqrt{x}} = k.$ Find the value of \[ f( \frac{9 +y^2}{y^2})^{\sqrt{ \frac{12}{y} }} \] for every positive number $y.$ [b]iii.)[/b] The function $f$ satisfies the functional equation $f(x) + f(y) = f(x+y) - x \cdot y - 1$ for every pair $x,y$ of real numbers. If $f(1) = 1,$ then find the numbers of integers $n,$ for which $f(n) = n.$

Let $a_1,a_2,\dots,a_m$ be a finite sequence of positive integers. Prove that there exist nonnegative integers $b,c,$ and $N$ such that $$\left\lfloor \sum_{i=1}^m \sqrt{n+a_i} \right\rfloor =\left\lfloor \sqrt{bn+c} \right\rfloor$$ holds for all integers $n>N.$ [i]Proposed by Carl Schildkraut[/i]

The sequence $(a_n)_{n>=1}$ satisfies that : $a_1=a_2=1$ $a_n=7a_{n-1}-a_{n-2}$ ($n>=3$) , prove that : for all positive integer n , number $a_n+2+a_{n+1}$ is a perfect square .

Suppose that $a,b,c,d$ are positive real numbers satisfying $(a+c)(b+d)=ac+bd$. Find the smallest possible value of $$\frac{a}{b}+\frac{b}{c}+\frac{c}{d}+\frac{d}{a}.$$ [i]Israel[/i]

Let $a, b$ and $c$ be positive real numbers for which $a + b + c = 1$. Prove that $$\frac{a^2}{b^3 + c^4 + 1}+\frac{b^2}{c^3 + a^4 + 1}+\frac{c^2}{a^3 + b^4 + 1} > \frac{1}{5}$$

Determine whether there exists an arithimethical progression consisting of 40 terms and each of whose terms can be written in the form $ 2^m \plus{} 3^n$ or not. where $ m,n$ are nonnegative integers.

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$.

For every natural number $n$ we define the derived number $n'$ as follows: $\bullet$ $0' = 1' = 0$ $\bullet$ if $n$ is prime, then $n' = 1$ $\bullet$ if $n = a \cdot b$, then $n' = a' b + a b'$ . For example: $15' = 3' 5 + 3 5' = 1\cdot 5 + 3\cdot 1 = 8$. Determine all natural numbers $n$ for which $n = n'$.

[b]p9.[/b] The frozen yogurt machine outputs yogurt at a rate of $5$ froyo$^3$/second. If the bowl is described by $z = x^2+y^2$ and has height $5$ froyos, how long does it take to fill the bowl with frozen yogurt? [b]p10.[/b] Prankster Pete and Good Neighbor George visit a street of $2021$ houses (each with individual mailboxes) on alternate nights, such that Prankster Pete visits on night $1$ and Good Neighbor George visits on night $2$, and so on. On each night $n$ that Prankster Pete visits, he drops a packet of glitter in the mailbox of every $n^{th}$ house. On each night $m$ that Good Neighbor George visits, he checks the mailbox of every $m^{th}$ house, and if there is a packet of glitter there, he takes it home and uses it to complete his art project. After the $2021^{th}$ night, Prankster Pete becomes enraged that none of the houses have yet checked their mail. He then picks three mailboxes at random and takes out a single packet of glitter to dump on George’s head, but notices that all of the mailboxes he visited had an odd number of glitter packets before he took one. In how many ways could he have picked these three glitter packets? Assume that each of these three was from a different house, and that he can only visit houses in increasing numerical order. [b]p11. [/b]The taxi-cab length of a line segment with endpoints $(x_1, y_1)$ and $(x_2, y_2)$ is $|x_1 - x_2| + |y_1- y_2|$. Given a series of straight line segments connected head-to-tail, the taxi-cab length of this path is the sum of the taxi-cab lengths of its line segments. A goat is on a rope of taxi-cab length $\frac72$ tied to the origin, and it can’t enter the house, which is the three unit squares enclosed by $(-2, 0)$,$(0, 0)$,$(0, -2)$,$(-1, -2)$,$(-1, -1)$,$(-2, -1)$. What is the area of the region the goat can reach? (Note: the rope can’t ”curve smoothly”-it must bend into several straight line segments.) [b]p12.[/b] Parabola $P$, $y = ax^2 + c$ has $a > 0$ and $c < 0$. Circle $C$, which is centered at the origin and lies tangent to $P$ at $P$’s vertex, intersects $P$ at only the vertex. What is the maximum value of a, possibly in terms of $c$? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Given the following real numbers $a. b, c $ greater than one that $a + b + c = 6$. Prove the inequality $$\frac{a}{b^2-1}+\frac{b}{c^2-1}+\frac{c}{a^2-1}\ge 2$$

The Den has two deals on chicken wings. The first deal is $4$ chicken wings for $3$ dollars, and the second deal is $11$ chicken wings for $ 8$ dollars. If Jeremy has $18$ dollars, what is the largest number of chicken wings he can buy?

Does there exist two infinite positive integer sets $S,T$, such that any positive integer $n$ can be uniquely expressed in the form $$n=s_1t_1+s_2t_2+\ldots+s_kt_k$$ ,where $k$ is a positive integer dependent on $n$, $s_1<\ldots<s_k$ are elements of $S$, $t_1,\ldots, t_k$ are elements of $T$?

We will say that a list of positive integers is [i]admissible [/i] if all its numbers are less than or equal to $100$ and their sum is greater than $1810$. Find the smallest positive integer $d$ such that each admissible list can be crossed out some numbers such that the sum of the numbers left uncrossed out is greater than or equal to $1810-d$ and less than or equal to $1810+d$ .

[u]Round 1[/u] [b]1.1.[/b] Suppose a certain menu has $3$ sandwiches and $5$ drinks. How many ways are there to pick a meal so that you have exactly a drink and a sandwich? [b]1.2.[/b] If $a + b = 4$ and $a + 3b = 222222$, find $10a + b$. [b]1.3.[/b] Compute $$\left\lfloor \frac{2019 \cdot 2017}{2018} \right\rfloor $$ where $\lfloor x \rfloor$ is the greatest integer less than or equal to $x$. [u]Round 2[/u] [b]2.1.[/b] Andrew has $10$ water bottles, each of which can hold at most $10$ cups of water. Three bottles are thirty percent filled, five are twenty-four percent filled, and the rest are empty. What is the average amount of water, in cups, contained in the ten water bottles? [b]2.2.[/b] How many positive integers divide $195$ evenly? [b]2.3.[/b] Square $A$ has side length $\ell$ and area $128$. Square $B$ has side length $\ell/2$. Find the length of the diagonal of Square $B$. [u]Round 3[/u] [b]3.1.[/b] A right triangle with area $96$ is inscribed in a circle. If all the side lengths are positive integers, what is the area of the circle? Express your answer in terms of $\pi$. [b]3.2.[/b] A circular spinner has four regions labeled $3, 5, 6, 10$. The region labeled $3$ is $1/3$ of the spinner, $5$ is $1/6$ of the spinner, $6$ is $1/10$ of the spinner, and the region labeled $10$ is $2/5$ of the spinner. If the spinner is spun once randomly, what is the expected value of the number on which it lands? [b]3.3.[/b] Find the integer k such that $k^3 = 8353070389$ [u]Round 4[/u] [b]4.1.[/b] How many ways are there to arrange the letters in the word [b]zugzwang [/b] such that the two z’s are not consecutive? [b]4.2.[/b] If $O$ is the circumcenter of $\vartriangle ABC$, $AD$ is the altitude from $A$ to $BC$, $\angle CAB = 66^o$ and $\angle ABC = 44^o$, then what is the measure of $\angle OAD$ ? [b]4.3.[/b] If $x > 0$ satisfies $x^3 +\frac{1}{x^3} = 18$, find $x^5 +\frac{1}{x^5}$ [u]Round 5[/u] [b]5.1.[/b] Let $C$ be the answer to Question $3$. Neethen decides to run for school president! To be entered onto the ballot, however, Neethen needs $C + 1$ signatures. Since no one else will support him, Neethen gets the remaining $C$ other signatures through bribery. The situation can be modeled by $k \cdot N = 495$, where $k$ is the number of dollars he gives each person, and $N$ is the number of signatures he will get. How many dollars does Neethen have to bribe each person with to get exactly C signatures? [b]5.2.[/b] Let $A$ be the answer to Question $1$. With $3A - 1$ total votes, Neethen still comes short in the election, losing to Serena by just $1$ vote. Darn! Neethen sneaks into the ballot room, knowing that if he destroys just two ballots that voted for Serena, he will win the election. How many ways can Neethen choose two ballots to destroy? [b]5.3.[/b] Let $B$ be the answer to Question $2$. Oh no! Neethen is caught rigging the election by the principal! For his punishment, Neethen needs to run the perimeter of his school three times. The school is modeled by a square of side length $k$ furlongs, where $k$ is an integer. If Neethen runs $B$ feet in total, what is $k + 1$? (Note: one furlong is $1/8$ of a mile). [u]Round 6[/u] [b]6.1.[/b] Find the unique real positive solution to the equation $x =\sqrt{6 + 2\sqrt6 + 2x}- \sqrt{6 - 2\sqrt6 - 2x} -\sqrt6$. [b]6.2.[/b] Consider triangle ABC with $AB = 13$ and $AC = 14$. Point $D$ lies on $BC$, and the lengths of the perpendiculars from $D$ to $AB$ and $AC$ are both $\frac{56}{9}$. Find the largest possible length of $BD$. [b]6.3.[/b] Let $f(x, y) = \frac{m}{n}$, where $m$ is the smallest positive integer such that $x$ and $y$ divide $m$, and $n$ is the largest positive integer such that $n$ divides both $x$ and $y$. If $S = \{1, 2, 3, 4, 5, 6, 7, 8, 9, 10\}$, what is the median of the distinct values that $f(a, b)$ can take, where $a, b \in S$? [u]Round 7[/u] [b]7.1.[/b] The polynomial $y = x^4 - 22x^2 - 48x - 23$ can be written in the form $$y = (x - \sqrt{a} - \sqrt{b} - \sqrt{c})(x - \sqrt{a} +\sqrt{b} +\sqrt{c})(x +\sqrt{a} -\sqrt{b} +\sqrt{c})(x +\sqrt{a} +\sqrt{b} -\sqrt{c})$$ for positive integers $a, b, c$ with $a \le b \le c$. Find $(a + b)\cdot c$. [b]7.2.[/b] Varun is grounded for getting an $F$ in every class. However, because his parents don’t like him, rather than making him stay at home they toss him onto a number line at the number $3$. A wall is placed at $0$ and a door to freedom is placed at $10$. To escape the number line, Varun must reach 10, at which point he walks through the door to freedom. Every $5$ minutes a bell rings, and Varun may walk to a different number, and he may not walk to a different number except when the bell rings. Being an $F$ student, rather than walking straight to the door to freedom, whenever the bell rings Varun just randomly chooses an adjacent integer with equal chance and walks towards it. Whenever he is at $0$ he walks to $ 1$ with a $100$ percent chance. What is the expected number of times Varun will visit $0$ before he escapes through the door to freedom? [b]7.3.[/b] Let $\{a_1, a_2, a_3, a_4, a_5, a_6\}$ be a set of positive integers such that every element divides $36$ under the condition that $a_1 < a_2 <... < a_6$. Find the probability that one of these chosen sets also satisfies the condition that every $a_i| a_j$ if $i|j$. [u]Round 8[/u] [b]8.[/b] How many numbers between $1$ and $100, 000$ can be expressed as the product of at most $3$ distinct primes? Your answer will be scored according to the following formula, where $X$ is the correct answer and $I$ is your input. $$max \left\{ 0, \left\lceil min \left\{13 - \frac{|I-X|}{0.1 |I|}, 13 - \frac{|I-X|}{0.1 |I-2X|} \right\} \right\rceil \right\}$$ PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].