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

Determine all positive integers $n$ for which there exists an integer $m$ such that $2^{n}-1$ divides $m^{2}+9$.

(1) Let $x>0,\ y$ be real numbers. For variable $t$, find the difference of Maximum and minimum value of the quadratic function $f(t)=xt^2+yt$ in $0\leq t\leq 1$. (2) Let $S$ be the domain of the points $(x,\ y)$ in the coordinate plane forming the following condition: For $x>0$ and all real numbers $t$ with $0\leq t\leq 1$ , there exists real number $z$ for which $0\leq xt^2+yt+z\leq 1$ . Sketch the outline of $S$. (3) Let $V$ be the domain of the points $(x,\ y,\ z) $ in the coordinate space forming the following condition: For $0\leq x\leq 1$ and for all real numbers $t$ with $0\leq t\leq 1$, $0\leq xt^2+yt+z\leq 1$ holds. Find the volume of $V$. [i]2011 Tokyo University entrance exam/Science, Problem 6[/i]

Let $g(n)$ be defined as follows: \[ g(1) = 0, g(2) = 1 \] and \[ g(n+2) = g(n) + g(n+1) + 1, n \geq 1. \] Prove that if $n > 5$ is a prime, then $n$ divides $g(n) \cdot (g(n) + 1).$

What quadratic polynomial whose coefficient of $x^2$ is $1$ has roots which are the complex conjugates of the solutions of $x^2 -6x+ 11 = 2xi-10i$? (Note that the complex conjugate of $a+bi$ is $a-bi$, where a and b are real numbers.)

Let $P(n)$ be a polynomial of degree $m$ with integer coefficients, where $m \le 10$. Suppose that $P(0)=0$, $P(n)$ has $m$ distinct integer roots, and $P(n)+1$ can be factored as the product of two nonconstant polynomials with integer coefficients. Find the sum of all possible values of $P(2)$. [i]Proposed by Evan Chen[/i]

Determine all real numbers $ a$ such that the inequality $ |x^2 \plus{} 2ax \plus{} 3a|\le2$ has exactly one solution in $ x$.

Let $a$ be a real number. Find the minimum value of $\int_0^1 |ax-x^3|dx$. How many solutions (including University Mathematics )are there for the problem? Any advice would be appreciated.

A coin is altered so that the probability that it lands on heads is less than $ \frac {1}{2}$ and when the coin is flipped four times, the probability of an equal number of heads and tails is $ \frac {1}{6}$. What is the probability that the coin lands on heads? $ \textbf{(A)}\ \frac {\sqrt {15} \minus{} 3}{6}\qquad \textbf{(B)}\ \frac {6 \minus{} \sqrt {6\sqrt {6} \plus{} 2}}{12}\qquad \textbf{(C)}\ \frac {\sqrt {2} \minus{} 1}{2}\qquad \textbf{(D)}\ \frac {3 \minus{} \sqrt {3}}{6}\qquad \textbf{(E)}\ \frac {\sqrt {3} \minus{} 1}{2}$

A sequence of natural numbers is constructed by listing the first $4$, then skipping one, listing the next $5$, skipping $2$, listing $6$, skipping $3$, and, on the $n$th iteration, listing $n+3$ and skipping $n$. The sequence begins $1,2,3,4,6,7,8,9,10,13$. What is the $500,000$th number in the sequence? $ \textbf{(A)}\ 996,506\qquad\textbf{(B)}\ 996507\qquad\textbf{(C)}\ 996508\qquad\textbf{(D)}\ 996509\qquad\textbf{(E)}\ 996510 $

Let $k$ be a fixed integer greater than 1, and let ${m=4k^2-5}$. Show that there exist positive integers $a$ and $b$ such that the sequence $(x_n)$ defined by \[x_0=a,\quad x_1=b,\quad x_{n+2}=x_{n+1}+x_n\quad\text{for}\quad n=0,1,2,\dots,\] has all of its terms relatively prime to $m$. [i]Proposed by Jaroslaw Wroblewski, Poland[/i]

Prove that the equation $ x^{5} \plus{} 31 \equal{} y^{2}$ has no integer solution.

