Victor has a drawer with two red socks, two green socks, two blue socks, two magenta socks, two lavender socks, two neon socks, two mauve socks, two wisteria socks, and $2000$ copper socks, for a total of $2016$ socks. He repeatedly draws two socks at a time from the drawer at random, and stops if the socks are of the same color. However, Victor is red-green colorblind, so he also stops if he sees a red and green sock. What is the probability that Victor stops with two socks of the same color? Assume Victor returns both socks to the drawer at each step.

Let $a<b$ be five-digit palindromes (without leading zeroes) such that there is no other five-digit palindrome strictly between $a$ and $b$. What are all possible values of $b-a$? (A number is a palindrome if it reads the same forwards and backwards in base $10$.)

[b]p1.[/b] To every face of a given cube a new cube of the same size is glued. The resulting solid has how many faces? [b]p2.[/b] A father and his son returned from a fishing trip. To make their catches equal the father gave to his son some of his fish. If, instead, the son had given his father the same number of fish, then father would have had twice as many fish as his son. What percent more is the father's catch more than his son's? [b]p3.[/b] A radio transmitter has $4$ buttons. Each button controls its own switch: if the switch is OFF the button turns it ON and vice versa. The initial state of switches in unknown. The transmitter sends a signal if at least $3$ switches are ON. What is the minimal number of times you have to push the button to guarantee the signal is sent? [b]p4.[/b] $19$ matches are placed on a table to show the incorrect equation: $XXX + XIV = XV$. Move exactly one match to change this into a correct equation. [b]p5.[/b] Cut the grid shown into two parts of equal area by cutting along the lines of the grid. [img]https://cdn.artofproblemsolving.com/attachments/c/1/7f2f284acf3709c2f6b1bea08835d2fb409c44.png[/img] [b]p6.[/b] A family of funny dwarfs consists of a dad, a mom, and a child. Their names are: $A$, $R$, and $C$ (not in order). During lunch, $C$ made the statements: “$R$ and $A$ have different genders” and “$R$ and $A$ are my parents”, and $A$ made the statements “I am $C$'s dad” and “I am $R$'s daughter.” In fact, each dwarf told truth once and told a lie once. What is the name of the dad, what is the name of the child, and is the child a son or a daughter? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

In triangle $ABC$ the angle $C$ is obtuse, $m(\angle A)=2m(\angle B)$ and the sidelengths are integers. Find the smallest possible perimeter of this triangle.

Let $ABCD$ be a convex quadrilateral. Let $n \geq 2$ be a whole number. Prove that there are $n$ triangles with the same area that satisfy all of the following properties: a) Their interiors are disjoint, that is, the triangles do not overlap. b) Each triangle lies either in $ABCD$ or inside of it. c) The sum of the areas of all of these triangles is at least $\frac{4n}{4n+1}$ the area of $ABCD$.

Find all functions $f:\mathbb{N}\rightarrow(0,\infty)$ such that $f(4)=4$ and \[\frac{1}{f(1)f(2)}+\frac{1}{f(2)f(3)}+\cdots+\frac{1}{f(n)f(n+1)}=\frac{f(n)}{f(n+1)},~\forall n\in\mathbb{N},\] where $\mathbb{N}=\{1,2,\dots\}$ is the set of positive integers.

$100$-gon made of $100$ sticks. Could it happen that it is not possible to construct a polygon from any lesser number of these sticks?

Let be a function $ f:\mathbb{R}\rightarrow\mathbb{R} $ satisfying the following properties: $ \text{(i)} $ is continuous on the rational numbers. $ \text{(ii)} f(x)<f\left( x+\frac{1}{n}\right) , $ for any real $ x $ and natural $ n. $ Prove that $ f $ is increasing. [i]Gabriel Mârşanu, Mihai Piticari[/i]

Let $f:X\rightarrow X$, where $X=\{1,2,\ldots ,100\}$, be a function satisfying: 1) $f(x)\neq x$ for all $x=1,2,\ldots,100$; 2) for any subset $A$ of $X$ such that $|A|=40$, we have $A\cap f(A)\neq\emptyset$. Find the minimum $k$ such that for any such function $f$, there exist a subset $B$ of $X$, where $|B|=k$, such that $B\cup f(B)=X$.

Each rational number $\frac{p}{q}$ with $p,q$ coprime of the open interval $(0,1)$ is covered by the closed interval $\left[\frac{p}{q}-\frac{1}{4q^{2}}, \frac{p}{q}+\frac{1}{4q^{2}}\right]$. Prove that $\frac{\sqrt{2}}{2}$ is not covered by any of the above closed intervals.

Triangle $ABC$ is given with its centroid $G$ and cicumcentre $O$ is such that $GO$ is perpendicular to $AG$. Let $A'$ be the second intersection of $AG$ with circumcircle of triangle $ABC$. Let $D$ be the intersection of lines $CA'$ and $AB$ and $E$ the intersection of lines $BA'$ and $AC$. Prove that the circumcentre of triangle $ADE$ is on the circumcircle of triangle $ABC$.

