Suppose $x_1, x_2, x_3$ are the roots of polynomial $P(x) = x^3 - 4x^2 -3x + 2$. The sum $|x_1| + |x_2| + |x_3|$ is (A): $4$ (B): $6$ (C): $8$ (D): $10$ (E): None of the above.

For a positive integer $x$, denote its $n^{\mathrm{th}}$ decimal digit by $d_n(x)$, i.e. $d_n(x)\in \{ 0,1, \dots, 9\}$ and $x=\sum_{n=1}^{\infty} d_n(x)10^{n-1}$. Suppose that for some sequence $(a_n)_{n=1}^{\infty}$, there are only finitely many zeros in the sequence $(d_n(a_n))_{n=1}^{\infty}$. Prove that there are infinitely many positive integers that do not occur in the sequence $(a_n)_{n=1}^{\infty}$. (Proposed by Alexander Bolbot, State University, Novosibirsk)

Let $m$ and $n$ be positive integers greater than $1$. In each unit square of an $m\times n$ grid lies a coin with its tail side up. A [i]move[/i] consists of the following steps. [list=1] [*]select a $2\times 2$ square in the grid; [*]flip the coins in the top-left and bottom-right unit squares; [*]flip the coin in either the top-right or bottom-left unit square. [/list] Determine all pairs $(m,n)$ for which it is possible that every coin shows head-side up after a finite number of moves. [i]Thanasin Nampaisarn, Thailand[/i]

An envelope contains eight bills: $ 2$ ones, $ 2$ fives, $ 2$ tens, and $ 2$ twenties. Two bills are drawn at random without replacement. What is the probability that their sum is $ \$ 20$ or more? $ \textbf{(A)}\ \frac {1}{4}\qquad \textbf{(B)}\ \frac {2}{7}\qquad \textbf{(C)}\ \frac {3}{7}\qquad \textbf{(D)}\ \frac {1}{2}\qquad \textbf{(E)}\ \frac {2}{3}$

Let's call a set of numbers [i]lucky[/i] if it cannot be divided into two nonempty groups so that the product of the sum of the numbers in one group and the sum of the numbers in the other is positive. The teacher wrote several integers on the blackboard. Prove that the children can add another integer to the existing ones so that the resulting set is lucky. [i]A. Kuznetsov[/i]

In a mathematical competition some competitors are friends. Friendship is always mutual. Call a group of competitors a [i]clique[/i] if each two of them are friends. (In particular, any group of fewer than two competitiors is a clique.) The number of members of a clique is called its [i]size[/i]. Given that, in this competition, the largest size of a clique is even, prove that the competitors can be arranged into two rooms such that the largest size of a clique contained in one room is the same as the largest size of a clique contained in the other room. [i]Author: Vasily Astakhov, Russia[/i]

Kelvin the Frog and Alex the Kat are playing a game on an initially empty blackboard. Kelvin begins by writing a digit. Then, the players alternate inserting a digit anywhere into the number currently on the blackboard, including possibly a leading zero (e.g. $12$ can become $123$, $142$, $512$, $012$, etc.). Alex wins if the blackboard shows a perfect square at any time, and Kelvin's goal is prevent Alex from winning. Does Alex have a winning strategy?

A round coin may be used to construct a circle passing through one or two given points on the plane. Given a line on the plane, show how to use this coin to construct two points such that they dene a line perpendicular to the given line. Note that the coin may not be used to construct a circle tangent to the given line.

Circles with centers $P, Q$ and $R$, having radii $1, 2$ and $3$, respectively, lie on the same side of line $l$ and are tangent to $l$ at $P', Q'$ and $R'$, respectively, with $Q'$ between $P'$ and $R'$. The circle with center $Q$ is externally tangent to each of the other two circles. What is the area of triangle $PQR$? $\textbf{(A) } 0\qquad \textbf{(B) } \sqrt{\frac{2}{3}}\qquad\textbf{(C) } 1\qquad\textbf{(D) } \sqrt{6}-\sqrt{2}\qquad\textbf{(E) }\sqrt{\frac{3}{2}}$

