There are $20$ pupils in the Backwoods school. Any two of them have a common grandfather. Prove that there exist $14$ pupils all of whom have a common grandfather. (AV Shapovalov)

We call two simple polygons $P, Q$ $\textit{compatible}$ if there exists a positive integer $k$ such that each of $P, Q$ can be partitioned into $k$ congruent polygons similar to the other one. Prove that for every two even integers $m, n \geq 4$, there are two compatible polygons with $m$ and $n$ sides. (A simple polygon is a polygon that does not intersect itself.) [i]Proposed by Hesam Rajabzadeh[/i]

The National Marriage Council wishes to invite $n$ couples to form 17 discussion groups under the following conditions: (1) All members of a group must be of the same sex; i.e. they are either all male or all female. (2) The difference in the size of any two groups is 0 or 1. (3) All groups have at least 1 member. (4) Each person must belong to one and only one group. Find all values of $n$, $n \leq 1996$, for which this is possible. Justify your answer.

[u]Round 1[/u] [b]p1.[/b] If $2m = 200 cm$ and $m \ne 0$, find $c$. [b]p2.[/b] A right triangle has two sides of lengths $3$ and $4$. Find the smallest possible length of the third side. [b]p3.[/b] Given that $20(x + 17) = 17(x + 20)$, determine the value of $x$. [u]Round 2[/u] [b]p4.[/b] According to the Egyptian Metropolitan Culinary Community, food service is delayed on $\frac23$ of flights departing from Cairo airport. On average, if flights with delayed food service have twice as many passengers per flight as those without, what is the probability that a passenger departing from Cairo airport experiences delayed food service? [b]p5.[/b] In a positive geometric sequence $\{a_n\}$, $a_1 = 9$, $a_9 = 25$. Find the integer $k$ such that $a_k = 15$ [b]p6.[/b] In the Delicate, Elegant, and Exotic Music Organization, pianist Hans is selling two types of owers with different prices (per ower): magnolias and myosotis. His friend Alice originally plans to buy a bunch containing $50\%$ more magnolias than myosotis for $\$50$, but then she realizes that if she buys $50\%$ less magnolias and $50\%$ more myosotis than her original plan, she would still need to pay the same amount of money. If instead she buys $50\%$ more magnolias and $50\%$ less myosotis than her original plan, then how much, in dollars, would she need to pay? [u]Round 3[/u] [b]p7.[/b] In square $ABCD$, point $P$ lies on side $AB$ such that $AP = 3$,$BP = 7$. Points $Q,R, S$ lie on sides $BC,CD,DA$ respectively such that $PQ = PR = PS = AB$. Find the area of quadrilateral $PQRS$. [b]p8.[/b] Kristy is thinking of a number $n < 10^4$ and she says that $143$ is one of its divisors. What is the smallest number greater than $143$ that could divide $n$? [b]p9.[/b] A positive integer $n$ is called [i]special [/i] if the product of the $n$ smallest prime numbers is divisible by the sum of the $n$ smallest prime numbers. Find the sum of the three smallest special numbers. [u]Round 4[/u] [b]p10.[/b] In the diagram below, all adjacent points connected with a segment are unit distance apart. Find the number of squares whose vertices are among the points in the diagram and whose sides coincide with the drawn segments. [img]https://cdn.artofproblemsolving.com/attachments/b/a/923e4d2d44e436ccec90661648967908306fea.png[/img] [b]p11.[/b] Geyang tells Junze that he is thinking of a positive integer. Geyang gives Junze the following clues: $\bullet$ My number has three distinct odd digits. $\bullet$ It is divisible by each of its three digits, as well as their sum. What is the sum of all possible values of Geyang's number? [b]p12.[/b] Regular octagon $ABCDEFGH$ has center $O$ and side length $2$. A circle passes through $A,B$, and $O$. What is the area of the part of the circle that lies outside of the octagon? PS. You should use hide for answers. Rounds 5-8 have been posted [url=https://artofproblemsolving.com/community/c3h2936505p26278645]here[/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

15 boxes are given. They all are initially empty. By one move it is allowed to choose some boxes and to put in them numbers of apricots which are pairwise distinct powers of 2. Find the least positive integer $k$ such that it is possible to have equal numbers of apricots in all the boxes after $k$ moves.

Consider pairs $(f,g)$ of functions from the set of nonnegative integers to itself such that [list] [*]$f(0) \geq f(1) \geq f(2) \geq \dots \geq f(300) \geq 0$ [*]$f(0)+f(1)+f(2)+\dots+f(300) \leq 300$ [*]for any 20 nonnegative integers $n_1, n_2, \dots, n_{20}$, not necessarily distinct, we have $$g(n_1+n_2+\dots+n_{20}) \leq f(n_1)+f(n_2)+\dots+f(n_{20}).$$ [/list] Determine the maximum possible value of $g(0)+g(1)+\dots+g(6000)$ over all such pairs of functions. [i]Sean Li[/i]

The numbers from $1$ to $100$ are arranged in a $10\times 10$ table so that any two adjacent numbers have sum no larger than $S$. Find the least value of $S$ for which this is possible. [i]D. Hramtsov[/i]

