Let $n\in\mathbb{N}^*$. Solve the equation $\sum_{k=0}^n C_n^k\cos2kx=\cos nx$ in $\mathbb{R}$.

Solve in the real numbers $x, y, z$ a system of the equations: \[ \begin{cases} x^2 - (y+z+yz)x + (y+z)yz = 0 \\ y^2 - (z + x + zx)y + (z+x)zx = 0 \\ z^2 - (x+y+xy)z + (x+y)xy = 0. \\ \end{cases} \]

Suppose $f$ is a nonconstant polynomial with integer coefficients with the following property: [list] [*]$f(0)$ and $f(1)$ are both odd. [*]Define a sequence of integers with $a_k = f(1)f(2) \cdots f(k)+1$ [/list] Prove that there are infinitely many prime numbers dividing at least one element of the sequence. [i]Proposed by Sayandeep Shee[/i]

If $a, b,c,p,q, r $are real numbers such that, for every real number $x,$ $$ax^2 - 2bx + c \ge 0 \ \ and \ \ px^2 + 2qx + r \ge 0;$$ prove that then $$apx^2 + bqx + cr \ge 0$$ for all real $x$.

Let a be a non-zero integer, and $n \ge 3$ another integer. Prove that the following polynomial is irreducible in the ring of integer polynomials (i.e. it cannot be written as a product of two non-constant integer polynomials): $$f(x) = x^n + ax^{n-1} + ax^{n-2} +... + ax -1$$

Let $\{x_n\}^\infty_{n=0}$ be the sequence such that $x_0=2$, $x_1=1$ and $x_{n+2}$ is the remainder of the number $x_{n+1}+x_n$ divided by $7$. Prove that $x_n$ is the remainder of the number $$4^n\sum_{k=0}^{\left\lfloor\frac n2\right\rfloor}2\binom n{2k}5^k$$

Evaluate $$\sum_{n=0}^{\infty} \sum_{k=0}^{\infty} \min (n, k) \left( \frac12 \right)^n\left( \frac13 \right)^k$$

Prove that for every natural number $n$, and for every real number $x \neq \frac{k\pi}{2^t}$ ($t=0,1, \dots, n$; $k$ any integer) \[ \frac{1}{\sin{2x}}+\frac{1}{\sin{4x}}+\dots+\frac{1}{\sin{2^nx}}=\cot{x}-\cot{2^nx} \]

[u]Round 1[/u] [b]1.1.[/b] A classroom has $29$ students. A teacher needs to split up the students into groups of at most $4$. What is the minimum number of groups needed? [b]1.2.[/b] On his history map quiz, Eric recalls that Sweden, Norway and Finland are adjacent countries, but he has forgotten which is which, so he labels them in random order. The probability that he labels all three countries correctly can be written as $\frac{m}{n}$, where $m$ and $n$ are relatively prime positive integers. Find $m + n$. [b]1.3.[/b] In a class of $40$ sixth graders, the class average for their final test comes out to be $90$ (out of a $100$). However, a student brings up an issue with problem $5$, and $10$ students receive credit for this question, bringing the class average to a $90.75$. How many points was problem $5$ worth? [u]Round 2[/u] [b]2.1.[/b] Compute $1 - 2 + 3 - 4 + ... - 2022 + 2023$. [b]2.2.[/b] In triangle $ABC$, $\angle ABC = 75^o$. Point $D$ lies on side $AC$ such that $BD = CD$ and $\angle BDC$ is a right angle. Compute the measure of $\angle A$. [b]2.3.[/b] Joe is rolling three four-sided dice each labeled with positive integers from $1$ to $4$. The probability the sum of the numbers on the top faces of the dice is $6$ can be written as $\frac{p}{q}$ where $p$ and $q$ are relatively prime integers. Find $p + q$. [u]Round 3[/u] [b]3.1.[/b] For positive integers $a, b, c, d$ that satisfy $a + b + c + d = 23$, what is the maximum value of $abcd$? [b]3.2.[/b] A buckball league has twenty teams. Each of the twenty teams plays exactly five games with each of the other teams. If each game takes 1 hour and thirty minutes, then how many total hours are spent playing games? [b]3.3.[/b] For a triangle $\vartriangle ABC$, let $M, N, O$ be the midpoints of $AB$, $BC$, $AC$, respectively. Let $P, Q, R$ be points on $AB$, $BC$, $AC$ such that $AP =\frac13 AB$, $BQ =\frac13 BC$, and $CR =\frac13 AC$. The ratio of the areas of $\vartriangle MNO$ and $\vartriangle P QR$ can be expressed as $\frac{m}{n}$ , where $ m$ and $n$ are relatively prime positive integers. Find $m + n$. [u]Round 4[/u] [b]4.1.[/b] $2023$ has the special property that leaves a remainder of $1$ when divided by $2$, $21$ when divided by $22$, and $22$ when divided by $23$. Let $n$ equal the lowest integer greater than $2023$ with the above properties. What is $n$? [b]4.2.[/b] Ants $A, B$ are on points $(0, 0)$ and $(3, 3)$ respectively, and ant A is trying to get to $(3, 3)$ while ant $B$ is trying to get to $(0, 0)$. Every second, ant $A$ will either move up or right one with equal probability, and ant $B$ will move down or left one with equal probability. The probability that the ants will meet each other be $\frac{a}{b}$, where $a$ and $b$ are relatively prime positive integers. Find $a + b$. [b]4.3.[/b] Find the number of trailing zeros of $100!$ in base $ 49$. PS. You should use hide for answers. Rounds 5-9 have been posted [url=https://artofproblemsolving.com/community/c3h3129723p28347714]here[/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $a$, $b$ and $c$ be rational numbers for which $a+bc$, $b+ac$ and $a+b$ are all non-zero and for which we have \[\frac{1}{a+bc}+\frac{1}{b+ac}=\frac{1}{a+b}.\] Prove that $\sqrt{(c-3)(c+1)}$ is rational.

Find all functions $f: \mathbb Q \to \mathbb Q$ such that $ f(x^{2}\plus{}y\plus{}f(xy)) \equal{} 3\plus{}(x\plus{}f(y)\minus{}2)f(x)$ for all $x,y \in \mathbb Q$.

Set $P$ as a polynomial function by $p_n(x)=\sum_{k=0}^{n-1} x^k$. a) Prove that for $m,n\in N$, when dividing $p_n(x)$ by $p_m(x)$, the remainder is $$p_i(x),\forall i=0,1,...,m-1.$$ b) Find all the positive integers $i,j,k$ that make $$p_i(x)+p_j(x^2)+p_k(x^4)=p_{100}(x).$$ [i](square1zoa)[/i]