$ ABCD$ is a square with side of unit length. Points $ E$ and $ F$ are taken respectively on sides $ AB$ and $ AD$ so that $ AE \equal{} AF$ and the quadrilateral $ CDFE$ has maximum area. In square units this maximum area is: $ \textbf{(A)}\ \frac12 \qquad \textbf{(B)}\ \frac {9}{16} \qquad \textbf{(C)}\ \frac{19}{32} \qquad \textbf{(D)}\ \frac {5}{8} \qquad \textbf{(E)}\ \frac23$

[b]p1.[/b] Find all solutions $a, b, c, d, e, f$ if it is known that they represent distinct digits and satisfy the following: $\begin{tabular}{ccccc} & a & b & c & a \\ + & & d & d & e \\ & & & d & e \\ \hline d & f & f & d & d \\ \end{tabular}$ [b]p2.[/b] Snowhite wrote on a piece of paper a whole number greater than $1$ and multiplied it by itself. She obtained a number, all digits of which are $1$: $n^2 = 111...111$ Does she know how to multiply? [b]p3.[/b] Two players play the following game on an $8\times 8$ chessboard. The first player can put a bishop on an arbitrary square. Then the second player can put another bishop on a free square that is not controlled by the first bishop. Then the first player can put a new bishop on a free square that is not controlled by the bishops on the board. Then the second player can do the same, etc. A player who cannot put a new bishop on the board loses the game. Who has a winning strategy? [b]p4.[/b] Four girls Marry, Jill, Ann and Susan participated in the concert. They sang songs. Every song was performed by three girls. Mary sang $8$ songs, more then anybody. Susan sang $5$ songs less then all other girls. How many songs were performed at the concert? [b]p5.[/b] Pinocchio has a $10\times 10$ table of numbers. He took the sums of the numbers in each row and each such sum was positive. Then he took the sum of the numbers in each columns and each such sum was negative. Can you trust Pinocchio's calculations? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $f:[0,\infty)\to(0,\infty)$ a continous function such that $\lim_{n\to\infty} \int^x_0 f(t)dt$ exists and it is finite. Prove that \[ \lim_{x\to\infty} \frac 1{\sqrt x} \int^x_0 \sqrt {f(t)} dt = 0. \] [i]Radu Miculescu[/i]

Determine all complex numbers $z$ such that \[\Bigl|z-\bigl|z+|z|\bigr|\Bigr|-|z|\sqrt3\ge0\] and draw the set of all such $z$ in complex plane.

Prove that for every composite number $ n>4$, numbers $ kn$ divides $ (n\minus{}1)!$ for every integer $ k$ such that $ 1\le k\le \lfloor \sqrt{n\minus{}1} \rfloor$.

If natural numbers $ x$, $ y$, $ p$, $ n$, $ k$ with $ n > 1$ odd and $ p$ an odd prime satisfy $ x^n \plus{} y^n \equal{} p^k$, prove that $ n$ is a power of $ p$.

A student of the National Technical University was reading advanced mathematics last summer for 37 days according to the following rules : (a) He was reading at least one hour every day. (b) He was reading an integer number of hours, but not more than 12, each day. (c) He had to read at most 60 hours in total. Prove that there were some successive days during which the student was reading exactly 13 hours in total.

Some squares of a $1999\times 1999$ board are occupied with pawns. Find the smallest number of pawns for which it is possible that for each empty square, the total number of pawns in the row or column of that square is at least $1999$.

(a) In the plane of the triangle $ABC$, find a point with the following property: its symmetrical points with respect to the midpoints of the sides of the triangle lie on the circumscribed circle. (b) Construct the triangle $ABC$ if it is known the positions of the orthocenter $H$, midpoint of the side $AB$ and the midpoint of the segment joining the feet of the heights through vertices $A$ and $B$.

Let $m,n$ be positive integers with $1 \le n < m$. A box is locked with several padlocks which must all be opened to open the box, and which all have different keys. The keys are distributed among $m$ people. Suppose that among these people, no $n$ can open the box, but any $n+1$ can open it. Find the smallest possible number $l$ of locks and then the total number of keys for which this is possible.

Given positive integers $m$, $a$, $b$, $(a,b)=1$. $A$ is a non-empty subset of the set of all positive integers, so that for every positive integer $n$ there is $an \in A$ and $bn \in A$. For all $A$ that satisfy the above condition, find the minimum of the value of $\left| A \cap \{ 1,2, \cdots,m \} \right|$

The parabolas $y=ax^2-2$ and $y=4-bx^2$ intersect the coordinate axes in exactly four points, and these four points are the vertices of a kite of area $12$. What is $a+b$? $\textbf{(A) }1\qquad\textbf{(B) }1.5\qquad\textbf{(C) }2\qquad\textbf{(D) }2.5\qquad\textbf{(E) }3$

The sequence of positive integers $a_0, a_1, a_2, . . .$ is defined by $a_0 = 3$ and $$a_{n+1} - a_n = n(a_n - 1)$$ for all $n \ge 0$. Determine all integers $m \ge 2$ for which $gcd (m, a_n) = 1$ for all $n \ge 0$.

Ivan has a $m \times n$ board, and he color some squares black, so that no three black squares form a L-triomino up to rotations and reflections. What is the maximal number of black squares that Ivan can color? [i]Proposed by Ivan Chan Kai Chin[/i]