A magician wants to demonstrate the following trick to an audience of $n \ge 16$ people. He gives them $15$ hats and after giving instructions to his assistant (which the audience does not hear), leaves the hall. Some $15$ people in the audience put on one of the hats. The assistant tags in front of everyone, one of the hats with a marker and then the person with an unmarked hat takes it off. The magician then returns back to the hall and after surveying the situation, knows who in the audience has taken off his hat. For what $n$ is this possible? [hide=original wording]Магьосник иска да покаже следния фокус пред публика от $n \ge 16$ души. Той им дава $15$ шапки и след като даде инструкции на помощника си (които публиката не чува), напуска залата. Някои $15$ души от публиката си слагат по една от шапките. Асистентът маркира пред всички една от шапките с маркер и след това човек с немаркирана шапка си я сваля. След това магьосникът се връща обратно в залата и след оглед на ситуацията познава кой от публиката си е свалил шапката. За кои $n$ е възможно това?[/hide]

A set of $1989$ numbers is given. It is known that the sum of any $10$ of them is positive. Prove that the sum of all these numbers is positive. (Folklore)

[b]p1.[/b] Alex and Sam have a friend Pat, who is younger than they are. Alex, Sam and Pat all share a birthday. When Pat was born, Alex’s age times Sam’s age was $42$. Now Pat’s age is $33$ and Alex’s age is a prime number. How old is Sam now? Show your work and justify your answer. (All ages are whole numbers.) [b]p2.[/b] Let $ABCD$ be a square with side length $2$. The four sides of $ABCD$ are diameters of four semicircles, each of which lies inside the square. The set of all points which lie on or inside two of these semicircles is a four petaled flower. Find (with proof) the area of this flower. [img]https://cdn.artofproblemsolving.com/attachments/5/5/bc724b9f74c3470434c322020997a533986d33.png[/img] [b]p3.[/b] A prime number is called [i]strongly prime[/i] if every integer obtained by permuting its digits is also prime. For example $113$ is strongly prime, since $113$, $131$, and $311$ are all prime numbers. Prove that there is no strongly prime number such that each of the digits $1, 3, 7$, and $9$ appears at least once in its decimal representation. [b]p4.[/b] Suppose $n$ is a positive integer. Let an be the number of permutations of $1, 2, . . . , n$, where $i$ is not in the $i$-th position, for all $i$ with $1 \le i \le n$. For example $a_3 = 2$, where the two permutations that are counted are $231$, and $312$. Let bn be the number of permutations of $1, 2, . . . , n$, where no $i$ is followed by $i + 1$, for all $i$ with $1 \le i \le n - 1$. For example $b_3 = 3$, where the three permutations that are counted are $132$, $213$, and $321$. For every $n \ge 1$, find (with proof) a simple formula for $\frac{a_{n+1}}{b_n}$. Your formula should not involve summations. Use your formula to evaluate $\frac{a_{2020}}{b_{2019}}$. [b]p5.[/b] Let $n \ge 2$ be an integer and $a_1, a_2, ... , a_n$ be positive real numbers such that $a_1 + a_2 +... + a_n = 1$. Prove that $$\sum^n_{k=1}\frac{a_k}{1 + a_{k+1} - a_{k-1}}\ge 1.$$ (Here $a_0 = a_n$ and $a_{n+1} = a_1$.) PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $n > 1$ be an integer. A set $S \subseteq \{ 0, 1, 2, \cdots , 4n - 1 \}$ is called ’sparse’ if for any $k \in \{ 0, 1, 2, \cdots , n - 1 \}$ the following two conditions are satisfied: $(a)$ The set $S \cap \{4k - 2, 4k - 1, 4k, 4k + 1, 4k + 2 \}$ has at most two elements; $(b)$ The set $S \cap \{ 4k +1, 4k +2, 4k +3 \}$ has at most one element. Prove that there are exactly $8 \cdot 7^{n-1}$ sparse subsets.

In some cells of the table $10\times 10$ arranged several $X$'s and a few $O$'s. It is known that there is no line (row or column) completely filled with identical symbols (crosses or zeros). However, if in any empty If you place any icon in a cell, this condition will be violated. What is the minimum number of icons that can appear in a table?

