Practice library
Problems
1Into a box, \(k\) smaller boxes are placed. Then \(k\) still smaller boxes are placed into some of the smaller boxes, each, and this procedure is repeated several times. If, at the end, \(m\) of all these …Open2A car leaves town \(A\) and drives along a straight road at constant speed. Every \(15\) minutes it makes a turn of \(90\) degrees, to the left or to the right. Prove that the car can be back in \(A\) …3In how many ways can \(11\) birds be placed into \(3\) identical cages so that every cage contains at least three birds?4Ten teams took part in a volleyball tournament, and each team played exactly one match against each of the other nine. When the tournament ended, the first team had \(x_{1}\) wins and \(y_{1}\) losses, …5A snake starts in the upper-left cell of a \(2 \times n\) board, where \(n\) is a natural number. From one cell it may move to another whenever the two cells share an edge, but it may never visit a cell …6Aca and Branko play the following game on a \(2023 \times 2024\) board. First Aca chooses a square of the board and places a queen on it. Then the players move the queen alternately, following the rules …7Let \(A\) be a subset of the set \(\{1, 4, 7, \dots, 1996\}\) containing exactly \(335\) elements. Prove that \(A\) contains two distinct numbers whose sum equals \(2000\).8A class has \(30\) students, and every day exactly three of them are on duty in the school kitchen. Prove that the duty roster cannot be arranged so that every two students of the class are on duty together …9Let \(S = \{1, 2, \ldots, 20\}\). What is the largest possible number of elements of a subset \(A \subseteq S\) with the property that \(2x \notin A\) whenever \(x \in A\)?10Every cell of a \(3 \times 3\) board is to be painted in one of \(9\) colors so that all \(9\) colors are used. How many differently colored boards can be made? (Two boards are colored differently if they …11Two players alternately take balls from two boxes. On each turn, a player chooses one of the boxes and removes any number of balls from it (at least one). The player who takes the last ball wins. The first …12In how many ways can \(1000\) numbers be chosen from the set \(\{1, 2, \dots, 1999\}\) so that no two of the chosen numbers have sum \(1999\) or sum \(2000\)?13In how many ways can \(m\) distinct birds be placed into \(n\) distinct cages so that every cage contains at least one bird and at most two birds?14Several lines are drawn in the plane. Line \(a\) intersects exactly three of the other lines, and line \(b\) intersects exactly four of the other lines. Line \(c\) intersects exactly \(n\) of the other …15Words are built from the two letters \(A\) and \(B\) only. Is it possible to form a set of words containing \(3\) words of \(4\) letters, \(10\) words of \(5\) letters, \(30\) words of \(6\) letters and …16In a handball tournament every team played exactly one match against each of the other teams. A win is worth \(2\) points, a loss \(0\), and a drawn match gives \(1\) point to each of the two teams. The …17There are \(14\) books standing in a row on a shelf. In how many ways can \(5\) of them be chosen so that no two of the chosen books stand next to each other?18A table of dimensions \(2010 \times 2011\) is given. Determine the largest number of cells that can be colored so that every \(2 \times 2\) square of the table contains at most two colored cells.19A mathematical commission has \(2n\) members, where \(n \geqslant 3\). Every member of the commission is in a quarrel with exactly one other member (the relation is symmetric). In how many ways can the …20The numbers \(1, 2, 3, 4, 5, 6, 7, 8\) are split into three disjoint nonempty sets. Let \(P_{1}\), \(P_{2}\) and \(P_{3}\) be the products of the numbers in the first, the second and the third set, respectively, …21The caliph of Baghdad rewarded three wise men with ten purses: the first held \(0\) dinars, the second \(1\) dinar, the third \(2\) dinars, and so on up to the tenth, which held \(9\) dinars. The first …22The numbers \(1, 2, 3, 4, 5\) are divided into two groups so that each group contains at least one of them. Prove that one of the groups contains two numbers whose difference also belongs to that same …23Two operations \(F\) and \(G\) turn an ordered triple of real numbers into another triple by the following rules: \(F\) sends \((a, b, c)\) to \((a+1,\, b+c,\, c+1)\), and \(G\) sends \((a, b, c)\) to …24For natural numbers \(m\) and \(n\), consider a board of dimensions \(m \times n\) made up of \(mn\) unit squares. Call the skeleton of the board the set of all unit segments that are edges of at least …25What is the largest number of chips that can be placed on the cells of a \(7 \times 7\) board so that no rectangle of area \(6\), with sides running along the grid lines, contains more than one chip?26Every school of a certain region sent exactly \(3\) students to a competition, and Andrej, Blaz and Zan all came from the same school. When the competitors lined up to collect their starting numbers, Andrej …27Prove or disprove the following assertion. Among any six positive integers it is always possible to choose three of them that are pairwise coprime, or three of them that have a common divisor greater than …28Each unit cell of a \(3 \times 3\) table is coloured with one of three colours. How many such colourings are there in which every two cells sharing a side are coloured differently?29A bishop on a chessboard attacks every square lying on one of the two diagonals through it. Call a square covered if a bishop stands on it or a bishop attacks it. Prove that seven bishops can never be …30Baron Munchausen lives in a country \(Z\) which has \(2018\) cities, some pairs of them joined by roads (every road can be travelled in both directions). The Baron has established that there is a city …31In the game Minesweeper, mines are placed on some cells of an \(a \times b\) board (\(a, b \in \mathbb{N}\)), and on every remaining cell one writes the number of neighbouring cells that contain a mine. …32The cells of an \(n \times n\) table are to be coloured with \(n\) different colours in such a way that every row and every column contains cells of all \(n\) colours. Determine the smallest and the largest …
Showing 32 of 651 - problem statements are free for everyone.