Found problems: 14842
2003 Germany Team Selection Test, 1
At a chess tournament the winner gets 1 point and the defeated one 0 points. A tie makes both obtaining $\frac{1}{2}$ points. 14 players, none of them equally aged, participated in a competition where everybody played against all the other players. After the competition a ranking was carried out. Of the two players with the same number of points the younger received the better ranking. After the competition Jan realizes that the best three players together got as many points as the last 9 players obtained points together. And Joerg noted that the number of ties was maximal. Determine the number of ties.
2018 Regional Competition For Advanced Students, 3
Let $n \ge 3$ be a natural number.
Determine the number $a_n$ of all subsets of $\{1, 2,...,n\}$ consisting of three elements such that one of them is the arithmetic mean of the other two.
[i]Proposed by Walther Janous[/i]
1997 Poland - Second Round, 5
We have thrown $k$ white dice and $m$ black dice. Find the probability that the remainder modulo $7$ of the sum of the numbers on the white dice is equal to the remainder modulo $7$ of the sum of the numbers on the black dice.
2023 Iranian Geometry Olympiad, 3
Let $ABCD$ be a square with side length $1$. How many points $P$ inside the square (not on its sides) have the property that the square can be cut into $10$ triangles of equal area such that all of them have $P$ as a vertex?
[i]Proposed by Josef Tkadlec - Czech Republic[/i]
2020 BMT Fall, Tie 2
On a certain planet, the alien inhabitants are born without any arms, legs, or noses. Every year, on their birthday, each alien randomly grows either an arm, a leg, or a nose, with equal probability for each. After its sixth birthday, the probability that an alien will have at least $2$ arms, at least $2$ legs, and at least $1$ nose on the day is $\frac{m}{n}$ , where $m$ and $n$ are relatively prime positive integers. Compute $m + n$.
2007 Hungary-Israel Binational, 1
You have to organize a fair procedure to randomly select someone from $ n$ people so that every one of them would be chosen with the probability $ \frac{1}{n}$. You are allowed to choose two real numbers $ 0<p_1<1$ and $ 0<p_2<1$ and order two coins which satisfy the following requirement: the probability of tossing "heads" on the first coin $ p_1$ and the probability of tossing "heads" on the second coin is $ p_2$. Before starting the procedure, you are supposed to announce an upper bound on the total number of times that the two coins are going to be flipped altogether. Describe a procedure that achieves this goal under the given conditions.
2016 BMT Spring, 4
How many graphs are there on $6$ vertices with degrees $1,1,2,3,4,5$?
2024 Germany Team Selection Test, 2
Elisa has $2023$ treasure chests, all of which are unlocked and empty at first. Each day, Elisa adds a new gem to one of the unlocked chests of her choice, and afterwards, a fairy acts according to the following rules:
[list=disc]
[*]if more than one chests are unlocked, it locks one of them, or
[*]if there is only one unlocked chest, it unlocks all the chests.
[/list]
Given that this process goes on forever, prove that there is a constant $C$ with the following property: Elisa can ensure that the difference between the numbers of gems in any two chests never exceeds $C$, regardless of how the fairy chooses the chests to unlock.
2016 IMAR Test, 3
Fix an integer $n \ge 2$, let $Q_n$ be the graph consisting of all vertices and all edges of an $n$-cube, and let $T$ be a spanning tree in $Q_n$. Show that $Q_n$ has an edge whose adjunction to $T$ produces a simple cycle of length at least $2n$.
2019 Azerbaijan IMO TST, 1
100 couples are invited to a traditional Modolvan dance. The $200$ people stand in a line, and then in a $\textit{step}$, (not necessarily adjacent) many swap positions. Find the least $C$ such that whatever the initial order, they can arrive at an ordering where everyone is dancing next to their partner in at most $C$ steps.
2003 China Western Mathematical Olympiad, 4
$ 1650$ students are arranged in $ 22$ rows and $ 75$ columns. It is known that in any two columns, the number of pairs of students in the same row and of the same sex is not greater than $ 11$. Prove that the number of boys is not greater than $ 928$.
2023 Iran MO (3rd Round), 3
There's infinity of the following blocks on the table:$1*1 , 1*2 , 1*3 ,.., 1*n$. We have a $n*n$ table and Ali chooses some of these blocks so that the sum of their area is at least $n^2$. Then , Amir tries to cover the $n*n$ table so that none of blocks go out of the table and they don't overlap and he wanna maximize the covered area in the $n*n$ table with those blocks chosen by Ali. Let $k$ be the maximum coverable area independent of Ali's choice. Prove that:
$$n^2 - \lceil \frac{n^2}{4} \rceil \leq k \leq n^2 - \lfloor \frac{n^2}{8} \rfloor$$
*Note : the blocks can be placed only vertically or horizontally.
2021 Latvia Baltic Way TST, P8
Initially on the blackboard eight zeros are written. In one step, it is allowed to choose numbers $a,b,c,d$, erase them and replace them with the numbers $a+1$, $b+2$, $c+3$, $d+3$. Determine:
a) the minimum number of steps required to achieve $8$ consecutive integers on the board
b) whether it is possible to achieve that sum of the numbers is $2021$
c) whether it is possible to achieve that product of the numbers is $2145$
2020 Belarusian National Olympiad, 11.8
$10$ teams participated in a football tournament: every two teams played each other exactly once. After the end of the tournament it turned out that all teams got different amount of points and some teams won more games, than the winner of the tournament, call them strong.
What is the maximum number of teams that could be strong? (In football the winner of the match gets three points, the loser - 0 points, and if the match ends in a draw both teams get 1 point.)
2006 Denmark MO - Mohr Contest, 4
Of the numbers $1, 2,3,..,2006$, ten different ones must be selected. Show that you can pick ten different numbers with a sum greater than $10039$ in more ways than you can select ten different numbers with a sum less than $10030$.
2014 Moldova Team Selection Test, 4
On a circle $n \geq 1$ real numbers are written, their sum is $n-1$. Prove that one can denote these numbers as $x_1, x_2, ..., x_n$ consecutively, starting from a number and moving clockwise, such that for any $k$ ($1\leq k \leq n$) $ x_1 + x_2+...+x_k \geq k-1$.
1996 Chile National Olympiad, 3
Let $n> 2$ be a natural. Given $2n$ points in the plane, no $3$ are collinear. What is the maximum number of lines that can be drawn between them, without forming a triangle?
[hide=original wording]Sea n > 2 un natural. Dados 2n puntos en el plano, tres a tres no colineales, Cual es el numero maximo de trazos que pueden dibujarse entre ellos, sin formar un triangulo?[/hide]
2017 Bosnia and Herzegovina Junior BMO TST, 2
Let $A$ be a set $A=\{1,2,3,...,2017\}$. Subset $S$ of set $A$ is [i]good [/i] if for all $x\in A$ sum of remaining elements of set $S$ has same last digit as $x$. Prove that [i]good[/i] subset with $405$ elements is not possible.
2012 Junior Balkan Team Selection Tests - Romania, 2
From an $n \times n $ square, $n \ge 2,$ the unit squares situated on both odd numbered rows and odd numbers columns are removed. Determine the minimum number of rectangular tiles needed to cover the remaining surface.
2010 Korea - Final Round, 3
There are $ n$ websites $ 1,2,\ldots,n$ ($ n \geq 2$). If there is a link from website $ i$ to $ j$, we can use this link so we can move website $ i$ to $ j$.
For all $ i \in \left\{1,2,\ldots,n - 1 \right\}$, there is a link from website $ i$ to $ i+1$.
Prove that we can add less or equal than $ 3(n - 1)\log_{2}(\log_{2} n)$ links so that for all integers $ 1 \leq i < j \leq n$, starting with website $ i$, and using at most three links to website $ j$. (If we use a link, website's number should increase. For example, No.7 to 4 is impossible).
Sorry for my bad English.
2024 Korea Summer Program Practice Test, 3
Find all pairs of positive integers $n$ such that one can partition a $n\times (n+1)$ board with $1\times 2$ or $2\times 1$ dominoes and draw one of the diagonals on each of the dominos so that none of the diagonals share endpoints.
2016 Romanian Master of Mathematics Shortlist, C4
Prove that a $46$-element set of integers contains two distinct doubletons $\{u, v\}$ and $\{x,y\}$ such that $u + v \equiv x + y$ (mod $2016$).
2013 Middle European Mathematical Olympiad, 4
Consider finitely many points in the plane with no three points on a line. All these points can be coloured red or green such that any triangle with vertices of the same colour contains at least one point of the other colour in its interior.
What is the maximal possible number of points with this property?
2014 Taiwan TST Round 1, 2
Determine whether there exist ten sets $A_1$, $A_2$, $\dots$, $A_{10}$ such that
(i) each set is of the form $\{a,b,c\}$, where $a \in \{1,2,3\}$, $b \in \{4,5,6\}$, $c \in \{7,8,9\}$,
(ii) no two sets are the same,
(iii) if the ten sets are arranged in a circle $(A_1, A_2, \dots, A_{10})$, then any two adjacent sets have no common element, but any two non-adjacent sets intersect. (Note: $A_{10}$ is adjacent to $A_1$.)
2021-IMOC, C9
In a simple graph, there exist two vertices $A,B$ such that there are exactly $100$ shortest paths from $A$ to $B$. Find the minimum number of edges in the graph.
[i]CSJL[/i]