[b]p1.[/b] Let $a_0, a_1,...,a_n$ be such that $a_n \ne 0$ and $$(1 + x + x^3)^{341}(1 + 2x + x^2 + 2x^3 + 2x^4 + x^6)^{342} =\sum^n_{i=0}a_ix^i,$$ Find the number of odd numbers in the sequence a0; a1; : : : an. [b]p2.[/b] Let $F_0 = 1$, $F_1 = 1$ and F$_k = F_{k-1} + F_{k-2}$. Let $P(x) =\sum^{99}_{k=0} x^{F_k}$ . The remainder when $P(x)$ is divided by $x^3 - 1$ can be expressed as $ax^2 + bx + c$. Find $2a + b$. [b]p3.[/b] Let $a_n$ be the number of permutations of the numbers $S = \{1, 2,...,n\}$ such that for all $k$ with $1 \le k \le n$, the sum of $k$ and the number in the $k$th position of the permutation is a power of $2$. Compute $a_{2^0} + a_{2^1} +... + a_{2^{20}}$ . [b]p4.[/b] Three identical balls are painted white and black, so that half of each sphere is a white hemisphere, and the other half is a black one. The three balls are placed on a plane surface, each with a random orientation, so that each ball has a point of contact with the other two. What is the probability that at at least one point of contact between two of the balls, both balls are the same color? [b]p5.[/b] Compute the greatest positive integer $n$ such that there exists an odd integer $a$, for which $\frac{a^{2^n}-1}{4^{4^4}}$ is not an integer. [b]p6.[/b] You are blind and cannot feel the difference between a coin that is heads up or tails up. There are $100$ coins in front of you and are told that exactly $10$ of them are heads up. On the back of this paper, explain how you can split the otherwise indistinguishable coins into two groups so that both groups have the same number of heads. [b]p7.[/b] On the back of this page, write the best math pun you can think of. You’ll get a point if we chuckle. [b]p8.[/b] Pick an integer between $1$ and $10$. If you pick $k$, and $n$ total teams pick $k$, then you’ll receive $\frac{k}{10n}$ points. [b]p9.[/b] There are four prisoners in a dungeon. Tomorrow, they will be separated into a group of three in one room, and the other in a room by himself. Each will be given a hat to wear that is either black or white – two will be given white and two black. None of them will be able to communicate with each other and none will see his or her own hat color. The group of three is lined up, so that the one in the back can see the other two, the second can see the first, but the first cannot see the others. If anyone is certain of their hat color, then they immediately shout that they know it to the rest of the group. If they can secretly prove it to the guard, they are saved. They only say something if they’re sure. Which person is sure to survive? [b]p10.[/b] Down the road, there are $10$ prisoners in a dungeon. Tomorrow they will be lined up in a single room and each given a black or white hat – this time they don’t know how many of each. The person in the back can see everyone’s hat besides his own, and similarly everyone else can only see the hats of the people in front of them. The person in the back will shout out a guess for his hat color and will be saved if and only if he is right. Then the person in front of him will have to guess, and this will continue until everyone has the opportunity to be saved. Each person can only say his or her guess of “white” or “black” when their turn comes, and no other signals may be made. If they have the night before receiving the hats to try to devise some sort of code, how many people at a minimum can be saved with the most optimal code? Describe the code on the back of this paper for full points. [b]p11.[/b] A few of the problems on this mixer contest were taken from last year’s event. One of them had fewer than $5$ correct answers, and most of the answers given were the same incorrect answer. Half a point will be given if you can guess the number of the problem on this test that corresponds to last year’s question, and another $.5$ points will be given if you can guess the very common incorrect answer. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

A hexahedron $ABCDE$ is made of two regular congruent tetrahedra $ABCD$ and $ABCE.$ Prove that there exists only one isometry $\mathbf Z$ that maps points $A, B, C, D, E$ onto $B, C, A, E, D,$ respectively. Find all points $X$ on the surface of hexahedron whose distance from $\mathbf Z(X)$ is minimal.

Three positive numbers are such that the sum of any one of them with the sum of squares of the remaining two numbers is the same. Is it true that all numbers are the same? (Author: L. Emelyanov)

