The number of solutions to $\{1,~2\}\subseteq~X~\subseteq~\{1,~2,~3,~4,~5\}$, where $X$ is a subset of $\{1,~2,~3,~4,~5\}$ is $\textbf{(A) }2\qquad\textbf{(B) }4\qquad\textbf{(C) }6\qquad\textbf{(D) }8\qquad \textbf{(E) }\text{None of these}$

How many non-similar triangle have angles whose degree measures are distinct positive integers in arithmetic progression? $ \textbf{(A) } 0 \qquad \textbf{(B) } 1 \qquad \textbf{(C) } 59 \qquad \textbf{(D) } 89 \qquad \textbf{(E) } 178$

How many of the numbers \[ a_1\cdot 5^1+a_2\cdot 5^2+a_3\cdot 5^3+a_4\cdot 5^4+a_5\cdot 5^5+a_6\cdot 5^6 \] are negative if $a_1,a_2,a_3,a_4,a_5,a_6 \in \{-1,0,1 \}$? $ \textbf{(A)}\ 121 \qquad\textbf{(B)}\ 224 \qquad\textbf{(C)}\ 275 \qquad\textbf{(D)}\ 364 \qquad\textbf{(E)}\ 375 $

[b]6.[/b] Consider a sequence $\{ a_n \}_{n=1}^{\infty}$ such that, for any convergent subsequence $\{ a_{n_k} \}$ of $\{a_n\}$, the sequence $\{ a_{n_k +1} \}$ also is convergent and has the same limit as $\{ a_{n_k}\}$. Prove that the sequence $\{ a_n \}$ is either convergent of has infinitely many accumulation points the set of which is dense in itself. Give an example for the second case. (A sequence $ x_n \to \infty $ or $-\infty$ is considered to be convergente, too) [b](S. 13)[/b]

Let $P_1(x) = ax^2 - bx - c$, $P_2(x) = bx^2 - cx - a$, $P_3(x) = cx^2 - ax - b$ be three quadratic polynomials. Suppose there exists a real number $\alpha$ such that $P_1(\alpha) = P_2(\alpha) = P_3(\alpha)$. Prove that $a = b = c$.

For a positive integer $N$, let $c_1 < c_2 < \cdots < c_m$ be all positive integers smaller than $N$ that are coprime to $N$. Find all $N \geqslant 3$ such that $$\gcd( N, c_i + c_{i+1}) \neq 1$$ for all $1 \leqslant i \leqslant m-1$ \\[i]Here $\gcd(a, b)$ is the largest positive integer that divides both $a$ and $b$. Integers $a$ and $b$ are coprime if $\gcd(a, b) = 1$.[/i] \\ [i]Proposed by Paulius Aleknavičius, Lithuania[/i]

Find all prime $x,y$ and $z,$ such that $x^5 +y^3 -(x+y)^2=3z^3$

Find the number of ordered quadruples of positive integers $(a,b,c,d)$ such that $a,b,c,$ and $d$ are all (not necessarily distinct) factors of $30$ and $abcd>900$.

We say that a positive integer $k$ is tricubic if there are three positive integers $a, b, c,$ not necessarily different, such that $k=a^3+b^3+c^3.$ a) Prove that there are infinitely many positive integers $n$ that satisfy the following condition: exactly one of the three numbers $n, n+2$ and $n+28$ is tricubic. b) Prove that there are infinitely many positive integers $n$ that satisfy the following condition: exactly two of the three numbers $n, n+2$ and $n+28$ are tricubic. c) Prove that there are infinitely many positive integers $n$ that satisfy the following condition: the three numbers $n, n+2$ and $n+28$ are tricubic.

What is the number of integral solutions of the equation $a^{b^2}=b^{2a}$, where a > 0 and $|b|>|a|$ [list=1] [*] 3 [*] 4 [*] 6 [*] 8 [/list]

On the square, $1,995$ soldiers lined up in a column, and some of them stood correctly, and some turned backwards. Sergeant Smith remembers only the command "as". With this command, each soldier who sees an even number of faces facing him turns $180^o$, while the rest remain stationary. All movements on command are performed simultaneously. Prove that the sergeant can orient all the soldiers in one direction.

There are $14$ boys in a class. Each boy is asked how many other boys in the class have his first name, and how many have his last name. It turns out that each number from $0$ to $6$ occurs among the answers. Prove that there are two boys in the class with the same first name and the same last name.

Given a triangle $ABC$. Let $S$ be the circle passing through $C$, centered at $A$. Let $X$ be a variable point on $S$ and let $K$ be the midpoint of the segment $CX$ . Find the locus of the midpoints of $BK$, when $X$ moves along $S$. (I. Gorodnin)

This is the one with the 8 circles? I made each circle into the square in which the circle is inscribed, then calculated it with that. It got the right answer but I don't think that my method is truly valid...

