Let $S$ be a square with sides length $100$. Let $L$ be a path within $S$ which does not meet itself and which is composed of line segments $A_0A_1,A_1A_2,A_2A_3,\ldots,A_{n-1}A_n$ with $A_0=A_n$. Suppose that for every point $P$ on the boundary of $S$ there is a point of $L$ at a distance from $P$ no greater than $\frac {1} {2}$. Prove that there are two points $X$ and $Y$ of $L$ such that the distance between $X$ and $Y$ is not greater than $1$ and the length of the part of $L$ which lies between $X$ and $Y$ is not smaller than $198$.

Let $ S$ be a set with $ n$ elements, and $ F$ be a family of subsets of $ S$ with $ 2^{n\minus{}1}$ elements, such that for each $ A,B,C\in F$, $ A\cap B\cap C$ is not empty. Prove that the intersection of all of the elements of $ F$ is not empty.

A merida path of order $2n$ is a lattice path in the first quadrant of $xy$- plane joining $(0,0)$ to $(2n,0)$ using three kinds of steps $U=(1,1)$, $D= (1,-1)$ and $L= (2,0)$, i.e. $U$ joins $x,y)$ to $(x+1,y+1)$ etc... An ascent in a merida path is a maximal string of consecutive steps of the form $U$. If $S(n,k)$ denotes the number of merdia paths of order $2n$ with exactly $k$ ascents, compute $S(n,1)$ and $S(n,n-1)$.

A design $X$ is an array of the digits $1,2,..., 9$ in the shape of an $X$, for example, [img]https://cdn.artofproblemsolving.com/attachments/8/e/d371a2cd442cb7a8784e1cc7635344df722e20.png[/img] We will say that a design $X$ is [i]balanced [/i] if the sum of the numbers of each of the diagonals match. Determine the number of designs $X$ that are balanced.

A regular $n$-gon is inscribed in a circle radius $1$. Let $X$ be the set of all arcs $PQ$, where $P, Q$ are distinct vertices of the $n$-gon. $5$ elements $L_1, L_2, ... , L_5$ of $X$ are chosen at random (so two or more of the $L_i$ can be the same). Show that the expected length of $L_1 \cap L_2 \cap L_3 \cap L_4 \cap L_5$ is independent of $n$.

For a set $ P$ of five points in the plane, no three of them being collinear, let $ s(P)$ be the numbers of acute triangles formed by vertices in $ P$. Find the maximum value of $ s(P)$ over all such sets $ P$.

On the cartesian plane we draw circunferences of radii 1/20 centred in each lattice point. Show that any circunference of radii 100 in the cartesian plane intersect at least one of the small circunferences.

[b]p1.[/b] Let $2^k$ be the largest power of $2$ dividing $30! = 30 \cdot 29 \cdot 28 ... 2 \cdot 1$. Find $k$. [b]p2.[/b] Let $d(n)$ be the total number of digits needed to write all the numbers from $1$ to $n$ in base $10$, for example, $d(5) = 5$ and $d(20) = 31$. Find $d(2012)$. [b]p3.[/b] Jim and TongTong play a game. Jim flips $10$ coins and TongTong flips $11$ coins, whoever gets the most heads wins. If they get the same number of heads, there is a tie. What is the probability that TongTong wins? [b]p4.[/b] There are a certain number of potatoes in a pile. When separated into mounds of three, two remain. When divided into mounds of four, three remain. When divided into mounds of five, one remain. It is clear there are at least $150$ potatoes in the pile. What is the least number of potatoes there can be in the pile? [b]p5.[/b] Call an ordered triple of sets $(A, B, C)$ nice if $|A \cap B| = |B \cap C| = |C \cap A| = 2$ and $|A \cap B \cap C| = 0$. How many ordered triples of subsets of $\{1, 2, · · · , 9\}$ are nice? [b]p6.[/b] Brett has an $ n \times n \times n$ cube (where $n$ is an integer) which he dips into blue paint. He then cuts the cube into a bunch of $ 1 \times 1 \times 1$ cubes, and notices that the number of un-painted cubes (which is positive) evenly divides the number of painted cubes. What is the largest possible side length of Brett’s original cube? Note that $\lfloor x\rfloor$ denotes the largest integer less than or equal to $x$. [b]p7.[/b] Choose two real numbers $x$ and $y$ uniformly at random from the interval $[0, 1]$. What is the probability that $x$ is closer to $1/4$ than $y$ is to $1/2$? [b]p8. [/b] In triangle $ABC$, we have $\angle BAC = 20^o$ and $AB = AC$. $D$ is a point on segment $AB$ such that $AD = BC$. What is $\angle ADC$, in degree. [b]p9.[/b] Let $a, b, c, d$ be real numbers such that $ab + c + d = 2012$, $bc + d + a = 2010$, $cd + a + b = 2013$, $da + b + c = 2009$. Find $d$. [b]p10. [/b]Let $\theta \in [0, 2\pi)$ such that $\cos \theta = 2/3$. Find $\sum_{n=0}^{\infty}\frac{1}{2^n}\cos(n \theta)$ PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $m$ and $n$ be fixed positive integers. Tsvety and Freyja play a game on an infinite grid of unit square cells. Tsvety has secretly written a real number inside of each cell so that the sum of the numbers within every rectangle of size either $m$ by $n$ or $n$ by $m$ is zero. Freyja wants to learn all of these numbers. One by one, Freyja asks Tsvety about some cell in the grid, and Tsvety truthfully reveals what number is written in it. Freyja wins if, at any point, Freyja can simultaneously deduce the number written in every cell of the entire infinite grid (If this never occurs, Freyja has lost the game and Tsvety wins). In terms of $m$ and $n$, find the smallest number of questions that Freyja must ask to win, or show that no finite number of questions suffice. [i]Nikolai Beluhov[/i]

