With $150$ white cubes of $1 \times 1 \times 1$ a prism of $6 \times 5 \times 5$ is assembled, its six faces are painted blue and then the prism is disassembled. Lucrecia must build a new prism, without holes, exclusively using cubes that have at least one blue face and so that the faces of Lucrecia's prism are all completely blue. Give the dimensions of the prism with the largest volume that Lucrecia can assemble.

Dilhan is running around a track for $12$ laps. If halfway through a lap, Dilhan has his phone on him, he has a $\frac{1}{3}$ chance to drop it there. If Dilhan runs past his phone on the ground, he will attempt to pick it up with a $\frac{2}{3}$ chance of success, and won't drop it for the rest of the lap. He starts with his phone at the start of the 5K, what is the chance he still has it when he finished the 5K? [i]Proposed by Zack Lee, Daniel Li, Dilhan Salgado[/i]

[b]p1.[/b] Two trains, $A$ and $B$, travel between cities $P$ and $Q$. On one occasion $A$ started from $P$ and $B$ from $Q$ at the same time and when they met $A$ had travelled $120$ miles more than $B$. It took $A$ four $(4)$ hours to complete the trip to $Q$ and B nine $(9)$ hours to reach $P$. Assuming each train travels at a constant speed, what is the distance from $P$ to $Q$? [b]p2.[/b] If $a$ and $b$ are integers, $b$ odd, prove that $x^2 + 2ax + 2b = 0$ has no rational roots. [b]p3.[/b] A diameter segment of a set of points in a plane is a segment joining two points of the set which is at least as long as any other segment joining two points of the set. Prove that any two diameter segments of a set of points in the plane must have a point in common. [b]p4.[/b] Find all positive integers $n$ for which $\frac{n(n^2 + n + 1) (n^2 + 2n + 2)}{2n + 1}$ is an integer. Prove that the set you exhibit is complete. [b]p5.[/b] $A, B, C, D$ are four points on a semicircle with diameter $AB = 1$. If the distances $\overline{AC}$, $\overline{BC}$, $\overline{AD}$, $\overline{BD}$ are all rational numbers, prove that $\overline{CD}$ is also rational. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Can the set of lattice points $\{(x, y) \mid x, y \in \mathbb{Z}, 1 \le x, y \le 252, x \neq y\}$ be colored using 10 distinct colors such that for all $a \neq b$, $b \neq c$, the colors of $(a, b)$ and $(b, c)$ are distinct?

Let $S = \{a_1, \ldots, a_n \}$ be a finite set of positive integers of size $n \ge 1$, and let $T$ be the set of all positive integers that can be expressed as sums of perfect powers (including $1$) of distinct numbers in $S$, meaning \[ T = \left\{ \sum_{i=1}^n a_i^{e_i} \mid e_1, e_2, \dots, e_n \ge 0 \right\}. \] Show that there is a positive integer $N$ (only depending on $n$) such that $T$ contains no arithmetic progression of length $N$. [i]Yang Liu[/i]

Given a positive integer $ n\geq 2$, consider a set of $ n$ islands arranged in a circle. Between every two neigboring islands two bridges are built as shown in the figure. Starting at the island $ X_1$, in how many ways one can one can cross the $ 2n$ bridges so that no bridge is used more than once?

In a $3$ by $3$ table, by a $k$-worm, we mean a path of different cells $(S_1,S_2,...,S_k)$ such that each two consecutive cells have one side in common. The $k$-worm at each steep can go one cell forward and turn to the $(S,S_1,...,S_{k-1})$ if $S$ is an unfilled cell which is adjacent (has one side in common) with $S_1$. Find the maximum number of $k$ such that there is a $k$-worm $(S_1,...,S_k)$ such that after finitly many steps can be turned to $(S_k,...,S_1)$.

For which natural number $n$ is it possible to place natural number from 1 to $3n$ on the edges of a right $n$-angled prism (on each edge there is exactly one number placed and each one is used exactly 1 time) in such a way, that the sum of all the numbers, that surround each face is the same?

A parliament has $n$ senators. The senators form 10 parties and 10 committees, such that any senator belongs to exactly one party and one committee. Find the least possible $n$ for which it is possible to label the parties and the committees with numbers from 1 to 10, such that there are at least 11 senators for which the numbers of the corresponding party and committee are equal.

Each vertex of a regular polygon is colored in one of three colors so that an odd number of vertices are colored in each of the three colors. Prove that the number of isosceles triangles whose vertices are colored in three different colors is odd. [i]From foreign Olympiads[/i]

The company employs 50,000 people. For each of them, the sum of the number of his immediate superiors and his immediate subordinates is equal to 7. On Monday, each employee of the enterprise issues an order and gives a copy of this order to each of his direct subordinates (if there are any). Further, every day an employee takes all the basics he received on the previous day and either distributes them copies to all your direct subordinates, or, if any, he is not there, he carries out orders himself. It turned out that on Friday no papers were transferred to the institution. Prove that the enterprise has at least 97 bosses over whom there are no bosses.

