A box whose shape is a parallelepiped can be completely filled with cubes of side $1.$ If we put in it the maximum possible number of cubes, each of volume $2$, with the sides parallel to those of the box, then exactly $40$ percent of the volume of the box is occupied. Determine the possible dimensions of the box.

Consider the $8\times 8\times 8$ Rubik’s cube below. Each face is painted with a different color, and it is possible to turn any layer, as you can with smaller Rubik’s cubes. Let $X$ denote the move that turns the shaded layer shown (indicated by arrows going from the top to the right of the cube) clockwise by $90$ degrees, about the axis labeled $X$. When move $X$ is performed, the only layer that moves is the shaded layer. Likewise, define move $Y$ to be a clockwise $90$-degree turn about the axis labeled Y, of just the shaded layer shown (indicated by the arrows going from the front to the top, where the front is the side pierced by the $X$ rotation axis). Let $M$ denote the move “perform $X$, then perform $Y$.” [img]https://cdn.artofproblemsolving.com/attachments/e/f/951ea75a3dbbf0ca23c45cd8da372595c2de48.png[/img] Imagine that the cube starts out in “solved” form (so each face has just one color), and we start doing move $M$ repeatedly. What is the least number of repeats of $M$ in order for the cube to be restored to its original colors?

There are n lilypads in a row labeled $1, 2, \dots, n$ from left to right. Fareniss the Frog picks a lilypad at random to start on, and every second she jumps to an adjacent lilypad; if there are two such lilypads, she is twice as likely to jump to the right as to the left. After some finite number of seconds, there exists two lilypads $A$ and $B$ such that Fareniss is more than $1000$ times as likely to be on $A$ as she is to be on $B$. What is the minimal number of lilypads $n$ such that this situation must occur?

A tamer wants to line up five lions and four tigers. We know that a tiger cannot go after another. How many ways can the beasts be distributed? The tamer cannot distinguish two animals of the same species.

A field has a shape of checkboard $\text{41x41}$ square. A tank concealed in one of the cells of the field. By one shot, a fighter airplane fires one of the cells. If a shot hits the tank, then the tank moves to a neighboring cell of the field, otherwise it stays in its cell (the cells are neighbours if they share a side). A pilot has no information about the tank , one needs to hit it twice. Find the least number of shots sufficient to destroy the tank for sure. [i](S.Berlov,A.Magazinov)[/i]

$xxxx$ $xx$ $x$ $x$ In how many ways can you fill in the $x$s with the numbers $1-8$ so that for each $x$, the numbers below and to the right are higher.

There are 25 masks of different colours. k sages play the following game. They are shown all the masks. Then the sages agree on their strategy. After that the masks are put on them so that each sage sees the masks on the others but can not see who wears each mask and does not see his own mask. No communication is allowed. Then each of them simultaneously names one colour trying to guess the colour of his mask. Find the minimum k for which the sages can agree so that at least one of them surely guesses the colour of his mask. ( S. Berlov )

If $5$ points are placed in the plane at lattice points (i.e. points $(x,y)$ where $x $and $y$ are both integers) such that no three are collinear, then there are $10$ triangles whose vertices are among these points. What is the minimum possible number of these triangles that have area greater than $1/2$?

Cut an acute triangle, one of whose sides is equal to the altitude drawn, by two straight cuts, into four parts, from which you can fold a square.

$10$ cities are connected by one-way air routes in a way so that each city can be reached from any other by several connected flights. Let $n$ be the smallest number of flights needed for a tourist to visit every city and return to the starting city. Clearly $n$ depends on the flight schedule. Find the largest $n$ and the corresponding flight schedule.

On a connected graph $G$, one may perform the following operations: [list] [*]choose a vertice $v$, and add a vertice $v'$ such that $v'$ is connected to $v$ and all of its neighbours [*] choose a vertice $v$ with odd degree and delete it [/list] Show that for any connected graph $G$, we may perform a finite number of operations such that the resulting graph is a clique. Proposed by [i]idonthaveanaopsaccount[/i]

