Let $p$ be a prime satisfying $p^2\mid 2^{p-1}-1$, and let $n$ be a positive integer. Define \[ f(x) = \frac{(x-1)^{p^n}-(x^{p^n}-1)}{p(x-1)}. \] Find the largest positive integer $N$ such that there exist polynomials $g(x)$, $h(x)$ with integer coefficients and an integer $r$ satisfying $f(x) = (x-r)^N g(x) + p \cdot h(x)$. [i]Proposed by Victor Wang[/i]

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)$? $\textbf{(A) }6\qquad\textbf{(B) }5-x\qquad\textbf{(C) }4-x+x^2\qquad$ $\textbf{(D) }3-x+x^2-x^3\qquad \textbf{(E) }2-x+x^2-x^3+x^4$

Prove that for every positive integer $n$, there exists a polynomial with integer coefficients whose values at points $1,2,\dots,n$ are pairwise different powers of $2$.

How many polynomials $P$ with integer coefficients and degree at most $5$ satisfy $0 \le P(x) < 120$ for all $x \in \{0,1,2,3,4,5\}$?

Suppose that a polynomial of the form $p(x)=x^{2010}\pm x^{2009}\pm \cdots \pm x \pm 1$ has no real roots. What is the maximum possible number of coefficients of $-1$ in $p$?

The roots of the equation $x^2 + (3a + b)x + a^2 + 2b^2 = 0$ are $x_1$ and $x_2$ with $x_1 \ne x_2$. Determine the values of $a$ and $b$ so that the roots of the equation $ x^2 - 2a(3a + 2b)x + 5a^2b^2 + 4b^4 = 0$ let $x^2_1$ and $x^2_2$.

Let $ a$, $ b$, $ c$, $ d$, $ e$, $ f$ be positive integers and let $ S = a+b+c+d+e+f$. Suppose that the number $ S$ divides $ abc+def$ and $ ab+bc+ca-de-ef-df$. Prove that $ S$ is composite.

$P(x)$ is a polynomial in $x$ with non-negative integer coefficients. If $P(1)=5$ and $P(P(1))=177$, what is the sum of all possible values of $P(10)$?

Given a positive integer $n$, suppose that $P(x,y)$ is a real polynomial such that \[P(x,y)=\frac{1}{1+x+y} \hspace{0.5cm} \text{for all $x,y\in\{0,1,2,\dots,n\}$} \] What is the minimum degree of $P$? [i]Proposed by Loke Zhi Kin[/i]

Welcome to the [b]USAYNO[/b], where each question has a yes/no answer. Choose any subset of the following six problems to answer. If you answer $n$ problems and get them [b]all[/b] correct, you will receive $\max(0, (n-1)(n-2))$ points. If any of them are wrong (or you leave them all blank), you will receive $0$ points. Your answer should be a six-character string containing 'Y' (for yes), 'N' (for no), or 'B' (for blank). For instance if you think 1, 2, and 6 are 'yes' and 3 and 4 are 'no', you should answer YYNNBY (and receive $12$ points if all five answers are correct, 0 points if any are wrong). (a) $a,b,c,d,A,B,C,$ and $D$ are positive real numbers such that $\frac{a}{b} > \frac{A}{B}$ and $\frac{c}{d} > \frac{C}{D}$. Is it necessarily true that $\frac{a+c}{b+d} > \frac{A+C}{B+D}$? (b) Do there exist irrational numbers $\alpha$ and $\beta$ such that the sequence $\lfloor\alpha\rfloor+\lfloor\beta\rfloor, \lfloor2\alpha\rfloor+\lfloor2\beta\rfloor, \lfloor3\alpha\rfloor+\lfloor3\beta\rfloor, \dots$ is arithmetic? (c) For any set of primes $\mathbb{P}$, let $S_\mathbb{P}$ denote the set of integers whose prime divisors all lie in $\mathbb{P}$. For instance $S_{\{2,3\}}=\{2^a3^b \; | \; a,b\ge 0\}=\{1,2,3,4,6,8,9,12,\dots\}$. Does there exist a finite set of primes $\mathbb{P}$ and integer polynomials $P$ and $Q$ such that $\gcd(P(x), Q(y))\in S_\mathbb{P}$ for all $x,y$? (d) A function $f$ is called [b]P-recursive[/b] if there exists a positive integer $m$ and real polynomials $p_0(n), p_1(n), \dots, p_m(n)$[color = red], not all zero,[/color] satisfying \[p_m(n)f(n+m)=p_{m-1}(n)f(n+m-1)+\dots+p_0(n)f(n)\] for all $n$. Does there exist a P-recursive function $f$ satisfying $\lim_{n\to\infty} \frac{f(n)}{n^{\sqrt{2}}}=1$? (e) Does there exist a [b]nonpolynomial[/b] function $f: \mathbb{Z}\to\mathbb{Z}$ such that $a-b$ divides $f(a)-f(b)$ for all integers $a\neq b$? (f) Do there exist periodic functions $f, g:\mathbb{R}\to\mathbb{R}$ such that $f(x)+g(x)=x$ for all $x$? [color = red]A clarification was issued for problem 33(d) during the test. I have included it above.[/color]

What is the maximal possible number of roots on the interval (0,1) for a polynomial of degree 2022 with integer coefficients and with the leading coefficient equal to 1?

It is known that a polynomial $P$ with integer coefficients has degree $2022$. What is the maximum $n$ such that there exist integers $a_1, a_2, \cdots a_n$ with $P(a_i)=i$ for all $1\le i\le n$? [Extra: What happens if $P \in \mathbb{Q}[X]$ and $a_i\in \mathbb{Q}$ instead?]

Find the smallest positive integer $j$ such that for every polynomial $p(x)$ with integer coefficients and for every integer $k,$ the integer \[p^{(j)}(k)=\left. \frac{d^j}{dx^j}p(x) \right|_{x=k}\] (the $j$-th derivative of $p(x)$ at $k$) is divisible by $2016.$

Find the smallest positive integer $n\neq 2004$ for which there exists a polynomial $f\in\mathbb{Z}[x]$ such that the equation $f(x)=2004$ has at least one, and the equation $f(x)=n$ has at least $2004$ different integer solutions.

Let $n$ be a fixed natural number. Find all $n$ tuples of natural pairwise distinct and coprime numbers like $a_1,a_2,\ldots,a_n$ such that for $1\leq i\leq n$ we have \[ a_1+a_2+\ldots+a_n|a_1^i+a_2^i+\ldots+a_n^i \]

Let $D$ be a closed disc in the complex plane. Prove that for all positive integers $n$, and for all complex numbers $z_1,z_2,\ldots,z_n\in D$ there exists a $z\in D$ such that $z^n = z_1\cdot z_2\cdots z_n$.