Consider the multiplicative group $A=\{z\in\mathbb{C}|z^{2006^k}=1, 0<k\in\mathbb{Z}\}$ of all the roots of unity of degree $2006^k$ for all positive integers $k$. Find the number of homomorphisms $f:A\to A$ that satisfy $f(f(x))=f(x)$ for all elements $x\in A$.

Let $ a_1,a_2,...,a_n$ be nonnegative real numbers. Prove that \[ ( \sum_{i=1}^na_i)( \sum_{i=1}^na_i^{n-1}) \leq n \prod_{i=1}^na_i+ (n-1) ( \sum_{i=1}^na_i^n).\] [i]J. Suranyi[/i]

Let $ p\geq 5$ be a prime number.Prove that for any partition of the set $ P\equal{}\{1,2,3,...,p\minus{}1\}$ in $ 3$ subsets there exists numbers $ x,y,z$ each belonging to a distinct subset,such that $ x\plus{}y\equiv z (mod p)$

Consider the sequence $ a_n\equal{}\left|z^n\plus{}\frac{1}{z^n}\right|\ ,\ n\ge 1$, where $ z\in \mathbb{C}^*$ is given. i) Prove that if $ a_1>2$, then: \[ a_{n\plus{}1}<\frac{a_n\plus{}a_{n\plus{}2}}{2}\ ,\ (\forall)n\in \mathbb{N}^*\] ii) Prove that if there is a $ k\in \mathbb{N}^*$ such that $ a_k\le 2$, then $ a_1\le 2$.

Consider the sequence $ \{a_n\}_{n\geq1}$ defined as follows: $ a_1 \equal{} 1$, $ a_{2k} \equal{} 1 \plus{} a_k$ and $ a_{2k \plus{} 1} \equal{} \frac {1}{a_{2k}}$ for every $ k\geq 1$. Prove that every positive rational number appears on the sequence $ \{a_n\}$ exactly once.

Consider a round-robin tournament with $2n+1$ teams, where each team plays each other team exactly one. We say that three teams $X,Y$ and $Z$, form a [i]cycle triplet [/i] if $X$ beats $Y$, $Y$ beats $Z$ and $Z$ beats $X$. There are no ties. a)Determine the minimum number of cycle triplets possible. b)Determine the maximum number of cycle triplets possible.

Let $ G$ be an infinite compact topological group with a Hausdorff topology. Prove that $ G$ contains an element $ g \not\equal{} 1$ such that the set of all powers of $ g$ is either everywhere dense in $ G$ or nowhere dense in $ G$. [i]J. Erdos[/i]

$a,b,c$ are positive real numbers. prove the following inequality: $\frac{1}{a^2}+\frac{1}{b^2}+\frac{1}{c^2}+\frac{1}{(a+b+c)^2}\ge \frac{7}{25}(\frac{1}{a}+\frac{1}{b}+\frac{1}{c}+\frac{1}{a+b+c})^2$ (20 points)

Find all functions $~$ $f: \mathbb{R} \to \mathbb{R}$ $~$ which satisfy the equation \[ f(x+yf(x))\, =\, f(f(x)) + xf(y)\, . \]

Prove that there are infinitely many positive integers $ n$ such that $ n(n\plus{}1)$ can be represented as a sum of two positive squares in at least two different ways. (Here $ a^{2}\plus{}b^{2}$ and $ b^{2}\plus{}a^{2}$ are considered as the same representation.)

Find all integers $ k$ such that for infinitely many integers $ n \ge 3$ the polynomial \[ P(x) =x^{n+ 1}+ kx^n - 870x^2 + 1945x + 1995\] can be reduced into two polynomials with integer coefficients.

Determine all natural numbers $n$ such that for each natural number $a$ relatively prime with $n$ and $a \le 1 + \left\lfloor \sqrt{n} \right\rfloor$ there exists some integer $x$ with $a \equiv x^2 \mod n$. Remark: "Natural numbers" is the set of positive integers.