The fourth power of $\sqrt{1+\sqrt{1+\sqrt{1}}}$ is: ${\textbf{(A) }\sqrt{2}+\sqrt{3}\qquad\textbf{(B) }\frac{1}{2}(7+3\sqrt{5}})\qquad\textbf{(C) }1+2\sqrt{3}\qquad\textbf{(D) }3\qquad \textbf{(E) }3+2\sqrt{2}$

A positive integer is called [i]uphill [/i] if the digits in its decimal representation form an increasing sequence from left to right. That is, a number $\overline{a_1a_2... a_n}$ is uphill if $a_i \le a_{i+1}$ for all $i$. For example, $123$ and $114$ are both uphill. Suppose a polynomial $P(x)$ with rational coefficients takes on an integer value for each uphill positive integer $x$. Is it necessarily true that $P(x)$ takes on an integer value for each integer $x$?

Alice is performing a magic trick. She has a standard deck of 52 cards, which she may order beforehand. She invites a volunteer to pick an integer \(0\le n\le 52\), and cuts the deck into a pile with the top \(n\) cards and a pile with the remaining \(52-n\). She then gives both piles to the volunteer, who riffles them together and hands the deck back to her face down. (Thus, in the resulting deck, the cards that were in the deck of size \(n\) appear in order, as do the cards that were in the deck of size \(52-n\).) Alice then flips the cards over one-by-one from the top. Before flipping over each card, she may choose to guess the color of the card she is about to flip over. She stops if she guesses incorrectly. What is the maximum number of correct guesses she can guarantee? [i]Proposed by Espen Slettnes[/i]

Let $p, u, m, a, c$ be positive real numbers satisfying $5p^5+4u^5+3m^5+2a^5+c^5=91$. What is the maximum possible value of: \[18pumac + 2(2 + p)^2 + 23(1 + ua)^2 + 15(3 + mc)^2?\]

Let be a natural number $ n $ and $ n $ real numbers $ a_1,a_2,\ldots ,a_n $ such that $$ a_m+a_{m+1} +\cdots +a_n\ge \frac{(m+n)(n-m+1)}{2} ,\quad\forall m\in\{ 1,2,\ldots ,n \} . $$ Prove that $ a_1^2+a_2^2+\cdots +a_n^2\ge\frac{n(n+1)(2n+1)}{6} . $

Determine the number of integer solutions $(x, y, z)$, with $0 \le x, y, z \le 100$, for the equation $$(x - y)^2 + (y + z)^2 = (x + y)^2 + (y - z)^2.$$

$\omega_A, \omega_B, \omega_C$ are three concentric circles with radii $2,3,$ and $7,$ respectively. We say that a point $P$ in the plane is [i]nice[/i] if there are points $A, B,$ and $C$ on $\omega_A, \omega_B,$ and $\omega_C,$ respectively, such that $P$ is the centroid of $\triangle{ABC}.$ If the area of the smallest region of the plane containing all nice points can be expressed as $\tfrac{a\pi}{b},$ where $a$ and $b$ are relatively prime positive integers , what is $a+b$?

The positive real $x, y, z$ are such that $x^2+y^2+z^2 = 3$. Prove that$$\frac{x^2+yz}{x^2+yz +1}+\frac{y^2+zx}{y^2+zx+1}+\frac{z^2+xy}{z^2+xy+1}\leq 2$$

Let $ S$ be the set of $25$ points $(x, y)$ with $0\le x, y \le 4$. A triangle whose three vertices are in $S$ is chosen at random. What is the expected value of the square of its area?

[b]p4[/b] Define the sequence ${a_n}$ as follows: 1) $a_1 = -1$, and 2) for all $n \ge 2$, $a_n = 1 + 2 + . . . + n - (n + 1)$. For example, $a_3 = 1+2+3-4 = 2$. Find the largest possible value of $k$ such that $a_k+a_{k+1} = a_{k+2}$. [b]p5[/b] The taxicab distance between two points $(a, b)$ and $(c, d)$ on the coordinate plane is $|c-a|+|d-b|$. Given that the taxicab distance between points $A$ and $B$ is $8$ and that the length of $AB$ is $k$, find the minimum possible value of $k^2$. [b]p6[/b] For any two-digit positive integer $\overline{AB}$, let $f(\overline{AB}) = \overline{AB}-A\cdot B$, or in other words, the result of subtracting the product of its digits from the integer itself. For example, $f(\overline{72}) = 72-7\cdot 2 = 58$. Find the maximum possible $n$ such that there exist distinct two-digit integers$ \overline{XY}$ and $\overline{WZ}$ such that $f(\overline{XY} ) = f(\overline{WZ}) = n$.

Let $n \ge 2$. Ana and Beto play the following game: Ana chooses $2n$ non-negative real numbers $x_1, x_2,\ldots , x_{2n}$ (not necessarily different) whose total sum is $1$, and shows them to Beto. Then Beto arranges these numbers in a circle in the way she sees fit, calculates the product of each pair of adjacent numbers, and writes the maximum value of these products. Ana wants to maximize the number written by Beto, while Beto wants to minimize it. What number will be written if both play optimally?