Prove that the numbers from $1$ to $16$ can be written in a line, but cannot be written in a circle so that the sum of any two adjacent numbers is square of a natural number.

A $10\times10\times10$ cube has $1000$ unit cubes. $500$ of them are coloured black and $500$ of them are coloured white. Show that there are at least $100$ unit squares, being the common face of a white and a black unit cube.

(a) Prove that if 3n stars are placed in $3n$ cells of a $2n \times 2n$ array, then it is possible to remove $n$ rows and $n$ columns in such away that all stars will be removed . (b) Prove that it is possible to place $3n + 1$ stars in the cells of a $2n \times 2n$ array in such a way that after removing any $n$ rows and $n$ columns at least one star remains. (K . P. Kohas, Leningrad)

12 points are located on a clock with the sme distance , numbers $1,2,3 , ... 12$ are marked on each point in clockwise order . Use 4 kinds of colors (red,yellow,blue,green) to colour the the points , each kind of color has 3 points . N ow , use these 12 points as the vertex of convex quadrilateral to construct $n$ convex quadrilaterals . They satisfies the following conditions: (1). the colours of vertex of every convex quadrilateral are different from each other . (2). for every 3 quadrilaterals among them , there exists a colour such that : the numbers on the 3 points painted into this colour are different from each other . Find the maximum $n$ .

For any given triangle $A_0B_0C_0$ consider a sequence of triangles constructed as follows: a new triangle $A_1B_1C_1$ (if any) has its sides (in cm) that equal to the angles of $A_0B_0C_0$ (in radians). Then for $\vartriangle A_1B_1C_1$ consider a new triangle $A_2B_2C_2$ (if any) constructed in the similar พay, i.e., $\vartriangle A_2B_2C_2$ has its sides (in cm) that equal to the angles of $A_1B_1C_1$ (in radians), and so on. Determine for which initial triangles $A_0B_0C_0$ the sequence never terminates.

Given two integers $ m,n$ satisfying $ 4 < m < n.$ Let $ A_{1}A_{2}\cdots A_{2n \plus{} 1}$ be a regular $ 2n\plus{}1$ polygon. Denote by $ P$ the set of its vertices. Find the number of convex $ m$ polygon whose vertices belongs to $ P$ and exactly has two acute angles.

For every integer $n \ge 2$ let $B_n$ denote the set of all binary $n$-nuples of zeroes and ones, and split $B_n$ into equivalence classes by letting two $n$-nuples be equivalent if one is obtained from the another by a cyclic permutation.(for example 110, 011 and 101 are equivalent). Determine the integers $n \ge 2$ for which $B_n$ splits into an odd number of equivalence classes.

