Found problems: 5802
Find all surjective functions $ f: \mathbb{N} \to \mathbb{N}$ such that for every $ m,n \in \mathbb{N}$ and every prime $ p,$ the number $ f(m + n)$ is divisible by $ p$ if and only if $ f(m) + f(n)$ is divisible by $ p$.
[i]Author: Mohsen Jamaali and Nima Ahmadi Pour Anari, Iran[/i]
Find all polynomials with integer coefficients $P$ such that for all positive integers $n$, the sequence $$0, P(0), P(P(0)), \cdots$$ is eventually constant modulo $n$.
[i]Proposed by Ivan Chan Kai Chin[/i]
$(MON 4)$ Let $p$ and $q$ be two prime numbers greater than $3.$ Prove that if their difference is $2^n$, then for any two integers $m$ and $n,$ the number $S = p^{2m+1} + q^{2m+1}$ is divisible by $3.$
Find all functions $f:\mathbb R^+\to \mathbb R^+$ such that $$f(x+y)f(f(x))=f(1+yf(x))$$ for all $x,y\in \mathbb R^+.$
[i]Proposed by Ming Hsiao[/i]
Let the sum of the first $ n$ primes be denoted by $ S_n$. Prove that for any positive integer $ n$, there exists a perfect square between $ S_n$ and $ S_{n\plus{}1}$.
Let $X$ be a non-empty set of positive integers which satisfies the following: [list] [*] if $x \in X$, then $4x \in X$, [*] if $x \in X$, then $\lfloor \sqrt{x}\rfloor \in X$. [/list] Prove that $X=\mathbb{N}$.
Let $n \geq 3$ be a positive integer. Find the maximum number of diagonals in a regular $n$-gon one can select, so that any two of them do not intersect in the interior or they are perpendicular to each other.
There are $ n$ websites $ 1,2,\ldots,n$ ($ n \geq 2$). If there is a link from website $ i$ to $ j$, we can use this link so we can move website $ i$ to $ j$.
For all $ i \in \left\{1,2,\ldots,n - 1 \right\}$, there is a link from website $ i$ to $ i+1$.
Prove that we can add less or equal than $ 3(n - 1)\log_{2}(\log_{2} n)$ links so that for all integers $ 1 \leq i < j \leq n$, starting with website $ i$, and using at most three links to website $ j$. (If we use a link, website's number should increase. For example, No.7 to 4 is impossible).
Sorry for my bad English.
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$.
Consider the function $ f: \mathbb{N}_0\to\mathbb{N}_0$, where $ \mathbb{N}_0$ is the set of all non-negative
integers, defined by the following conditions :
$ (i)$ $ f(0) \equal{} 0$; $ (ii)$ $ f(2n) \equal{} 2f(n)$ and $ (iii)$ $ f(2n \plus{} 1) \equal{} n \plus{} 2f(n)$ for all $ n\geq 0$.
$ (a)$ Determine the three sets $ L \equal{} \{ n | f(n) < f(n \plus{} 1) \}$, $ E \equal{} \{n | f(n) \equal{} f(n \plus{} 1) \}$, and $ G \equal{} \{n | f(n) > f(n \plus{} 1) \}$.
$ (b)$ For each $ k \geq 0$, find a formula for $ a_k \equal{} \max\{f(n) : 0 \leq n \leq 2^k\}$ in terms of $ k$.
$201$ positive integers are written on a line, such that both the first one and the last one are equal to $19999$. Each one of the remaining numbers is less than the average of its neighbouring numbers, and the differences between each one of the remaining numbers and the average of its neighbouring numbers are all equal to a unique integer. Find the second-to-last term on the line.
$n$ people (with names $1,2,\dots,n$) are around a table. Some of them are friends. At each step 2 friend can change their place. Find a necessary and sufficient condition for friendship relation between them that with these steps we can always reach to all of posiible permutations.
The rows and columns of a $2^n \times 2^n$ table are numbered from $0$ to $2^{n}-1.$ The cells of the table have been coloured with the following property being satisfied: for each $0 \leq i,j \leq 2^n - 1,$ the $j$-th cell in the $i$-th row and the $(i+j)$-th cell in the $j$-th row have the same colour. (The indices of the cells in a row are considered modulo $2^n$.) Prove that the maximal possible number of colours is $2^n$.
[i]Proposed by Hossein Dabirian, Sepehr Ghazi-nezami, Iran[/i]
Find all pairs $(a,b)$ of positive integers such that $a!+b$ and $b!+a$ are both powers of $5$.
[i]Nikola Velov, North Macedonia[/i]
Determine all positive integers $a,b,c$ satisfying $a^{(b^c)}=(b^a)^c$
For $ x \in (0, 1)$ let $ y \in (0, 1)$ be the number whose $ n$-th digit after the decimal point is the $ 2^{n}$-th digit after the decimal point of $ x$. Show that if $ x$ is rational then so is $ y$.
[i]Proposed by J.P. Grossman, Canada[/i]
Prove that the polynomial $P_n(x)=1+x+\frac{x^2}{2!}+\cdots +\frac{x^n}{n!}$ has no real zeros if $n$ is even and has exatly one real zero if $n$ is odd
For each prime $p$, construct a graph $G_p$ on $\{1,2,\ldots p\}$, where $m\neq n$ are adjacent if and only if $p$ divides $(m^{2} + 1-n)(n^{2} + 1-m)$. Prove that $G_p$ is disconnected for infinitely many $p$
$p$ is a prime number that is greater than $2$. Let $\{ a_{n}\}$ be a sequence such that $ na_{n+1}= (n+1) a_{n}-\left( \frac{p}{2}\right)^{4}$.
Show that if $a_{1}=5$, the $16 \mid a_{81}$.
Note that $k\ge 1$ for an odd natural number $$k! ! = k \cdot (k - 2) \cdot ... \cdot 1.$$
Prove that $2^n$ divides $(2^n -1)!! -1$ for all $n \ge 3$.
Two rational numbers \(\tfrac{m}{n}\) and \(\tfrac{n}{m}\) are written on a blackboard, where \(m\) and \(n\) are relatively prime positive integers. At any point, Evan may pick two of the numbers \(x\) and \(y\) written on the board and write either their arithmetic mean \(\tfrac{x+y}{2}\) or their harmonic mean \(\tfrac{2xy}{x+y}\) on the board as well. Find all pairs \((m,n)\) such that Evan can write 1 on the board in finitely many steps.
[i]Proposed by Yannick Yao[/i]
Let $A=33\cdots3$, where $A$ contains $2009$ $3$s. Let $B=11\cdots1088\cdots89$, where $B$ contains $2008$ $1$s and $2008$ $8$s. Prove that $A^2=B$.
Let $(a_n)^{+\infty}_{n=1}$ be a sequence defined recursively as follows: $a_1=1$ and $$a_{n+1}=1 + \sum\limits_{k=1}^{n}ka_k$$
For every $n > 1$, prove that $\sqrt[n]{a_n} < \frac {n+1}{2}$.
Let $a_1,a_2,\ldots a_n,k$, and $M$ be positive integers such that
$$\frac{1}{a_1}+\frac{1}{a_2}+\cdots+\frac{1}{a_n}=k\quad\text{and}\quad a_1a_2\cdots a_n=M.$$
If $M>1$, prove that the polynomial
$$P(x)=M(x+1)^k-(x+a_1)(x+a_2)\cdots (x+a_n)$$
has no positive roots.
Determine all functions $f:\mathbb{Z}\rightarrow\mathbb{Z}$ with the property that \[f(x-f(y))=f(f(x))-f(y)-1\] holds for all $x,y\in\mathbb{Z}$.