Found problems: 5802
$p$ is a polynomial with integer coefficients and for every natural $n$ we have $p(n)>n$. $x_k $ is a sequence that: $x_1=1, x_{i+1}=p(x_i)$ for every $N$ one of $x_i$ is divisible by $N.$ Prove that $p(x)=x+1$
Find all functions $f:\mathbb N_+\to \mathbb N_+,$ such that for all positive integer $a,b,$
$$\sum_{k=0}^{2b}f(a+k)=(2b+1)f(f(a)+b).$$
[i]Created by Liang Xiao, Yunhao Fu[/i]
Find all functions $ f: Z \rightarrow R$ that verify the folowing two conditions:
(i) for each pair of integers $ (m,n)$ with $ m<n$ one has $ f(m)<f(n)$;
(ii) for each pair of integers $ (m,n)$ there exists an integer $ k$ such that $ f(m)\minus{}f(n)\equal{}f(k)$.
Given a fixed positive integer $a\geq 9$. Prove: There exist finitely many positive integers $n$, satisfying:
(1)$\tau (n)=a$
(2)$n|\phi (n)+\sigma (n)$
Note: For positive integer $n$, $\tau (n)$ is the number of positive divisors of $n$, $\phi (n)$ is the number of positive integers $\leq n$ and relatively prime with $n$, $\sigma (n)$ is the sum of positive divisors of $n$.
Let $n\geq 3$ be a fixed integer. Each side and each diagonal of a regular $n$-gon is labelled with a number from the set $\left\{1;\;2;\;...;\;r\right\}$ in a way such that the following two conditions are fulfilled:
[b]1.[/b] Each number from the set $\left\{1;\;2;\;...;\;r\right\}$ occurs at least once as a label.
[b]2.[/b] In each triangle formed by three vertices of the $n$-gon, two of the sides are labelled with the same number, and this number is greater than the label of the third side.
[b](a)[/b] Find the maximal $r$ for which such a labelling is possible.
[b](b)[/b] [i]Harder version (IMO Shortlist 2005):[/i] For this maximal value of $r$, how many such labellings are there?
[hide="Easier version (5th German TST 2006) - contains answer to the harder version"]
[i]Easier version (5th German TST 2006):[/i] Show that, for this maximal value of $r$, there are exactly $\frac{n!\left(n-1\right)!}{2^{n-1}}$ possible labellings.[/hide]
[i]Proposed by Federico Ardila, Colombia[/i]
$n$ symbols line up in a row, numbered as $1,2,...,n$ from left to right. Delete every symbol with squared numbers. Renumber the rest from left to right. Repeat the process until all $n$ symbols are deleted. Let $f(n)$ be the initial number of the last symbol deleted. Find $f(n)$ in terms of $n$ and find $f(2019)$.
Find the largest positive integer $n$ such that no two adjacent digits are the same, and for any two distinct digits $0 \leq a,b \leq 9 $, you can't get the string $abab$ just by removing digits from $n$.
Find all functions $f:\mathbb{R}\rightarrow \mathbb{R}$ such that $f(0) \in \mathbb Q$ and
\[f(x+f(y)^2 ) = {f(x+y)}^2.\]
(25 points)
The real numbers $a_1,a_2,\dots,a_n$ are given such that $|a_i|\leq 1$
for all $i=1,2,\dots,n$ and
$a_1+a_2+\cdots+a_n=0$.
a) Prove that there exists $k\in\{1,2,\dots,n\}$ such that
\[ |a_1+2a_2+\cdots+ka_k|\leq\frac{2k+1}{4}. \]
b) Prove that for $n > 2$ the bound above is the best possible.
[i]Radu Gologan, Dan Schwarz[/i]
An integer $n>2$ is called [i]tasty[/i] if for every ordered pair of positive integers $(a,b)$ with $a+b=n,$ at least one of $\frac{a}{b}$ and $\frac{b}{a}$ is a terminating decimal. Do there exist infinitely many tasty integers?
[i]Proposed by Vincent Huang[/i]
Do there exist integers $m, n$ and a function $f\colon \mathbb R \to \mathbb R$ satisfying simultaneously the following two conditions?
$\bullet$ i) $f(f(x))=2f(x)-x-2$ for any $x \in \mathbb R$;
$\bullet$ ii) $m \leq n$ and $f(m)=n$.
Let $A$ be a given finite set with some of its subsets called pretty. Let a subset be called small, if it's a subset of a pretty set. Let a subset be called big, if it has a pretty subset. (A set can be small and big simultaneously, and a set can be neither small nor big.) Let $a$ denote the number of elements of $A$, and let $p$, $s$ and $b$ denote the number of pretty, small and big sets, respectively. Prove that $2^a\cdot p\le s\cdot b$.
[i]Proposed by András Imolay, Budapest[/i]
Let $n$ be a positive integer. Dominoes are placed on a $2n \times 2n$ board in such a way that every cell of the board is adjacent to exactly one cell covered by a domino. For each $n$, determine the largest number of dominoes that can be placed in this way.
(A domino is a tile of size $2 \times 1$ or $1 \times 2$. Dominoes are placed on the board in such a way that each domino covers exactly two cells of the board, and dominoes do not overlap. Two cells are said to be adjacent if they are different and share a common side.)
For any nonempty set $S$ of real numbers, let $\sigma(S)$ denote the sum of the elements of $S$. Given a set $A$ of $n$ positive integers, consider the collection of all distinct sums $\sigma(S)$ as $S$ ranges over the nonempty subsets of $A$. Prove that this collection of sums can be partitioned into $n$ classes so that in each class, the ratio of the largest sum to the smallest sum does not exceed 2.
Find all functions $ f: \mathbb{R}^{ \plus{} }\to\mathbb{R}^{ \plus{} }$ satisfying $ f\left(x \plus{} f\left(y\right)\right) \equal{} f\left(x \plus{} y\right) \plus{} f\left(y\right)$ for all pairs of positive reals $ x$ and $ y$. Here, $ \mathbb{R}^{ \plus{} }$ denotes the set of all positive reals.
[i]Proposed by Paisan Nakmahachalasint, Thailand[/i]
Find all positive integers $n$ such that it is possible to split the numbers from $1$ to $2n$ in two groups $(a_1,a_2,..,a_n)$, $(b_1,b_2,...,b_n)$ in such a way that $2n\mid a_1a_2\cdots a_n+b_1b_2\cdots b_n-1$.
[i]Proposed by Alef Pineda[/i]
Let $n$ be an positive integer. Find the smallest integer $k$ with the following property; Given any real numbers $a_1 , \cdots , a_d $ such that $a_1 + a_2 + \cdots + a_d = n$ and $0 \le a_i \le 1$ for $i=1,2,\cdots ,d$, it is possible to partition these numbers into $k$ groups (some of which may be empty) such that the sum of the numbers in each group is at most $1$.
Suppose there are 18 lighthouses on the Persian Gulf. Each of the lighthouses lightens an angle with size 20 degrees. Prove that we can choose the directions of the lighthouses such that whole of the blue Persian (always Persian) Gulf is lightened.
Can a number of the form $44\dots 41$, with an odd number of decimal digits $4$ followed by a digit $1$, be a perfect square?
Find all real-valued functions $f$ on the reals such that $f(-x) = -f(x)$, $f(x+1) = f(x) + 1$ for all $x$, and $f\left(\dfrac{1}{x}\right) = \dfrac{f(x)}{x^2}$ for $x \not = 0$.
Find all integers $n$ satisfying $n \geq 2$ and $\dfrac{\sigma(n)}{p(n)-1} = n$, in which $\sigma(n)$ denotes the sum of all positive divisors of $n$, and $p(n)$ denotes the largest prime divisor of $n$.
Let $(x_n)$ be an infinite sequence of real numbers from interval $(0, 1)$. An infinite sequence $(a_n)$ of positive integers is defined as follows: $a_1 = 1$, and for $i \ge 1$, $a_{i+1}$ is equal to the smallest positive integer $m$, for which $[x_1 + x_2 + \ldots + x_m] = a_i$. Show that for any indexes $i, j$ holds $a_{i+j} \ge a_i + a_j$.
[i]Proposed by Nazar Serdyuk[/i]
Let a sequence $(x_n)$ satisfy :$x_1=1$ and $x_{n+1}=x_n+3\sqrt{x_n} + \frac{n}{\sqrt{x_n}}$,$\forall$n$\ge1$
a) Prove lim$\frac{n}{x_n}=0$
b) Find lim$\frac{n^2}{x_n}$
Le $S$ be the set of positive integers greater than or equal to $2$. A function $f: S\rightarrow S$ is italian if $f$ satifies all the following three conditions:
1) $f$ is surjective
2) $f$ is increasing in the prime numbers(that is, if $p_1<p_2$ are prime numbers, then $f(p_1)<f(p_2)$)
3) For every $n\in S$ the number $f(n)$ is the product of $f(p)$, where $p$ varies among all the primes which divide $n$ (For instance, $f(360)=f(2^3\cdot 3^2\cdot 5)=f(2)\cdot f(3)\cdot f(5)$).
Determine the maximum and the minimum possible value of $f(2020)$, when $f$ varies among all italian functions.
Let $n$ be a positive integer. Two players $A$ and $B$ play a game in which they take turns choosing positive integers $k \le n$. The rules of the game are:
(i) A player cannot choose a number that has been chosen by either player on any previous turn.
(ii) A player cannot choose a number consecutive to any of those the player has already chosen on any previous turn.
(iii) The game is a draw if all numbers have been chosen; otherwise the player who cannot choose a number anymore loses the game.
The player $A$ takes the first turn. Determine the outcome of the game, assuming that both players use optimal strategies.
[i]Proposed by Finland[/i]