Some $ m$ squares on the chessboard are marked. If among four squares at the intersection of some two rows and two columns three squares are marked then it is allowed to mark the fourth square. Find the smallest $ m$ for which it is possible to mark all squares after several such operations.

In the space there are 8 points that no four of them are in the plane. 17 of the connecting segments are coloured blue and the other segments are to be coloured red. Prove that this colouring will create at least four triangles. Prove also that four cannot be subsituted by five. Remark: Blue triangles are those triangles whose three edges are coloured blue.

There are $4$ piles of stones with the following quantities: $1004$, $1005$, $2009$ and $2010$. A legitimate move is to remove a stone from each from $3$ different piles. Two players $A$ and $B$ play in turns. $A$ begins the game . The player who, on his turn, cannot make a legitimate move, loses. Determine which of the players has a winning strategy and give a strategy for that player.

[u]Round 1[/u] [b]1.1.[/b] A classroom has $29$ students. A teacher needs to split up the students into groups of at most $4$. What is the minimum number of groups needed? [b]1.2.[/b] On his history map quiz, Eric recalls that Sweden, Norway and Finland are adjacent countries, but he has forgotten which is which, so he labels them in random order. The probability that he labels all three countries correctly can be written as $\frac{m}{n}$, where $m$ and $n$ are relatively prime positive integers. Find $m + n$. [b]1.3.[/b] In a class of $40$ sixth graders, the class average for their final test comes out to be $90$ (out of a $100$). However, a student brings up an issue with problem $5$, and $10$ students receive credit for this question, bringing the class average to a $90.75$. How many points was problem $5$ worth? [u]Round 2[/u] [b]2.1.[/b] Compute $1 - 2 + 3 - 4 + ... - 2022 + 2023$. [b]2.2.[/b] In triangle $ABC$, $\angle ABC = 75^o$. Point $D$ lies on side $AC$ such that $BD = CD$ and $\angle BDC$ is a right angle. Compute the measure of $\angle A$. [b]2.3.[/b] Joe is rolling three four-sided dice each labeled with positive integers from $1$ to $4$. The probability the sum of the numbers on the top faces of the dice is $6$ can be written as $\frac{p}{q}$ where $p$ and $q$ are relatively prime integers. Find $p + q$. [u]Round 3[/u] [b]3.1.[/b] For positive integers $a, b, c, d$ that satisfy $a + b + c + d = 23$, what is the maximum value of $abcd$? [b]3.2.[/b] A buckball league has twenty teams. Each of the twenty teams plays exactly five games with each of the other teams. If each game takes 1 hour and thirty minutes, then how many total hours are spent playing games? [b]3.3.[/b] For a triangle $\vartriangle ABC$, let $M, N, O$ be the midpoints of $AB$, $BC$, $AC$, respectively. Let $P, Q, R$ be points on $AB$, $BC$, $AC$ such that $AP =\frac13 AB$, $BQ =\frac13 BC$, and $CR =\frac13 AC$. The ratio of the areas of $\vartriangle MNO$ and $\vartriangle P QR$ can be expressed as $\frac{m}{n}$ , where $ m$ and $n$ are relatively prime positive integers. Find $m + n$. [u]Round 4[/u] [b]4.1.[/b] $2023$ has the special property that leaves a remainder of $1$ when divided by $2$, $21$ when divided by $22$, and $22$ when divided by $23$. Let $n$ equal the lowest integer greater than $2023$ with the above properties. What is $n$? [b]4.2.[/b] Ants $A, B$ are on points $(0, 0)$ and $(3, 3)$ respectively, and ant A is trying to get to $(3, 3)$ while ant $B$ is trying to get to $(0, 0)$. Every second, ant $A$ will either move up or right one with equal probability, and ant $B$ will move down or left one with equal probability. The probability that the ants will meet each other be $\frac{a}{b}$, where $a$ and $b$ are relatively prime positive integers. Find $a + b$. [b]4.3.[/b] Find the number of trailing zeros of $100!$ in base $ 49$. PS. You should use hide for answers. Rounds 5-9 have been posted [url=https://artofproblemsolving.com/community/c3h3129723p28347714]here[/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

We call a [i]ship[/i] a figure made up of unit squares connected by common edges. Prove that if there is an odd number of possible different ships consisting of n unit squares on a $ 10 \times 10$ board, then n is divisible by 4.

Five identical empty buckets of $2$-liter capacity stand at the vertices of a regular pentagon. Cinderella and her wicked Stepmother go through a sequence of rounds: At the beginning of every round, the Stepmother takes one liter of water from the nearby river and distributes it arbitrarily over the five buckets. Then Cinderella chooses a pair of neighbouring buckets, empties them to the river and puts them back. Then the next round begins. The Stepmother goal's is to make one of these buckets overflow. Cinderella's goal is to prevent this. Can the wicked Stepmother enforce a bucket overflow? [i]Proposed by Gerhard Woeginger, Netherlands[/i]

How many distinct sets are there such that each set contains only non-negative powers of $2$ or $3$ and sum of its elements is $2014$? $ \textbf{(A)}\ 64 \qquad\textbf{(B)}\ 60 \qquad\textbf{(C)}\ 54 \qquad\textbf{(D)}\ 48 \qquad\textbf{(E)}\ \text{None of the preceding} $

[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].

Ten friends send greeting cards to each other, each sending $5$ cards. Prove that at least two of them sent cards to each other. (Folklore)

On an infinite chessboard, a solitaire game is played as follows: at the start, we have $n^2$ pieces occupying a square of side $n.$ The only allowed move is to jump over an occupied square to an unoccupied one, and the piece which has been jumped over is removed. For which $n$ can the game end with only one piece remaining on the board?

We are given an infinite deck of cards, each with a real number on it. For every real number $x$, there is exactly one card in the deck that has $x$ written on it. Now two players draw disjoint sets $A$ and $B$ of $100$ cards each from this deck. We would like to define a rule that declares one of them a winner. This rule should satisfy the following conditions: 1. The winner only depends on the relative order of the $200$ cards: if the cards are laid down in increasing order face down and we are told which card belongs to which player, but not what numbers are written on them, we can still decide the winner. 2. If we write the elements of both sets in increasing order as $A =\{ a_1 , a_2 , \ldots, a_{100} \}$ and $B= \{ b_1 , b_2 , \ldots , b_{100} \}$, and $a_i > b_i$ for all $i$, then $A$ beats $B$. 3. If three players draw three disjoint sets $A, B, C$ from the deck, $A$ beats $B$ and $B$ beats $C$ then $A$ also beats $C$. How many ways are there to define such a rule? Here, we consider two rules as different if there exist two sets $A$ and $B$ such that $A$ beats $B$ according to one rule, but $B$ beats $A$ according to the other. [i]Proposed by Ilya Bogdanov, Russia[/i]

We say a positive integer $ n$ is [i]good[/i] if there exists a permutation $ a_1, a_2, \ldots, a_n$ of $ 1, 2, \ldots, n$ such that $ k \plus{} a_k$ is perfect square for all $ 1\le k\le n$. Determine all the good numbers in the set $ \{11, 13, 15, 17, 19\}$.

A configuration of several checkers at the centers of squares on a rectangular sheet of grid paper is called [i]boring [/i] if some four checkers occupy the vertices of a rectangle with sides parallel to those of the sheet. (a) Prove that any configuration of more than $3mn/4$ checkers on an $m\times n$ grid is boring. (b) Prove that any configuration of $26$ checkers on a $7\times 7$ grid is boring.

In a circular circuit there are petrol stations, so that the total accumulated petrol in them it is exactly enough for a car to go around the circuit. Prove that there is a position from where a car, with the tank of finite capacity and initially empty, can leave and get to go a full loop around the circuit, stopping to refuel at positions. [hide=original wording]En un circuito circular hay puestos de gasolina, de modo que el total de la gasolina acumulada en ellos es exactamente suciente para que un auto de una vuelta completa al circuito. Demostrar que existe un puesto desde donde un auto, con el estanque de capacidad finita e inicialmente vacio, puede partir y conseguir recorrer una vuelta completa al circuito, deteniendose a reabastecerse de gasolina en los puestos.[/hide]

The fields of an $n\times n$ chess board are colored black and white, such that in every small $2\times 2$-square both colors should be the same number. How many there possibilities are for this?

[u]Set 3[/u] [b]3.1[/b] Find the number of distinct values that can be made by inserting parentheses into the expression $$1\,\,\,\,\, - \,\,\,\,\, 1 \,\,\,\,\, -\,\,\,\,\, 1 \,\,\,\,\, - \,\,\,\,\, 1 \,\,\,\,\, - \,\,\,\,\, 1\,\,\,\,\, - \,\,\,\,\, 1$$ such that you don’t introduce any multiplication. For example, $(1-1)-((1-1)-1-1)$ is a valid way to insert parentheses, but $1 - 1(-1 - 1) - 1 - 1$ is not. [b]3.2[/b] Let $T$ be the answer from the previous problem. Katie rolls T fair 4-sided dice with faces labeled $0-3$. Considering all possible sums of these rolls, there are two sums that have the highest probability of occurring. Find the smaller of these two sums. [b]3.3[/b] Let $T$ be the answer from the previous problem. Amy has a fair coin that she will repeatedly flip until her total number of heads is strictly greater than her total number of tails. Find the probability she will flip the coin exactly T times. (Hint: Finding a general formula in terms of T is hard, try solving some small cases while you wait for $T$.) PS. You should use hide for answers.

Let $n$ be a positive integer. We start with $n$ piles of pebbles, each initially containing a single pebble. One can perform moves of the following form: choose two piles, take an equal number of pebbles from each pile and form a new pile out of these pebbles. Find (in terms of $n$) the smallest number of nonempty piles that one can obtain by performing a finite sequence of moves of this form.

A circular game board is divided into $n \ge 3$ sectors. Each sector is either empty or occupied by a marker. In each step one chooses an occupied sector, removes its marker and then switches each of the two adjacent sectors from occupied to empty or vice-versa. Starting with a single occupied sector, for which $n$ is it possible to end up with all empty sectors after finitely many steps?