This website contains problems from math contests. Problems and corresponding tags were obtained from the Art of Problem Solving website.

Tags were heavily modified to better represent problems.

AND:
OR:
NO:

Found problems: 14842

2022 Moldova EGMO TST, 12

On a board there are $2022$ numbers: $1,\frac{1}{2},\frac{1}{3},\frac{1}{4},\dots,\frac{1}{2022}$. During a $move$ two numbers are chosen, $a$ and $b$, they are erased and $a+b+ab$ is written in their place. The moves take place until only one number is left on the board. What are the possible values of this number?

1991 Tournament Of Towns, (298) 5

There are $16$ cities in a certain kingdom. The king wants to have a system of roads constructed so that one can go along those roads from any city to any other one without going through more than one intermediate city and so that no more than $5$ roads go out of any city. (a) Prove that this is possible. (b) Prove that if we replace the number $5$ by the number $4$ in the statement of the problem the king’s desire will become unrealizable. (D. Fomin, Leningrad)

2021 Baltic Way, 8

We are given a collection of $2^{2^k}$ coins, where $k$ is a non-negative integer. Exactly one coin is fake. We have an unlimited number of service dogs. One dog is sick but we do not know which one. A test consists of three steps: select some coins from the collection of all coins; choose a service dog; the dog smells all of the selected coins at once. A healthy dog will bark if and only if the fake coin is amongst them. Whether the sick dog will bark or not is random. \\ Devise a strategy to find the fake coin, using at most $2^k+k+2$ tests, and prove that it works.

2015 Mathematical Talent Reward Programme, MCQ: P 4

Let $n$ be an odd integer. Placing no more than one $X$ in each cell of a $n \times n$ grid, what is the greatest number of $X$ 's that can be put on the grid without getting $n$ $X$'s together vertically, horizontally or diagonally? [list=1] [*] $2{{n}\choose {2}}$ [*] ${{n}\choose {2}}$ [*] $2n $ [*] $2{{n}\choose {2}}-1$ [/list]

2006 Hong kong National Olympiad, 1

A subset $M$ of $\{1, 2, . . . , 2006\}$ has the property that for any three elements $x, y, z$ of $M$ with $x < y < z$, $x+ y$ does not divide $z$. Determine the largest possible size of $M$.

2010 Vietnam Team Selection Test, 2

We have $n$ countries. Each country have $m$ persons who live in that country ($n>m>1$). We divide $m \cdot n$ persons into $n$ groups each with $m$ members such that there don't exist two persons in any groups who come from one country. Prove that one can choose $n$ people into one class such that they come from different groups and different countries.

2021 Czech-Polish-Slovak Junior Match, 3

A [i]cross [/i] is the figure composed of $6$ unit squares shown below (and any figure made of it by rotation). [img]https://cdn.artofproblemsolving.com/attachments/6/0/6d4e0579d2e4c4fa67fd1219837576189ec9cb.png[/img] Find the greatest number of crosses that can be cut from a $6 \times 11$ divided sheet of paper into unit squares (in such a way that each cross consists of six such squares).

2009 Postal Coaching, 6

Let $n > 2$ and $n$ lamps numbered $1, 2, ..., n$ be connected in cyclic order: $1$ to $2, 2$ to $3, ..., n-1$ to $n, n$ to $1$. At the beginning all lamps are off. If the switch of a lamp is operated, the lamp and its $2$ neighbors change status: off to on, on to off. Prove that if $3$ does not divide $n$, then (all the) $2^n$ configurations can be reached and if $3$ divides $n$, then $2^{n-2}$ configurations can be reached.

2021 Dutch IMO TST, 2

Stekel and Prick play a game on an $ m \times n$ board, where $m$ and $n$ are positive are integers. They alternate turns, with Stekel starting. Spine bets on his turn, he always takes a pawn on a square where there is no pawn yet. Prick does his turn the same, but his pawn must always come into a square adjacent to the square that Spike just placed a pawn in on his previous turn. Prick wins like the whole board is full of pawns. Spike wins if Prik can no longer move a pawn on his turn, while there is still at least one empty square on the board. Determine for all pairs $(m, n)$ who has a winning strategy.

2018 Bosnia and Herzegovina Team Selection Test, 4

Every square of $1000 \times 1000$ board is colored black or white. It is known that exists one square $10 \times 10$ such that all squares inside it are black and one square $10 \times 10$ such that all squares inside are white. For every square $K$ $10 \times 10$ we define its power $m(K)$ as an absolute value of difference between number of white and black squares $1 \times 1$ in square $K$. Let $T$ be a square $10 \times 10$ which has minimum power among all squares $10 \times 10$ in this board. Determine maximal possible value of $m(T)$