$16$ progamers are playing in another single elimination tournament. Each round, each of the remaining progamers plays against another and the loser is eliminated. Additionally, each time a progamer wins, he will have a ceremony to celebrate. A player's rst ceremony is ten seconds long, and afterward each ceremony is ten seconds longer than the last. What is the total length in seconds of all the ceremonies over the entire tournament?

Find the smallest real number \(a\) such that for any positive integer number \(n > 2\) and any arrangement of the numbers from 1 to \(n\) on a circle, there exists a pair of adjacent numbers whose ratio (when dividing the larger number by the smaller one) is less than \(a\). [i]Proposed by Mykhailo Shtandenko[/i]

Show that a convex polyhedron with an odd number of faces has at least one face with an even number of edges.

Some time ago, on a radio program, a baker announced a special promotion in the purchase of two stuffed cakes. Each cake could contain up to five fillings of which had in the pastry. On the show, a lady said there were $1,048,576$ different possibilities to choose the two stuffed cakes. How many different fillings did the pastry chef have?

Is it possible to write a positive integer in every cell of an infinite chessboard, in such a manner that, for all positive integers $m, n$, the sum of numbers in every $m\times n$ rectangle is divisible by $m + n$ ?

An infinite triangular lattice is given, such that the distance between any two adjacent points is always equal to $1$. Points $A$, $B$, and $C$ are chosen on the lattice such that they are the vertices of an equilateral triangle of side length $L$, and the sides of $ABC$ contain no points from the lattice. Prove that, inside triangle $ABC$, there are exactly $\frac{L^2-1}{2}$ points from the lattice.

At least $ n - 1$ numbers are removed from the set $\{1, 2, \ldots, 2n - 1\}$ according to the following rules: (i) If $ a$ is removed, so is $ 2a$; (ii) If $ a$ and $ b$ are removed, so is $ a \plus{} b$. Find the way of removing numbers such that the sum of the remaining numbers is maximum possible.

One tiles a floor of $a \times b$ dm$^2$ with square tiles, $a,b \in N$. Tiles do not overlap, and sides of floor and tiles are parallel. Using tiles of $2\times 2$ dm$^2$ leaves the same amount of floor uncovered as using tiles of $4\times 4$ dm$^2$. Using $3\times 3$ dm$^2$ tiles leaves $29$ dm$^2$ floor uncovered. Determine $a$ and $b$.

In a particular European city, there are only $7$ day tickets and $30$ day tickets to the public transport. The former costs $7.03$ euro and the latter costs $30$ euro. Aina the Algebraist decides to buy at once those tickets that she can travel by the public transport the whole three year (2014-2016, 1096 days) visiting in the city. What is the cheapest solution?

Given an integer $n > 1$, consider words composed of $n$ letters $A$ and $n$ letters $B$. A word $X_1...X_{2n}$ is said to belong to set $R(n)$ (respectively, $S(n)$) if no initial segment (respectively, exactly one initial segment) $X_1...X_k$ with $1 \le k < 2n$ consists of equally many letters $A$ and $B$. If $r(n)$ and $s(n)$ denote the cardinalities of $R(n)$ and $S(n)$ respectively, compute $s(n)/r(n)$.

In a class of $ n\geq 4$ some students are friends. In this class any $ n \minus{} 1$ students can be seated in a round table such that every student is sitting next to a friend of him in both sides, but $ n$ students can not be seated in that way. Prove that the minimum value of $ n$ is $ 10$.

Prove that for any positive integer $n$, the least common multiple of the numbers $1,2,\ldots,n$ and the least common multiple of the numbers: \[\binom{n}{1},\binom{n}{2},\ldots,\binom{n}{n}\] are equal if and only if $n+1$ is a prime number. [i]Laurentiu Panaitopol[/i]

On an east-west shipping lane are ten ships sailing individually. The first five from the west are sailing eastwards while the other five ships are sailing westwards. They sail at the same constant speed at all times. Whenever two ships meet, each turns around and sails in the opposite direction. When all ships have returned to port, how many meetings of two ships have taken place?

