In some cells of the table $10\times 10$ arranged several $X$'s and a few $O$'s. It is known that there is no line (row or column) completely filled with identical symbols (crosses or zeros). However, if in any empty If you place any icon in a cell, this condition will be violated. What is the minimum number of icons that can appear in a table?

Let $X = \{1, 2, 3, 4, 5, 6, 7, 8\}$. We want to color, using $k$ colors, all subsets of $3$ elements of $X$ in such a way that, two disjoint subsets have distinct colors. Prove that: (a) $4$ colors are sufficient; (b) $3$ colors are not sufficient.

In the unit squares of a transparent $1 \times 100$ tape, numbers $1,2,\cdots,100$ are written in the ascending order.We fold this tape on it's lines with arbitrary order and arbitrary directions until we reach a $1 \times1$ tape with $100$ layers.A permutation of the numbers $1,2,\cdots,100$ can be seen on the tape, from the top to the bottom. Prove that the number of possible permutations is between $2^{100}$ and $4^{100}$. ([i]e.g.[/i] We can produce all permutations of numbers $1,2,3$ with a $1\times3$ tape) [i]Proposed by Morteza Saghafian[/i]

Let $0<c<1$ and $n$ a positive integer. Alice and Bob are playing a game. Bob writes $n$ integers on the board, not all equal. On a player's turn, they erase two numbers from the board and write their arithmetic mean instead. Alice starts and performs at most $cn$ moves. After her, Bob makes moves until there are only two numbers left on the board. Alice wins if these two numbers are different, and otherwise, Bob wins. For which values of $c$ does Alice win for all large enough $n$?

Prove that a square can be divided into any number greater than 5 squares, but cannot be divided into 5 squares.

On the squares $a1, a2,... , a8$ of a chessboard there are respectively $2^0, 2^1, ..., 2^7$ grains of oat, on the squares $b8, b7,..., b1$ respectively $2^8, 2^9, ..., 2^{15}$ grains of oat, on the squares $c1, c2,..., c8$ respectively $2^{16}, 2^{17}, ..., 2^{23}$ grains of oat etc. (so there are $2^{63}$ grains of oat on the square $h1$). A knight starts moving from some square and eats after each move all the grains of oat on the square to which it had jumped, but immediately after the knight leaves the square the same number of grains of oat reappear. With the last move the knight arrives to the same square from which it started moving. Prove that the number of grains of oat eaten by the knight is divisible by $3$.

The checker is standing on the corner field of a $n\times n$ chess-board. Each of two players moves it in turn to the neighbour (i.e. that has the common side) field. It is forbidden to move to the field, the checker has already visited. That who cannot make a move losts. a) Prove that for even $n$ the first can always win, and if $n$ is odd, than the second can always win. b) Who wins if the checker stands initially on the neighbour to the corner field?

A $30\times30$ table is given. We want to color some of it's unit squares such that any colored square has at most $k$ neighbors. ( Two squares $(i,j)$ and $(x,y)$ are called neighbors if $i-x,j-y\equiv0,-1,1 \pmod {30}$ and $(i,j)\neq(x,y)$. Therefore, each square has exactly $8$ neighbors) What is the maximum possible number of colored squares if$:$ $a) k=6$ $b)k=1$

Grasshopper Gerald and his 2020 friends play leapfrog on a plane as follows. At each turn Gerald jumps over a friend so that his original point and his resulting point are symmetric with respect to this friend. Gerald wants to perform a series of jumps such that he jumps over each friend exactly once. Let us say that a point is achievable if Gerald can finish the 2020th jump in it. What is the maximum number $N{}$ such that for some initial placement of the grasshoppers there are just $N{}$ achievable points? [i]Mikhail Svyatlovskiy[/i]

The numbers $1, 2, \ldots, n$ are written on a blackboard. Each minute, a student goes up to the board, chooses two numbers $x$ and $y$, erases them, and writes the number $2x+2y$ on the board. This continues until only one number remains. Prove that this number is at least $\frac{4}{9}n^3$. [i]Brian Hamrick.[/i]

Consider a regular 2n-gon $ P$,$A_1,A_2,\cdots ,A_{2n}$ in the plane ,where $n$ is a positive integer . We say that a point $S$ on one of the sides of $P$ can be seen from a point $E$ that is external to $P$ , if the line segment $SE$ contains no other points that lie on the sides of $P$ except $S$ .We color the sides of $P$ in 3 different colors (ignore the vertices of $P$,we consider them colorless), such that every side is colored in exactly one color, and each color is used at least once . Moreover ,from every point in the plane external to $P$ , points of most 2 different colors on $P$ can be seen .Find the number of distinct such colorings of $P$ (two colorings are considered distinct if at least one of sides is colored differently). [i]Proposed by Viktor Simjanoski, Macedonia[/i] JBMO 2017, Q4

Let $X$ be a set with $n\ge 2$ elements. Define $\mathcal{P}(X)$ to be the set of all subsets of $X$. Find the number of functions $f:\mathcal{P}(X)\mapsto \mathcal{P}(X)$ such that $$|f(A)\cap f(B)|=|A\cap B|$$ whenever $A$ and $B$ are two distinct subsets of $X$. [i] (Sergiu Novac)[/i]

