Found problems: 429
Some checkers placed on an $n \times n$ checkerboard satisfy the following conditions:
(a) every square that does not contain a checker shares a side with one that does;
(b) given any pair of squares that contain checkers, there is a sequence of squares containing checkers, starting and ending with the given squares, such that every two consecutive squares of the sequence share a side.
Prove that at least $(n^{2}-2)/3$ checkers have been placed on the board.
$\pi(n)$ is the number of primes that are not bigger than $n$. For $n=2,3,4,6,8,33,\dots$ we have $\pi(n)|n$. Does exist infinitely many integers $n$ that $\pi(n)|n$?
Let $n\geq 3$ be an integer and $S_{n}$ the permutation group. $G$ is a subgroup of $S_{n}$, generated by $n-2$ transpositions. For all $k\in\{1,2,\ldots,n\}$, denote by $S(k)$ the set $\{\sigma(k) \ : \ \sigma\in G\}$.
Show that for any $k$, $|S(k)|\leq n-1$.
A graph $G$ has $n$ vertices ($n>1$). For each edge $e$ let $c(e)$ be the number of vertices of the largest complete subgraph containing $e$. Prove that the inequality (the summation is over all edges of $G$):
\[\sum_{e} \frac{c(e)}{c(e)-1}\le \frac{n^2}{2}.\]
Some bishops and knights are placed on an infinite chessboard, where each square has side length $1$ unit. Suppose that the following conditions hold:
[list]
[*] For each bishop, there exists a knight on the same diagonal as that bishop (there may be another piece between the bishop and the knight).
[*] For each knight, there exists a bishop that is exactly $\sqrt{5}$ units away from it.
[*] If any piece is removed from the board, then at least one of the above conditions is no longer satisfied.
[/list]
If $n$ is the total number of pieces on the board, find all possible values of $n$.
[i]Sheldon Kieren Tan[/i]
We define a beehive of order $n$ as follows:
a beehive of order 1 is one hexagon
To construct a beehive of order $n$, take a beehive of order $n-1$ and draw a layer of hexagons in the exterior of these hexagons. See diagram for examples of $n=2,3$
Initially some hexagons are infected by a virus. If a hexagon has been infected, it will always be infected. Otherwise, it will be infected if at least 5 out of the 6 neighbours are infected.
Let $f(n)$ be the minimum number of infected hexagons in the beginning so that after a finite time, all hexagons become infected. Find $f(n)$.
Find the largest positive integer $k{}$ for which there exists a convex polyhedron $\mathcal{P}$ with 2022 edges, which satisfies the following properties:
[list]
[*]The degrees of the vertices of $\mathcal{P}$ don’t differ by more than one, and
[*]It is possible to colour the edges of $\mathcal{P}$ with $k{}$ colours such that for every colour $c{}$, and every pair of vertices $(v_1, v_2)$ of $\mathcal{P}$, there is a monochromatic path between $v_1$ and $v_2$ in the colour $c{}$.
[/list]
[i]Viktor Simjanoski, Macedonia[/i]
In a board school, there are 9 subjects, 512 students, and 256 rooms (two people in each room.) For every student there is a set (a subset of the 9 subjects) of subjects the student is interested in. Each student has a different set of subjects, (s)he is interested in, from all other students. (Exactly one student has no subjects (s)he is interested in.)
Prove that the whole school can line up in a circle in such a way that every pair of the roommates has the two people standing next to each other, and those pairs of students standing next to each other that are not roommates, have the following properties. One of the two students is interested in all the subjects that the other student is interested in, and also exactly one more subject.
A school has $n$ students and $k$ classes. Every two students in the same class are friends. For each two different classes, there are two people from these classes that are not friends. Prove that we can divide students into $n-k+1$ parts taht students in each part are not friends.
In a school there are $n$ classes and $n$ students. The students are enrolled in classes, such that no two of them have exactly the same classes. Prove that we can close a class in a such way that there still are no two of them which have exactly the same classes.
A castle has a number of halls and $n$ doors. Every door leads into another hall or outside. Every hall has at least two doors. A knight enters the castle. In any hall, he can choose any door for exit except the one he
just used to enter that hall. Find a strategy allowing the knight to get outside after visiting no more than $2n$ halls (a hall is counted each time it is entered).
A school has three senior classes of $M$ students each. Every student knows at least $\frac{3}{4}M$ people in each of the other two classes. Prove that the school can send $M$ non-intersecting teams to the olympiad so that each team consists of $3$ students from different classes who know each other.
[i]Proposed by C. Magyar, R. Martin[/i]
Suppose $ \,G\,$ is a connected graph with $ \,k\,$ edges. Prove that it is possible to label the edges $ 1,2,\ldots ,k\,$ in such a way that at each vertex which belongs to two or more edges, the greatest common divisor of the integers labeling those edges is equal to 1.
[b]Note: Graph-Definition[/b]. A [b]graph[/b] consists of a set of points, called vertices, together with a set of edges joining certain pairs of distinct vertices. Each pair of vertices $ \,u,v\,$ belongs to at most one edge. The graph $ G$ is connected if for each pair of distinct vertices $ \,x,y\,$ there is some sequence of vertices $ \,x \equal{} v_{0},v_{1},v_{2},\cdots ,v_{m} \equal{} y\,$ such that each pair $ \,v_{i},v_{i \plus{} 1}\;(0\leq i < m)\,$ is joined by an edge of $ \,G$.
In a party, there are $2n + 1$ people. It's well known that for every group of $n$ people, there exist a person(out of the group) who knows all them(the $n$ people of the group). Show that there exist a person who knows all the people in the party.
Alice has a map of Wonderland, a country consisting of $n \geq 2$ towns. For every pair of towns, there is a narrow road going from one town to the other. One day, all the roads are declared to be “one way” only. Alice has no information on the direction of the roads, but the King of Hearts has offered to help her. She is allowed to ask him a number of questions. For each question in turn, Alice chooses a pair of towns and the King of Hearts tells her the direction of the road connecting those two towns.
Alice wants to know whether there is at least one town in Wonderland with at most one outgoing road. Prove that she can always find out by asking at most $4n$ questions.
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)$.
In the country there're $N$ cities and some pairs of cities are connected by two-way airlines (each pair with no more than one). Every airline belongs to one of $k$ companies. It turns out that it's possible to get to any city from any other, but it fails when we delete all airlines belonging to any one of the companies. What is the maximum possible number of airlines in the country ?
An $ (n, k) \minus{}$ tournament is a contest with $ n$ players held in $ k$ rounds such that:
$ (i)$ Each player plays in each round, and every two players meet at most once.
$ (ii)$ If player $ A$ meets player $ B$ in round $ i$, player $ C$ meets player $ D$ in round $ i$, and player $ A$ meets player $ C$ in round $ j$, then player $ B$ meets player $ D$ in round $ j$.
Determine all pairs $ (n, k)$ for which there exists an $ (n, k) \minus{}$ tournament.
[i]Proposed by Carlos di Fiore, Argentina[/i]
Consider $2018$ pairwise crossing circles no three of which are concurrent. These circles subdivide the plane into regions bounded by circular $edges$ that meet at $vertices$. Notice that there are an even number of vertices on each circle. Given the circle, alternately colour the vertices on that circle red and blue. In doing so for each circle, every vertex is coloured twice- once for each of the two circle that cross at that point. If the two colours agree at a vertex, then it is assigned that colour; otherwise, it becomes yellow. Show that, if some circle contains at least $2061$ yellow points, then the vertices of some region are all yellow.
Proposed by [i]India[/i]
Let $n\geqslant 2$ be a positive integer. Paul has a $1\times n^2$ rectangular strip consisting of $n^2$ unit squares, where the $i^{\text{th}}$ square is labelled with $i$ for all $1\leqslant i\leqslant n^2$. He wishes to cut the strip into several pieces, where each piece consists of a number of consecutive unit squares, and then [i]translate[/i] (without rotating or flipping) the pieces to obtain an $n\times n$ square satisfying the following property: if the unit square in the $i^{\text{th}}$ row and $j^{\text{th}}$ column is labelled with $a_{ij}$, then $a_{ij}-(i+j-1)$ is divisible by $n$.
Determine the smallest number of pieces Paul needs to make in order to accomplish this.
Simple graph $G$ has $19998$ vertices. For any subgraph $\bar G$ of $G$ with $9999$ vertices, $\bar G$ has at least $9999$ edges. Find the minimum number of edges in $G$
Let $G$ be a complete directed graph with $100$ vertices such that for any two vertices $x,y$ one can find a directed path from $x$ to $y$.
a) Show that for any such $G$, one can find a $m$ such that for any two vertices $x,y$ one can find a directed path of length $m$ from $x$ to $y$ (Vertices can be repeated in the path)
b) For any graph $G$ with the properties above, define $m(G)$ to be smallest possible $m$ as defined in part a). Find the minimim value of $m(G)$ over all such possible $G$'s.
Let $n$ be a positive integer. Find the greatest possible integer $m$, in terms of $n$, with the following property: a table with $m$ rows and $n$ columns can be filled with real numbers in such a manner that for any two different rows $\left[ {{a_1},{a_2},\ldots,{a_n}}\right]$ and $\left[ {{b_1},{b_2},\ldots,{b_n}} \right]$ the following holds: \[\max\left( {\left| {{a_1} - {b_1}} \right|,\left| {{a_2} - {b_2}} \right|,...,\left| {{a_n} - {b_n}} \right|} \right) = 1\]
[i]Poland (Tomasz Kobos)[/i]
A [b][u]word[/u][/b] is formed by a number of letters of the alphabet. We show words with capital letters. A [b][u]sentence[/u][/b] is formed by a number of words. For example if $A=aa$ and $B=ab$ then the sentence $AB$ is equivalent to $aaab$. In this language, $A^n$ indicates $\underbrace{AA \cdots A}_{n}$. We have an equation when two sentences are equal. For example $XYX=YZ^2$ and it means that if we write the alphabetic letters forming the words of each sentence, we get two equivalent sequences of alphabetic letters. An equation is [b][u]simplified[/u][/b], if the words of the left and the right side of the sentences of the both sides of the equation are different. Note that every word contains one alphabetic letter at least.
$\text{a})$We have a simplified equation in terms of $X$ and $Y$. Prove that both $X$ and $Y$ can be written in form of a power of a word like $Z$.($Z$ can contain only one alphabetic letter).
$\text{b})$ Words $W_1,W_2,\cdots , W_n$ are the answers of a simplified equation. Prove that we can produce these $n$ words with fewer words.
$\text{c})$ $n$ words $W_1,W_2,\cdots , W_n$ are the answers of a simplified system of equations. Define graph $G$ with vertices ${1,2 \cdots ,n}$ such that $i$ and $j$ are connected if in one of the equations, $W_i$ and $W_j$ be the two words appearing in the right side of each side of the equation.($\cdots W_i = \cdots W_j$). If we denote by $c$ the number of connected components of $G$, prove that these $n$ words can be produced with at most $c$ words.
[i]Proposed by Mostafa Einollah Zadeh Samadi[/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)$.