Daud want to paint some faces of a cube with green paint. At least one face must be painted. How many ways are there for him to paint the cube? Note: Two colorings are considered the same if one can be obtained from the other by rotation.

Consider the following one-person game: A player starts with score $0$ and writes the number $20$ on an empty whiteboard. At each step, she may erase any one integer (call it a) and writes two positive integers (call them $b$ and $c$) such that $b + c = a$. The player then adds $b\times c$ to her score. She repeats the step several times until she ends up with all $1$'s on the whiteboard. Then the game is over, and the final score is calculated. Let $M, m$ be the maximum and minimum final score that can be possibly obtained respectively. Find $M-m$.

On a table, we have ten thousand matches, two of which are inside a bowl. Anna and Bernd play the following game: They alternate taking turns and Anna begins. A turn consists of counting the matches in the bowl, choosing a proper divisor $d$ of this number and adding $d$ matches to the bowl. The game ends when more than $2024$ matches are in the bowl. The person who played the last turn wins. Prove that Anna can win independently of how Bernd plays. [i](Richard Henner)[/i]

Six teams participate in a hockey tournament. Each team plays exactly once against each other team. A team is awarded $3$ points for each game they win, $1$ point for each draw, and $0$ points for each game they lose. After the tournament, a ranking is made. There are no ties in the list. Moreover, it turns out that each team (except the very last team) has exactly $2$ points more than the team ranking one place lower. Prove that the team that finished fourth won exactly two games.

In the rectangle in the figure, we are going to write $12$ numbers from $1$ to $9$, so that the sum of the four numbers written in each line is the same and the sum of the three is also equal numbers in each column. Six numbers have already been written. Determine the sum of the numbers of each row and every column. [img]https://cdn.artofproblemsolving.com/attachments/7/f/3db9ded1e703c5392f258e1608a1800760d78c.png[/img]

Given is a binary string $0101010101$. On a move Ali changes 0 to 1 or 1 to 0. The following conditions are fulfilled: a) All the strings obtained are different. b) All the strings obtained must have at least 5 times 1. Prove that Ali can't obtain more than 555 strings.

With $21$ tiles, some white and some black, a $3 \times 7$ rectangle is formed. Show that there are always four tokens of the same color located at the vertices of a rectangle.

In a certain language words are formed using an alphabet of three letters. Some words of two or more letters are not allowed, and any two such distinct words are of different lengths. Prove that one can form a word of arbitrary length that does not contain any non-allowed word.

A directed graph (any two distinct vertices joined by at most one directed line) has the following property: If $x, u,$ and $v$ are three distinct vertices such that $x \to u$ and $x \to v$, then $u \to w$ and $v \to w$ for some vertex $w$. Suppose that $x \to u \to y \to\cdots \to z$ is a path of length $n$, that cannot be extended to the right (no arrow goes away from $z$). Prove that every path beginning at $x$ arrives after $n$ steps at $z.$

$2013$ people sit in a circle, playing a ball game. When one player has a ball, he may only pass it to another player $3$, $11$, or $61$ seats away (in either direction). If $f(A,B)$ represents the minimal number of passes it takes to get the ball from Person $A$ to Person $B$, what is the maximal possible value of $f$?

On the table, there are $1024$ marbles and two students, $A$ and $B$, alternatively take a positive number of marble(s). The student $A$ goes first, $B$ goes after that and so on. On the first move, $A$ takes $k$ marbles with $1 < k < 1024$. On the moves after that, $A$ and $B$ are not allowed to take more than $k$ marbles or $0$ marbles. The student that takes the last marble(s) from the table wins. Find all values of $k$ the student $A$ should choose to make sure that there is a strategy for him to win the game.

A rectangular array has $m$ rows and $n$ columns, where $m < n$. Some cells of the array contain stars, in such a way that there is at least one star in each column. Prove that there is at least one such star such that the row containing it has more stars than the column containing it. (A. Razborov, Moscow)

Let $m,n$ and $a_1,a_2,\dots,a_m$ be arbitrary positive integers. Ali and Mohammad Play the following game. At each step, Ali chooses $b_1,b_2,\dots,b_m \in \mathbb{N}$ and then Mohammad chosses a positive integers $s$ and obtains a new sequence $\{c_i=a_i+b_{i+s}\}_{i=1}^m$, where $$b_{m+1}=b_1,\ b_{m+2}=b_2, \dots,\ b_{m+s}=b_s$$ The goal of Ali is to make all the numbers divisible by $n$ in a finite number of steps. FInd all positive integers $m$ and $n$ such that Ali has a winning strategy, no matter how the initial values $a_1, a_2,\dots,a_m$ are. [hide=clarification] after we create the $c_i$ s, this sequence becomes the sequence that we continue playing on, as in it is our 'new' $a_i$[/hide] Proposed by Shayan Gholami

Let $n$ be a positive integer. There are $2018n+1$ cities in the Kingdom of Sellke Arabia. King Mark wants to build two-way roads that connect certain pairs of cities such that for each city $C$ and integer $1\le i\le 2018,$ there are exactly $n$ cities that are a distance $i$ away from $C.$ (The [i]distance[/i] between two cities is the least number of roads on any path between the two cities.) For which $n$ is it possible for Mark to achieve this? [i]Proposed by Michael Ren[/i]

Each student at a school divided 18 subjects into six disjoint triples. Could it happen that every triple of subjects is among the triples of exactly one student?

