Found problems: 259
2022 Bulgarian Autumn Math Competition, Problem 9.4
Given is $2022\times 2022$ cells table. We can select $4$ cells, such that they make the figure $L$ (rotations, symmetric still count) (left one) and put a ball in each of them, or select $4$ cell which makes up the right figure (rotations, symmetric still count) and get one ball from each of them.
For which $k$ is it possible in a given moment to be exactly $k$ points in each of the cells
2009 Romanian Masters In Mathematics, 4
For a finite set $ X$ of positive integers, let $ \Sigma(X) \equal{} \sum_{x \in X} \arctan \frac{1}{x}.$ Given a finite set $ S$ of positive integers for which $ \Sigma(S) < \frac{\pi}{2},$ show that there exists at least one finite set $ T$ of positive integers for which $ S \subset T$ and $ \Sigma(S) \equal{} \frac{\pi}{2}.$
[i]Kevin Buzzard, United Kingdom[/i]
India EGMO 2021 TST, 1
Mad scientist Kyouma writes $N$ positive integers on a board. Each second, he chooses two numbers $x, y$ written on the board with $x > y$, and writes the number $x^2-y^2$ on the board. After some time, he sends the list of all the numbers on the board to Christina. She notices that all the numbers from 1 to 1000 are present on the list. Aid Christina in finding the minimum possible value of N.
1997 IMO Shortlist, 2
Let $ R_1,R_2, \ldots$ be the family of finite sequences of positive integers defined by the following rules: $ R_1 \equal{} (1),$ and if $ R_{n - 1} \equal{} (x_1, \ldots, x_s),$ then
\[ R_n \equal{} (1, 2, \ldots, x_1, 1, 2, \ldots, x_2, \ldots, 1, 2, \ldots, x_s, n).\]
For example, $ R_2 \equal{} (1, 2),$ $ R_3 \equal{} (1, 1, 2, 3),$ $ R_4 \equal{} (1, 1, 1, 2, 1, 2, 3, 4).$ Prove that if $ n > 1,$ then the $ k$th term from the left in $ R_n$ is equal to 1 if and only if the $ k$th term from the right in $ R_n$ is different from 1.
1982 IMO Longlists, 52
We are given $2n$ natural numbers
\[1, 1, 2, 2, 3, 3, \ldots, n - 1, n - 1, n, n.\]
Find all $n$ for which these numbers can be arranged in a row such that for each $k \leq n$, there are exactly $k$ numbers between the two numbers $k$.
2014 Contests, 1
Numbers $1$ through $2014$ are written on a board. A valid operation is to erase two numbers $a$ and $b$ on the board and replace them with the greatest common divisor and the least common multiple of $a$ and $b$.
Prove that, no matter how many operations are made, the sum of all the numbers that remain on the board is always larger than $2014$ $\times$ $\sqrt[2014]{2014!}$
2012 Iran MO (3rd Round), 5
We call the three variable polynomial $P$ cyclic if $P(x,y,z)=P(y,z,x)$. Prove that cyclic three variable polynomials $P_1,P_2,P_3$ and $P_4$ exist such that for each cyclic three variable polynomial $P$, there exists a four variable polynomial $Q$ such that $P(x,y,z)=Q(P_1(x,y,z),P_2(x,y,z),P_3(x,y,z),P_4(x,y,z))$.
[i]Solution by Mostafa Eynollahzade and Erfan Salavati[/i]
2008 Putnam, A3
Start with a finite sequence $ a_1,a_2,\dots,a_n$ of positive integers. If possible, choose two indices $ j < k$ such that $ a_j$ does not divide $ a_k$ and replace $ a_j$ and $ a_k$ by $ \gcd(a_j,a_k)$ and $ \text{lcm}\,(a_j,a_k),$ respectively. Prove that if this process is repeated, it must eventually stop and the final sequence does not depend on the choices made. (Note: $ \gcd$ means greatest common divisor and lcm means least common multiple.)
2005 China National Olympiad, 3
As the graph, a pond is divided into 2n (n $\geq$ 5) parts. Two parts are called neighborhood if they have a common side or arc. Thus every part has three neighborhoods. Now there are 4n+1 frogs at the pond. If there are three or more frogs at one part, then three of the frogs of the part will jump to the three neighborhoods repsectively. Prove that for some time later, the frogs at the pond will uniformily distribute. That is, for any part either there are frogs at the part or there are frogs at the each of its neighborhoods.
[img]http://www.mathlinks.ro/Forum/files/china2005_2_214.gif[/img]
1992 Canada National Olympiad, 5
A deck of $ 2n\plus{}1$ cards consists of a joker and, for each number between 1 and $ n$ inclusive, two cards marked with that number. The $ 2n\plus{}1$ cards are placed in a row, with the joker in the middle. For each $ k$ with $ 1 \leq k \leq n,$ the two cards numbered $ k$ have exactly $ k\minus{}1$ cards between them. Determine all the values of $ n$ not exceeding 10 for which this arrangement is possible. For which values of $ n$ is it impossible?
2015 Belarus Team Selection Test, 1
We have $2^m$ sheets of paper, with the number $1$ written on each of them. We perform the following operation. In every step we choose two distinct sheets; if the numbers on the two sheets are $a$ and $b$, then we erase these numbers and write the number $a + b$ on both sheets. Prove that after $m2^{m -1}$ steps, the sum of the numbers on all the sheets is at least $4^m$ .
[i]Proposed by Abbas Mehrabian, Iran[/i]
2013 AMC 10, 4
When counting from $3$ to $201$, $53$ is the $51^{\text{st}}$ number counted. When counting backwards from $201$ to $3$, $53$ is the $n^{\text{th}}$ number counted. What is $n$?
$\textbf{(A) }146\qquad \textbf{(B) } 147\qquad\textbf{(C) } 148\qquad\textbf{(D) }149\qquad\textbf{(E) }150$
1998 Polish MO Finals, 3
$S$ is a board containing all unit squares in the $xy$ plane whose vertices have integer coordinates and which lie entirely inside the circle $x^2 + y^2 = 1998^2$. In each square of $S$ is written $+1$. An allowed move is to change the sign of every square in $S$ in a given row, column or diagonal. Can we end up with exactly one $-1$ and $+1$ on the rest squares by a sequence of allowed moves?
2010 Tournament Of Towns, 3
Each of $999$ numbers placed in a circular way is either $1$ or $-1$. (Both values appear). Consider the total sum of the products of every $10$ consecutive numbers.
$(a)$ Find the minimal possible value of this sum.
$(b)$ Find the maximal possible value of this sum.
2011 Czech-Polish-Slovak Match, 2
Written on a blackboard are $n$ nonnegative integers whose greatest common divisor is $1$. A [i]move[/i] consists of erasing two numbers $x$ and $y$, where $x\ge y$, on the blackboard and replacing them with the numbers $x-y$ and $2y$. Determine for which original $n$-tuples of numbers on the blackboard is it possible to reach a point, after some number of moves, where $n-1$ of the numbers of the blackboard are zeroes.
2000 IMO Shortlist, 5
Let $ n \geq 2$ be a positive integer and $ \lambda$ a positive real number. Initially there are $ n$ fleas on a horizontal line, not all at the same point. We define a move as choosing two fleas at some points $ A$ and $ B$, with $ A$ to the left of $ B$, and letting the flea from $ A$ jump over the flea from $ B$ to the point $ C$ so that $ \frac {BC}{AB} \equal{} \lambda$.
Determine all values of $ \lambda$ such that, for any point $ M$ on the line and for any initial position of the $ n$ fleas, there exists a sequence of moves that will take them all to the position right of $ M$.
1995 Belarus National Olympiad, Problem 8
Five numbers 1,2,3,4,5 are written on a blackboard. A student may
erase any two of the numbers a and b on the board and write the
numbers a+b and ab replacing them. If this operation is performed repeatedly, can the numbers 21,27,64,180,540 ever appear on the board?
2013 All-Russian Olympiad, 2
Circle is divided into $n$ arcs by $n$ marked points on the circle. After that circle rotate an angle $ 2\pi k/n $ (for some positive integer $ k $), marked points moved to $n$ [i] new points [/i], dividing the circle into $ n $ [i] new arcs[/i]. Prove that there is a new arc that lies entirely in the one of the old arсs.
(It is believed that the endpoints of arcs belong to it.)
[i]I. Mitrophanov[/i]
2004 Bulgaria National Olympiad, 4
In a word formed with the letters $a,b$ we can change some blocks: $aba$ in $b$ and back, $bba$ in $a$ and backwards. If the initial word is $aaa\ldots ab$ where $a$ appears 2003 times can we reach the word $baaa\ldots a$, where $a$ appears 2003 times.
2015 Tournament of Towns, 5
Several distinct real numbers are written on a blackboard. Peter wants to create an algebraic expression such that among its values there would be these and only these numbers. He may use any real numbers, brackets, signs $+, -, \times$ and a special sign $\pm$. Usage of $\pm$ is equivalent to usage of $+$ and $-$ in all possible combinations. For instance, the expression $5 \pm 1$ results in $\{4, 6\}$, while $(2 \pm 0.5) \pm 0.5$ results in $\{1, 2, 3\}$.
Can Peter construct an expression if the numbers on the blackboard are :
(a) $1, 2, 4$ ? [i]($2$ points)[/i]
(b) any $100$ distinct real numbers ? [i]($6$ points)[/i]
2001 Bulgaria National Olympiad, 3
Given a permutation $(a_{1}, a_{1},...,a_{n})$ of the numbers $1, 2,...,n$ one may interchange any two consecutive "blocks" - that is, one may transform
($a_{1}, a_{2},...,a_{i}$,$\underbrace {a_{i+1},... a_{i+p},}_{A} $ $ \underbrace{a_{i+p+1},...,a_{i+q},}_{B}...,a_{n}) $
into
$ (a_{1}, a_{2},...,a_{i},$ $ \underbrace {a_{i+p+1},...,a_{i+q},}_{B} $ $ \underbrace {a_{i+1},... a_{i+p}}_{A}$$,...,a_{n}) $
by interchanging the "blocks" $A$ and $B$. Find the least number of such changes which are needed to transform $(n, n-1,...,1)$ into $(1,2,...,n)$
2006 Germany Team Selection Test, 2
There are $ n$ markers, each with one side white and the other side black. In the beginning, these $ n$ markers are aligned in a row so that their white sides are all up. In each step, if possible, we choose a marker whose white side is up (but not one of the outermost markers), remove it, and reverse the closest marker to the left of it and also reverse the closest marker to the right of it. Prove that, by a finite sequence of such steps, one can achieve a state with only two markers remaining if and only if $ n \minus{} 1$ is not divisible by $ 3$.
[i]Proposed by Dusan Dukic, Serbia[/i]
2016 Philippine MO, 1
The operations below can be applied on any expression of the form \(ax^2+bx+c\).
$(\text{I})$ If \(c \neq 0\), replace \(a\) by \(4a-\frac{3}{c}\) and \(c\) by \(\frac{c}{4}\).
$(\text{II})$ If \(a \neq 0\), replace \(a\) by \(-\frac{a}{2}\) and \(c\) by \(-2c+\frac{3}{a}\).
$(\text{III}_t)$ Replace \(x\) by \(x-t\), where \(t\) is an integer. (Different values of \(t\) can be used.)
Is it possible to transform \(x^2-x-6\) into each of the following by applying some sequence of the above operations?
$(\text{a})$ \(5x^2+5x-1\)
$(\text{b})$ \(x^2+6x+2\)
2022 IMO Shortlist, C4
Let $n > 3$ be a positive integer. Suppose that $n$ children are arranged in a circle, and $n$ coins are distributed between them (some children may have no coins). At every step, a child with at least 2 coins may give 1 coin to each of their immediate neighbors on the right and left. Determine all initial distributions of the coins from which it is possible that, after a finite number of steps, each child has exactly one coin.
1996 APMO, 1
Let $ABCD$ be a quadrilateral $AB = BC = CD = DA$. Let $MN$ and $PQ$ be two segments perpendicular to the diagonal $BD$ and such that the distance between them is $d > \frac{BD}{2}$, with $M \in AD$, $N \in DC$, $P \in AB$, and $Q \in BC$. Show that the perimeter of hexagon $AMNCQP$ does not depend on the position of $MN$ and $PQ$ so long as the distance between them remains constant.