Determine all real values of the parameter $a$ for which the equation \[16x^4 -ax^3 + (2a + 17)x^2 -ax + 16 = 0\] has exactly four distinct real roots that form a geometric progression.

Prove that \[\arctan \frac 12 +\arctan \frac 13 = \frac{\pi}{4}.\]

Let $f(x)$ and $g(x)$ be polynomials with non-negative integer coefficients, and let m be the largest coefficient of $f.$ Suppose that there exist natural numbers $a < b$ such that $f(a) = g(a)$ and $f(b) = g(b)$. Show that if $b > m,$ then $f = g.$

Evaluate $1 + 2 - 3 - 4 + 5 + 6 - 7 - 8 + ... + 2018 - 2019$.

(a) Prove or find a counter-example: For every two complex numbers $z,w$ the following inequality holds: $$|z|+|w|\le|z+w|+|z-w|.$$(b) Prove that for all $z_1,z_2,z_3,z_4\in\mathbb C$: $$\sum_{k=1}^4|z_k|\le\sum_{1\le i<j\le4}|z_i+z_j|.$$

Professor Piraldo takes part in soccer matches with a lot of goals and judges a match in his own peculiar way. A match with score of $m$ goals to $n$ goals, $m\geq n$, is [i]tough[/i] when $m\leq f(n)$, where $f(n)$ is defined by $f(0) = 0$ and, for $n \geq 1$, $f(n) = 2n-f(r)+r$, where $r$ is the largest integer such that $r < n$ and $f(r) \leq n$. Let $\phi ={1+\sqrt 5\over 2}$. Prove that a match with score of $m$ goals to $n$, $m\geq n$, is tough if $m\leq \phi n$ and is not tough if $m \geq \phi n+1$.

Find all polynomials $f$ with integer coefficient such that, for every prime $p$ and natural numbers $u$ and $v$ with the condition: \[ p \mid uv - 1 \] we always have $p \mid f(u)f(v) - 1$.

Let $n\geq 2$ be a given integer. Find all functions $f:\mathbb{R}\rightarrow \mathbb{R}$ such that \[f(x-f(y))=f(x+y^n)+f(f(y)+y^n), \qquad \forall x,y \in \mathbb R.\]