Let $a, b, c, d$ be positive reals strictly smaller than $1$, such that $a+b+c+d=2$. Prove that $$\sqrt{(1-a)(1-b)(1-c)(1-d)} \leq \frac{ac+bd}{2}. $$

Peter has three accounts in a bank, each with an integral number of dollars. He is only allowed to transfer money from one account to another so that the amount of money in the latter is doubled. Prove that Peter can always transfer all his money into two accounts. Can Peter always transfer all his money into one account?

p1. Given $f(x)=\frac{1+x}{1-x}$ , for $x \ne 1$ . Defined $p @ q = \frac{p+q}{1+pq}$ for all positive rational numbers $p$ and $q$. Note the sequence with $a_1,a_2,a_3,...$ with $a_1=2 @3$, $a_{n}=a_{n-1}@ (n+2)$ for $n \ge 2$. Determine $f(a_{233})$ and $a_{233}$ p2. It is known that $ a$ and $ b$ are positive integers with $a > b > 2$. Is $\frac{2^a+1}{2^b-1}$ an integer? Write down your reasons. p3. Given a cube $ABCD.EFGH$ with side length $ 1$ dm. There is a square $PQRS$ on the diagonal plane $ABGH$ with points $P$ on $HG$ and $Q$ on $AH$ as shown in the figure below. Point $T$ is the center point of the square $PQRS$. The line $HT$ is extended so that it intersects the diagonal line $BG$ at $N$. Point $M$ is the projection of $N$ on $BC$. Determine the volume of the truncated prism $DCM.HGN$. [img]https://cdn.artofproblemsolving.com/attachments/f/6/22c26f2c7c66293ad7065a3c8ce3ac2ffd938b.png[/img] 4. Nine pairs of husband and wife want to take pictures in a three-line position with the background of the Palembang Ampera Bridge. There are $4$ people in the front row, $6$ people in the middle row, and $ 8$ people in the back row. They agreed that every married couple must be in the same row, and every two people next to each other must be a married couple or of the same sex. Specify the number of different possible arrangements of positions. p5. p5. A hotel provides four types of rooms with capacity, rate, and number of rooms as presented in the following table. [b] type of room, capacity of persons/ room, day / rate (Rp.), / number of rooms [/b][img]https://cdn.artofproblemsolving.com/attachments/3/c/e9e1ed86887e692f9d66349a82eaaffc730b46.jpg[/img] A group of four families wanted to stay overnight at the hotel. Each family consists of husband and wife and their unmarried children. The number of family members by gender is presented in the following table. [b]family / man / woman/ total[/b] [img]https://cdn.artofproblemsolving.com/attachments/4/6/5961b130c13723dc9fa4e34b43be30c31ee635.jpg[/img] The group leader enforces the following provisions. I. Each husband and wife must share a room and may not share a room with other married couples. II. Men and women may not share the same room unless they are from the same family. III. At least one room is occupied by all family representatives (“representative room”) IV. Each family occupies at most $3$ types of rooms. V. No rooms are occupied by more than one family except representative rooms. You are asked to arrange a room for the group so that the total cost of lodging is as low as possible. Provide two possible alternative room arrangements for each family and determine the total cost.

For each $n\geq 1$ let $$a_{n}=\sum_{k=0}^{\infty}\frac{k^{n}}{k!}, \;\; b_{n}=\sum_{k=0}^{\infty}(-1)^{k}\frac{k^{n}}{k!}.$$ Show that $a_{n}\cdot b_{n}$ is an integer.

Find all integer solutions $ (a_1,a_2,\dots,a_{2008})$ of the following equation: $ (2008\minus{}a_1)^2\plus{}(a_1\minus{}a_2)^2\plus{}\dots\plus{}(a_{2007}\minus{}a_{2008})^2\plus{}a_{2008}^2\equal{}2008$