A tree with $n\geq 2$ vertices is given. (A tree is a connected graph without cycles.) The vertices of the tree have real numbers $x_1,x_2,\dots,x_n$ associated with them. Each edge is associated with the product of the two numbers corresponding to the vertices it connects. Let $S$ be a sum of number across all edges. Prove that \[\sqrt{n-1}\left(x_1^2+x_2^2+\dots+x_n^2\right)\geq 2S.\] (Author: V. Dolnikov)

Prove that there exists two different permutations $ (a_1,a_2,\dots,a_{2009})$ and $ (b_1,b_2,\dots,b_{2009})$ of $ (1,2,\dots,2009)$ such that \[ \sum_{i\equal{}1}^{2009}i^i a_i \minus{} \sum_{i\equal{}1}^{2009} i^i b_i\] is divisible by $ 2009!$.

Find the maximal possible $n$, where $A_1, \dots, A_n \subseteq \{1, 2, \dots, 2016\}$ satisfy the following properties. - For each $1 \le i \le n$, $\lvert A_i \rvert = 4$. - For each $1 \le i < j \le n$, $\lvert A_i \cap A_j \rvert$ is even.

Let $n$ be a positive integer. A board with a format $n*n$ is divided in $n*n$ equal squares.Determine all integers $n$≥3 such that the board can be covered in $2*1$ (or $1*2$) pieces so that there is exactly one empty square in each row and each column.

Given $6$ points in a plane, assume that each two of them are connected by a segment. Let $D$ be the length of the longest, and $d$ the length of the shortest of these segments. Prove that $\frac Dd\ge\sqrt3$.

A $5 \times 5$ grid is given, called $f_1$: \[ \begin{array}{ccccc} 1 & 1 & 1 & 1 & 1 \\ 1 & 1 & 1 & 1 & 1 \\ -1 & 1 & -1 & 1 & -1 \\ 1 & 1 & 1 & 1 & 1 \\ 1 & 1 & 1 & 1 & 1 \\ \end{array} \] A new grid $f_{n+1}$ is constructed where each cell is equal to the product of its neighboring cells in grid $f_n$. (a) Find the grids $f_6$ and $f_7$. (b) Find the grids $f_{2008}$ and $f_{2009}$. (c) Find $f_{2n}$ and $f_{2n+1}$ for any $n \in \mathbb{N}$. *Note: Neighboring cells are those that share an edge, not just a vertex.*

Let $A$ be a non-empty subset of the set of all positive integers $N^*$. If any sufficient big positive integer can be expressed as the sum of $2$ elements in $A$(The two integers do not have to be different), then we call that $A$ is a divalent radical. For $x \geq 1$, let $A(x)$ be the set of all elements in $A$ that do not exceed $x$, prove that there exist a divalent radical $A$ and a constant number $C$ so that for every $x \geq 1$, there is always $\left| A(x) \right| \leq C \sqrt{x}$.

A hunter and an invisible rabbit play a game on an infinite square grid. First the hunter fixes a colouring of the cells with finitely many colours. The rabbit then secretly chooses a cell to start in. Every minute, the rabbit reports the colour of its current cell to the hunter, and then secretly moves to an adjacent cell that it has not visited before (two cells are adjacent if they share an edge). The hunter wins if after some finite time either:[list][*]the rabbit cannot move; or [*]the hunter can determine the cell in which the rabbit started.[/list]Decide whether there exists a winning strategy for the hunter. [i]Proposed by Aron Thomas[/i]

$ n\geq 4 $ points are given in a plane such that any 3 of them are not collinear. Prove that a triangle exist such that all the points are in its interior and there is exactly one point laying on each side.

Silverio is very happy for the 25th year of the PMO. In his jubilation, he ends up writing a finite sequence of As and Gs on a nearby blackboard. He then performs the following operation: if he finds at least one occurrence of the string "AG", he chooses one at random and replaces it with "GAAA". He performs this operation repeatedly until there is no more "AG" string on the blackboard. Show that for any initial sequence of As and Gs, Silverio will eventually be unable to continue doing the operation.

A salesman and a customer altogether have $1999$ rubles in coins and bills of $1, 5, 10, 50, 100, 500 , 1000$ rubles. The customer has enough money to buy a Cat in the Bag which costs the integer number of rubles. Prove that the customer can buy the Cat and get the correct change.

In a chess tournament, every participant played with each other exactly once, receiving $1$ point for a win, $1/2$ for a draw and $0$ for a loss. [list][b](a)[/b] Is it possible that for every player $P$, the sum of points of the players who were beaten by P is greater than the sum of points of the players who beat $P$? [b](b)[/b] Is it possible that for every player $P$, the first sum is less than the second one?[/list]

There are $2025$ people living on the island, each of whom is either a knight, i.e. always tells the truth, or a liar, which means they always lie. Some of the inhabitants of the island know each other, and everyone has at least one acquaintance, but no more than three. Each inhabitant of the island claims that there are exactly two liars among his acquaintances. a) What is the smallest possible number of knights among the inhabitants of the island? b) What is the largest possible number of knights among the inhabitants of the island? [i]Proposed by Oleksii Masalitin[/i]

The numbers from $1$ through $100$ are written in some order on a circle. We call a pair of numbers on the circle [i]good [/i] if the two numbers are not neighbors on the circle and if at least one of the two arcs they determine on the circle only contains numbers smaller then both of them. What may be the total number of good pairs on the circle.