We select $16$ cells on an $8\times 8$ chessboard. What is the minimal number of pairs of selected cells in the same row or column?

Every face of a cube is colored one of $3$ colors at random. What is the expected number of edges that lie along two faces of different colors?

Let be given three-element subsets $A_1,A_2,\ldots,A_6$ of a six-element set $X$. Prove that the elements of $X$ can be colored with two colors in such a way that none of the given subsets are monochromatic.

Each of the 36 line segments joining 9 distinct points on a circle is coloured either red or blue. Suppose that each triangle determined by 3 of the 9 points contains at least one red side. Prove that there are four points such that the 6 segments connecting them are all red.

Let $n \geq 5$ be a positive integer and let $A$ and $B$ be sets of integers satisfying the following conditions: i) $|A| = n$, $|B| = m$ and $A$ is a subset of $B$ ii) For any distinct $x,y \in B$, $x+y \in B$ iff $x,y \in A$ Determine the minimum value of $m$.

There are several gentlemen in the meeting of the Diogenes Club, some of which are friends with each other (friendship is mutual). Let's name a participant unsociable if he has exactly one friend among those present at the meeting. By the club rules, the only friend of any unsociable member can leave the meeting (gentlemen leave the meeting one at a time). The purpose of the meeting is to achieve a situation in which that there are no friends left among the participants. Prove that if the goal is achievable, then the number of participants remaining at the meeting does not depend on who left and in what order.

An illusionist and his assistant are about to perform the following magic trick. Let $k$ be a positive integer. A spectator is given $n=k!+k-1$ balls numbered $1,2,…,n$. Unseen by the illusionist, the spectator arranges the balls into a sequence as he sees fit. The assistant studies the sequence, chooses some block of $k$ consecutive balls, and covers them under her scarf. Then the illusionist looks at the newly obscured sequence and guesses the precise order of the $k$ balls he does not see. Devise a strategy for the illusionist and the assistant to follow so that the trick always works. (The strategy needs to be constructed explicitly. For instance, it should be possible to implement the strategy, as described by the solver, in the form of a computer program that takes $k$ and the obscured sequence as input and then runs in time polynomial in $n$. A mere proof that an appropriate strategy exists does not qualify as a complete solution.)

The numbers $1$ to $1024$ are written one per square on a $32 \times 32$ board, so that the first row is $1, 2, ... , 32$, the second row is $33, 34, ... , 64$ and so on. Then the board is divided into four $16 \times 16$ boards and the position of these boards is moved round clockwise, so that $AB$ goes to $DA$ $DC \,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\, \, CB$ then each of the $16 \times 16 $ boards is divided into four equal $8 \times 8$ parts and each of these is moved around in the same way (within the $ 16 \times 16$ board). Then each of the $8 \times 8$ boards is divided into four $4 \times 4$ parts and these are moved around, then each $4 \times 4$ board is divided into $2 \times 2$ parts which are moved around, and finally the squares of each $2 \times 2$ part are moved around. What numbers end up on the main diagonal (from the top left to bottom right)?

A Tetris Figure is every figure in the plane which consists of $4$ unit squares connected by their sides (and don’t overlap). Two Tetris Figures are the same if one can be rotated in the plane to become the other. a) Prove that there exist exactly $7$ different Tetris Figures. b) Is it possible to fill a $4 \times 7$ rectangle by using once each of the $7$ different Tetris Figures?