Let $f$ be a polynomial function such that, for all real $x$, \[f(x^2 + 1) = x^4 + 5x^2 + 3.\] For all real $x$, $f(x^2-1)$ is $ \textbf{(A)}\ x^4+5x^2+1\qquad\textbf{(B)}\ x^4+x^2-3\qquad\textbf{(C)}\ x^4-5x^2+1\qquad\textbf{(D)}\ x^4+x^2+3\qquad\textbf{(E)}\ \text{None of these} $

A solid right circular cylinder with height $h$ and base-radius $r$ has a solid hemisphere of radius $r$ resting upon it. The center of the hemisphere $O$ is on the axis of the cylinder. Let $P$ be any point on the surface of the hemisphere and $Q$ the point on the base circle of the cylinder that is furthest from $P$ (measuring along the surface of the combined solid). A string is stretched over the surface from $P$ to $Q$ so as to be as short as possible. Show that if the string is not in a plane, the straight line $PO$ when produced cuts the curved surface of the cylinder.

How many ways are there to fill in a three by three grid of cells with $0$’s and $2$’s, one number in each cell, such that each two by two contiguous subgrid contains exactly three $2$’s and one $0$?

Let $N=10^6$. For which integer $a$ with $0 \leq a \leq N-1$ is the value of \[\binom{N}{a+1}-\binom{N}{a}\] maximized? [i]Proposed by Lewis Chen[/i]

The bisector of the diagonal $BD$ of a rectangle $ABCD$ (with $AB < BC$) intersects the lines $BC$ and $BA$ at points $E$ and $F$, respectively. The line passing through point $F$ and parallel to segment $AC$ intersects line $CD$ at point $G$. Prove that lines $EG$ and $AC$ are perpendicular

A teacher wants to divide the $2010$ questions she asked in the exams during the school year into three folders of $670$ questions and give each folder to a student who solved all $670$ questions in that folder. Determine the minimum number of students in the class that makes this possible for all possible situations in which there are at most two students who did not solve any given question.

Find all functions $f : R \to R$ such that $$f(f(x) + f(y)^2) = f(x)^2 +y^2f(y)^3.$$ Here $R$ denotes the usual real numbers.

Some bishops and knights are placed on an infinite chessboard, where each square has side length $1$ unit. Suppose that the following conditions hold: [list] [*] For each bishop, there exists a knight on the same diagonal as that bishop (there may be another piece between the bishop and the knight). [*] For each knight, there exists a bishop that is exactly $\sqrt{5}$ units away from it. [*] If any piece is removed from the board, then at least one of the above conditions is no longer satisfied. [/list] If $n$ is the total number of pieces on the board, find all possible values of $n$. [i]Sheldon Kieren Tan[/i]

Positive numbers $a_1,a_2,...,a_n, b_1, b_2,...,b_n$ satisfy the condition $a_1+a_2+...+a_n=b_1+ b_2+...+b_n=1$. Find the smallest possible value of the sum $$\frac{a_1^2}{a_1+b_1}+\frac{a_2^2}{a_2+b_2}+...+\frac{a_n^2}{a_n+b_n}$$ (V.Kolbun)

Let $f(x)$ be a real-valued function defined for $0<x<1.$ If $$ \lim_{x \to 0} f(x) =0 \;\; \text{and} \;\; f(x) - f \left( \frac{x}{2} \right) =o(x),$$ prove that $f(x) =o(x),$ where we use the O-notation.

Find all triples $a,b,c$ of positive integers such that \[ ( 1 + \frac{1}{a} ) ( 1 + \frac{1}{b}) ( 1 + \frac{1}{c} ) = 3. \]

Let $\triangle ABC$ be a triangle with $AB = 7$, $AC = 8$, and $BC = 3$. Let $P_1$ and $P_2$ be two distinct points on line $AC$ ($A, P_1, C, P_2$ appear in that order on the line) and $Q_1$ and $Q_2$ be two distinct points on line $AB$ ($A, Q_1, B, Q_2$ appear in that order on the line) such that $BQ_1 = P_1Q_1 = P_1C$ and $BQ_2 = P_2Q_2 = P_2C$. Find the distance between the circumcenters of $BP_1P_2$ and $CQ_1Q_2$.

In a cube-shaped box with an edge equal to $5$, there are two balls. The radius of one of the balls is $2$. Find the radius of the other ball if one of the balls touches the base and two side faces of the cube, and the other ball touches the first ball, base and two other side faces of the cube.