There are 15 cities, and there is a train line between each pair operated by either the Carnegie Rail Corporation or the Mellon Transportation Company. A tourist wants to visit exactly three cities by travelling in a loop, all by travelling on one line. What is the minimum number of such 3-city loops?

In a certain language there are only two letters, $A$ and $B$. The words of this language obey the following rules: (i) The only word of length $1$ is $A$; (ii) A sequence of letters $X_1X_2...X_{n+1}$, where $X_i\in \{A,B\}$ for each $i$, forms a word of length $n+1$ if and only if it contains at least one letter $A$ and is not of the form $WA$ for a word $W$ of length $n$. Show that the number of words consisting of $1998 A$’s and $1998 B$’s and not beginning with $AA$ equals $\binom{3995}{1997}-1$

$n$ people sitting at a round table. In the beginning, everyone writes down a positive number $n$ on piece of paper in front of them. From now on, in every minute, they write down the number that they get if they subtract the number of their right-hand neighbour from their own number. They write down the new number and erase the original. Give those number $n$ that there exists an integer $k$ in a way that regardless of the starting numbers, after $k$ minutes, everyone will have a number that is divisible by $n$.

Is it possible to arrange the chips in the cells of an $8 \times 8$ board so that in any two columns the number of chips is the same, and in any two lines are different?

[b]p1.[/b] What is the maximal number of pieces of two shapes, [img]https://cdn.artofproblemsolving.com/attachments/a/5/6c567cf6a04b0aa9e998dbae3803b6eeb24a35.png[/img] and [img]https://cdn.artofproblemsolving.com/attachments/8/a/7a7754d0f2517c93c5bb931fb7b5ae8f5e3217.png[/img], that can be used to tile a $7\times 7$ square? [b]p2.[/b] Six shooters participate in a shooting competition. Every participant has $5$ shots. Each shot adds from $1$ to $10$ points to shooter’s score. Every person can score totally for all five shots from $5$ to $50$ points. Each participant gets $7$ points for at least one of his shots. The scores of all participants are different. We enumerate the shooters $1$ to $6$ according to their scores, the person with maximal score obtains number $1$, the next one obtains number $2$, the person with minimal score obtains number $6$. What score does obtain the participant number $3$? The total number of all obtained points is $264$. [b]p2.[/b] There are exactly $n$ students in a high school. Girls send messages to boys. The first girl sent messages to $5$ boys, the second to $7$ boys, the third to $6$ boys, the fourth to $8$ boys, the fifth to $7$ boys, the sixth to $9$ boys, the seventh to $8$, etc. The last girl sent messages to all the boys. Prove that $n$ is divisible by $3$. [b]p4.[/b] In what minimal number of triangles can one cut a $25 \times 12$ rectangle in such a way that one can tile by these triangles a $20 \times 15$ rectangle. [b]p5.[/b] There are $2014$ stones in a pile. Two players play the following game. First, player $A$ takes some number of stones (from $1$ to $30$) from the pile, then player B takes $1$ or $2$ stones, then player $A$ takes $2$ or $3$ stones, then player $B$ takes $3$ or $4$ stones, then player A takes $4$ or $5$ stones, etc. The player who gets the last stone is the winner. If no player gets the last stone (there is at least one stone in the pile but the next move is not allowed) then the game results in a draw. Who wins the game using the right strategy? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

At the meeting, each person is familiar with 22 people. If two persons $A$ and $B$ know each with one another, among the remaining people they do not have a common friend. For each pair individuals $A$ and $B$ are not familiar with each other, there are among the remaining six common acquaintances. How many people were at the meeting?

Sir Alex plays the following game on a row of 9 cells. Initially, all cells are empty. In each move, Sir Alex is allowed to perform exactly one of the following two operations: [list=1] [*] Choose any number of the form $2^j$, where $j$ is a non-negative integer, and put it into an empty cell. [*] Choose two (not necessarily adjacent) cells with the same number in them; denote that number by $2^j$. Replace the number in one of the cells with $2^{j+1}$ and erase the number in the other cell. [/list] At the end of the game, one cell contains $2^n$, where $n$ is a given positive integer, while the other cells are empty. Determine the maximum number of moves that Sir Alex could have made, in terms of $n$. [i]Proposed by Warut Suksompong, Thailand[/i]