[u]Round 1[/u] [b]p1.[/b] Alice and Bob played $25$ games of rock-paper-scissors. Alice played rock $12$ times, scissors $6$ times, and paper $7$ times. Bob played rock $13$ times, scissors $9$ times, and paper $3$ times. If there were no ties, who won the most games? (Remember, in each game each player picks one of rock, paper, or scissors. Rock beats scissors, scissors beat paper, and paper beats rock. If they choose the same object, the result is a tie.) [b]p2.[/b] On the planet Vulcan there are eight big volcanoes and six small volcanoes. Big volcanoes erupt every three years and small volcanoes erupt every two years. In the past five years, there were $30$ eruptions. How many volcanoes could erupt this year? [b]p3.[/b] A tangle is a sequence of digits constructed by picking a number $N\ge 0$ and writing the integers from $0$ to $N$ in some order, with no spaces. For example, $010123459876$ is a tangle with $N = 10$. A palindromic sequence reads the same forward or backward, such as $878$ or $6226$. The shortest palindromic tangle is $0$. How long is the second-shortest palindromic tangle? [b]p4.[/b] Balls numbered $1$ to $N$ have been randomly arranged in a long input tube that feeds into the upper left square of an $8 \times 8$ board. An empty exit tube leads out of the lower right square of the board. Your goal is to arrange the balls in order from $1$ to $N$ in the exit tube. As a move, you may 1. move the next ball in line from the input tube into the upper left square of the board, 2. move a ball already on the board to an adjacent square to its right or below, or 3. move a ball from the lower right square into the exit tube. No square may ever hold more than one ball. What is the largest number $N$ for which you can achieve your goal, no matter how the balls are initially arranged? You can see the order of the balls in the input tube before you start. [img]https://cdn.artofproblemsolving.com/attachments/1/8/bbce92750b01052db82d58b96584a36fb5ca5b.png[/img] [b]p5.[/b] A $2018 \times 2018$ board is covered by non-overlapping $2 \times 1$ dominoes, with each domino covering two squares of the board. From a given square, a robot takes one step to the other square of the domino it is on and then takes one more step in the same direction. Could the robot continue moving this way forever without falling off the board? [img]https://cdn.artofproblemsolving.com/attachments/9/c/da86ca4ff0300eca8e625dff891ed1769d44a8.png[/img] [u]Round 2[/u] [b]p6.[/b] Seventeen teams participated in a soccer tournament where a win is worth $1$ point, a tie is worth $0$ points, and a loss is worth $-1$ point. Each team played each other team exactly once. At least $\frac34$ of all games ended in a tie. Show that there must be two teams with the same number of points at the end of the tournament. [b]p7.[/b] The city of Old Haven is known for having a large number of secret societies. Any person may be a member of multiple societies. A secret society is called influential if its membership includes at least half the population of Old Haven. Today, there are $2018$ influential secret societies. Show that it is possible to form a council of at most $11$ people such that each influential secret society has at least one member on the council. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

[b]p1.[/b] If $A = 0$, $B = 1$, $C = 2$, $...$, $Z = 25$, then what is the sum of $A + B + M+ C$? [b]p2.[/b] Eric is playing Tetris against Bryan. If Eric wins one-fifth of the games he plays and he plays $15$ games, find the expected number of games Eric will win. [b]p3.[/b] What is the sum of the measures of the exterior angles of a regular $2023$-gon in degrees? [b]p4.[/b] If $N$ is a base $10$ digit of $90N3$, what value of $N$ makes this number divisible by $477$? [b]p5.[/b] What is the rightmost non-zero digit of the decimal expansion of $\frac{1}{2^{2023}}$ ? [b]p6.[/b] if graphs of $y = \frac54 x + m$ and $y = \frac32 x + n$ intersect at $(16, 27)$, what is the value of $m + n$? [b]p7.[/b] Bryan is hitting the alphabet keys on his keyboard at random. If the probability he spells out ABMC at least once after hitting $6$ keys is $\frac{a}{b^c}$ , for positive integers $a$, $b$, $c$ where $b$, $c$ are both as small as possible, find $a+b+c$. Note that the letters ABMC must be adjacent for it to count: AEBMCC should not be considered as correctly spelling out ABMC. [b]p8.[/b] It takes a Daniel twenty minutes to change a light bulb. It takes a Raymond thirty minutes to change a light bulb. It takes a Bryan forty-five minutes to change a light bulb. In the time that it takes two Daniels, three Raymonds, and one and a half Bryans to change $42$ light bulbs, how many light bulbs could half a Raymond change? Assume half a person can work half as productively as a whole person. [b]p9.[/b] Find the value of $5a + 4b + 3c + 2d + e$ given $a, b, c, d, e$ are real numbers satisfying the following equations: $$a^2 = 2e + 23$$ $$b^2 = 10a - 34$$ $$c^2 = 8b - 23$$ $$d^2 = 6c - 14$$ $$e^2 = 4d - 7.$$ [b]p10.[/b] How many integers between $1$ and $1000$ contain exactly two $1$’s when written in base $2$? [b]p11.[/b] Joe has lost his $2$ sets of keys. However, he knows that he placed his keys in one of his $12$ mailboxes, each labeled with a different positive integer from $1$ to $12$. Joe plans on opening the $2$ mailbox labeled $1$ to see if any of his keys are there. However, a strong gust of wind blows by, opening mailboxes $11$ and $12$, revealing that they are empty. If Joe decides to open one of the mailboxes labeled $2$, $3$, $4$, $5$, $6$, $7$, $8$, $9$ , or $10$, the probability that he finds at least one of his sets of keys can be expressed as $\frac{a}{b}$, where a and b are relatively prime positive integers. Find the sum $a + b$. Note that a single mailbox can contain $0$, $1$, or $2$ sets of keys, and the mailboxes his sets of keys were placed in are determined independently at random. [b]p12.[/b] As we all know, the top scientists have recently proved that the Earth is a flat disc. Bob is standing on Earth. If he takes the shortest path to the edge, he will fall off after walking $1$ meter. If he instead turns $90$ degrees away from the shortest path and walks towards the edge, he will fall off after $3$ meters. Compute the radius of the Earth. [b]p13.[/b] There are $999$ numbers that are repeating decimals of the form $0.abcabcabc...$ . The sum of all of the numbers of this form that do not have a $1$ or $2$ in their decimal representation can be expressed as $\frac{a}{b}$ for relatively prime positive integers $a$, $b$. Find $a + b$. [b]p14.[/b] An ant is crawling along the edges of a sugar cube. Every second, it travels along an edge to another adjacent vertex randomly, interested in the sugar it notices. Unfortunately, the cube is about to be added to some scalding coffee! In $10$ seconds, it must return to its initial vertex, so it can get off and escape. If the probability the ant will avoid a tragic doom can be expressed as $\frac{a}{3^{10}}$ , where $a$ is a positive integer, find $a$. Clarification: The ant needs to be on its initial vertex in exactly $10$ seconds, no more or less. [b]p15.[/b] Raymond’s new My Little Pony: Friendship is Magic Collector’s book arrived in the mail! The book’s pages measure $4\sqrt3$ inches by $12$ inches, and are bound on the longer side. If Raymond keeps one corner in the same plane as the book, what is the total area one of the corners can travel without ripping the page? If the desired area in square inches is $a\pi+b\sqrt{c}$ where $a$, $b$, and $c$ are integers and $c$ is squarefree, find $a + b + c$. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Are there convex $n$-gonal ($n \ge 4$) and triangular pyramids such that the four trihedral angles of the $n$-gonal pyramid are equal trihedral angles of a triangular pyramid? [hide=original wording] Существуют ли выпуклая n-угольная (n>= 4) и треугольная пирамиды такие, что четыре трехгранных угла n-угольной пирамиды равны трехгранным углам треугольной пирамиды?[/hide]