2018 Macedonia National Olympiad, Problem 2

Let $n$ be a natural number and $C$ a non-negative real number. Determine the number of sequences of real numbers $1, x_{2}, ..., x_{n}, 1$ such that the absolute value of the difference between any two adjacent terms is equal to $C$.

2002 IMO, 1

Let $n$ be a positive integer. Each point $(x,y)$ in the plane, where $x$ and $y$ are non-negative integers with $x+y<n$, is coloured red or blue, subject to the following condition: if a point $(x,y)$ is red, then so are all points $(x',y')$ with $x'\leq x$ and $y'\leq y$. Let $A$ be the number of ways to choose $n$ blue points with distinct $x$-coordinates, and let $B$ be the number of ways to choose $n$ blue points with distinct $y$-coordinates. Prove that $A=B$.

2016 May Olympiad, 2

How many squares must be painted at least on a $5 \times 5$ board such that in each row, in each column and in each $2 \times 2$ square is there at least one square painted?

2008 Postal Coaching, 4

An $8\times 8$ square board is divided into $64$ unit squares. A ’skew-diagonal’ of the board is a set of $8$ unit squares no two of which are in the same row or same column. Checkers are placed in some of the unit squares so that ’each skew-diagonal contains exactly two squares occupied by checkers’. Prove that there exist two rows or two columns which contain all the checkers.

2021 JBMO Shortlist, C3

We have a set of $343$ closed jars, each containing blue, yellow and red marbles with the number of marbles from each color being at least $1$ and at most $7$. No two jars have exactly the same contents. Initially all jars are with the caps up. To flip a jar will mean to change its position from cap-up to cap-down or vice versa. It is allowed to choose a triple of positive integers $(b; y; r) \in \{1; 2; ...; 7\}^3$ and flip all the jars whose number of blue, yellow and red marbles differ by not more than $1$ from $b, y, r$, respectively. After $n$ moves all the jars turned out to be with the caps down. Find the number of all possible values of $n$, if $n \le 2021$.

2022 BMT, Tie 3

You wish to color every vertex, edge, face, and the interior of a cube one color each such that no two adjacent objects are the same color. Faces are adjacent if they share an edge. Edges are adjacent if they share a vertex. The interior is adjacent to all of its faces, edges, and vertices. Each face is adjacent to all of its edges and vertices, but is not adjacent to any other edges or vertices. Each edge is adjacent to both of its vertices, but is not adjacent to any other vertices. What is the minimum number of colors required for a coloring satisfying this property?

2010 Estonia Team Selection Test, 2

Let $n$ be a positive integer. Find the largest integer $N$ for which there exists a set of $n$ weights such that it is possible to determine the mass of all bodies with masses of $1, 2, ..., N$ using a balance scale . (i.e. to determine whether a body with unknown mass has a mass $1, 2, ..., N$, and which namely).

2020 June Advanced Contest, 2

Let $p$ be a prime number. At a school of $p^{2020}$ students it is required that each club consist of exactly $p$ students. Is it possible for each pair of students to have exactly one club in common?

2013 BMT Spring, 10

In a far away kingdom, there exist $k^2$ cities subdivided into k distinct districts, such that in the $i^ {th}$ district, there exist $2i - 1$ cities. Each city is connected to every city in its district but no cities outside of its district. In order to improve transportation, the king wants to add $k - 1$ roads such that all cities will become connected, but his advisors tell him there are many ways to do this. Two plans are different if one road is in one plan that is not in the other. Find the total number of possible plans in terms of $k$.

2014 China Western Mathematical Olympiad, 4

Given a positive integer $n$, let $a_1,a_2,..,a_n$ be a sequence of nonnegative integers. A sequence of one or more consecutive terms of $a_1,a_2,..,a_n$ is called $dragon$ if their aritmetic mean is larger than 1. If a sequence is a $dragon$, then its first term is the $head$ and the last term is the $tail$. Suppose $a_1,a_2,..,a_n$ is the $head$ or/and $tail$ of some $dragon$ sequence; determine the minimum value of $a_1+a_2+\cdots +a_n$ in terms of $n$.

2015 Taiwan TST Round 2, 2

