The number $0$ or $1$ is to be assigned to each of the $n$ vertices of a regular polygon. In how many different ways can this be done (if we consider two assignments that can be obtained one from the other through rotation in the plane of the polygon to be identical)?

Let $\Omega$ be a unit circle and $A$ be a point on $\Omega$. An angle $0 < \theta < 180^\circ$ is chosen uniformly at random, and $\Omega$ is rotated $\theta$ degrees clockwise about $A$. What is the expected area swept by this rotation?

Estimate the value of $e^f$ , where $f = e^e$ .

To each pair of nonzero real numbers $a$ and $b$ a real number $a*b$ is assigned so that $a*(b*c) = (a*b)c$ and $a*a = 1$ for all $a,b,c$. Solve the equation $x*36 = 216$.

The Fibonacci sequence $f_n$ is defined by $f_1=f_2=1$ and $f_{n+2}=f_{n+1}+f_n$ for $n\in\mathbb N$. (a) Show that $f_{1005}$ is divisible by $10$. (b) Show that $f_{1005}$ is not divisible by $100$.

$x_i$ are non-negative reals. $x_1 + x_2 + ...+ x_n = s$. Show that $x_1x_2 + x_2x_3 + ... + x_{n-1}x_n \le \frac{s^2}{4}$.

There are three kinds of things, which are designated respectively by the words (stripped of all common meaning) [i]notes[/i], [i]staves [/i], and [i]heads[/i]. There can be a certain relationship between a note and a head, which is expressed by the saying: they match. Also, a note and a head can match and two different staves can match. Given are the following axioms: (a) If a note and a head each match the same stave, then they match, (b) If two different notes both match with stave B, and also both match with head V, then B and V match, (c) If two staves match, then there is a note that matches both, (d) If a note and a stave are given, then there is a head that matches both. Prove the following theorem, denoting the axiom you apply by its letter. If three staves that differ from each other, each one matches every other, and no note matches any of the three staves, then there is a head that matches all three staves. [hide=original wording] Er zijn drie soorten van dingen, die respectievelijk worden aangeduid met de (van alle gangbare betekenis ontdane) woorden noten, balken en vellen. Tussen een noot en een vel kan een zekere betrekking bestaan die uitgedrukt wordt door de zegswijze: zij passen bij elkaar. Ook kunnen een noot en een vel bij elkaar passen en twee verschillende balken kunnen bij elkaar passen. Gegeven zijn de volgende axioma’s: (a) Als een noot en een vel elk passen bij de zelfde balk, dan passen zij bij elkaar; (b) Als tw’ee verschillende noten beide passen bij balk b, en ook passen bij het vel v, dan passen b en v bij elkaar; (c) Als twee balken bij elkaar passen, dan is er een noot die bij beiden past; (d) Als een noot en een balk zijn gegeven, dan is er een vel dat bij beiden past. Bewijs de volgende stelling en geef daarbij telkens door zijn letter het axioma aan dat U toepast. Als van drie onderling verschillende balken elke past bij elke andere en er geen noot bij de drie balken past, dan is er een vel dat bij alle drie de balken past.[/hide]

There are three eight-digit positive integers which are equal to the sum of the eighth powers of their digits. Given that two of the numbers are $24678051$ and $88593477$, compute the third number. [i]Proposed by Vincent Huang[/i]

Let $f(x)=x^2-2$ and let $f^{(n)}(x)$ denote the $n$-th iteration of $f$. Let $H=\{x:f^{(100)}(x)\leq -1\}$. Find the length of $H$ (the sum of the lengths of the intervals of $H$).

A subset $U \subset R$ is open if for any $x \in U$, there exist real numbers $a, b$ such that $x \in (a, b) \subset U$. Suppose $S \subset R$ has the property that any open set intersecting $(0, 1)$ also intersects $S$. Let $T$ be a countable collection of open sets containing $S$. Prove that the intersection of all of the sets of $T$ is not a countable subset of $R$. (A set $\Gamma$ is countable if there exists a bijective function $f : \Gamma \to Z$.)

Let $P$ be an arbitrary point on the incircle $k$ of triangle $ABC$ with center $I$, different from the points of tangency with its sides. The tangent to $k$ at $P$ intersects the lines $BC$, $AC$, $AB$ at points $A_0$, $B_0$, $C_0$, respectively. The lines through $A_0$, $B_0$, $C_0$, parallel to the bisectors of the angles $\angle BAC$, $\angle ABC$, $\angle ACB$, form a triangle $\Delta$. Prove that the line $PI$ is tangent to the circumcircle of $\Delta$.

For a finite set of naturals $(C)$, the product of its elements is going to be noted $P(C)$. We are going to define $P (\phi) = 1$. Calculate the value of the expression $$\sum_{C \subseteq \{1,2,...,n\}} \frac{1}{P(C)}$$

Find a real number $t$ such that for any set of 120 points $P_1, \ldots P_{120}$ on the boundary of a unit square, there exists a point $Q$ on this boundary with $|P_1Q| + |P_2Q| + \cdots + |P_{120}Q| = t$.

Is there a natural number $ n > 10^{1000}$ which is not divisible by 10 and which satisfies: in its decimal representation one can exchange two distinct non-zero digits such that the set of prime divisors does not change.

Let $a,b,c\geq 0$ and $a+b+c=1.$ Prove that$$\frac{a}{2a+1}+\frac{b}{3b+1}+\frac{c}{6c+1}\leq \frac{1}{2}.$$ [size=50](Marian Dinca)[/size]

Quadratic trinomial $f(x)$ is allowed to be replaced by one of the trinomials $x^2f(1+\frac{1}{x})$ or $(x-1)^2f(\frac{1}{x-1})$. With the use of these operations, is it possible to go from $x^2+4x+3$ to $x^2+10x+9$?

Find the last four digits of $5^{5555}$.

Let $n$ be a positive integer, $n \geq 2$, and consider the polynomial equation \[x^n - x^{n-2} - x + 2 = 0.\] For each $n,$ determine all complex numbers $x$ that satisfy the equation and have modulus $|x| = 1.$

If $ a,b,c>0 $ and $ ab+bc+ca+abc=4, $ then $ \sqrt{ab} +\sqrt{bc} +\sqrt{ca} \le 3\le a+b+c. $

Denote $S$ as the subset of $\{1,2,3,\dots,1000\}$ with the property that none of the sums of two different elements in $S$ is in $S$. Find the maximum number of elements in $S$.

Let $\mathbb{R}$ denote the set of all real numbers. Determine all functions $f:\mathbb{R}\to\mathbb{R}$ such that for all real numbers $x$ and $y$, \[f(xy+xf(x))=f(x)\left(f(x)+f(y)\right).\]

Show that the number of 5-tuples ($a$, $b$, $c$, $d$, $e$) such that $abcde = 5(bcde + acde + abde + abce + abcd)$ is odd

The two heights in the triangle are not less than the respective sides. Find the angles.

$ABC$ is a triangle with $AB = 15$, $BC = 14$, and $CA = 13$. The altitude from $A$ to $BC$ is extended to meet the circumcircle of $ABC$ at $D$. Find $AD$.

(a) Prove that the set $X = (1,2,....100)$ cannot be partitoned into THREE subsets such that two numbers differing by a square belong to different subsets. (b) Prove that $X$ can so be partitioned into $5$ subsets.