Found problems: 14842
2023 Belarusian National Olympiad, 9.8
On the faces of a cube several positive integer numbers are written. On every edge the sum of the numbers of it's two faces is written, and in every vertex the sum of numbers on the three faces that have this vertex. It turned out that all the written numbers are different.
Find the smallest possible amount of the sum of all written numbers.
2011 Tournament of Towns, 3
Worms grow at the rate of $1$ metre per hour. When they reach their maximal length of $1$ metre, they stop growing. A full-grown worm may be dissected into two not necessarily equal parts. Each new worm grows at the rate of $1$ metre per hour. Starting with $1$ full-grown worm, can one obtain $10$ full-grown worms in less than $1$ hour?
2014 Bosnia And Herzegovina - Regional Olympiad, 4
How namy subsets with $3$ elements of set $S=\{1,2,3,...,19,20\}$ exist, such that their product is divisible by $4$.
2016 Korea Winter Program Practice Test, 4
Let $a_1, a_2, \cdots a_{100}$ be a permutation of $1,2,\cdots 100$.
Define $l(k)$ as the maximum $m$ such that there exists $i_1, i_2 \cdots i_m$ such that $a_{i_1} > a_{i_2} > \cdots > a_{i_m}$ or $a_{i_1} < a_{i_2} < \cdots < a_{i_m}$, where $i_1=k$ and $i_1<i_2< \cdots <i_m$
Find the minimum possible value for $\sum_{i=1}^{100} l(i)$.
2022 IMO Shortlist, C9
Let $\mathbb Z_{\ge 0}$ be the set of non-negative integers, and let $f:\mathbb Z_{\ge 0}\times \mathbb Z_{\ge 0} \to \mathbb Z_{\ge 0}$ be a bijection such that whenever $f(x_1,y_1) > f(x_2, y_2)$, we have $f(x_1+1, y_1) > f(x_2 + 1, y_2)$ and $f(x_1, y_1+1) > f(x_2, y_2+1)$.
Let $N$ be the number of pairs of integers $(x,y)$ with $0\le x,y<100$, such that $f(x,y)$ is odd. Find the smallest and largest possible values of $N$.
2022 China Team Selection Test, 3
Given a positive integer $n \ge 2$. Find all $n$-tuples of positive integers $(a_1,a_2,\ldots,a_n)$, such that $1<a_1 \le a_2 \le a_3 \le \cdots \le a_n$, $a_1$ is odd, and
(1) $M=\frac{1}{2^n}(a_1-1)a_2 a_3 \cdots a_n$ is a positive integer;
(2) One can pick $n$-tuples of integers $(k_{i,1},k_{i,2},\ldots,k_{i,n})$ for $i=1,2,\ldots,M$ such that for any $1 \le i_1 <i_2 \le M$, there exists $j \in \{1,2,\ldots,n\}$ such that $k_{i_1,j}-k_{i_2,j} \not\equiv 0, \pm 1 \pmod{a_j}$.
1995 Czech And Slovak Olympiad IIIA, 3
Five distinct points and five distinct lines are given in the plane. Prove that one can select two of the points and two of the lines so that none of the selected lines contains any of the selected points.
2013 Iran MO (3rd Round), 1
An $n$-stick is a connected figure consisting of $n$ matches of length $1$ which are placed horizontally or vertically and no two touch each other at points other than their ends. Two shapes that can be transformed into each other by moving, rotating or flipping are considered the same.
An $n$-mino is a shape which is built by connecting $n$ squares of side length 1 on their sides such that there's a path on the squares between each two squares of the $n$-mino.
Let $S_n$ be the number of $n$-sticks and $M_n$ the number of $n$-minos, e.g. $S_3=5$ And $M_3=2$.
(a) Prove that for any natural $n$, $S_n \geq M_{n+1}$.
(b) Prove that for large enough $n$ we have $(2.4)^n \leq S_n \leq (16)^n$.
A [b]grid segment[/b] is a segment on the plane of length 1 which it's both ends are integer points. A polystick is called [b]wise[/b] if using it and it's rotations or flips we can cover all grid segments without overlapping, otherwise it's called [b]unwise[/b].
(c) Prove that there are at least $2^{n-6}$ different unwise $n$-sticks.
(d) Prove that any polystick which is in form of a path only going up and right is wise.
(e) Extra points: Prove that for large enough $n$ we have $3^n \leq S_n \leq 12^n$
Time allowed for this exam was 2 hours.
2021 China Second Round A1, 4
There are 100 points on a circle that are about to be colored in two colors: red or blue. Find the largest number $k$ such that no matter how I select and color $k$ points, you can always color the remaining $100-k$ points such that you can connect 50 pairs of points of the same color with lines in a way such that no two lines intersect.
2024 APMO, 2
Consider a $100 \times 100$ table, and identify the cell in row $a$ and column $b$, $1 \leq a, b \leq 100$, with the ordered pair $(a, b)$. Let $k$ be an integer such that $51 \leq k \leq 99$. A $k$-knight is a piece that moves one cell vertically or horizontally and $k$ cells to the other direction; that is, it moves from $(a, b)$ to $(c, d)$ such that $(|a-c|, |b - d|)$ is either $(1, k)$ or $(k, 1)$. The $k$-knight starts at cell $(1, 1)$, and performs several moves. A sequence of moves is a sequence of cells $(x_0, y_0)= (1, 1)$, $(x_1, y_1), (x_2, y_2)$, $\ldots, (x_n, y_n)$ such that, for all $i = 1, 2, \ldots, n$, $1 \leq x_i , y_i \leq 100$ and the $k$-knight can move from $(x_{i-1}, y_{i-1})$ to $(x_i, y_i)$. In this case, each cell $(x_i, y_i)$ is said to be reachable. For each $k$, find $L(k)$, the number of reachable cells.
2005 Taiwan TST Round 1, 1
More than three quarters of the circumference of a circle is colored black. Prove that there exists a rectangle such that all of its vertices are black.
Actually the result holds if "three quarters" is replaced by "one half"...
2005 May Olympiad, 5
a) In each box of a $7\times 7$ board one of the numbers is written: $1, 2, 3, 4, 5, 6$ or $7$ of so that each number is written in seven different boxes. Is it possible that in no row and no column are consecutive numbers written?
b) In each box of a $5\times 5$ board one of the numbers is written: $1, 2, 3, 4$ or $5$ of so that each one is written in five different boxes. Is it possible that in no row and in no column are consecutive numbers written?
2025 Israel National Olympiad (Gillis), P4
A $100\times \sqrt{3}$ rectangular table is given. What is the minimum number of disk-shaped napkins of radius $1$ required to cover the table completely?
[i]Remark:[/i] The napkins are allowed to overlap and protrude the table's edges.
KoMaL A Problems 2020/2021, A. 800
In a finite, simple, connected graph $G$ we play the following game: initially we color all the vertices with a different color. In each step we choose a vertex randomly (with uniform distribution), and then choose one of its neighbors randomly (also with uniform distribution), and color it to the the same color as the originally chosen vertex (if the two chosen vertices already have the same color, we do nothing). The game ends when all the vertices have the same color.
Knowing graph $G$ find the probability for each vertex that the game ends with all vertices having the same color as the chosen vertex.
2016 BMT Spring, 7
Consider the graph on $1000$ vertices $v_1, v_2, ...v_{1000}$ such that for all $1 \le i < j \le 1000$, $v_i$ is connected to $v_j$ if and only if $i$ divides $j$. Determine the minimum number of colors that must be used to color the vertices of this graph such that no two vertices sharing an edge are the same color.
2012 Math Hour Olympiad, 8-10
[u]Round 1 [/u]
[b]p1.[/b] In the Hundred Acre Wood, all the animals are either knights or liars. Knights always tell the truth and liars always lie. One day in the Wood, Winnie-the-Pooh, a knight, decides to visit his friend Rabbit, also a noble knight. Upon arrival, Pooh finds his friend sitting at a round table with $5$ other guests.
One-by-one, Pooh asks each person at the table how many of his two neighbors are knights. Surprisingly, he gets the same answer from everybody! "Oh bother!" proclaims Pooh. "I still don't have enough information to figure out how many knights are at this table." "But it's my birthday," adds one of the guests. "Yes, it's his birthday!" agrees his neighbor.
Now Pooh can tell how many knights are at the table. Can you?
[b]p2.[/b] Harry has an $8 \times 8$ board filled with the numbers $1$ and $-1$, and the sum of all $64$ numbers is $0$. A magical cut of this board is a way of cutting it into two pieces so that the sum of the numbers in each piece is also $0$. The pieces should not have any holes. Prove that Harry will always be able to find a magical cut of his board. (The picture shows an example of a proper cut.)
[img]https://cdn.artofproblemsolving.com/attachments/4/b/98dec239cfc757e6f2996eef7876cbfd79d202.png[/img]
[b]p3.[/b] Several girls participate in a tennis tournament in which each player plays each other player exactly once. At the end of the tournament, it turns out that each player has lost at least one of her games. Prove that it is possible to find three players $A$, $B$, and $C$ such that $A$ defeated $B$, $B$ defeated $C$, and $C$ defeated $A$.
[b]p4.[/b] $120$ bands are participating in this year's Northwest Grunge Rock Festival, and they have $119$ fans in total. Each fan belongs to exactly one fan club. A fan club is called crowded if it has at least $15$ members.
Every morning, all the members of one of the crowded fan clubs start arguing over who loves their favorite band the most. As a result of the fighting, each of them leaves the club to join another club, but no two of them join the same one.
Is it true that, no matter how the clubs are originally arranged, all these arguments will eventually stop?
[b]p5.[/b] In Infinite City, the streets form a grid of squares extending infinitely in all directions. Bonnie and Clyde have just robbed the Infinite City Bank, located at the busiest intersection downtown. Bonnie sets off heading north on her bike, and, $30$ seconds later, Clyde bikes after her in the same direction. They each bike at a constant speed of $1$ block per minute. In order to throw off any authorities, each of them must turn either left or right at every intersection. If they continue biking in this manner, will they ever be able to meet?
[u]Round 2 [/u]
[b]p6.[/b] In a certain herd of $33$ cows, each cow weighs a whole number of pounds. Farmer Dan notices that if he removes any one of the cows from the herd, it is possible to split the remaining $32$ cows into two groups of equal total weight, $16$ cows in each group. Show that all $33$ cows must have the same weight.
[b]p7.[/b] Katniss is thinking of a positive integer less than $100$: call it $x$. Peeta is allowed to pick any two positive integers $N$ and $M$, both less than $100$, and Katniss will give him the greatest common divisor of $x+M$ and $N$ . Peeta can do this up to seven times, after which he must name Katniss' number $x$, or he will die. Can Peeta ensure his survival?
PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].
2021 CMIMC, 10
How many functions $f:\{1,2,3, \ldots, 7\} \rightarrow \{1,2,3, \ldots, 7\}$ are there such that the set $\mathcal{F} = \{f(i) : i\in\{1,\ldots, 7\}\}$ has cardinality four, while the set $\mathcal{G} = \{f(f(f(i))) : i\in\{1,\ldots, 7\}\}$ consists of a single element?
[i]Proposed by Sam Delatore[/i]
2020 IMO Shortlist, C2
In a regular 100-gon, 41 vertices are colored black and the remaining 59 vertices are colored white. Prove that there exist 24 convex quadrilaterals $Q_{1}, \ldots, Q_{24}$ whose corners are vertices of the 100-gon, so that
[list]
[*] the quadrilaterals $Q_{1}, \ldots, Q_{24}$ are pairwise disjoint, and
[*] every quadrilateral $Q_{i}$ has three corners of one color and one corner of the other color.
[/list]
2015 Romania Team Selection Tests, 2
Let $n$ be an integer greater than $1$, and let $p$ be a prime divisor of $n$. A confederation consists of $p$ states, each of which has exactly $n$ airports. There are $p$ air companies operating interstate flights only such that every two airports in different states are joined by a direct (two-way) flight operated by one of these companies. Determine the maximal integer $N$ satisfying the following condition: In every such confederation it is possible to choose one of the $p$ air companies and $N$ of the $np$ airports such that one may travel (not necessarily directly) from any one of the $N$ chosen airports to any other such only by flights operated by the chosen air company.
1999 Tournament Of Towns, 7
Prove that any convex polyhedron with $10n$ faces, has at least $n$ faces with the same number of sides.
(A Kanel)
2023 Costa Rica - Final Round, 3.4
A teacher wants her $N$ students to know each other, so she creates various clubs of three people, so that each student can participate in several clubs. The clubs are formed in such a way that if $A$ and $B$ are two people, then there is a single club such that $A$ and $B$ are two of its three members.
[b](1)[/b] Show that there is no way for the teacher to form the clubs if $N = 11$.
[b](2)[/b] Show that the teacher can do it if $N = 9$.
2009 Indonesia TST, 2
Prove that there exists two different permutations $ (a_1,a_2,\dots,a_{2009})$ and $ (b_1,b_2,\dots,b_{2009})$ of $ (1,2,\dots,2009)$ such that \[ \sum_{i\equal{}1}^{2009}i^i a_i \minus{} \sum_{i\equal{}1}^{2009} i^i b_i\] is divisible by $ 2009!$.
2006 All-Russian Olympiad Regional Round, 10.8
A convex polyhedron has $2n$ faces ($n\ge 3$), and all faces are triangles. What is the largest number of vertices at which converges exactly $3$ edges at a such a polyhedron ?
1990 IMO Longlists, 40
Given three letters $X, Y, Z$, we can construct letter sequences arbitrarily, such as $XZ, ZZYXYY, XXYZX$, etc. For any given sequence, we can perform following operations:
$T_1$: If the right-most letter is $Y$, then we can add $YZ$ after it, for example, $T_1(XYZXXY) =
(XYZXXYYZ).$
$T_2$: If The sequence contains $YYY$, we can replace them by $Z$, for example, $T_2(XXYYZYYYX) =
(XXYYZZX).$
$T_3$: We can replace $Xp$ ($p$ is any sub-sequence) by $XpX$, for example, $T_3(XXYZ) = (XXYZX).$
$T_4$: In a sequence containing one or more $Z$, we can replace the first $Z$ by $XY$, for example,
$T_4(XXYYZZX) = (XXYYXYZX).$
$T_5$: We can replace any of $XX, YY, ZZ$ by $X$, for example, $T_5(ZZYXYY) = (XYXX)$ or $(XYXYY)$ or $(ZZYXX).$
Using above operations, can we get $XYZZ$ from $XYZ \ ?$
2009 Philippine MO, 3
Each point of a circle is colored either red or blue.
[b](a)[/b] Prove that there always exists an isosceles triangle inscribed in this circle such that all its vertices are colored the same.
[b](b)[/b] Does there always exist an equilateral triangle inscribed in this circle such that all its vertices are colored the same?