[b]p1.[/b] Jack made $3$ quarts of fruit drink from orange and apple juice. His drink contains $45\%$ of orange juice. Nick prefers more orange juice in the drink. How much orange juice should he add to the drink to obtain a drink composed of $60\%$ of orange juice? [b]p2.[/b] A square is tiled by smaller squares as shown in the figure. Find the area of the black square in the middle if the perimeter of the big square $ABCD$ is $40$ cm. [img]https://cdn.artofproblemsolving.com/attachments/8/c/d54925cba07f63ec8578048f46e1e730cb8df3.png[/img] [b]p3.[/b] For one particular number $a > 0$ the function f satisfies the equality $f(x + a) =\frac{1 + f(x)}{1 - f(x)}$ for all $x$. Show that $f$ is a periodic function. (A function $f$ is periodic with the period $T$ if $f(x + T) = f(x)$ for any $x$.) [b]p4.[/b] If $a, b, c, x, y, z$ are numbers so that $\frac{x}{a}+\frac{y}{b}+\frac{z}{c}= 1$ and $\frac{a}{x}+\frac{b}{y}+\frac{c}{z}= 0$. Show that $\frac{x^2}{a^2} +\frac{y^2}{b^2} +\frac{z^2}{c^2} = 1$ [b]p5.[/b] Is it possible that a four-digit number $AABB$ is a perfect square? (Same letters denote the same digits). [b]p6.[/b] A finite number of arcs of a circle are painted black (see figure). The total length of these arcs is less than $\frac15$ of the circumference. Show that it is possible to inscribe a square in the circle so that all vertices of the square are in the unpainted portion of the circle. [img]https://cdn.artofproblemsolving.com/attachments/2/c/bdfa61917a47f3de5dd3684627792a9ebf05d5.png[/img] PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $A$ and $B$ be two non-infinite sets of natural numbers, each of which contains at least 3 elements. Two numbers $a\in A$ and $b\in B$ are called [i]"harmonious"[/i], if they are not coprime. It is known that each element from $A$ is not [i]harmonious[/i] with at least one element from $B$ and each element from $B$ is harmonious with at least one from $A$. Prove that there exist $a_1,a_2\in A$ and $b_1,b_2\in B$ such that $(a_1,b_1)$ and $(a_2,b_2)$ are [i]harmonious[/i] but $(a_1,b_2)$ and $(a_2,b_1)$ are not.

Consider a checkered $3m\times 3m$ square, where $m$ is an integer greater than $1.$ A frog sits on the lower left corner cell $S$ and wants to get to the upper right corner cell $F.$ The frog can hop from any cell to either the next cell to the right or the next cell upwards. Some cells can be [i]sticky[/i], and the frog gets trapped once it hops on such a cell. A set $X$ of cells is called [i]blocking[/i] if the frog cannot reach $F$ from $S$ when all the cells of $X$ are sticky. A blocking set is [i] minimal[/i] if it does not contain a smaller blocking set.[list=a][*]Prove that there exists a minimal blocking set containing at least $3m^2-3m$ cells. [*]Prove that every minimal blocking set containing at most $3m^2$ cells.

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]

There are $2008$ participants in a programming competition. In every round, all programmers are divided into two equal-sized teams. Find the minimal number of rounds after which there can be a situation in which every two programmers have been in different teams at least once.

In his bag, Salman has a number of stones. The weight of each stone is not greater than $0.5$ kg and the total weight of the stones is not greater than $2.5$ kg. Prove that Salman can divide his stones into $4$ groups, each group has a total weight not greater than $1$ kg Trần Nam Dũng

[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].

Given a finite sequence with terms in the set $A=\{0,1,…,121\}$ , it is allowed to replace each term by a number from the set $A$ so that like terms are replaced by like numbers, and different terms by different numbers. (Terms may remain without replacement.) The objective is to obtain, from a given sequence, through several such changes, a new sequence with sum divisible by $121$ . Show that it is possible to achieve the objective for every initial sequence. [hide=original wording]Dada una secuencia finita con términos en el conjunto A={0,1,…,121} , está permitido reemplazar cada término por un número del conjunto A de modo que términos iguales se reemplacen por números iguales, y términos distintos por números distintos. (Pueden quedar términos sin reemplazar.) El objetivo es obtener, a partir de una sucesión dada, mediante varios de tales cambios, una nueva sucesión con suma divisible por 121 . Demostrar que es posible lograr el objetivo para toda sucesión inicial.[/hide]

Given $3n$ cards, each of them will be written with a number from the following sequence: $$2, 3, ..., n, n + 1, n + 3, n + 4, ..., 2n + 1, 2n + 2, 2n + 4, ..., 3n + 3$$ with each number used exactly once. Then every card is arranged from left to right in random order. Determine the probability such that for every $i$ with $1\le i \le 3n$, the number written on the $i$-th card, counted from the left, is greater than or equal to $i$.