[i]20 problems for 20 minutes.[/i] [b]p1.[/b] Determine how many digits the number $10^{10}$ has. [b]p2.[/b] Let $ABC$ be a triangle with $\angle ABC = 60^o$ and $\angle BCA = 70^o$. Compute $\angle CAB$ in degrees. [b]p3.[/b] Given that $x : y = 2012 : 2$ and $y : z = 1 : 2013$, compute $x : z$. Express your answer as a common fraction. [b]p4.[/b] Determine the smallest perfect square greater than $2400$. [b]p5.[/b] At $12:34$ and $12:43$, the time contains four consecutive digits. Find the next time after 12:43 that the time contains four consecutive digits on a 24-hour digital clock. [b]p6.[/b] Given that $ \sqrt{3^a \cdot 9^a \cdot 3^a} = 81^2$, compute $a$. [b]p7.[/b] Find the number of positive integers less than $8888$ that have a tens digit of $4$ and a units digit of $2$. [b]p8.[/b] Find the sum of the distinct prime divisors of $1 + 2012 + 2013 + 2011 \cdot 2013$. [b]p9.[/b] Albert wants to make $2\times 3$ wallet sized prints for his grandmother. Find the maximum possible number of prints Albert can make using one $4 \times 7$ sheet of paper. [b]p10.[/b] Let $ABC$ be an equilateral triangle, and let $D$ be a point inside $ABC$. Let $E$ be a point such that $ADE$ is an equilateral triangle and suppose that segments $DE$ and $AB$ intersect at point $F$. Given that $\angle CAD = 15^o$, compute $\angle DFB$ in degrees. [b]p11.[/b] A palindrome is a number that reads the same forwards and backwards; for example, $1221$ is a palindrome. An almost-palindrome is a number that is not a palindrome but whose first and last digits are equal; for example, $1231$ and $1311$ are an almost-palindromes, but $1221$ is not. Compute the number of $4$-digit almost-palindromes. [b]p12.[/b] Determine the smallest positive integer $n$ such that the sum of the digits of $11^n$ is not $2^n$. [b]p13.[/b] Determine the minimum number of breaks needed to divide an $8\times 4$ bar of chocolate into $1\times 1 $pieces. (When a bar is broken into pieces, it is permitted to rotate some of the pieces, stack some of the pieces, and break any set of pieces along a vertical plane simultaneously.) [b]p14.[/b] A particle starts moving on the number line at a time $t = 0$. Its position on the number line, as a function of time, is $$x = (t-2012)^2 -2012(t-2012)-2013.$$ Find the number of positive integer values of $t$ at which time the particle lies in the negative half of the number line (strictly to the left of $0$). [b]p15.[/b] Let $A$ be a vertex of a unit cube and let $B$,$C$, and $D$ be the vertices adjacent to A. The tetrahedron $ABCD$ is cut off the cube. Determine the surface area of the remaining solid. [b]p16.[/b] In equilateral triangle $ABC$, points $P$ and $R$ lie on segment $AB$, points $I$ and $M$ lie on segment $BC$, and points $E$ and $S$ lie on segment $CA$ such that $PRIMES$ is a equiangular hexagon. Given that $AB = 11$, $PS = 2$, $RI = 3$, and $ME = 5$, compute the area of hexagon $PRIMES$. [b]p17.[/b] Find the smallest odd positive integer with an odd number of positive integer factors, an odd number of distinct prime factors, and an odd number of perfect square factors. [b]p18.[/b] Fresh Mann thinks that the expressions $2\sqrt{x^2 -4} $and $2(\sqrt{x^2} -\sqrt4)$ are equivalent to each other, but the two expressions are not equal to each other for most real numbers $x$. Find all real numbers $x$ such that $2\sqrt{x^2 -4} = 2(\sqrt{x^2} -\sqrt4)$. [b]p19.[/b] Let $m$ be the positive integer such that a $3 \times 3$ chessboard can be tiled by at most $m$ pairwise incongruent rectangles with integer side lengths. If rotations and reflections of tilings are considered distinct, suppose that there are $n$ ways to tile the chessboard with $m$ pairwise incongruent rectangles with integer side lengths. Find the product $mn$. [b]p20.[/b] Let $ABC$ be a triangle with $AB = 4$, $BC = 5$, and $CA = 6$. A triangle $XY Z$ is said to be friendly if it intersects triangle $ABC$ and it is a translation of triangle $ABC$. Let $S$ be the set of points in the plane that are inside some friendly triangle. Compute the ratio of the area of $S$ to the area of triangle $ABC$. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