In the simple and connected graph $G$ let $x_i$ be the number of vertices with degree $i$. Let $d>3$ be the biggest degree in the graph $G$. Prove that if : $$x_d \ge x_{d-1} + 2x_{d-2}+... +(d-1)x_1$$ Then there exists a vertex with degree $d$ such that after removing that vertex the graph $G$ is still connected. Proposed by [i]Ali Mirzaie[/i]

In a convex $2008$-gon some of the diagonals are coloured red and the rest blue, so that every vertex is an endpoint of a red diagonal and no three red diagonals concur at a point. It's known that every blue diagonal is intersected by a red diagonal in an interior point. Find the minimal number of intersections of red diagonals.

Let $n$ be an positive integer. Find the smallest integer $k$ with the following property; Given any real numbers $a_1 , \cdots , a_d $ such that $a_1 + a_2 + \cdots + a_d = n$ and $0 \le a_i \le 1$ for $i=1,2,\cdots ,d$, it is possible to partition these numbers into $k$ groups (some of which may be empty) such that the sum of the numbers in each group is at most $1$.

$A = \{a, b, c\}$ is a set containing three positive integers. Prove that we can find a set $B \subset A$, $B = \{x, y\}$ such that for all odd positive integers $m, n$ we have $$10\mid x^my^n-x^ny^m.$$ [i]Tomi Dimovski[/i]

$4026$ points were noted on the plane, not three of which lie on a straight line. The $2013$ points are the vertices of a convex polygon, and the other $2013$ vertices are inside this polygon. It is allowed to paint each point in one of two colors. Coloring will be good if some pairs of dots can be combined segments with the following conditions: $\bullet$ Each segment connects dots of the same color. $\bullet$ No two drawn segments intersect at their inner points. $\bullet$ For an arbitrary pair of dots of the same color, there is a path along the lines from one point to another. Please note that the sides of the convex $2013$ rectangle are not automatically drawn segments, although some (or all) can be drawn as needed. Prove that the total number of good colors does not depend on the specific locations of the points and find that number.

On a table lie 2022 matches and a regular dice that has the number $a$ on top. Now Max and Moritz play the following game: Alternately, they take away matches according to the following rule, where Max begins: The player to make a move rolls the dice over one of its edges and then takes a way as many matches as the top number shows. The player that cannot make legal move after some number of moves loses. For which $a$ can Moritz force Max to lose?

On the map, the Flower City has the form of a right triangle $ABC$ (see Fig.1). The length of each leg is $6$ meters. All the streets of the city run parallel to one of the legs at a distance of $1$ meter from each other. A river flows along the hypotenuse. From their houses that are located at points $V$ and $S$, at the same time get the Cog and Tab. Each short moves to rivers according to the following rule: tosses his coin, and if the [b]heads[/b] falls, he passes $1$ meter parallel to the leg $AB$ to the north (up), and if tails, then passes $1$ meter parallel to the leg $AC$ on east (right). If the Cog and the Tab meet at the same point, then they move together, tossing a coin. a) Which is more likely: Cog and Tab will meet on the way to the river, or will they come to different points on the shore? b) At what point near the river should the Stranger sit, if he wants the most did Gvintik and Shpuntik come to him together? [img]https://cdn.artofproblemsolving.com/attachments/d/c/5d6f75d039e8f2dd6a0ddfe6c4cb046b83f24c.png[/img] [hide=original wording] На мапi Квiткове мiсто має вигляд прямокутного трикутника ABC (див. рисунок 1). Довжина кожного катету – 6 метрiв. Всi вулицi мiста проходять паралельно одному за катетiв на вiдстанi 1 метра одна вiд одної. Вздовж гiпотенузи тече рiка. Зi своїх будиночкiв, що знаходяться в точках V та S, одночасно виходять Гвинтик та Шпунтик. Кожен коротулька рухається до рiчки за таким правилом: пiдкидає свою монетку, та якщо випадає Орел, вiн проходить 1 метр паралельно катету AB на пiвнiч (вгору), а якщо Решка, то проходить 1 метр паралельно катету AC на схiд (вправо). Якщо Гвинтик та Шпунтик зустрiчаються в однiй точцi, то далi вони рушають разом, пiдкидаючи монетку Гвинтика. 1. Що бiльш ймовiрно: Гвинтик та Шпунтик зустрiнуться на шляху до рiки, або вони прийдуть у рiзнi точки берега? 2. В якiй точцi бiля рiки має сидiти Незнайка, якщо вiн хоче, щоб найбiльш ймовiрно до нього прийшли Гвинтик та Шпунтик разом?[/hide]

Suppose that $1000$ students are standing in a circle. Prove that there exists an integer $k$ with $100 \leq k \leq 300$ such that in this circle there exists a contiguous group of $2k$ students, for which the first half contains the same number of girls as the second half. [i]Proposed by Gerhard Wöginger, Austria[/i]

The figure below is cut along the lines into polygons (which need not be convex). No polygon contains a $2 \times 2$ square. What is the smallest possible number of polygons? [missing figure]

