Given a polynomial with integer coefficents$$P(x)=x^n+a_{n-1}x^{n-1}+...+a_1x+a_0,n\ge 1$$satisfying these conditions: i) $|a_0|$ is not a perfect square. ii) $P(x)$ is irreducible in $\mathbb{Q}[x].$ Prove that: $P(x^2)$ is irreducible in $\mathbb{Q}[x].$

Let $a \ge 2$ be an integer. Find all polynomials $f$ with real coefficients such that $$A = \{a^{n^2} | n \ge 1, n \in Z\} \subset \{f(n) | n \ge 1, n \in Z\} = B.$$

Given a positive integer $n \ge 2$. Find all $n$-tuples of positive integers $(a_1,a_2,\ldots,a_n)$, such that $1<a_1 \le a_2 \le a_3 \le \cdots \le a_n$, $a_1$ is odd, and (1) $M=\frac{1}{2^n}(a_1-1)a_2 a_3 \cdots a_n$ is a positive integer; (2) One can pick $n$-tuples of integers $(k_{i,1},k_{i,2},\ldots,k_{i,n})$ for $i=1,2,\ldots,M$ such that for any $1 \le i_1 <i_2 \le M$, there exists $j \in \{1,2,\ldots,n\}$ such that $k_{i_1,j}-k_{i_2,j} \not\equiv 0, \pm 1 \pmod{a_j}$.

Let $f(x)=x^n + a_{n-1}x^{n-1} + ...+ a_0 $ be a polynomial of degree $ n\ge 1 $ with $ n$ (not necessarily distinct) integer roots. Assume that there exist distinct primes $p_0,p_1,..,p_{n-1}$ such that $a_i > 1$ is a power of $p_i$, for all $ i=0,1,..,n-1$. Find all possible values of $ n$.

We consider two sequences of real numbers $x_{1} \geq x_{2} \geq \ldots \geq x_{n}$ and $\ y_{1} \geq y_{2} \geq \ldots \geq y_{n}.$ Let $z_{1}, z_{2}, .\ldots, z_{n}$ be a permutation of the numbers $y_{1}, y_{2}, \ldots, y_{n}.$ Prove that $\sum \limits_{i=1}^{n} ( x_{i} -\ y_{i} )^{2} \leq \sum \limits_{i=1}^{n}$ $( x_{i} - z_{i})^{2}.$

The complex numbers $z$ and $w$ satisfy the system \begin{align*}z+\frac{20i}{w}&=5+i,\\w+\frac{12i}{z}&=-4+10i.\end{align*} Find the smallest possible value of $|zw|^2$.

[b]p1[/b]. Consider the following four statements referring to themselves: 1. At least one of these statements is true. 2. At least two of these statements are false. 3. At least three of these statements are true. 4. All four of these statements are false. Determine which statements are true and which are false. Justify your answer. [b]p2.[/b] Let $f(x) = a_{2017}x^{2017} + a_{2016}x^{2016} + ... + a_1x + a_0$ where the coefficients $a_0, a_1, ... , a_{2017}$ have not yet been determined. Alice and Bob play the following game: $\bullet$ Alice and Bob alternate choosing nonzero integer values for the coefficients, with Alice going first. (For example, Alice’s first move could be to set $a_{18}$ to $-3$.) $\bullet$ After all of the coefficients have been chosen: - If f(x) has an integer root then Alice wins. - If f(x) does not have an integer root then Bob wins. Determine which player has a winning strategy and what the strategy is. Make sure to justify your answer. [b]p3.[/b] Suppose that a circle can be inscribed in a polygon $P$ with $2017$ equal sides. Prove that $P$ is a regular polygon; that is, all angles of $P$ are also equal. [b]p4.[/b] A $3 \times 3 \times 3$ cube of cheese is sliced into twenty-seven $ 1 \times 1 \times 1$ blocks. A mouse starts anywhere on the outside and eats one of the $1\times 1\times 1$ cubes. He then moves to an adjacent cube (in any direction), eats that cube, and continues until he has eaten all $27$ cubes. (Two cubes are considered adjacent if they share a face.) Prove that no matter what strategy the mouse uses, he cannot eat the middle cube last. [Note: One should neglect gravity – intermediate configurations don’t collapse.] p5. Suppose that a constant $c > 0$ and an infinite sequence of real numbers $x_0, x_1, x_2, ...$ satisfy $x_{k+1} =\frac{x_k + 1}{1 - cx_k}$ for all $k \ge 0$. Prove that the sequence $x_0, x_1, x_2, ....$ contains infinitely many positive terms and also contains infinitely many negative terms. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

