For $n$ an odd positive integer, the unit squares of an $n\times n$ chessboard are coloured alternately black and white, with the four corners coloured black. A it tromino is an $L$-shape formed by three connected unit squares. For which values of $n$ is it possible to cover all the black squares with non-overlapping trominos? When it is possible, what is the minimum number of trominos needed?

Let $n$ be a positive integer. Two players $A$ and $B$ play a game in which they take turns choosing positive integers $k \le n$. The rules of the game are: (i) A player cannot choose a number that has been chosen by either player on any previous turn. (ii) A player cannot choose a number consecutive to any of those the player has already chosen on any previous turn. (iii) The game is a draw if all numbers have been chosen; otherwise the player who cannot choose a number anymore loses the game. The player $A$ takes the first turn. Determine the outcome of the game, assuming that both players use optimal strategies. [i]Proposed by Finland[/i]

Consider a $1 \times n$ rectangle and some tiles of size $1 \times 1$ of four different colours. The rectangle is tiled in such a way that no two neighboring square tiles have the same colour. a) Find the number of distinct symmetrical tilings. b) Find the number of tilings such that any consecutive square tiles have distinct colours.

Given a string of length $2n$, we perform the following operation: [list] [*]Place all the even indexed positions together, and then all the odd indexed positions next. Indexing is done starting from $0$.[/*] [/list] For example, say our string is ``abcdef''. Performing our operation yields ``abcdef'' $\to$ ``acebdf''. Performing the operation again yields ``acebdf'' $\to$ ``aedcbf''. Doing this repeatedly, we have:\\ ``abcdef'' $\to$ ``acebdf'' $\to$ ``aedcbf'' $\to$ ``adbecf'' $\to$ ``abcdef''.\\\\ You can assume that the characters in the string will be unique. It can be shown that, by performing the above operation a finite number of times we can get back our original string.\\\\ Given $n$, you have to determine the minimum number of times the operation must be performed to get our original string of length $2n$ back.\\\\ In the example given above, $2n = 6$. The minimum steps required is $4$.

[u]Set 3[/u] [b]3.1[/b] Find the number of distinct values that can be made by inserting parentheses into the expression $$1\,\,\,\,\, - \,\,\,\,\, 1 \,\,\,\,\, -\,\,\,\,\, 1 \,\,\,\,\, - \,\,\,\,\, 1 \,\,\,\,\, - \,\,\,\,\, 1\,\,\,\,\, - \,\,\,\,\, 1$$ such that you don’t introduce any multiplication. For example, $(1-1)-((1-1)-1-1)$ is a valid way to insert parentheses, but $1 - 1(-1 - 1) - 1 - 1$ is not. [b]3.2[/b] Let $T$ be the answer from the previous problem. Katie rolls T fair 4-sided dice with faces labeled $0-3$. Considering all possible sums of these rolls, there are two sums that have the highest probability of occurring. Find the smaller of these two sums. [b]3.3[/b] Let $T$ be the answer from the previous problem. Amy has a fair coin that she will repeatedly flip until her total number of heads is strictly greater than her total number of tails. Find the probability she will flip the coin exactly T times. (Hint: Finding a general formula in terms of T is hard, try solving some small cases while you wait for $T$.) PS. You should use hide for answers.

For two real numbers $ a$, $ b$, with $ ab\neq 1$, define the $ \ast$ operation by \[ a\ast b=\frac{a+b-2ab}{1-ab}.\] Start with a list of $ n\geq 2$ real numbers whose entries $ x$ all satisfy $ 0<x<1$. Select any two numbers $ a$ and $ b$ in the list; remove them and put the number $ a\ast b$ at the end of the list, thereby reducing its length by one. Repeat this procedure until a single number remains. $ a.$ Prove that this single number is the same regardless of the choice of pair at each stage. $ b.$ Suppose that the condition on the numbers $ x$ is weakened to $ 0<x\leq 1$. What happens if the list contains exactly one $ 1$?

Consider a convex polyhedron $P$ with vertices $V_1,\ldots ,V_p$. The distinct vertices $V_i$ and $V_j$ are called [i]neighbours[/i] if they belong to the same face of the polyhedron. To each vertex $V_k$ we assign a number $v_k(0)$, and construct inductively the sequence $v_k(n)\ (n\ge 0)$ as follows: $v_k(n+1)$ is the average of the $v_j(n)$ for all neighbours $V_j$ of $V_k$ . If all numbers $v_k(n)$ are integers, prove that there exists the positive integer $N$ such that all $v_k(n)$ are equal for $n\ge N$ .

Prove that for any natural number $n$ the following inequality holds $$4^n < (2n+1)C_{2n}^n$$

A cube with edge length $3$ is divided into $27$ unit cubes. The numbers $1, 2,\ldots ,27$ are distributed arbitrarily over the unit cubes, with one number in each cube. We form the $27$ possible row sums (there are nine such sums of three integers for each of the three directions parallel with the edges of the cube). At most how many of the $27$ row sums can be odd?

Given a square with side $10$. Cut it into $100$ congruent quadrilaterals such that each of them is inscribed into a circle with diameter $\sqrt{3}$. [i](5 points)[/i] [i]Ilya Bogdanov[/i]

Each one of $2001$ children chooses a positive integer and writes down his number and names of some of other $2000$ children to his notebook. Let $A_c$ be the sum of the numbers chosen by the children who appeared in the notebook of the child $c$. Let $B_c$ be the sum of the numbers chosen by the children who wrote the name of the child $c$ into their notebooks. The number $N_c = A_c - B_c$ is assigned to the child $c$. Determine whether all of the numbers assigned to the children could be positive.

A set of identical square tiles with side length $1$ is placed on a (very large) floor. Every tile after the first shares an entire edge with at least one tile that has already been placed. - What is the largest possible perimeter for a figure made of $10$ tiles? - What is the smallest possible perimeter for a figure made of $10$ tiles? - What is the largest possible perimeter for a figure made of $2011$ tiles? - What is the smallest possible perimeter for a figure made of $2011$ tiles? Prove that your answers are correct.

On the plane are chosen six points. Prove that the ratio of the longest distance between two points to the shortest is at least $\sqrt3$.

Consider a set of $n$ points in plane. Prove that the number of isosceles triangles having their vertices among these $n$ points is $\mathcal O (n^{\frac{7}{3}})$. Find a configuration of $n$ points in plane such that the number of equilateral triangles with vertices among these $n$ points is $\Omega (n^2)$.

In a tennis tournament there are participants from $n$ different countries. Each team consists of a coach and a player whom should settle in a hotel. The rooms considered for the settlement of coaches are different from players' ones. Each player wants to be in a room whose roommates are [b][u]all[/u][/b] from countries which have a defense agreement with the player's country. Conversely, each coach wants to be in a room whose roommates are [b][u]all[/u][/b] from countries which don't have a defense agreement with the coach's country. Find the minimum number of the rooms such that we can [u][b]always[/b][/u] grant everyone's desire. [i]proposed by Seyed Reza Hosseini and Mohammad Amin Ghiasi[/i]

Initially, one of the two boxes on the table is empty and the other contains $29$ different colored marbles. By starting with the full box and performing moves in order, in each move, one or more marbles are selected from that box and transferred to the other box. At most, how many moves can be made without selecting the same set of marbles more than once?

A point $(x,y)$ is a [i]lattice point[/i] if $x,y\in\Bbb Z$. Let $E=\{(x,y):x,y\in\Bbb Z\}$. In the coordinate plane, $P$ and $Q$ are both sets of points in and on the boundary of a convex polygon with vertices on lattice points. Let $T=P\cap Q$. Prove that if $T\ne\emptyset$ and $T\cap E=\emptyset$, then $T$ is a non-degenerate convex quadrilateral region.

For any integer $n\ge 2$, let $N(n)$ be the maximum number of triples $(a_j,b_j,c_j),j=1,2,3,\cdots ,N(n),$ consisting of non-negative integers $a_j,b_j,c_j$ (not necessarily distinct) such that the following two conditions are satisfied: (a) $a_j+b_j+c_j=n,$ for all $j=1,2,3,\cdots N(n)$; (b) $j\neq k$, then $a_j\neq a_k$, $b_j\neq b_k$ and $c_j\neq c_k$. Determine $N(n)$ for all $n\ge 2$.

There are 5 points on plane. Prove that you can chose some of them and shift them such that distances between shifted points won't change and as a result there will be symetric by some line set of 5 points.

Kamil wrote on a board an expression consisting of alternating addition and subtraction of natural numbers from $1$ to $100$: \[1-2+3-4+5-6+\ldots-98+99-100.\] Then, Kamil erased one of the plus or minus signs and replaced it with an equals sign, obtaining a true equality. Which number preceded the erased sign? Find all possibilities and justify your answer.

Let $ t(n)$ for $ n \equal{} 3, 4, 5, \ldots,$ represent the number of distinct, incongruent, integer-sided triangles whose perimeter is $ n;$ e.g., $ t(3) \equal{} 1.$ Prove that \[ t(2n\minus{}1) \minus{} t(2n) \equal{} \left[ \frac{6}{n} \right] \text{ or } \left[ \frac{6}{n} \plus{} 1 \right].\]

A sequence of moves is performed starting on the three letter string "$BAD.$'' A move consists of inserting an additional instance of the three letter string "$BAD$'' between any two consecutive letters of the current string, to achieve an elongated string. After $n$ moves, how many distinct possible strings of length $3n+3$ can be achieved? For example, after one move the strings "$BBADAD$'' and "$BABADD$'' are achievable. [i]Proposed by squareman (Evan Chang), USA[/i]

[u]Round 5[/u] [b]p13.[/b] In coordinate space, a lattice point is a point all of whose coordinates are integers. The lattice points $(x, y, z)$ in three-dimensional space satisfying $0 \le x, y, z \le 5$ are colored in n colors such that any two points that are $\sqrt3$ units apart have different colors. Determine the minimum possible value of $n$. [b]p14.[/b] Determine the number of ways to express $121$ as a sum of strictly increasing positive Fibonacci numbers. [b]p15.[/b] Let $ABCD$ be a rectangle with $AB = 7$ and $BC = 15$. Equilateral triangles $ABP$, $BCQ$, $CDR$, and $DAS$ are constructed outside the rectangle. Compute the area of quadrilateral $P QRS$. [u] Round 6[/u] Each of the three problems in this round depends on the answer to one of the other problems. There is only one set of correct answers to these problems; however, each problem will be scored independently, regardless of whether the answers to the other problems are correct. [b]p16.[/b] Let $C$ be the answer to problem $18$. Suppose that $x$ and $y$ are real numbers with $y > 0$ and $$x + y = C$$ $$x +\frac{1}{y} = -2.$$ Compute $y +\frac{1}{y}$. [b]p17.[/b] Let $A$ be the answer to problem $16$. Let $P QR$ be a triangle with $\angle P QR = 90^o$, and let $X$ be the foot of the perpendicular from point $Q$ to segment $P R$. Given that $QX = A$, determine the minimum possible area of triangle $PQR$. [b]p18.[/b] Let $B$ be the answer to problem $17$ and let $K = 36B$. Alice, Betty, and Charlize are identical triplets, only distinguishable by their hats. Every day, two of them decide to exchange hats. Given that they each have their own hat today, compute the probability that Alice will have her own hat in $K$ days. [u]Round 7[/u] [b]p19.[/b] Find the number of positive integers a such that all roots of $x^2 + ax + 100$ are real and the sum of their squares is at most $2013$. [b]p20.[/b] Determine all values of $k$ such that the system of equations $$y = x^2 - kx + 1$$ $$x = y^2 - ky + 1$$ has a real solution. [b]p21.[/b] Determine the minimum number of cuts needed to divide an $11 \times 5 \times 3$ block of chocolate into $1\times 1\times 1$ pieces. (When a block 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.) [u]Round 8[/u] [b]p22.[/b] A sequence that contains the numbers $1, 2, 3, ... , n$ exactly once each is said to be a permutation of length $n$. A permutation $w_1w_2w_3... w_n$ is said to be sad if there are indices $i < j < k$ such that $w_j > w_k$ and $w_j > w_i$. For example, the permutation $3142756$ is sad because $7 > 6$ and $7 > 1$. Compute the number of permutations of length $11$ that are not sad. [b]p23.[/b] Let $ABC$ be a triangle with $AB = 39$, $BC = 56$, and $CA = 35$. Compute $\angle CAB - \angle ABC$ in degrees. [b]p24.[/b] On a strange planet, there are $n$ cities. Between any pair of cities, there can either be a one-way road, two one-way roads in different directions, or no road at all. Every city has a name, and at the source of every one-way road, there is a signpost with the name of the destination city. In addition, the one-way roads only intersect at cities, but there can be bridges to prevent intersections at non-cities. Fresh Mann has been abducted by one of the aliens, but Sophy Moore knows that he is in Rome, a city that has no roads leading out of it. Also, there is a direct one-way road leading from each other city to Rome. However, Rome is the secret police’s name for the so-described city; its official name, the name appearing on the labels of the one-way roads, is unknown to Sophy Moore. Sophy Moore is currently in Athens and she wants to head to Rome in order to rescue Fresh Mann, but she does not know the value of $n$. Assuming that she tries to minimize the number of roads on which she needs to travel, determine the maximum possible number of roads that she could be forced to travel in order to find Rome. Express your answer as a function of $n$. PS. You should use hide for answers. Rounds 1-4 have been posted [url=https://artofproblemsolving.com/community/c4h2809419p24782489]here[/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

A regular polygon with $20$ vertices is given. Alice colors each vertex in one of two colors. Bob then draws a diagonal connecting two opposite vertices. Now Bob draws perpendicular segments to this diagonal, each segment having vertices of the same color as endpoints. He gets a fish from Alice for each such segment he draws. How many fish can Bob guarantee getting, no matter Alice's goodwill?

We are going to colour the cells of a $2015 \times 2015$ board such that there are none of the following: $1)$ Three cells with the same colour where two of them are in the same column, and the third is in the same row and to the right of the upper cell, $2)$ Three cells with the same colour where two of them are in the same column, and the third is in the same row and to the left of the lower cell. What is the minimum number of colours $k$ required to make such a colouring possible?