A marker is placed at the origin of an integer lattice. Calvin and Hobbes play the following game. Calvin starts the game and each of them takes turns alternatively. At each turn, one can choose two (not necessarily distinct) integers $a, b$, neither of which was chosen earlier by any player and move the marker by $a$ units in the horizontal direction and $b$ units in the vertical direction. Hobbes wins if the marker is back at the origin any time after the first turn. Prove or disprove that Calvin can prevent Hobbes from winning. Note: A move in the horizontal direction by a positive quantity will be towards the right, and by a negative quantity will be towards the left (and similar directions in the vertical case as well).

[hide=D stands for Dedekind, Z stands for Zermelo]they had two problem sets under those two names[/hide] [b]D1.[/b] The product of two positive integers is $5$. What is their sum? [b]D2.[/b] Gavin is $4$ feet tall. He walks $5$ feet before falling forward onto a cushion. How many feet is the top of Gavin’s head from his starting point? [b]D3.[/b] How many times must Nathan roll a fair $6$-sided die until he can guarantee that the sum of his rolls is greater than $6$? [b]D4 / Z1.[/b] What percent of the first $20$ positive integers are divisible by $3$? [b]D5.[/b] Let $a$ be a positive integer such that $a^2 + 2a + 1 = 36$. Find $a$. [b]D6 / Z2.[/b] It is said that a sheet of printer paper can only be folded in half $7$ times. A sheet of paper is $8.5$ inches by $11$ inches. What is the ratio of the paper’s area after it has been folded in half $7$ times to its original area? [b]D7 / Z3.[/b] Boba has an integer. They multiply the number by $8$, which results in a two digit integer. Bubbles multiplies the same original number by 9 and gets a three digit integer. What was the original number? [b]D8.[/b] The average number of letters in the first names of students in your class of $24$ is $7$. If your teacher, whose first name is Blair, is also included, what is the new class average? [b]D9 / Z4.[/b] For how many integers $x$ is $9x^2$ greater than $x^4$? [b]D10 / Z5.[/b] How many two digit numbers are the product of two distinct prime numbers ending in the same digit? [b]D11 / Z6.[/b] A triangle’s area is twice its perimeter. Each side length of the triangle is doubled,and the new triangle has area $60$. What is the perimeter of the new triangle? [b]D12 / Z7.[/b] Let $F$ be a point inside regular pentagon $ABCDE$ such that $\vartriangle FDC$ is equilateral. Find $\angle BEF$. [b]D13 / Z8.[/b] Carl, Max, Zach, and Amelia sit in a row with $5$ seats. If Amelia insists on sitting next to the empty seat, how many ways can they be seated? [b]D14 / Z9.[/b] The numbers $1, 2, ..., 29, 30$ are written on a whiteboard. Gumbo circles a bunch of numbers such that for any two numbers he circles, the greatest common divisor of the two numbers is the same as the greatest common divisor of all the numbers he circled. Gabi then does the same. After this, what is the least possible number of uncircled numbers? [b]D15 / Z10.[/b] Via has a bag of veggie straws, which come in three colors: yellow, orange, and green. The bag contains $8$ veggie straws of each color. If she eats $22$ veggie straws without considering their color, what is the probability she eats all of the yellow veggie straws? [b]Z11.[/b] We call a string of letters [i]purple[/i] if it is in the form $CVCCCV$ , where $C$s are placeholders for (not necessarily distinct) consonants and $V$s are placeholders for (not necessarily distinct) vowels. If $n$ is the number of purple strings, what is the remainder when $n$ is divided by $35$? The letter $y$ is counted as a vowel. [b]Z12.[/b] Let $a, b, c$, and d be integers such that $a+b+c+d = 0$ and $(a+b)(c+d)(ab+cd) = 28$. Find $abcd$. [b]Z13.[/b] Griffith is playing cards. A $13$-card hand with Aces of all $4$ suits is known as a godhand. If Griffith and $3$ other players are dealt $13$-card hands from a standard $52$-card deck, then the probability that Griffith is dealt a godhand can be expressed in simplest form as $\frac{a}{b}$. Find $a$. [b]Z14.[/b] For some positive integer $m$, the quadratic $x^2 + 202200x + 2022m$ has two (not necessarily distinct) integer roots. How many possible values of $m$ are there? [b]Z15.[/b] Triangle $ABC$ with altitudes of length $5$, $6$, and $7$ is similar to triangle $DEF$. If $\vartriangle DEF$ has integer side lengths, find the least possible value of its perimeter. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

An equilateral triangle is divided into $9000000$ congruent equilateral triangles by lines parallel to its sides. Each vertex of the small triangles is coloured in one of three colours. Prove that there exist three points of the same colour being the vertices of a triangle with its sides parallel to the lines of the original triangle.

We are given $ 3^{2k}$ apparently identical coins,one of which is fake,being lighter than the others. We also dispose of three apparently identical balances without weights, one of which is broken (and yields outcomes unrelated to the actual situations). How can we find the fake coin in $ 3k\plus{}1$ weighings?