A group of $ 100$ students numbered $ 1$ through $ 100$ are playing the following game. The judge writes the numbers $ 1$, $ 2$, $ \ldots$, $ 100$ on $ 100$ cards, places them on the table in an arbitrary order and turns them over. The students $ 1$ to $ 100$ enter the room one by one, and each of them flips $ 50$ of the cards. If among the cards flipped by student $ j$ there is card $ j$, he gains one point. The flipped cards are then turned over again. The students cannot communicate during the game nor can they see the cards flipped by other students. The group wins the game if each student gains a point. Is there a strategy giving the group more than $ 1$ percent of chance to win?

Let $ f$ be an infinitely differentiable real-valued function defined on the real numbers. If $ f(1/n)\equal{}\frac{n^{2}}{n^{2}\plus{}1}, n\equal{}1,2,3,...,$ Compute the values of the derivatives of $ f^{k}(0), k\equal{}0,1,2,3,...$

Two different ellipses are given. One focus of the first ellipse coincides with one focus of the second ellipse. Prove that the ellipses have at most two points in common.

prove that for each natural number $n$ there exist a polynomial with degree $2n+1$ with coefficients in $\mathbb{Q}[x]$ such that it has exactly $2$ complex zeros and it's irreducible in $\mathbb{Q}[x]$.(20 points)

An ordered pair $( b , c )$ of integers, each of which has absolute value less than or equal to five, is chosen at random, with each such ordered pair having an equal likelihood of being chosen. What is the probability that the equation $x^ 2 + bx + c = 0$ will [i]not[/i] have distinct positive real roots? $\textbf{(A) }\frac{106}{121}\qquad\textbf{(B) }\frac{108}{121}\qquad\textbf{(C) }\frac{110}{121}\qquad\textbf{(D) }\frac{112}{121}\qquad\textbf{(E) }\text{none of these}$

Noah has 8 species of animals to fit into 4 cages of the ark. He plans to put species in each cage. It turns out that, for each species, there are at most 3 other species with which it cannot share the accomodation. Prove that there is a way to assign the animals to their cages so that each species shares with compatible species.

Does there exist a solution $(x,y,z,u,v)$ in integers greater than $1998$ to the equation $x^{2}+y^{2}+z^{2}+u^{2}+v^{2}=xyzuv-65$?

Find the first integer $n > 1$ such that the average of $1^2 , 2^2 ,\cdots, n^2$ is itself a perfect square.

Let $g(t)$ be the minimum value of $f(x)=x2^{-x}$ in $t\leq x\leq t+1$. Evaluate $\int_0^2 g(t)dt$. [i]2010 Kumamoto University entrance exam/Science[/i]

Farmer Tim is lost in the densely-forested Cartesian plane. Starting from the origin he walks a sinusoidal path in search of home; that is, after $t$ minutes he is at position $(t,\sin t)$. Five minutes after he sets out, Alex enters the forest at the origin and sets out in search of Tim. He walks in such a way that after he has been in the forest for $m$ minutes, his position is $(m,\cos t)$. What is the greatest distance between Alex and Farmer Tim while they are walking in these paths?

Initially numbers from 1 to 1000000 are all colored black. A move consists of picking one number, then change the color (black to white or white to black) of itself and all other numbers NOT coprime with the chosen number. Can all numbers become white after finite numbers of moves? Edited by pbornsztein

Let $ A$ be a unitary finite ring with $ n$ elements, such that the equation $ x^n\equal{}1$ has a unique solution in $ A$, $ x\equal{}1$. Prove that a) $ 0$ is the only nilpotent element of $ A$; b) there exists an integer $ k\geq 2$, such that the equation $ x^k\equal{}x$ has $ n$ solutions in $ A$.

Prove that all roots of $ 11z^{10} \plus{} 10iz^9 \plus{} 10iz \minus{}11 \equal{} 0$ have unit modulus (or equivalent $ |z| \equal{} 1$).