[b]p1.[/b] Let $a$ be an integer. How many fractions $\frac{a}{100}$ are greater than $\frac17$ and less than $\frac13$ ?. [b]p2.[/b] Justin Bieber invited Justin Timberlake and Justin Shan to eat sushi. There were $5$ different kinds of fish, $3$ different rice colors, and $11$ different sauces. Justin Shan insisted on a spicy sauce. If the probability of a sushi combination that pleased Justin Shan is $6/11$, then how many non-spicy sauces were there? [b]p3.[/b] A palindrome is any number that reads the same forward and backward (for example, $99$ and $50505$ are palindromes but $2020$ is not). Find the sum of all three-digit palindromes whose tens digit is $5$. [b]p4.[/b] Isaac is given an online quiz for his chemistry class in which he gets multiple tries. The quiz has $64$ multiple choice questions with $4$ choices each. For each of his previous attempts, the computer displays Isaac's answer to that question and whether it was correct or not. Given that Isaac is too lazy to actually read the questions, the maximum number of times he needs to attempt the quiz to guarantee a $100\%$ can be expressed as $2^{2^k}$. Find $k$. [b]p5.[/b] Consider a three-way Venn Diagram composed of three circles of radius $1$. The area of the entire Venn Diagram is of the form $\frac{a}{b}\pi +\sqrt{c}$ for positive integers $a$, $b$, $c$ where $a$, $b$ are relatively prime. Find $a+b+c$. (Each of the circles passes through the center of the other two circles) [b]p6.[/b] The sum of two four-digit numbers is $11044$. None of the digits are repeated and none of the digits are $0$s. Eight of the digits from $1-9$ are represented in these two numbers. Which one is not? [b]p7.[/b] Al wants to buy cookies. He can buy cookies in packs of $13$, $15$, or $17$. What is the maximum number of cookies he can not buy if he must buy a whole number of packs of each size? [b]p8.[/b] Let $\vartriangle ABC$ be a right triangle with base $AB = 2$ and hypotenuse $AC = 4$ and let $AD$ be a median of $\vartriangle ABC$. Now, let $BE$ be an altitude in $\vartriangle ABD$ and let $DF$ be an altitude in $\vartriangle ADC$. The quantity $(BE)^2 - (DF)^2$ can be expressed as a common fraction $\frac{a}{b}$ in lowest terms. Find $a + b$. [b]p9.[/b] Let $P(x)$ be a monic cubic polynomial with roots $r$, $s$, $t$, where $t$ is real. Suppose that $r + s + 2t = 8$, $2rs + rt + st = 12$ and $rst = 9$. Find $|P(2)|$. [b]p10.[/b] Let S be the set $\{1, 2,..., 21\}$. How many $11$-element subsets $T$ of $S$ are there such that there does not exist two distinct elements of $T$ such that one divides the other? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

