Found problems: 815
Determine for which $ n$ positive integer the equation: $ a \plus{} b \plus{} c \plus{} d \equal{} n \sqrt {abcd}$ has positive integer solutions.
Let $ABC$ be an acute triangle. Points $B'$ and $C'$ are located on the interior of sides $AB$ and $AC$, respectively. Let $M$ denote the second intersection of the circumcircles of triangles $ABC$ and $AB'C'$, while let $N$ denote the second intersection of the circumcircles of triangles $ABC'$ and $AB'C$. Reflect $M$ across lines $AB$ and $AC$, and let $l$ denote the line through the reflections.
a) Prove that the line through $M$ perpendicular to $AM$, the line $AK$, and $l$ are either concurrent or all parallel.
b) Show that if the three lines are concurrent at $S$, then triangles $SBC'$ and $SCB'$ have equal areas.
[i]Proposed by Áron Bán-Szabó, Budapest[/i]
By a $\emph{tile}$ we mean a polyomino (i.e. a finite edge-connected set of cells in the infinite grid). There are many ways to place a tile in the infinite table (rotation is allowed but we cannot flip the tile). We call a tile $\textbf{T}$ special if we can place a permutation of the positive integers on all cells of the infinite table in such a way that each number would be maximum between all the numbers that tile covers in at most one placement of the tile.
1. Prove that each square is a special tile.
2. Prove that each non-square rectangle is not a special tile.
3. Prove that tile $\textbf{T}$ is special if and only if it looks the same after $90^\circ$ rotation.
There are $n \ge 3$ positive integers written on a board. A [i]move[/i] consists of choosing three numbers $a, b, c$ written from the board such that there exists a non-degenerate non-equilateral triangle with sides $a, b, c$ and replacing those numbers with $a + b - c, b + c - a$ and $c + a - b$.
Prove that a sequence of moves cannot be infinite.
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]
Let $a$ and $b$ be distinct positive integers. The following infinite process takes place on an initially empty board.
[list=i]
[*] If there is at least a pair of equal numbers on the board, we choose such a pair and increase one of its components by $a$ and the other by $b$.
[*] If no such pair exists, we write two times the number $0$.
[/list]
Prove that, no matter how we make the choices in $(i)$, operation $(ii)$ will be performed only finitely many times.
Proposed by [I]Serbia[/I].
From the number $7^{1996}$ we delete its first digit, and then add the same digit to the remaining number. This process continues until the left number has ten digits. Show that the left number has two same digits.
Let $a$ and $b$ be distinct positive integers. The following infinite process takes place on an initially empty board.
[list=i]
[*] If there is at least a pair of equal numbers on the board, we choose such a pair and increase one of its components by $a$ and the other by $b$.
[*] If no such pair exists, we write two times the number $0$.
[/list]
Prove that, no matter how we make the choices in $(i)$, operation $(ii)$ will be performed only finitely many times.
Proposed by [I]Serbia[/I].
Two squirrels, Bushy and Jumpy, have collected 2021 walnuts for the winter. Jumpy numbers the walnuts from 1 through 2021, and digs 2021 little holes in a circular pattern in the ground around their favourite tree. The next morning Jumpy notices that Bushy had placed one walnut into each hole, but had paid no attention to the numbering. Unhappy, Jumpy decides to reorder the walnuts by performing a sequence of 2021 moves. In the $k$-th move, Jumpy swaps the positions of the two walnuts adjacent to walnut $k$.
Prove that there exists a value of $k$ such that, on the $k$-th move, Jumpy swaps some walnuts $a$ and $b$ such that $a<k<b$.
Let $ABC$ be a triangle with $AB=AC$. A circle $\Gamma$ lies outside triangle $ABC$ and is tangent to line $AC$ at $C$. Point $D$ lies on $\Gamma$ such that the circumcircle of triangle $ABD$ is internally tangent to $\Gamma$. Segment $AD$ meets $\Gamma$ secondly at $E$. Prove that $BE$ is tangent to $\Gamma$
Ivan writes the matrix $\begin{pmatrix} 2 & 3\\ 2 & 4\end{pmatrix}$ on the board. Then he performs the following operation on the matrix several times:
[b]1.[/b] he chooses a row or column of the matrix, and
[b]2.[/b] he multiplies or divides the chosen row or column entry-wise by the other row or column, respectively.
Can Ivan end up with the matrix $\begin{pmatrix} 2 & 4\\ 2 & 3\end{pmatrix}$ after finitely many steps?
Let triangle $ABC$ have altitudes $BE$ and $CF$ which meet at $H$. The reflection of $A$ over $BC$ is $A'$. Let $(ABC)$ meet $(AA'E)$ at $P$ and $(AA'F)$ at $Q$. Let $BC$ meet $PQ$ at $R$. Prove that $EF \parallel HR$.
[i]Proposed by Daniel Hu[/i]
Each term in a sequence $1,0,1,0,1,0...$starting with the seventh is the sum of the last 6 terms mod 10 .Prove that the sequence $...,0,1,0,1,0,1...$ never occurs
Let $ n$ and $ k$ be positive integers with $ k \geq n$ and $ k \minus{} n$ an even number. Let $ 2n$ lamps labelled $ 1$, $ 2$, ..., $ 2n$ be given, each of which can be either [i]on[/i] or [i]off[/i]. Initially all the lamps are off. We consider sequences of steps: at each step one of the lamps is switched (from on to off or from off to on).
Let $ N$ be the number of such sequences consisting of $ k$ steps and resulting in the state where lamps $ 1$ through $ n$ are all on, and lamps $ n \plus{} 1$ through $ 2n$ are all off.
Let $ M$ be number of such sequences consisting of $ k$ steps, resulting in the state where lamps $ 1$ through $ n$ are all on, and lamps $ n \plus{} 1$ through $ 2n$ are all off, but where none of the lamps $ n \plus{} 1$ through $ 2n$ is ever switched on.
Determine $ \frac {N}{M}$.
[i]Author: Bruno Le Floch and Ilia Smilga, France[/i]
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$.
A polynomial $P(x, y, z)$ in three variables with real coefficients satisfies the identities
$$P(x, y, z)=P(x, y, xy-z)=P(x, zx-y, z)=P(yz-x, y, z).$$
Prove that there exists a polynomial $F(t)$ in one variable such that
$$P(x,y,z)=F(x^2+y^2+z^2-xyz).$$
A finite number of coins are placed on an infinite row of squares. A sequence of moves is performed as follows: at each stage a square containing more than one coin is chosen. Two coins are taken from this square; one of them is placed on the square immediately to the left while the other is placed on the square immediately to the right of the chosen square. The sequence terminates if at some point there is at most one coin on each square. Given some initial configuration, show that any legal sequence of moves will terminate after the same number of steps and with the same final configuration.
Let $G= \{ A \in \mathcal M_2 \left( \mathbb C \right) \mid |\det A| = 1 \}$ and $H =\{A \in \mathcal M_2 \left( \mathbb C \right) \mid \det A = 1 \}$. Prove that $G$ and $H$ together with the operation of matrix multiplication are two non-isomorphical groups.
There are $N$ monsters, each with a positive weight. On each step, two of the monsters are merged into one, whose weight is the sum of weights for the two original monsters. At the end, all monsters will be merged into one giant monster. During this process, if at any mergence, one of the two monsters has a weight greater than $2.020$ times the other monster's weight, we will call this mergence [b]dangerous[/b]. The dangerous level of a sequence of mergences is the number of dangerous mergence throughout its process.
Prove that, no matter how the weights being distributed among the monsters, "for every step, merge the lightest two monsters" is always one of the merging sequences that obtain the minimum possible dangerous level.
[i]Proposed by houkai[/i]
Suppose there are $n$ distinct points on plane. There is circle with radius $r$ and center $O$ on the plane. At least one of the points are in the circle. We do the following instructions. At each step we move $O$ to the baricenter of the point in the circle. Prove that location of $O$ is constant after some steps.
a. Let $ABC$ be a triangle with altitude $AD$ and $P$ a variable point on $AD$. Lines $PB$ and $AC$ intersect each other at $E$, lines $PC$ and $AB$ intersect each other at $F.$ Suppose $AEDF$ is a quadrilateral inscribed . Prove that \[\frac{PA}{PD}=(\tan B+\tan C)\cot \frac{A}{2}.\]
b. Let $ABC$ be a triangle with orthocentre $H$ and $P$ a variable point on $AH$. The line through $C$ perpendicular to $AC$ meets $BP$ at $M$, The line through $B$ perpendicular to $AB$ meets $CP$ at $N.$ $K$ is the projection of $A$on $MN$. Prove that $\angle BKC+\angle MAN$ is invariant .
Let $ABC$ be a triangle and let $M$ and $N$ denote the midpoints of $\overline{AB}$ and $\overline{AC}$, respectively. Let $X$ be a point such that $\overline{AX}$ is tangent to the circumcircle of triangle $ABC$. Denote by $\omega_B$ the circle through $M$ and $B$ tangent to $\overline{MX}$, and by $\omega_C$ the circle through $N$ and $C$ tangent to $\overline{NX}$. Show that $\omega_B$ and $\omega_C$ intersect on line $BC$.
[i]Merlijn Staps[/i]
In the coordinate plane consider the set $ S$ of all points with integer coordinates. For a positive integer $ k$, two distinct points $A$, $ B\in S$ will be called $ k$-[i]friends[/i] if there is a point $ C\in S$ such that the area of the triangle $ ABC$ is equal to $ k$. A set $ T\subset S$ will be called $ k$-[i]clique[/i] if every two points in $ T$ are $ k$-friends. Find the least positive integer $ k$ for which there exits a $ k$-clique with more than 200 elements.
[i]Proposed by Jorge Tipe, Peru[/i]
There are 20 people at a party. Each person holds some number of coins. Every minute, each person who has at least 19 coins simultaneously gives one coin to every other person at the party. (So, it is possible that $A$ gives $B$ a coin and $B$ gives $A$ a coin at the same time.) Suppose that this process continues indefinitely. That is, for any positive integer $n$, there exists a person who will give away coins during the $n$th minute. What is the smallest number of coins that could be at the party?
[i]Proposed by Ray Li[/i]
Assume $n$ is a positive integer. Considers sequences $a_0, a_1, \ldots, a_n$ for which $a_i \in \{1, 2, \ldots , n\}$ for all $i$ and $a_n = a_0$.
(a) Suppose $n$ is odd. Find the number of such sequences if $a_i - a_{i-1} \not \equiv i \pmod{n}$ for all $i = 1, 2, \ldots, n$.
(b) Suppose $n$ is an odd prime. Find the number of such sequences if $a_i - a_{i-1} \not \equiv i, 2i \pmod{n}$ for all $i = 1, 2, \ldots, n$.