Prove that for arbitary integer $ n > 16$, there exists the set $ S$ that contains $ n$ positive integers and has the following property:if the subset $ A$ of $ S$ satisfies for arbitary $ a,a'\in A, a\neq a', a \plus{} a'\notin S$ holds, then $ |A|\leq4\sqrt n.$

You have some cyan, magenta, and yellow beads on a non-reorientable circle, and you can perform only the following operations: 1. Move a cyan bead right (clockwise) past a yellow bead, and turn the yellow bead magenta. 2. Move a magenta bead left of a cyan bead, and insert a yellow bead left of where the magenta bead ends up. 3. Do either of the above, switching the roles of the words ``magenta'' and ``left'' with those of ``yellow'' and ``right'', respectively. 4. Pick any two disjoint consecutive pairs of beads, each either yellow-magenta or magenta-yellow, appearing somewhere in the circle, and swap the orders of each pair. 5. Remove four consecutive beads of one color. Starting with the circle: ``yellow, yellow, magenta, magenta, cyan, cyan, cyan'', determine whether or not you can reach a) ``yellow, magenta, yellow, magenta, cyan, cyan, cyan'', b) ``cyan, yellow, cyan, magenta, cyan'', c) ``magenta, magenta, cyan, cyan, cyan'', d) ``yellow, cyan, cyan, cyan''. [i]Proposed by Sammy Luo[/i]

$ a)$ Two players play a cooperative game. They can discuss a strategy prior to the game, however, they cannot communicate and have no information about the other player during the game. The game master chooses one of the players in each round. The player on turn has to guess the number of the current round. Players keep note of the number of rounds they were chosen, however, they have no information about the other player's rounds. If the player's guess is correct, the players are awarded a point. Player's are not notified whether they've scored or not. The players win the game upon collecting 100 points. Does there exist a strategy with which they can surely win the game in a finite number of rounds? $b)$ How does this game change, if in each round the player on turn has two guesses instead of one, and they are awarded a point if one of the guesses is correct (while keeping all the other rules of the game the same)? [i]Proposed by Gábor Szűcs, Budapest[/i]

Let $G$ be a connected graph, with degree of all vertices not less then $m \geq 3$, such that there is no path through all vertices of $G$ being in every vertex exactly once. Find the least possible number of vertices of $G.$

The workers laid a floor of size $n \times n$ with tiles of two types: $2 \times 2$ and $3 \times 1$. It turned out that they were able to completely lay the floor in such a way that the same number of tiles of each type was used. Under what conditions could this happen? (You can’t cut tiles and also put them on top of each other.)

[u]Bouncy Balls[/u] In the following problems, you will consider the trajectories of balls moving and bouncing off of the boundaries of various containers. The balls are small enough that you can treat them as points. Let us suppose that a ball starts at a point $X$, strikes a boundary (indicated by the line segment $AB$) at $Y$ , and then continues, moving along the ray $Y Z$. Balls always bounce in such a way that $\angle XY A = \angle BY Z$. This is indicated in the above diagram. [img]https://cdn.artofproblemsolving.com/attachments/4/6/42ad28823d839f804d618a1331db43a9ebdca1.png[/img] Balls bounce off of boundaries in the same way light reflects off of mirrors - if the ball hits the boundary at point P, the trajectory after $P$ is the reflection of the trajectory before $P$ through the perpendicular to the boundary at P. A ball inside a rectangular container of width $7$ and height $12$ is launched from the lower-left vertex of the container. It first strikes the right side of the container after traveling a distance of $\sqrt{53}$ (and strikes no other sides between its launch and its impact with the right side). [b]p4.[/b] Find the height at which the ball first contacts the right side. [b]p5.[/b] How many times does the ball bounce before it returns to a vertex? (The final contact with a vertex does not count as a bounce.) Now a ball is launched from a vertex of an equilateral triangle with side length $5$. It strikes the opposite side after traveling a distance of $\sqrt{19}$. [b]p6.[/b] Find the distance from the ball's point of rst contact with a wall to the nearest vertex. [b]p7.[/b] How many times does the ball bounce before it returns to a vertex? (The final contact with a vertex does not count as a bounce.) In this final problem, a ball is again launched from the vertex of an equilateral triangle with side length $5$. [b]p8.[/b] In how many ways can the ball be launched so that it will return again to a vertex for the first time after $2009$ bounces?