Construct a tetromino by attaching two $2 \times 1$ dominoes along their longer sides such that the midpoint of the longer side of one domino is a corner of the other domino. This construction yields two kinds of tetrominoes with opposite orientations. Let us call them $S$- and $Z$-tetrominoes, respectively. Assume that a lattice polygon $P$ can be tiled with $S$-tetrominoes. Prove that no matter how we tile $P$ using only $S$- and $Z$-tetrominoes, we always use an even number of $Z$-tetrominoes. [i]Proposed by Tamas Fleiner and Peter Pal Pach, Hungary[/i]

Kettering MO, 2006

[b]p1.[/b] At a conference a mathematician and a chemist were talking. They were amazed to find that they graduated from the same high school. One of them, the chemist, mentioned that he had three sons and asked the other to calculate the ages of his sons given the following facts: (a) their ages are integers, (b) the product of their ages is $36$, (c) the sum of their ages is equal to the number of windows in the high school of the chemist and the mathematician. The mathematician considered this problem and noted that there was not enough information to obtain a unique solution. The chemist then noted that his oldest son had red hair. The mathematician then announced that he had determined the ages of the three sons. Please (aspiring mathematicians) determine the ages of the chemists three sons and explain your solution. [b]p2.[/b] A square is inscribed in a triangle. Two vertices of this square are on the base of the triangle and two others are on the lateral sides. Prove that the length of the side of the square is greater than and less than $2r$, where $r$ is a radius of the circle inscribed in the triangle. [b]p3.[/b] You are given any set of $100$ integers in which none of the integers is divisible by $100$. Prove that it is possible to select a subset of this set of $100$ integers such that their sum is a multiple of $100$. [b]p4.[/b] Find all prime numbers $a$ and $b$ such that $a^b + b^a$ is a prime number. [b]p5.[/b] $N$ airports are connected by airlines. Some airports are directly connected and some are not. It is always possible to travel from one airport to another by changing planes as needed. The board of directors decided to close one of the airports. Prove that it is possible to select an airport to close so that the remaining airports remain connected. [b]p6.[/b] (A simplified version of the Fermat’s Last Theorem). Prove that there are no positive integers $x, y, z$ and $z \le n$ satisfying the following equation: $x^n + y^n = z^n$. PS. You should use hide for answers.

1972 Kurschak Competition, 2

A class has $n > 1$ boys and $n$ girls. For each arrangement $X$ of the class in a line let $f(X)$ be the number of ways of dividing the line into two non-empty segments, so that in each segment the number of boys and girls is equal. Let the number of arrangements with $f(X) = 0$ be $A$, and the number of arrangements with $f(X) = 1$ be $B$. Show that $B = 2A$.

2022 Brazil Team Selection Test, 3

Let $n$ and $k$ be two integers with $n>k\geqslant 1$. There are $2n+1$ students standing in a circle. Each student $S$ has $2k$ [i]neighbors[/i] - namely, the $k$ students closest to $S$ on the left, and the $k$ students closest to $S$ on the right. Suppose that $n+1$ of the students are girls, and the other $n$ are boys. Prove that there is a girl with at least $k$ girls among her neighbors. [i]Proposed by Gurgen Asatryan, Armenia[/i]

Mid-Michigan MO, Grades 5-6, 2012

[b]p1.[/b] A boy has as many sisters as brothers. How ever, his sister has twice as many brothers as sisters. How many boys and girls are there in the family? [b]p2.[/b] Solve each of the following problems. (1) Find a pair of numbers with a sum of $11$ and a product of $24$. (2) Find a pair of numbers with a sum of $40$ and a product of $400$. (3) Find three consecutive numbers with a sum of $333$. (4) Find two consecutive numbers with a product of $182$. [b]p3.[/b] $2008$ integers are written on a piece of paper. It is known that the sum of any $100$ numbers is positive. Show that the sum of all numbers is positive. [b]p4.[/b] Let $p$ and $q$ be prime numbers greater than $3$. Prove that $p^2 - q^2$ is divisible by $24$. [b]p5.[/b] Four villages $A,B,C$, and $D$ are connected by trails as shown on the map. [img]https://cdn.artofproblemsolving.com/attachments/4/9/33ecc416792dacba65930caa61adbae09b8296.png[/img] On each path $A \to B \to C$ and $B \to C \to D$ there are $10$ hills, on the path $A \to B \to D$ there are $22$ hills, on the path $A \to D \to B$ there are $45$ hills. A group of tourists starts from $A$ and wants to reach $D$. They choose the path with the minimal number of hills. What is the best path for them? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].