Found problems: 5802
On a blackboard there are three positive integers. In each step the three numbers on the board are denoted as $a, b, c$ such that $a >gcd(b, c)$, then $a$ gets replaced by $ a-gcd(b, c)$. The game ends if there is no way to denote the numbers such that $a >gcd(b, c)$.
Prove that the game always ends and that the last three numbers on the blackboard only depend on the starting numbers.
(Theresia Eisenkölbl)
Find the largest constant $c>0$ such that for every positive integer $n\ge 2$, there always exist a positive divisor $d$ of $n$ such that $$d\le \sqrt{n}\hspace{0.5cm} \text{and} \hspace{0.5cm} \tau(d)\ge c\sqrt{\tau(n)}$$ where $\tau(n)$ is the number of divisors of $n$.
[i]Proposed by Mohd. Suhaimi Ramly[/i]
Let $n \geq 4$ be an integer. Find all positive real solutions to the following system of $2n$ equations:
\begin{align*}
a_{1} &=\frac{1}{a_{2 n}}+\frac{1}{a_{2}}, & a_{2}&=a_{1}+a_{3}, \\
a_{3}&=\frac{1}{a_{2}}+\frac{1}{a_{4}}, & a_{4}&=a_{3}+a_{5}, \\
a_{5}&=\frac{1}{a_{4}}+\frac{1}{a_{6}}, & a_{6}&=a_{5}+a_{7} \\
&\vdots & &\vdots \\
a_{2 n-1}&=\frac{1}{a_{2 n-2}}+\frac{1}{a_{2 n}}, & a_{2 n}&=a_{2 n-1}+a_{1}
\end{align*}
For positive integers $n$ and $k \geq 2$, define $E_k(n)$ as the greatest exponent $r$ such that $k^r$ divides $n!$. Prove that there are infinitely many $n$ such that $E_{10}(n) > E_9(n)$ and infinitely many $m$ such that $E_{10}(m) < E_9(m)$.
Let $k$ be a positive integer. Arnaldo and Bernaldo play a game in a table $2020\times 2020$, initially all the cells are empty. In each round a player chooses a empty cell and put one red token or one blue token, Arnaldo wins if in some moment, there are $k$ consecutive cells in the same row or column with tokens of same color, if all the cells have a token and there aren't $k$ consecutive cells(row or column) with same color, then Bernaldo wins. If the players play alternately and Arnaldo goes first, determine for which values of $k$, Arnaldo has the winning strategy.
Let $p$ be a prime, $n$ be a positive integer, and let $\mathbb{Z}_{p^n}$ denote the set of congruence classes modulo $p^n.$ Determine the number of functions $f: \mathbb{Z}_{p^n} \to \mathbb{Z}_{p^n}$ satisfying the condition
\[ f(a)+f(b) \equiv f(a+b+pab) \pmod{p^n} \]
for all $a,b \in \mathbb{Z}_{p^n}.$
Let $a_0, a_1, \ldots, a_{10}$ be integers such that, for each $i \in \{0,1,\ldots,2047\}$, there exists a subset $S \subseteq \{0,1,\ldots,10\}$ with
\[
\sum_{j \in S} a_j \equiv i \pmod{2048}.
\]
Show that for each $i \in \{0,1,\ldots,10\}$, there is exactly one $j \in \{0,1,\ldots,10\}$ such that $a_j$ is divisible by $2^i$ but not by $2^{i+1}$.
Note: $\sum_{j \in S} a_j$ is the summation notation, for instance, $\sum_{j \in \{2,5\}} a_j = a_2 + a_5$, while for the empty set $\varnothing$, one defines $\sum_{j \in \varnothing} a_j = 0$.
Let $G$ be a weighted bipartite graph $A \cup B$, with $|A| = |B| = n$. In other words, each edge in the graph is assigned a positive integer value, called its [i]weight.[/i] Also, define the weight of a perfect matching in $G$ to be the sum of the weights of the edges in the matching.
Let $G'$ be the graph with vertex set $A \cup B$, and (which) contains the edge $e$ if and only if $e$ is part of some minimum weight perfect matching in $G$.
Show that all perfect matchings in $G'$ have the same weight.
Prove that for every pair of positive real numbers $a, b$ and for every positive integer $n$,
$$(a+b)^n-a^n-b^n \ge \frac{2^n-2}{2^{n-2}} \cdot ab(a+b)^{n-2}.$$
2008 persons take part in a programming contest. In one round, the 2008 programmers are divided into two groups. Find the minimum number of groups such that every two programmers ever be in the same group.
Define the sequence $x_1, x_2, ...$ inductively by $x_1 = \sqrt{5}$ and $x_{n+1} = x_n^2 - 2$ for each $n \geq 1$. Compute
$\lim_{n \to \infty} \frac{x_1 \cdot x_2 \cdot x_3 \cdot ... \cdot x_n}{x_{n+1}}$.
Let $n$ be a positive integer. Let $a_1$, $a_2$, $\ldots\,$, $a_n$ be real numbers such that $-1 \le a_i \le 1$ (for all $1 \le i \le n$). Let $b_1$, $b_2$, $\ldots$, $b_n$ be real numbers such that $-1 \le b_i \le 1$ (for all $1 \le i \le n$). Prove that
\[
\left| \prod_{i=1}^n a_i - \prod_{i=1}^n b_i \right|
\le \sum_{i = 1}^n \left| a_i - b_i \right| \, .
\]
There are n cups arranged on the circle. Under one of cups is hiden a coin. For every move, it is allowed to choose 4 cups and verify if the coin lies under these cups. After that, the cups are returned into its former places and the coin moves to one of two neigbor cups. What is the minimal number of moves we need in order to eventually find where the coin is?
Let $a > 1$ be a positive integer and $d > 1$ be a positive integer coprime to $a$. Let $x_1=1$, and for $k\geq 1$, define
$$x_{k+1} = \begin{cases}
x_k + d &\text{if } a \text{ does not divide } x_k \\
x_k/a & \text{if } a \text{ divides } x_k
\end{cases}$$
Find, in terms of $a$ and $d$, the greatest positive integer $n$ for which there exists an index $k$ such that $x_k$ is divisible by $a^n$.
Prove the following identity for every $ n\in N$:
$ \sum_{j\plus{}h\equal{}n,j\geq h}\frac{(\minus{}1)^h2^{j\minus{}h}\binom{j}{h}}{j}\equal{}\frac{2}{n}$
Find all functions $ f: \mathbb Q\longrightarrow\mathbb Q$ such that:
$ f(x)+f(\frac1x)=1$
$ 2f(f(x))=f(2x)$
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]
Is there a positive integer $n$ for which the following holds:
for an arbitrary rational $r$ there exists an integer $b$ and non-zero integers $a _1, a_2, ..., a_n$ such that $r=b+\frac{1}{a_1}+\frac{1}{a_2}+...+\frac{1}{a_n}$ ?
Originally, every square of $8 \times 8$ chessboard contains a rook. One by one, rooks which attack an odd number of others are removed. Find the maximal number of rooks that can be removed. (A rook attacks another rook if they are on the same row or column and there are no other rooks between them.)
[i](6 points)[/i]
The sequences $(a_n), (b_n),$ and $(c_n)$ are de fined by $a_0 = 1, b_0 = 0, c_0 = 0,$ and
\[a_n = a_{n-1} +
\frac{c_{n-1}}{n}, b_n = b_{n-1} +\frac{a_{n-1}}{n}, c_n = c_{n-1} +\frac{b_{n-1}}{n}\]
for all $n \geq1$. Prove that
\[\left|a_n -\frac{n + 1}{3}\right|<\frac{2}{\sqrt{3n}}\]
for all $n \geq 1$.
Let $n\ge 3$ be an integer, and let $a_2,a_3,\ldots ,a_n$ be positive real numbers such that $a_{2}a_{3}\cdots a_{n}=1$. Prove that
\[(1 + a_2)^2 (1 + a_3)^3 \dotsm (1 + a_n)^n > n^n.\]
[i]Proposed by Angelo Di Pasquale, Australia[/i]
A convex 2011-gon is drawn on the board. Peter keeps drawing its diagonals in such a way, that each newly drawn diagonal intersected no more than one of the already drawn diagonals. What is the greatest number of diagonals that Peter can draw?
Fix positive integers $n$ and $k$, and $2n$ positive (not neccesarily distinct) real numbers $a_1,\cdots, a_n$, $b_1, \cdots, b_n$. An equation is written on a whiteboard: $$t=*\times*\times\cdots\times*$$ where $t$ is a fixed positive real number, with exactly $k$ asterisks.
Ebi fills each asterisk with a number from $a_1, a_2,\cdots, a_n$, while Rubi fills each asterisk with a number from $b_1, b_2,\cdots, b_n$, so that the equation on the whiteboard is correct. Suppose for every positive real number $t$, the number of ways for Ebi and Rubi to do so are equal.
Prove that the sequences $a_1,\cdots, a_n$ and $b_1, \cdots, b_n$ are permutations of each other.
[i](Note: $t=a_1a_2a_3$ and $t=a_2a_3a_1$ are considered different ways to fill the asterisks, and the chosen terms need not be distinct, for example $t=a_1a_1a_2$.)[/i]
[i]Proposed by Wong Jer Ren[/i]
In each side of a regular polygon with $n$ sides, we choose a point different from the vertices and we obtain a new polygon of $n$ sides. For which values of $n$ can we obtain a polygon such that the internal angles are all equal but the polygon isn't regular?
We say that a set $S$ of integers is [i]rootiful[/i] if, for any positive integer $n$ and any $a_0, a_1, \cdots, a_n \in S$, all integer roots of the polynomial $a_0+a_1x+\cdots+a_nx^n$ are also in $S$. Find all rootiful sets of integers that contain all numbers of the form $2^a - 2^b$ for positive integers $a$ and $b$.