Find the smallest positive integer $n$ such that if we color in red $n$ arbitrary vertices of the cube , there will be a vertex of the cube which has the three vertices adjacent to it colored in red.

There are $15$ lights on the ceiling of a room, numbered from $1$ to $15$. All lights are turned off. In another room, there are $15$ switches: a switch for lights $1$ and $2$, a switch for lights $2$ and $3$, a switch for lights $3$ en $4$, etcetera, including a sqitch for lights $15$ and $1$. When the switch for such a pair of lights is turned, both of the lights change their state (from on to off, or vice versa). The switches are put in a random order and all look identical. Raymond wants to find out which switch belongs which pair of lights. From the room with the switches, he cannot see the lights. He can, however, flip a number of switches, and then go to the other room to see which lights are turned on. He can do this multiple times. What is the minimum number of visits to the other room that he has to take to determine for each switch with certainty which pair of lights it corresponds to?

For which natural numbers $n\ge 2$ can the numbers from $1$ to $16$ be lined up in a square scheme so that the four row sums and the four column sums are all mutually different and divisible by $n$?

[b]p1.[/b] An airplane travels between two cities. The first half of the distance between the cities is traveled at a constant speed of $600$ mi/hour, and the second half of the distance is traveled at a a constant speed of $900$ mi/hour. Find the average speed of the plane. [b]p2.[/b] The figure below shows two egg cartons, $A$ and $B$. Carton $A$ has $6$ spaces (cell) and has $3$ eggs. Carton $B$ has $12$ cells and $3$ eggs. Tow cells from the total of $18$ cells are selected at random and the contents of the selected cells are interchanged. (Not that one or both of the selected cells may be empty.) [img]https://cdn.artofproblemsolving.com/attachments/6/7/2f7f9089aed4d636dab31a0885bfd7952f4a06.png[/img] (a) Find the number of selections/interchanges that produce a decrease in the number of eggs in cartoon $A$- leaving carton $A$ with $2$ eggs. (b) Assume that the total number of eggs in cartons $A$ and $B$ is $6$. How many eggs must initially be in carton $A$ and in carton $B$ so that the number of selections/interchanges that lead to an increase in the number of eggs in $A$ equals the number of selections/interchanges that lead to an increase in the number of eggs in $B$. $\bullet$ In other words, find the initial distribution of $6$ eggs between $A$ and $B$ so that the likelihood of an increase in A equals the likelihood of an increase in $B$ as the result of a selection/interchange. Prove your answer. [b]p3.[/b] Divide the following figure into four equal parts (parts should be of the same shape and of the same size, they may be rotated by different angles however they may not be disjoint and reconnected). [img]https://cdn.artofproblemsolving.com/attachments/f/b/faf0adbf6b09b5aaec04c4cfd7ab1d6397ad5d.png[/img] [b]p4.[/b] Find the exact numerical value of $\sqrt[3]{5\sqrt2 + 7}- \sqrt[3]{5\sqrt2 - 7}$ (do not use a calculator and do not use approximations). [b]p5.[/b] The medians of a triangle have length $9$, $12$ and $15$ cm respectively. Find the area of the triangle. [b]p6. [/b]The numbers $1, 2, 3, . . . , 82$ are written in an arbitrary order. Prove that it is possible to cross out $72$ numbers in such a sway the remaining number will be either in increasing order or in decreasing order. PS. You should use hide for answers.

Austin is at the Lincoln Airport. He wants to take $5$ successive flights whose destinations are randomly chosen among Indianapolis, Jackson, Kansas City, Lincoln, and Milwaukee. The origin and destination of each flight may not be the same city, but Austin must arrive back at Lincoln on the last of his flights. Compute the probability that the cities Austin arrives at are all distinct.

A $5\times 5$ board is covered by eight hooks (a three unit square figure, shown in the picture) so that one unit square remains free. Determine all squares of the board that can remain free after such covering. [img]https://cdn.artofproblemsolving.com/attachments/6/8/a8c4e47ba137b904bd28c01c1d2cb765824e6a.png[/img]

Can one draw , on the surface of a Rubik's cube , a closed path which crosses each little square exactly once and does not pass through any vertex of a square? (S . Fomin, Leningrad)

Let $n$ be a natural number.A triangulation of a convex n-gon is a division of the polygon into $n-2$ triangles by drawing $n-3$ diagonals no two of which intersect at an interior point of the polygon.Let $f(n)$ denote the number of triangulations of a regular n-gon such that each of the triangles formed is isosceles.Determine $f(n)$ in terms of $n$.

On a plane several straight lines are drawn in such a way that each of them intersects exactly $15$ other lines. How many lines are drawn on the plane? Find all possibilities and justify your answer. Poland

Let $n$ be a fixed positive integer. Ben is playing a computer game. The computer picks a tree $T$ such that no vertex of $T$ has degree $2$ and such that $T$ has exactly $n$ leaves, labeled $v_1,\ldots, v_n$. The computer then puts an integer weight on each edge of $T$, and shows Ben neither the tree $T$ nor the weights. Ben can ask queries by specifying two integers $1\leq i < j \leq n$, and the computer will return the sum of the weights on the path from $v_i$ to $v_j$. At any point, Ben can guess whether the tree's weights are all zero. He wins the game if he is correct, and loses if he is incorrect. (a) Show that if Ben asks all $\binom n2$ possible queries, then he can guarantee victory. (b) Does Ben have a strategy to guarantee victory in less than $\binom n2$ queries? [i]Brandon Wang[/i]