Practice library
Problems
1Find the sum of all seven-digit numbers whose digits are \(1, 2, 3, 3, 4, 4, 4\) in some order.Open2An entry of a permutation is called right-minimal if it is smaller than every entry standing to its right. For example, in the permutation \[ (2,\; 1,\; 4,\; 6,\; 3,\; 7,\; 8,\; 5) \] the right-minimal …3A cinema row has \(20\) seats. In how many ways can six couples take their seats in this row if every couple wants to sit on two adjacent seats?4The number \(2025\) is written on a board. Ana and Bojan play the following game, moving alternately. A move consists of erasing the number currently on the board and writing in its place the difference …5Vid cut a square \(ABCD\) of side length \(20\) units into \(400\) unit squares. Eva then picked four vertices of unit squares, all lying in the interior of \(ABCD\), that are the vertices of a rectangle …6At a national competition the students worked on \(4\) problems. Each problem was marked with a whole number of points, at least \(0\) and at most \(7\). Altogether \(42\) students competed. Exactly half …7Can the plane be tiled by squares - that is, covered completely, with no two squares overlapping - in such a way that no side length is used by more than two of the squares?8Four vertices of a given regular octagon are to be coloured blue and the remaining four red. Two colourings are called equivalent if one of them is carried onto the other by a rotation of the octagon about …9Ana and Branko placed a number of tokens on the squares of an \(8 \times 8\) board, no square carrying more than one token. Ana then wrote down the number of tokens in each of the eight rows, and Branko …10Two roads run from Novi Sad to Belgrade, an old one and a new one, and they are joined by \(7\) connecting roads. In how many different ways can one travel from Novi Sad to Belgrade along these roads, …11At most how many rooks can be placed on a chessboard of dimensions \(5 \times 4\) (five rows and four columns) so that every rook attacks at most one of the remaining ones? Here a rook attacks every rook …12Let \(n \geq 2\) be a natural number. Every cell of a square table \(A\) of size \(n \times n\) is filled with one of the numbers \(1\) and \(-1\). For each \(i \in \{1, 2, \ldots, n\}\) write \(k_i\) …13An \(n \times n\) table is to be filled with zeros and ones so that for every index \(i \in \{1, 2, \dots, n\}\) the number of ones in the \(i\)-th row and the number of ones in the \(i\)-th column differ …14Sixteen teams take part in a basketball tournament played as a double round robin: every two teams meet exactly twice. The eight best-placed teams qualify for the next tournament. Teams are ranked by the …15Every positive integer is painted in one of two colours, one of which is called red. The painting is periodic with period \(d\): the numbers \(x\) and \(x + d\) always receive the same colour. Suppose …16An infinite set \(S\) of pairs of positive integers is given. Prove that \(S\) contains two different pairs \((a,b)\) and \((x,y)\) for which \[ a \leq x \quad \text{and} \quad b \leq y . \]17The cells of a \(4 \times 4\) table are to be coloured with several colours so that in every figure congruent to the one shown below, all four cells have different colours. The figure may be rotated or …18In the Mad Forest there lived \(6\) werewolves, \(17\) unicorns and \(55\) spiders. A werewolf can eat a spider or a unicorn, but not another werewolf; a spider can eat a unicorn, but neither a werewolf …19Borut drew the table of size \(2 \times 7\) shown in the picture. He now wants to colour some of its cells so that every cell he leaves uncoloured shares a side with at least one coloured cell. What is …20Peter keeps \(111\) red and \(111\) blue marbles at home; they are made by his uncle. Every day Peter may visit his uncle and carry out one exchange: either he hands over \(11\) red marbles and receives …21Two teams, each consisting of \(6\) footballers, have at their disposal \(4\) pairs of shorts and \(4\) jerseys in each of the colours red, blue and white. In how many ways can the footballers dress for …22A merchant has to ferry seven goods across a river: a piece of cheese, a mouse, a rat, a cat, a dog, a wolf and a bear. His boat has room for only \(k\) of the seven at a time. If they are left without …23Miljan and Mladen play the following game. They take turns naming divisors of \(200\), with one restriction: the number a player names must not be a divisor of any number named earlier in the game. A player …24A number is written in every cell of an \(8 \times 8\) table. A move consists of choosing any \(3 \times 3\) square of the table (nine cells) or any \(4 \times 4\) square (sixteen cells) and increasing …25A plane figure of area greater than \(1006\) can be placed inside a rectangle with side lengths \(2011\) and \(1\). Prove that the figure contains two points, on its boundary or in its interior, whose …26A cinema hall has \(2015\) seats, and \(2014\) viewers, one of whom is Mika, walk in. They all sit down on arbitrary seats, paying no attention to the seat assigned to them by their ticket, so exactly …27Two players alternately write one of the numbers \[ 473, \quad 523, \quad 573, \quad 623, \quad 673, \quad 723, \quad 773, \quad 823, \quad 873 \] into a free cell of a \(3 \times 3\) table, where each …28An \(8 \times 8\) board is tiled with copies of the three figures below. The figures may be rotated and reflected, and any number of copies of each of the three shapes may be used; the board counts as …29Let \(k \geq 2\) be a natural number. Margita has written on the board the first \(2k - 1\) natural numbers \(1, 2, \ldots, 2k - 1\). In one move she may erase any two numbers from the board and write …30Let \(A\) be a set of \(10\) numbers chosen from \(\{1, 2, \ldots, 100\}\). Prove that \(A\) has two nonempty subsets \(S\) and \(T\) with no element in common such that the sum of the elements of \(S\) …31Jure drew four distinct lines in the plane, one arrangement after another, and for each arrangement he wrote down the number \(n\) of points at which at least two of his lines cross. Which of the sets …32Lara and Sara draw \(n\) straight lines on a rectangular sheet of paper, taking turns and drawing one line each time. Every line is parallel to one of the edges of the sheet and runs from edge to edge, …33An island is inhabited by \(45\) chameleons: \(17\) yellow, \(15\) grey and \(13\) blue. They wander about and meet from time to time, never more than two at a time. When two chameleons of the same colour …34On each of \(n > 4\) cards, one of the numbers \(+1\) and \(-1\) is written. A single question consists of naming exactly three of the cards, after which we are told the product of the numbers written …35The pupils of a school went to the theatre on two occasions, and every pupil of the school attended at least one of the two performances. Boys formed \(60\%\) of the audience at the first performance and …36The points of a plane \(\alpha\) are split between two nonempty sets \(A\) and \(B\): no point belongs to both, and every point belongs to one of them. Prove that some isosceles right triangle has all …37The capital of a certain country is joined by a direct air route to each of the other \(2012\) cities. Moreover, every one of those \(2012\) cities is joined by an air route to at least one city other …38Maksim and Mina play the following game. Maksim starts by drawing a line in the plane; Mina then draws a line different from it; Maksim then draws a line different from both lines already drawn, and so …39How many integers \(n\) with \(10 \le n < 100000\) are divisible by \(4\), contain no digit \(0\) in their decimal representation, and have no two adjacent digits equal?
Showing 39 of 651 - problem statements are free for everyone.