Found problems: 5802
For any positive integer $a,$ $\sigma(a)$ denotes the sum of the positive integer divisors of $a.$ Let $n$ be the least positive integer such that $\sigma(a^n)-1$ is divisible by $2021$ for all positive integers $a.$ Find the sum of the prime factors in the prime factorization of $n.$
A sequence $a_1, a_2, a_3, \ldots$ of positive integers satisfies $a_1 > 5$ and $a_{n+1} = 5 + 6 + \cdots + a_n$ for all positive integers $n$. Determine all prime numbers $p$ such that, regardless of the value of $a_1$, this sequence must contain a multiple of $p$.
There are $n$ coins in a row, $n\geq 2$. If one of the coins is head, select an odd number of consecutive coins (or even 1 coin) with the one in head on the leftmost, and then flip all the selected coins upside down simultaneously. This is a $move$. No move is allowed if all $n$ coins are tails.
Suppose $m-1$ coins are heads at the initial stage, determine if there is a way to carry out $ \lfloor\frac {2^m}{3}\rfloor $ moves
Find all functions $f: \mathbb{N} \to \mathbb{N}$ such that $$\gcd(f(x),y)f(xy)=f(x)f(y)$$ for all positive integers $x, y$.
For integers $n>1$, define $f(n)$ to be the sum of all postive divisors of $n$ that are less than $n$. Prove that for any positive integer $k$, there exists a positive integer $n>1$ such that $n<f(n)<f^2(n)<\cdots<f^k(n)$, where $f^i(n)=f(f^{i-1}(n))$ for $i>1$ and $f^1(n)=f(n)$.
Let $\mathbb{Q}_{>0}$ denote the set of all positive rational numbers. Determine all functions $f:\mathbb{Q}_{>0}\to \mathbb{Q}_{>0}$ satisfying $$f(x^2f(y)^2)=f(x)^2f(y)$$ for all $x,y\in\mathbb{Q}_{>0}$
Find the set of all $ a \in \mathbb{R}$ for which there is no infinite sequene $ (x_n)_{n \geq 0} \subset \mathbb{R}$ satisfying $ x_0 \equal{} a,$ and for $ n \equal{} 0,1, \ldots$ we have \[ x_{n\plus{}1} \equal{} \frac{x_n \plus{} \alpha}{\beta x_n \plus{} 1}\] where $ \alpha \beta > 0.$
Prove that the number $\left\lfloor\left(5+\sqrt{35}\right)^{2n-1}\right\rfloor$ is divisible by $10^n$ for each $n\in\mathbb N$.
$5$ points are given in the plane, any three non-collinear and any four non-concyclic. If three points determine a circle that has one of the remaining points inside it and the other one outside it, then the circle is said to be [i]good[/i]. Let the number of good circles be $n$; find all possible values of $n$.
The number $2019$ is written on a blackboard. Every minute, if the number $a$ is written on the board, Evan erases it and replaces it with a number chosen from the set
$$ \left\{ 0, 1, 2, \ldots, \left\lceil 2.01 a \right\rceil \right\} $$
uniformly at random. Is there an integer $N$ such that the board reads $0$ after $N$ steps with at least $99\%$ probability?
Consider a tree with $n$ vertices, labeled with $1,\ldots,n$ in a way that no label is used twice. We change the labeling in the following way - each time we pick an edge that hasn't been picked before and swap the labels of its endpoints. After performing this action $n-1$ times, we get another tree with its labeling a permutation of the first graph's labeling.
Prove that this permutation contains exactly one cycle.
$1993$ points are arranged in a circle. At time $0$ each point is arbitrarily labeled $+1$ or $-1$. At times $n = 1, 2, 3, ...$ the vertices are relabeled. At time $n$ a vertex is given the label $+1$ if its two neighbours had the same label at time $n-1$, and it is given the label $-1$ if its two neighbours had different labels at time $n-1$. Show that for some time $n > 1$ the labeling will be the same as at time $1.$
Prove that every positive integer can be written as a finite sum of distinct integral powers of the golden ratio.
Let $n$ be a fixed positive integer. Determine the smallest possible rank of an $n\times n$ matrix that has zeros along the main diagonal and strictly positive real numbers off the main diagonal.
[i]Proposed by Ilya Bogdanov and Grigoriy Chelnokov, MIPT, Moscow.[/i]
Let $n$ be a positive integer. Determine the smallest positive integer $k$ with the following property: it is possible to mark $k$ cells on a $2n \times 2n$ board so that there exists a unique partition of the board into $1 \times 2$ and $2 \times 1$ dominoes, none of which contain two marked cells.
Find all positive integers $n$ satisfying the following: there exists a way to fill in $1, \cdots, n^2$ into a $n \times n$ grid so that each block has exactly one number, each number appears exactly once, and:
1. For all positive integers $1 \leq i < n^2$, $i$ and $i + 1$ are neighbors (two numbers neighbor each other if and only if their blocks share a common edge.)
2. Any two numbers among $1^2, \cdots, n^2$ are not in the same row or the same column.
Let $0<a_1<a_2<\cdots <a_n$ be real numbers. Prove that
\[\left (\frac{1}{1+a_1}+\frac{1}{1+a_2}+\cdots +\frac{1}{1+a_n}\right )^2 \leq \frac{1}{a_1}+\frac{1}{a_2-a_1}+\cdots +\frac{1}{a_n-a_{n-1}}.\]
Let $c_n$ be a sequence which is defined recursively as follows: $c_0 = 1$, $c_{2n+1} = c_n$ for $n \geq 0$, and $c_{2n} = c_n + c_{n-2^e}$ for $n > 0$ where $e$ is the maximal nonnegative integer such that $2^e$ divides $n$. Prove that
\[\sum_{i=0}^{2^n-1} c_i = \frac{1}{n+2} {2n+2 \choose n+1}.\]
On a circular table sit $\displaystyle {n> 2}$ students. First, each student has just one candy. At each step, each student chooses one of the following actions:
(A) Gives a candy to the student sitting on his left or to the student sitting on his right.
(B) Separates all its candies in two, possibly empty, sets and gives one set to the student sitting on his left and the other to the student sitting on his right.
At each step, students perform the actions they have chosen at the same time.
A distribution of candy is called legitimate if it can occur after a finite number of steps.
Find the number of legitimate distributions.
(Two distributions are different if there is a student who has a different number of candy in each of these distributions.)
（Forgive my poor English）
Denote by $\mathbb{Q}^+$ the set of all positive rational numbers. Determine all functions $f : \mathbb{Q}^+ \mapsto \mathbb{Q}^+$ which satisfy the following equation for all $x, y \in \mathbb{Q}^+:$ \[f\left( f(x)^2y \right) = x^3 f(xy).\]
[i]Proposed by Thomas Huber, Switzerland[/i]
Prove that for every natural $n$
$$\frac{1}{3} + \frac{2}{3\cdot 5} + \frac{3}{3 \cdot 5 \cdot 7} + ...+ \frac{n}{3 \cdot 5 \cdot 7 \cdot ...\cdot (2n+1)} < \frac{1}{2}.$$
Let $n$ be a positive integer and $x_1,x_2,\ldots,x_n$ be positive reals. Show that there are numbers $a_1,a_2,\ldots, a_n \in \{-1,1\}$ such that the following holds:
\[a_1x_1^2+a_2x_2^2+\cdots+a_nx_n^2 \ge (a_1x_1+a_2x_2 +\cdots+a_nx_n)^2\]
Find all non-decreasing functions $f:\mathbb R^+\cup\{0\}\rightarrow\mathbb R^+\cup\{0\}$ such that for each $x,y\in \mathbb R^+\cup\{0\}$
\[f\left(\frac{x+f(x)}2+y\right)=2x-f(x)+f(f(y)).\]
Consider an $n$-by-$n$ board of unit squares for some odd positive integer $n$. We say that a collection $C$ of identical dominoes is a [i]maximal grid-aligned configuration[/i] on the board if $C$ consists of $(n^2-1)/2$ dominoes where each domino covers exactly two neighboring squares and the dominoes don't overlap: $C$ then covers all but one square on the board. We are allowed to slide (but not rotate) a domino on the board to cover the uncovered square, resulting in a new maximal grid-aligned configuration with another square uncovered. Let $k(C)$ be the number of distinct maximal grid-aligned configurations obtainable from $C$ by repeatedly sliding dominoes. Find all possible values of $k(C)$ as a function of $n$.
[i]Proposed by Holden Mui[/i]
Find all surjective functions $f:\mathbb{N}\to\mathbb{N}$ such that for all positive integers $a$ and $b$, exactly one of the following equations is true:
\begin{align*}
f(a)&=f(b), <br /> \\
f(a+b)&=\min\{f(a),f(b)\}.
\end{align*}
[i]Remarks:[/i] $\mathbb{N}$ denotes the set of all positive integers. A function $f:X\to Y$ is said to be surjective if for every $y\in Y$ there exists $x\in X$ such that $f(x)=y$.