I've come across a challenging graph theory problem. Roughly translated, it goes something like this: There are n lines drawn on a plane; no two lines are parallel to each other, and no three lines meet at a single point. Those lines would partition the plane down into many 'area's. Suppose we select one point from each area. Also, should two areas share a common side, we connect the two points belonging to the respective areas with a line. A graph consisted of points and lines will have been made. Find all possible 'n' that will make a hamiltonian circuit exist for the given graph

Alice and Bob play the following game. They write the expressions $x + y$, $x - y$, $x^2+xy+y^2$ and $x^2-xy+y^2$ each on a separate card. The four cards are shuffled and placed face down on a table. One of the cards is turned over, revealing the expression written on it, after which Alice chooses any two of the four cards, and gives the other two to Bob. All cards are then revealed. Now Alice picks one of the variables $x$ and $y$, assigns a real value to it, and tells Bob what value she assigned and to which variable. Then Bob assigns a real value to the other variable. Finally, they both evaluate the product of the expressions on their two cards. Whoever gets the larger result, wins. Which player, if any, has a winning strategy?

Adam is playing Minesweeper on a $9\times9$ grid of squares, where exactly $\frac13$ (or 27) of the squares are mines (generated uniformly at random over all such boards). Every time he clicks on a square, it is either a mine, in which case he loses, or it shows a number saying how many of the (up to eight) adjacent squares are mines. First, he clicks the square directly above the center square, which shows the number $4$. Next, he clicks the square directly below the center square, which shows the number $1$. What is the probability that the center square is a mine? [i]Proposed by Adam Bertelli[/i]

Two players in turn play a game. First Player has cards with numbers $2, 4, \ldots, 2000$ while Second Player has cards with numbers $1, 3, \ldots, 2001$. In each his turn, a player chooses one of his cards and puts it on a table; the opponent sees it and puts his card next to the first one. Player, who put the card with a larger number, scores 1 point. Then both cards are discarded. First Player starts. After $1000$ turns the game is over; First Player has used all his cards and Second Player used all but one. What are the maximal scores, that players could guarantee for themselves, no matter how the opponent would play?

Let $n$ be a positive integer. There are $n$ ants walking along a line at constant nonzero speeds. Different ants need not walk at the same speed or walk in the same direction. Whenever two or more ants collide, all the ants involved in this collision instantly change directions. (Different ants need not be moving in opposite directions when they collide, since a faster ant may catch up with a slower one that is moving in the same direction.) The ants keep walking indefinitely. Assuming that the total number of collisions is finite, determine the largest possible number of collisions in terms of $n$.

A lattice point in the plane is a point both of whose coordinates are integers. Each lattice point has four neighboring points: upper, lower, left, and right. Let $k$ be a circle with radius $r \geq 2$, that does not pass through any lattice point. An interior boundary point is a lattice point lying inside the circle $k$ that has a neighboring point lying outside $k$. Similarly, an exterior boundary point is a lattice point lying outside the circle $k$ that has a neighboring point lying inside $k$. Prove that there are four more exterior boundary points than interior boundary points.

The convex $1976$-gon is divided into $1975$ triangles. Prove that there is a straight line separating one of these triangles from the rest.

An ordered pair of sets $(A, B)$ is [i]good[/i] if $A$ is not a subset of $B$ and $B$ is not a subset of $A$. How many ordered pairs of subsets of $\{1, 2, \dots, 2017\}$ are good?