Show that there are infinitely many primes.

Let $a$, $b$, $c$, $d$ be real numbers such that $b-d \ge 5$ and all zeros $x_1, x_2, x_3,$ and $x_4$ of the polynomial $P(x)=x^4+ax^3+bx^2+cx+d$ are real. Find the smallest value the product $(x_1^2+1)(x_2^2+1)(x_3^2+1)(x_4^2+1)$ can take.

The equation $2000x^6+100x^5+10x^3+x-2=0$ has exactly two real roots, one of which is $\frac{m+\sqrt{n}}r,$ where $m, n$ and $r$ are integers, $m$ and $r$ are relatively prime, and $r>0.$ Find $m+n+r.$

Real function $f$ [b]generates[/b] real function $g$ if there exists a natural $k$ such that $f^k=g$ and we show this by $f \rightarrow g$. In this question we are trying to find some properties for relation $\rightarrow$, for example it's trivial that if $f \rightarrow g$ and $g \rightarrow h$ then $f \rightarrow h$.(transitivity) (a) Give an example of two real functions $f,g$ such that $f\not = g$ ,$f\rightarrow g$ and $g\rightarrow f$. (b) Prove that for each real function $f$ there exists a finite number of real functions $g$ such that $f \rightarrow g$ and $g \rightarrow f$. (c) Does there exist a real function $g$ such that no function generates it, except for $g$ itself? (d) Does there exist a real function which generates both $x^3$ and $x^5$? (e) Prove that if a function generates two polynomials of degree 1 $P,Q$ then there exists a polynomial $R$ of degree 1 which generates $P$ and $Q$. Time allowed for this problem was 75 minutes.

Given reals numbers $a$, $b$, $c$. Prove that at least one of three equations $x^{2}+(a-b)x+(b-c)=0$, $x^{2}+(b-c)x+(c-a)=0$, $x^{2}+(c-a)x+(a-b)=0$ has a real root. [i]O. Podlipsky[/i]

Alice has two urns. Each urn contains four balls and on each ball a natural number is written. She draws one ball from each urn at random, notes the sum of the numbers written on them, and replaces the balls in the urns from which she took them. This she repeats a large number of times. Bill, on examining the numbers recorded, notices that the frequency with which each sum occurs is the same as if it were the sum of two natural numbers drawn at random from the range 1 to 4. What can he deduce about the numbers on the balls?

Given some monic polynomials $P_1, \ldots, P_n$ with real coefficients, for any real number $y$, let $S_y$ be the set of real number $x$ such that $y = P_i(x)$ for some $i = 1, 2, ..., n$. If the sets $S_{y_1}, S_{y_2}$ have the same size for any two real numbers $y_1, y_2$, show that $P_1, \ldots, P_n$ have the same degree. [i] Proposed by usjl[/i]

(Eisentein's Criterion) Let $f(x)=a_{n}x^{n} +\cdots +a_{1}x+a_{0}$ be a nonconstant polynomial with integer coefficients. If there is a prime $p$ such that $p$ divides each of $a_{0}$, $a_{1}$, $\cdots$,$a_{n-1}$ but $p$ does not divide $a_{n}$ and $p^2$ does not divide $a_{0}$, then $f(x)$ is irreducible in $\mathbb{Q}[x]$.

Find the least positive integer $ n$ so that the polynomial $ P(X)\equal{}\sqrt3\cdot X^{n\plus{}1}\minus{}X^n\minus{}1$ has at least one root of modulus $ 1$.

Prove that for every positive integer $n$ there exists a polynomial $p(x)$ of degree $n$ with real coefficients, having $n$ distinct real roots and satisfying $$p(x)p(4-x)=p(x(4-x))$$

Real numbers $x_1,x_2,\ldots ,x_{1996}$ have the following property: For any polynomial $W$ of degree $2$ at least three of the numbers $W(x_1),W(x_2),\ldots ,W(x_{1996})$ are equal. Prove that at least three of the numbers $x_1,x_2,\ldots ,x_{1996}$ are equal.

A sequence is called an [i]arithmetic progression of the first order[/i] if the differences of the successive terms are constant. It is called an [i]arithmetic progression of the second order[/i] if the differences of the successive terms form an arithmetic progression of the first order. In general, for $k\geq 2$, a sequence is called an [i]arithmetic progression of the $k$-th order[/i] if the differences of the successive terms form an arithmetic progression of the $(k-1)$-th order. The numbers \[4,6,13,27,50,84\] are the first six terms of an arithmetic progression of some order. What is its least possible order? Find a formula for the $n$-th term of this progression.

Is that true that there exist a polynomial $f(x)$ with rational coefficients, not all integers, with degree $n>0$, a polynomial $g(x)$, with integer coefficients, and a set $S$ with $n+1$ integers such that $f(t)=g(t)$ for all $t \in S$?

Let $N{}$ be the number of positive integers with $10$ digits $\overline{d_9d_8\cdots d_0}$ in base $10$ (where $0\le d_i\le9$ for all $i$ and $d_9>0$) such that the polynomial \[d_9x^9+d_8x^8+\cdots+d_1x+d_0\] is irreducible in $\Bbb Q$. Prove that $N$ is even. (A polynomial is irreducible in $\Bbb Q$ if it cannot be factored into two non-constant polynomials with rational coefficients.)

Let $ f(x) \equal{} c_m x^m \plus{} c_{m\minus{}1} x^{m\minus{}1} \plus{}...\plus{} c_1 x \plus{} c_0$, where each $ c_i$ is a non-zero integer. Define a sequence $ \{ a_n \}$ by $ a_1 \equal{} 0$ and $ a_{n\plus{}1} \equal{} f(a_n)$ for all positive integers $ n$. (a) Let $ i$ and $ j$ be positive integers with $ i<j$. Show that $ a_{j\plus{}1} \minus{} a_j$ is a multiple of $ a_{i\plus{}1} \minus{} a_i$. (b) Show that $ a_{2008} \neq 0$