Alice, Bob, and Charlie are playing a game with $6$ cards numbered $1$ through $6.$ Each player is dealt $2$ cards uniformly at random. On each player’s turn, they play one of their cards, and the winner is the person who plays the median of the three cards played. Charlie goes last, so Alice and Bob decide to tell their cards to each other, trying to prevent him from winning whenever possible. Compute the probability that Charlie wins regardless.

11.4 Let $AA_1$ and $BB_1$ are altitudes of an acute non-isosceles triangle $ABC$, $A'$ is a midpoint of $BC$ and $B'$ is a midpoint of $AC$. A segement $A_1B_1$ intersects $A'B'$ at point $C'$. Prove that $CC'\perp HO$, where $H$ is a orthocenter and $O$ is a circumcenter of $ABC$. ([i]L. Emel'yanov[/i])

Polly can do the following operations on a quadratic trinomial: 1) Swapping the places of its leading coefficient and constant coefficient (swapping $a_2$ with $a_0$); 2) Substituting (changing) $x$ with $x-m$, where $m$ is an arbitrary real number; Is it possible for Polly to get $25x^2+5x+2014$ from $6x^2+2x+1996$ with finite applications of the upper operations?

We call a polynomial $P$ [i]square-friendly[/i] if it is monic, has integer coefficients, and there is a polynomial $Q$ for which $P(n^2)=P(n)Q(n)$ for all integers $n$. We say $P$ is [i]minimally square-friendly[/i] if it is square-friendly and cannot be written as the product of nonconstant, square-friendly polynomials. Determine the number of nonconstant, minimally square-friendly polynomials of degree at most $12$.

Let $f(x)=x^2-2x+1.$ For some constant $k, f(x+k) = x^2+2x+1$ for all real numbers $x.$ Determine the value of $k.$

In a box there are $n$ balls, each colored in one of the following colors: green, red, blue or yellow. It is known that among any $28$ balls in the box at least one is green. Among any $26$ balls at least one is red. Among any $24$ balls at least one is blue. Among any $23$ balls at least one is yellow. Find the largest possible value of the number $n$.

Let $f$ be a real-valued function defined on the positive integers satisfying the following condition: For all $n>1$ there exists a prime divisor $p$ of $n$ such that $f(n)=f\left(\frac{n}{p}\right)-f(p)$. Given that $f(2001)=1$, what is the value of $f(2002)$?

A cycling group that has $4n$ members will have several cycling events, such that: a) Two cycling events are done every week; once on Saturday and once on Sunday. b) Exactly $2n$ members participate in any cycling event. c) No member may participate in both cycling events of a week. d) After all cycling events are completed, the number of events where each pair of members meet is the same for all pairs of members. Prove that after all cycling events are completed, the number of events where each group of three members meet is the same value $t$ for all groups of three members, and that for $n \ge 2$, $t$ is divisible by $n-1$.

Given two circles $\Gamma_1$ and $\Gamma_2$ which intersect at points $A$ and $B$. A line through $A$ intersects $\Gamma_1$ and $\Gamma_2$ at points $C$ and $D$, respectively. Let $M$ be the midpoint of arc $BC$ in $\Gamma_1$ ,which does not contains $A$, and $N$ is the midpoint of the arc $BD$ in $\Gamma_2$, which does not contain $A$. If $K$ is the midpoint of $CD$, prove that $\angle MKN = 90^o.$

In a triangle $ABC$, let $H_a$, $H_b$ and $H_c$ denote the base points of the altitudes on the sides $BC$, $CA$ and $AB$, respectively. Determine for which triangles $ABC$ two of the lengths $H_aH_b$, $H_bH_c$ and $H_aH_c$ are equal.

The number $N$ is the product of $200$ distinct positive integers. Prove that it has at least 19901 distinct divisors (including 0 and itself). [I]Proposed by A. Golovanov[/i]