A cube of side $n$ is cut into $n^3$ unit cubes, and m of these cubes are marked so that the centers of any three marked cubes do not form a right-angled triangle with legs parallel to sides of the cube. Find the maximum possible value of $m$.

$ 20 $ discs of radius $ 1 $ are bounded by a circle of radius $ 10. $ Show that in the interior of this circle is sufficient space to insert $ 7 $ discs of radius $ \frac{1}{3} $ that doesn't touch any other disc. [i]Flavian Georgescu[/i]

Prove that from a set of ten distinct two-digit numbers, it is always possible to find two disjoint subsets whose members have the same sum.

There are 20 blue points on the circle and some red inside so no three are collinear. It turned out that there exists $1123$ triangles with blue vertices having 10 red points inside. Prove that all triangles have 10 red points inside

All integers from $1$ to one million are written on a tape in some arbitrary order. Then the tape is cut into pieces containing two consecutive digits each. Prove that these pieces contain all two-digit integers for sure, regardless of the initial order of integers.[i](4 points)[/i] [i]Alexey Tolpygo[/i]

There is a row that consists of digits from $ 0$ to $ 9$ and Ukrainian letters (there are $ 33$ of them) with following properties: there aren’t two distinct digits or letters $ a_i$, $ a_j$ such that $ a_i > a_j$ and $ i < j$ (if $ a_i$, $ a_j$ are letters $ a_i > a_j$ means that $ a_i$ has greater then $ a_j$ position in alphabet) and there aren’t two equal consecutive symbols or two equal symbols having exactly one symbol between them. Find the greatest possible number of symbols in such row.

Let $M$ be a point which has coordinates $(p\times 1994,7p\times 1994)$ in the Cartesian plane ($p$ is a prime). Find the number of right-triangles satisfying the following conditions: (1) all vertexes of the triangle are lattice points, moreover $M$ is on the right-angled corner of the triangle; (2) the origin ($0,0$) is the incenter of the triangle.

On the plane are given $ k\plus{}n$ distinct lines , where $ k>1$ is integer and $ n$ is integer as well.Any three of these lines do not pass through the same point . Among these lines exactly $ k$ are parallel and all the other $ n$ lines intersect each other.All $ k\plus{}n$ lines define on the plane a partition of triangular , polygonic or not bounded regions. Two regions are colled different, if the have not common points or if they have common points only on their boundary.A regions is called ''good'' if it contained in a zone between two parallel lines . If in a such given configuration the minimum number of ''good'' regionrs is $ 176$ and the maximum number of these regions is $ 221$, find $ k$ and $ n$. Babis

Find all natural numbers $n\geq 3$ satisfying one can cut a convex $n$-gon into different triangles along some of the diagonals (None of these diagonals intersects others at any point other than vertices) and the number of diagonals are used at each vertex is even.

101 numbers are written in a circle. Near the first number the statement "This number is bigger than the next one" is written, near the second "This number is bigger that the next two" and etc, near the 100th "This number is bigger than the next 100 numbers". What is the maximum possible amount of the statements that can be true? [i]M. Karpuk[/i]

Determine the smallest constant $N$ so that the following may hold true: Geostan has deployed secret agents in Combostan. All pairs of agents can communicate, either directly or through other agents. The distance between two agents is the smallest number of agents in a communication chain between the two agents. Andreas and Edvard are among these agents, and Combostan has given Noah the task of determining the distance between Andreas and Edvard. Noah has a list of numbers, one for each agent. The number of an agent describes the longest of the two distances from the agent to Andreas and Edvard. However, Noah does not know which number corresponds to which agent, or which agents have direct contact. Given this information, he can write down $N$ numbers and prove that the distance between Andreas and Edvard is one of these $N$ numbers. The number $N$ is independent of the agents’ communication network.

Determine the maximal length $L$ of a sequence $a_1,\dots,a_L$ of positive integers satisfying both the following properties: [list=disc] [*]every term in the sequence is less than or equal to $2^{2023}$, and [*]there does not exist a consecutive subsequence $a_i,a_{i+1},\dots,a_j$ (where $1\le i\le j\le L$) with a choice of signs $s_i,s_{i+1},\dots,s_j\in\{1,-1\}$ for which \[s_ia_i+s_{i+1}a_{i+1}+\dots+s_ja_j=0.\] [/list]