$ n>2$ is an integer such that $ n^2$ can be represented as a difference of cubes of 2 consecutive positive integers. Prove that $ n$ is a sum of 2 squares of positive integers, and that such $ n$ does exist.

For any two positive real numbers $x_0 > 0$, $x_1 > 0$, a sequence of real numbers is defined recursively by $$x_{n+1} =\frac{4 \max\{x_n, 4\}}{x_{n-1}}$$ for $n \ge 1$. Find $x_{2010}$.

Let $a \neq b a,b \in \mathbb{R}$ such that $(x^2+20ax+10b)(x^2+20bx+10a)=0$ has no roots for $x$. Prove that $20(b-a)$ is not an integer.

Does there exist a subset $M$ of positive integers such that for all positive rational numbers $r<1$ there exists exactly one finite subset of $M$ like $S$ such that sum of reciprocals of elements in $S$ equals $r$.

Let $a_1$, $a_2$, $b_1$, $b_2$, $c_1$ and $c_2$ be real numbers for which $a_1a_2 > 0$, $a_1c_1 \ge b^2_1$ and $a_2c_2 > b^2_2$. Prove that $$(a_1 + a_2)(c_1 + c_2) \ge (b_1 + b_2)^2$$

Does there exist an angle $ \alpha\in(0,\pi/2)$ such that $ \sin\alpha$, $ \cos\alpha$, $ \tan\alpha$ and $ \cot\alpha$, taken in some order, are consecutive terms of an arithmetic progression?

Prove that the polynomial $ x^3 + x + 1 $ is a factor of the polynomial $ P_n(x) = x^{n + 2} + (x+1)^{2n+1} $ for every integer $ n \geq 0 $.

Find the sum of all solutions of the equation $\frac{1}{x^2-1}+\frac{2}{x^2-2}+\frac{3}{x^2-3}+\frac{4}{x^2-4}=2010x-4$

A polynomial $P(x)$ with integer coefficients and a positive integer $a>1$, are such that for all integers $x$, there exists an integer $z$ such that $aP(x)=P(z)$. Find all such pairs of $(P(x),a)$.

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 $f$ be a function defined on $[0, 2022]$, such that $f(0) = f(2022) = 2022$, and $$|f(x) - f(y)| \le 2|x -y|,$$ for all $x, y$ in $[0, 2022]$. Prove that for each $x, y$ in $[0, 2022]$, the distance between $f(x)$ and $f(y)$ does not exceed $2022$.

Georg has a board displaying the numbers from $1$ to $50$. Georg may strike out a number if it can be formed by starting with the number $2$ and doing one or more calculations where he either multiplies by $10$ or subtracts $3$. Which of the board’s numbers may Georg strike out?[img]https://cdn.artofproblemsolving.com/attachments/c/e/1bea13b691d3591d782e698bedee3235f8512f.png[/img] Example: Georg may strike out $26$ because it may, for example, be formed by starting with $2$, multiplying by $10$, subtracting $3$ three times, multiplying by $10$ and subtracting $3$ twenty-eight times.

For any positive integer $n$, show that there exists a polynomial $P(x)$ of degree $n$ with integer coefficients such that $P(0),P(1), \ldots, P(n)$ are all distinct powers of $2$.

Prove the following theorem: If $n > 2$ is a natural number, $a_1, ..., a_n$ are positive real numbers and becomes $\sum_{i=1}^n a_i = s$, then the following holds $$\sum_{i=1}^n \frac{a_i}{s - a_i} \ge \frac{n}{n - 1}$$

Given the equation \[ x^4 \plus{} px^3 \plus{} qx^2 \plus{} rx \plus{} s \equal{} 0\] has four real, positive roots, prove that (a) $ pr \minus{} 16s \geq 0$ (b) $ q^2 \minus{} 36s \geq 0$ with equality in each case holding if and only if the four roots are equal.

Determine all functions $f : R \to R$ satisfying $f(f(x) + 2y)= 6x + f(f(y) -x)$ for all real numbers $x,y$

A polynomial $P(x)$ of degree $n$ has $n$ different real roots. What is the largest number of its coefficients that can be zero?

Find all $x$ and $y$ which are rational multiples of $\pi$ with $0<x<y<\frac{\pi}{2}$ and $\tan x+\tan y =2$.