The monetary unit of a certain country is called Reo, and all the coins circulating are integers values of Reos. In a group of three people, each one has 60 Reos in coins (but we don't know what kind of coins each one has). Each of the three people can pay each other any integer value between 1 and 15 Reos, including, perhaps with change. Show that the three persons together can pay exactly (without change) any integer value between 45 and 135 Reos, inclusive.

Let $S$ be a set of $n$ elements and $S_1,\ S_2,\dots,\ S_k$ are subsets of $S$ ($k\geq2$), such that every one of them has at least $r$ elements. Show that there exists $i$ and $j$, with $1\leq{i}<j\leq{k}$, such that the number of common elements of $S_i$ and $S_j$ is greater or equal to: $r-\frac{nk}{4(k-1)}$

Determine the largest integer $k(n)$ with the following properties: There exist $k(n)$ different subsets of a given set with $n$ elements such that each two of them have a non-empty intersection.

In a school there is a person with $l$ friends for all $1 \leq l \leq 99$. If there is no trio of students in this school, all three of whom are friends with each other, what is the minimum number of students in the school?

On each day of their tour of the West Indies, Sourav and Srinath have either an apple or an orange for breakfast. Sourav has oranges for the first $m$ days, apples for the next $m$ days, followed by oranges for the next $m$ days, and so on. Srinath has oranges for the first $n$ days, apples for the next $n$ days, followed by oranges for the next $n$ days, and so on. If $\gcd(m,n)=1$, and if the tour lasted for $mn$ days, on how many days did they eat the same kind of fruit?

There are $n>1$ cities in the country, some pairs of cities linked two-way through straight flight. For every pair of cities there is exactly one aviaroute (can have interchanges). Major of every city X counted amount of such numberings of all cities from $1$ to $n$ , such that on every aviaroute with the beginning in X, numbers of cities are in ascending order. Every major, except one, noticed that results of counting are multiple of $2016$. Prove, that result of last major is multiple of $2016$ too.

Find the number of positive integers less than $2019$ that are neither multiples of $3$ nor have any digits that are multiples of $3$.

(a) Alenka has two jars, each with $6$ marbles labeled with numbers $1$ through $6$. She draws one marble from each jar at random. Denote by $p_n$ the probability that the sum of the labels of the two drawn marbles is $n$. Compute pn for each $n \in N$. (b) Barbara has two jars, each with $6$ marbles which are labeled with unknown numbers. The sets of labels in the two jars may differ and two marbles in the same jar can have the same label. If she draws one marble from each jar at random, the probability that the sum of the labels of the drawn marbles is $n$ equals the probability $p_n$ in Alenka’s case. Determine the labels of the marbles. Find all solution

Show that there doesn't exist two infinite and separate sets $A,B$ of points such that [b](i)[/b] There are no three collinear points in $A \cup B$, [b](ii)[/b] The distance between every two points in $A \cup B$ is at least $1$, and [b](iii)[/b] There exists at least one point belonging to set $B$ in interior of each triangle which all of its vertices are chosen from the set $A$, and there exists at least one point belonging to set $A$ in interior of each triangle which all of its vertices are chosen from the set $B$.

Given two distinct numbers $ b_1$ and $ b_2$, their product can be formed in two ways: $ b_1 \times b_2$ and $ b_2 \times b_1.$ Given three distinct numbers, $ b_1, b_2, b_3,$ their product can be formed in twelve ways: $ b_1\times(b_2 \times b_3);$ $ (b_1 \times b_2) \times b_3;$ $ b_1 \times (b_3 \times b_2);$ $ (b_1 \times b_3) \times b_2;$ $ b_2 \times (b_1 \times b_3);$ $ (b_2 \times b_1) \times b_3;$ $ b_2 \times(b_3 \times b_1);$ $ (b_2 \times b_3)\times b_1;$ $ b_3 \times(b_1 \times b_2);$ $ (b_3 \times b_1)\times b_2;$ $ b_3 \times(b_2 \times b_1);$ $ (b_3 \times b_2) \times b_1.$ In how many ways can the product of $ n$ distinct letters be formed?

Let $A_1B_1C_1D_1E_1$ be a regular pentagon.For $ 2 \le n \le 11$, let $A_nB_nC_nD_nE_n$ be the pentagon whose vertices are the midpoint of the sides $A_{n-1}B_{n-1}C_{n-1}D_{n-1}E_{n-1}$. All the $5$ vertices of each of the $11$ pentagons are arbitrarily coloured red or blue. Prove that four points among these $55$ points have the same colour and form the vertices of a cyclic quadrilateral.

A black unit equilateral triangle is drawn on the plane. How can we place nine tiles, each a unit equilateral triangle, on the plane so that they do not overlap, and each tile covers at least one interior point of the black triangle? (Folklore)

There are $100$ apparently identical coins, where at least one of them is counterfeit . The real ones coins are of equal weight and counterfeit coins are also of equal weight, but lighter than the real ones. Explain how the number of counterfeit coins can be found, using a pan balance, at most $51$ times.

Let $m,n \geqslant 2$ be integers, let $X$ be a set with $n$ elements, and let $X_1,X_2,\ldots,X_m$ be pairwise distinct non-empty, not necessary disjoint subset of $X$. A function $f \colon X \to \{1,2,\ldots,n+1\}$ is called [i]nice[/i] if there exists an index $k$ such that \[\sum_{x \in X_k} f(x)>\sum_{x \in X_i} f(x) \quad \text{for all } i \ne k.\] Prove that the number of nice functions is at least $n^n$.

Find all positive integers $n$ for which all positive divisors of $n$ can be put into the cells of a rectangular table under the following constraints: [list] [*]each cell contains a distinct divisor; [*]the sums of all rows are equal; and [*]the sums of all columns are equal. [/list]

[color=blue][size=150]PERU TST IMO - 2006[/size] Saturday, may 20.[/color] [b]Question 03[/b] In each square of a board drawn into squares of $2^n$ rows and $n$ columns $(n\geq 1)$ are written a 1 or a -1, in such a way that the rows of the board constitute all the possible sequences of length $n$ that they are possible to be formed with numbers 1 and -1. Next, some of the numbers are replaced by zeros. Prove that it is possible to choose some of the rows of the board (It could be a row only) so that in the chosen rows, is fulfilled that the sum of the numbers in each column is zero. ---- [url=http://www.mathlinks.ro/Forum/viewtopic.php?t=88511]Spanish version[/url] $\text{\LaTeX}{}$ed by carlosbr

Let $X$ be a $5\times 5$ matrix with each entry be $0$ or $1$. Let $x_{i,j}$ be the $(i,j)$-th entry of $X$ ($i,j=1,2,\hdots,5$). Consider all the $24$ ordered sequence in the rows, columns and diagonals of $X$ in the following: \begin{align*} &(x_{i,1}, x_{i,2},\hdots,x_{i,5}),\ (x_{i,5},x_{i,4},\hdots,x_{i,1}),\ (i=1,2,\hdots,5) \\ &(x_{1,j}, x_{2,j},\hdots,x_{5,j}),\ (x_{5,j},x_{4,j},\hdots,x_{1,j}),\ (j=1,2,\hdots,5) \\ &(x_{1,1},x_{2,2},\hdots,x_{5,5}),\ (x_{5,5},x_{4,4},\hdots,x_{1,1}) \\ &(x_{1,5},x_{2,4},\hdots,x_{5,1}),\ (x_{5,1},x_{4,2},\hdots,x_{1,5}) \end{align*} Suppose that all of the sequences are different. Find all the possible values of the sum of all entries in $X$.

For all natural $n$, an $n$-staircase is a figure consisting of unit squares, with one square in the first row, two squares in the second row, and so on, up to $n$ squares in the $n^{th}$ row, such that all the left-most squares in each row are aligned vertically. Let $f(n)$ denote the minimum number of square tiles requires to tile the $n$-staircase, where the side lengths of the square tiles can be any natural number. e.g. $f(2)=3$ and $f(4)=7$. (a) Find all $n$ such that $f(n)=n$. (b) Find all $n$ such that $f(n) = n+1$.

The origami club meets once a week at a fixed time, but this week, the club had to reschedule the meeting to a different time during the same day. However, the room that they usually meet has $5$ available time slots, one of which is the original time the origami club meets. If at any given time slot, there is a $30$ percent chance the room is not available, what is the probability the origami club will be able to meet at that day?

The game Battleship is played on a $10\times10$ grid. A [i]fleet[/i] consists of 10 ships: one occupying $4$ cells, two occupying $3$ cells each, three occupying $2$ cells each and four occupying $1$ cell each (see figure). [asy] size(10cm); // Function to draw a square centered at a given position void drawSquare(pair center, real sideLength) { real halfSide = sideLength / 2; draw(shift(center) * box((-halfSide, -halfSide), (halfSide, halfSide))); } // Side length of each square real sideLength = 1; // Coordinates for the squares pair[] positions = { // Top row remains the same (0, 0), (1, 0), (3, 0), (4, 0), (6, 0), (7, 0), (9, 0), (11, 0), (13, 0), (15, 0), // Bottom row moved one square (1 unit) to the right (2, 2), (3, 2), (4, 2), (5, 2), (7, 2), (8, 2), (9, 2), (11, 2), (12, 2), (13, 2) }; // Draw all squares for (pair pos : positions) { drawSquare(pos, sideLength); } [/asy] Ships can be placed either horizontally or vertically, but they must not touch each other, not even at a vertex. Is it possible to place two fleets on the same board according to these rules?

We are given a set $S=\{z_1,z_2,\cdots ,z_{1993}\}$, where $z_1,z_2,\cdots ,z_{1993}$ are nonzero complex numbers (also viewed as nonzero vectors in the plane). Prove that we can divide $S$ into some groups such that the following conditions are satisfied: (1) Each element in $S$ belongs and only belongs to one group; (2) For any group $p$, if we use $T(p)$ to denote the sum of all memebers in $p$, then for any memeber $z_i (1\le i \le 1993)$ of $p$, the angle between $z_i$ and $T(p)$ does not exceed $90^{\circ}$; (3) For any two groups $p$ and $q$, the angle between $T(p)$ and $T(q)$ exceeds $90^{\circ}$ (use the notation introduced in (2)).

1. Every square of a $8 \times 8$ board is filled with a positive integer, such that the following condition holds: if a chess knight can move from some square to another then the ratio of numbers from these two squares is a prime number. Is it possible that some square is filled with 5 , and another one with 6 ? Egor Bakaev

In an art museum, $n$ paintings are exhibited, where $n \geq 33.$ In total, $15$ colors are used for these paintings such that any two paintings have at least one common color, and no two paintings have exactly the same colors. Determine all possible values of $n \geq 33$ such that regardless of how we color the paintings with the given properties, we can choose four distinct paintings, which we can label as $T_1, T_2, T_3,$ and $T_4,$ such that any color that is used in both $T_1$ and $T_2$ can also be found in either $T_3$ or $T_4$.

Consider the numbers $ a_n=1-\binom{n}{3} +\binom{n}{6} -\cdots, b_n= -\binom{n}{1} +\binom{n}{4}-\binom{n}{7} +\cdots $ and $ c_n=\binom{n}{2} -\binom{n}{5} +\binom{n}{8} -\cdots , $ for a natural number $ n\ge 2. $ Prove that $$ a_n^2+b_n^2+c_n^2-a_nb_n-b_nc_n-c_na_n =3^{n-1}. $$