[b]p1.[/b] I open my $2010$-page dictionary, whose pages are numbered $ 1$ to $2010$ starting on page $ 1$ on the right side of the spine when opened, and ending with page $2010$ on the left. If I open to a random page, what is the probability that the two page numbers showing sum to a multiple of $6$? [b]p2.[/b] Let $A$ be the number of positive integer factors of $128$. Let $B$ be the sum of the distinct prime factors of $135$. Let $C$ be the units’ digit of $381$. Let $D$ be the number of zeroes at the end of $2^5\cdot 3^4 \cdot 5^3 \cdot 7^2\cdot 11^1$. Let $E$ be the largest prime factor of $999$. Compute $\sqrt[3]{\sqrt{A + B} +\sqrt[3]{D^C+E}}$. [b]p3. [/b] The root mean square of a set of real numbers is defined to be the square root of the average of the squares of the numbers in the set. Determine the root mean square of $17$ and $7$. [b]p4.[/b] A regular hexagon $ABCDEF$ has area $1$. The sides$ AB$, $CD$, and $EF$ are extended to form a larger polygon with $ABCDEF$ in the interior. Find the area of this larger polygon. [b]p5.[/b] For real numbers $x$, let $\lfloor x \rfloor$ denote the greatest integer less than or equal to $x$. For example, $\lfloor 3\rfloor = 3$ and $\lfloor 5.2 \rfloor = 5$. Evaluate $\lfloor -2.5 \rfloor + \lfloor \sqrt 2 \rfloor + \lfloor -\sqrt 2 \rfloor + \lfloor 2.5 \rfloor$. [b]p6.[/b] The mean of five positive integers is $7$, the median is $8$, and the unique mode is $9$. How many possible sets of integers could this describe? [b]p7.[/b] How many three digit numbers x are there such that $x + 1$ is divisible by $11$? [b]p8.[/b] Rectangle $ABCD$ is such that $AD = 10$ and $AB > 10$. Semicircles are drawn with diameters $AD$ and $BC$ such that the semicircles lie completely inside rectangle $ABCD$. If the area of the region inside $ABCD$ but outside both semicircles is $100$, determine the shortest possible distance between a point $X$ on semicircle $AD$ and $Y$ on semicircle $BC$. [b]p9.[/b] $ 8$ distinct points are in the plane such that five of them lie on a line $\ell$, and the other three points lie off the line, in a way such that if some three of the eight points lie on a line, they lie on $\ell$. How many triangles can be formed using some three of the $ 8$ points? [b]p10.[/b] Carl has $10$ Art of Problem Solving books, all exactly the same size, but only $9$ spaces in his bookshelf. At the beginning, there are $9$ books in his bookshelf, ordered in the following way. $A - B - C - D - E - F - G - H - I$ He is holding the tenth book, $J$, in his hand. He takes the books out one-by-one, replacing each with the book currently in his hand. For example, he could take out $A$, put $J$ in its place, then take out $D$, put $A$ in its place, etc. He never takes the same book out twice, and stops once he has taken out the tenth book, which is $G$. At the end, he is holding G in his hand, and his bookshelf looks like this. $C - I - H - J - F - B - E - D - A$ Give the order (start to finish) in which Carl took out the books, expressed as a $9$-letter string (word). PS. You had better use hide for answers.

Let $n$ be a positive integer and $a_1,a_2,\ldots a_{2n+1}$ be positive reals. For $k=1,2,\ldots ,2n+1$, denote $b_k = \max_{0\le m\le n}\left(\frac{1}{2m+1} \sum_{i=k-m}^{k+m} a_i \right)$, where indices are taken modulo $2n+1$. Prove that the number of indices $k$ satisfying $b_k\ge 1$ does not exceed $2\sum_{i=1}^{2n+1} a_i$.

Let $S(b)$ be the number of nonuples of positive integers $(a_1, a_2, \ldots , a_9)$ satisfying $3b-1=a_1+a_2+\ldots+a_9$ and $b^2+1=a_1^2+\ldots+a_9^2$. Prove that for all $\epsilon>0$, there exists $C_{\epsilon}>0$ such that $S(b)\leq C_{\epsilon}b^{3+\epsilon}$.

Prove that the following polynomial is irreducible in $ \mathbb Z[x,y]$: \[ x^{200}y^5\plus{}x^{51}y^{100}\plus{}x^{106}\minus{}4x^{100}y^5\plus{}x^{100}\minus{}2y^{100}\minus{}2x^6\plus{}4y^5\minus{}2\]

Given arbitrary complex numbers $w_1,w_2,\ldots,w_n$, show that there exists a positive integer $k\le 2n+1$ for which $\text{Re} (w_1^k+w_2^k+\cdots+w_n^k)\ge 0$.