Found problems: 429
An integer $n \geq 3$ is given. We call an $n$-tuple of real numbers $(x_1, x_2, \dots, x_n)$ [i]Shiny[/i] if for each permutation $y_1, y_2, \dots, y_n$ of these numbers, we have
$$\sum \limits_{i=1}^{n-1} y_i y_{i+1} = y_1y_2 + y_2y_3 + y_3y_4 + \cdots + y_{n-1}y_n \geq -1.$$
Find the largest constant $K = K(n)$ such that
$$\sum \limits_{1 \leq i < j \leq n} x_i x_j \geq K$$
holds for every Shiny $n$-tuple $(x_1, x_2, \dots, x_n)$.
There are $30$ teams in NBA and every team play $82$ games in the year. Bosses of NBA want to divide all teams on Western and Eastern Conferences (not necessary equally), such that number of games between teams from different conferences is half of number of all games. Can they do it?
Consider a checkered $3m\times 3m$ square, where $m$ is an integer greater than $1.$ A frog sits on the lower left corner cell $S$ and wants to get to the upper right corner cell $F.$ The frog can hop from any cell to either the next cell to the right or the next cell upwards.
Some cells can be [i]sticky[/i], and the frog gets trapped once it hops on such a cell. A set $X$ of cells is called [i]blocking[/i] if the frog cannot reach $F$ from $S$ when all the cells of $X$ are sticky. A blocking set is [i] minimal[/i] if it does not contain a smaller blocking set.[list=a][*]Prove that there exists a minimal blocking set containing at least $3m^2-3m$ cells.
[*]Prove that every minimal blocking set containing at most $3m^2$ cells.
Noah has to fit 8 species of animals into 4 cages of the Arc. He planes to put two species of animal in each cage. It turns out that, for each species of animal, there are at most 3 other species with which it cannot share a cage. Prove that there is a way to assign the animals to the cages so that each species shares a cage with a compatible species.
Find for which values of $n$, an integer larger than $1$ but smaller than $100$, the following expression has its minimum value:
$S = |n-1| + |n-2| + \ldots + |n-100|$
Let $S$ be a set of $n$ points in the plane such that no four points are collinear. Let $\{d_1,d_2,\cdots ,d_k\}$ be the set of distances between pairs of distinct points in $S$, and let $m_i$ be the multiplicity of $d_i$, i.e. the number of unordered pairs $\{P,Q\}\subseteq S$ with $|PQ|=d_i$. Prove that $\sum_{i=1}^k m_i^2\leq n^3-n^2$.
A hunter and an invisible rabbit play a game on an infinite square grid. First the hunter fixes a colouring of the cells with finitely many colours. The rabbit then secretly chooses a cell to start in. Every minute, the rabbit reports the colour of its current cell to the hunter, and then secretly moves to an adjacent cell that it has not visited before (two cells are adjacent if they share an edge). The hunter wins if after some finite time either:[list][*]the rabbit cannot move; or
[*]the hunter can determine the cell in which the rabbit started.[/list]Decide whether there exists a winning strategy for the hunter.
[i]Proposed by Aron Thomas[/i]
Nancy shuffles a deck of $52$ cards and spreads the cards out in a circle face up, leaving one spot empty. Andy, who is in another room and does not see the cards, names a card. If this card is adjacent to the empty spot, Nancy moves the card to the empty spot, without telling Andy; otherwise nothing happens. Then Andy names another card and so on, as many times as he likes, until he says "stop."
[list][b](a)[/b] Can Andy guarantee that after he says "stop," no card is in its initial spot?
[b](b)[/b] Can Andy guarantee that after he says "stop," the Queen of Spades is not adjacent to
the empty spot?[/list]
In a country, there are $2018$ cities, some of which are connected by roads. Each city is connected to at least three other cities. It is possible to travel from any city to any other city using one or more roads. For each pair of cities, consider the shortest route between these two cities. What is the greatest number of roads that can be on such a shortest route?
A hunter and an invisible rabbit play a game on an infinite square grid. First the hunter fixes a colouring of the cells with finitely many colours. The rabbit then secretly chooses a cell to start in. Every minute, the rabbit reports the colour of its current cell to the hunter, and then secretly moves to an adjacent cell that it has not visited before (two cells are adjacent if they share an edge). The hunter wins if after some finite time either:[list][*]the rabbit cannot move; or
[*]the hunter can determine the cell in which the rabbit started.[/list]Decide whether there exists a winning strategy for the hunter.
[i]Proposed by Aron Thomas[/i]
Consider horizontal and vertical segments in the plane that may intersect each other. Let $n$ denote their total number. Suppose that we have $m$ curves starting from the origin that are pairwise disjoint except for their endpoints. Assume that each curve intersects exactly two of the segments, a different pair for each curve. Prove that $m=O(n)$.
On sport games there was 1991 participant from which every participant knows at least n other participants(friendship is mutual). Determine the lowest possible n for which we can be sure that there are 6 participants between which any two participants know each other.
Solve the equation $\frac{1}{\sin x}+\frac{1}{\cos x}=\frac 1p$ where $p$ is a real parameter.
Discuss for which values of $p$ the equation has at least one real solution and determine the number of solutions in $[0, 2\pi)$ for a given $p.$
The Macedonian Mathematical Olympiad is held in two rooms numbered $1$ and $2$. At the beginning all of the competitors enter room No. $1$. The final arrangement of the competitors to the rooms is obtained in the following way: a list with the names of a few of the competitors is read aloud; after a name is read, the corresponding competitor and all of his/her acquaintances from the rest of the competitors change the room in which they currently are. Hence, to each list of names corresponds one final arrangement of the competitors to the rooms. Show that the total number of possible final arrangements is not equal to $2009$ (acquaintance between competitors is a symmetrical relation).
There is secret society with $2011$ members. Every member has bank account with integer balance ( can be negative). Sometimes some member give one dollar to every his friend. It is known, that after some such moves members can redistribute their money arbitrarily. Prove, that there are exactly $2010$ pairs of friends.
Say that an $n$-by-$n$ matrix $A=(a_{ij})_{1\le i,j \le n}$ with integer entries is very odd if, for every nonempty subset $S$ of $\{1,2,\dots,n \}$, the $|S|$-by-$|S|$ submatrix $(a_{ij})_{i,j \in S}$ has odd determinant. Prove that if $A$ is very odd, then $A^k$ is very odd for every $k \ge 1$.
Sofia and Viktor are playing the following game on a $2022 \times 2022$ board:
- Firstly, Sofia covers the table completely by dominoes, no two are overlapping and all are inside the table;
- Then Viktor without seeing the table, chooses a positive integer $n$;
- After that Viktor looks at the table covered with dominoes, chooses and fixes $n$ of them;
- Finally, Sofia removes the remaining dominoes that aren't fixed and tries to recover the table with dominoes differently from before.
If she achieves that, she wins, otherwise Viktor wins. What is the minimum number $n$ for which Viktor can always win, no matter the starting covering of dominoes.
[i]Proposed by Viktor Simjanoski[/i]
Let
\[M=\{1, 2, 3, \ldots, 2022\}\]
Determine the least positive integer $k$, such that for every $k$ subsets of $M$ with the cardinality of each subset equal to $3$, there are two of these subsets with exactly one common element.
Let $n$ be a positive integer. Jadzia has to write all integers from $1$ to $2n-1$ on a board, and she writes each integer in blue or red color. We say that pair of numbers $i,j\in \{1,2,3,...,2n-1\}$, where $i\leqslant j$, is $\textit{good}$ if and only if number of blue numbers among $i,i+1,...,j$ is odd. Determine, in terms of $n$, maximal number of good pairs.
Let $n$ be a positive integer. There are $2018n+1$ cities in the Kingdom of Sellke Arabia. King Mark wants to build two-way roads that connect certain pairs of cities such that for each city $C$ and integer $1\le i\le 2018,$ there are exactly $n$ cities that are a distance $i$ away from $C.$ (The [i]distance[/i] between two cities is the least number of roads on any path between the two cities.)
For which $n$ is it possible for Mark to achieve this?
[i]Proposed by Michael Ren[/i]
Let $S$ be an infinite set of positive integers, such that there exist four pairwise distinct $a,b,c,d \in S$ with $\gcd(a,b) \neq \gcd(c,d)$. Prove that there exist three pairwise distinct $x,y,z \in S$ such that $\gcd(x,y)=\gcd(y,z) \neq \gcd(z,x)$.
Find all positive integers $n \geq 3$, for which it is possible to draw $n$ chords on a circle, with their $2n$ endpoints being pairwise distinct, such that each chords intersects exactly $k$ others for:
(a) $k=n-2$,
(b) $k=n-3$.
Does there exist such a configuration of 22 circles and 22 point, that any circle contains at leats 7 points and any point belongs at least to 7 circles?
Do there exist polynomials $f(x)$, $g(x)$ with real coefficients and a positive integer $k$ satisfying the following condition? (Here, the equation $x^2 = 0$ is considered to have $1$ distinct real roots. The equation $0 = 0$ has infinitely many distinct real roots.)
For any real numbers $a, b$ with $(a,b) \neq (0,0)$, the number of distinct real roots of $a f(x) + b g(x) = 0$ is $k$.
The following facts are known in a mathematical contest:
[list]
(a) The number of problems tested was $n\ge 4$
(b) Each problem was solved by exactly four contestants.
(c) For each pair of problems, there is exactly one contestant who solved both problems
[/list]
Assuming the number of contestants is greater than or equal to $4n$, find the minimum value of $n$ for which there always exists a contestant who solved all the problems.