Let $f(x)=t\sin x+(1-t)\cos x\ (0\leqq t\leqq 1)$. Find the maximum and minimum value of the following $P(t)$. \[P(t)=\left\{\int_0^{\frac{\pi}{2}} e^x f(x) dx \right\}\left\{\int_0^{\frac{\pi}{2}} e^{-x} f(x)dx \right\}\]

Let $ \overline{AB}$ be a diameter of circle $ \omega$. Extend $ \overline{AB}$ through $ A$ to $ C$. Point $ T$ lies on $ \omega$ so that line $ CT$ is tangent to $ \omega$. Point $ P$ is the foot of the perpendicular from $ A$ to line $ CT$. Suppose $ AB \equal{} 18$, and let $ m$ denote the maximum possible length of segment $ BP$. Find $ m^{2}$.

The polynomial $ P(x)\equal{}x^3\plus{}ax^2\plus{}bx\plus{}d$ has three distinct real roots. The polynomial $ P(Q(x))$, where $ Q(x)\equal{}x^2\plus{}x\plus{}2001$, has no real roots. Prove that $ P(2001)>\frac{1}{64}$.

Are there integers $m$ and $n$ such that \[5m^2 - 6mn + 7n^2 = 1985 \ ?\]

Find the real number $t$, such that the following system of equations has a unique real solution $(x, y, z, v)$: \[ \left\{\begin{array}{cc}x+y+z+v=0\\ (xy + yz +zv)+t(xz+xv+yv)=0\end{array}\right. \]

Show that the number of integral-sided right triangles whose ratio of area to semi-perimeter is $p^{m}$, where $p$ is a prime and $m$ is an integer, is $m+1$ if $p=2$ and $2m+1$ if $p \neq 2$.

Let $f:(0,\infty) \rightarrow (0,\infty)$ be a function such that \[ 10\cdot \frac{x+y}{xy}=f(x)\cdot f(y)-f(xy)-90 \] for every $x,y \in (0,\infty)$. What is $f(\frac 1{11})$? $ \textbf{(A)}\ 1 \qquad\textbf{(B)}\ 11 \qquad\textbf{(C)}\ 21 \qquad\textbf{(D)}\ 31 \qquad\textbf{(E)}\ \text{There is more than one solution} $

Call admissible a set $A$ of integers that has the following property: If $x,y \in A$ (possibly $x=y$) then $x^2+kxy+y^2 \in A$ for every integer $k$. Determine all pairs $m,n$ of nonzero integers such that the only admissible set containing both $m$ and $n$ is the set of all integers. [i]Proposed by Warut Suksompong, Thailand[/i]

Form the infinite graph $A$ by taking the set of primes $p$ congruent to $1\pmod{4}$, and connecting $p$ and $q$ if they are quadratic residues modulo each other. Do the same for a graph $B$ with the primes $1\pmod{8}$. Show $A$ and $B$ are isomorphic to each other. [i]Linus Hamilton.[/i]

If $a$ , $b$ , $c$ , $d$ are integers and $A=2(a-2b+c)^4+2(b-2c+a)^4+2(c-2a+b)^4$ , $B=d(d+1)(d+2)(d+3)+1$ , then prove that $\left (\sqrt{A}+1 \right )^2 +B$ cannot be a perfect square.

Let $ a, b \in \mathbb{Z}$ which are not perfect squares. Prove that if \[ x^2 \minus{} ay^2 \minus{} bz^2 \plus{} abw^2 \equal{} 0\] has a nontrivial solution in integers, then so does \[ x^2 \minus{} ay^2 \minus{} bz^2 \equal{} 0.\]

Call admissible a set $A$ of integers that has the following property: If $x,y \in A$ (possibly $x=y$) then $x^2+kxy+y^2 \in A$ for every integer $k$. Determine all pairs $m,n$ of nonzero integers such that the only admissible set containing both $m$ and $n$ is the set of all integers. [i]Proposed by Warut Suksompong, Thailand[/i]

Find all positive integers $n$ that are quadratic residues modulo all primes greater than $n$.