Found problems: 5802
Determine all integers $ n\geq 2$ having the following property: for any integers $a_1,a_2,\ldots, a_n$ whose sum is not divisible by $n$, there exists an index $1 \leq i \leq n$ such that none of the numbers $$a_i,a_i+a_{i+1},\ldots,a_i+a_{i+1}+\ldots+a_{i+n-1}$$ is divisible by $n$. Here, we let $a_i=a_{i-n}$ when $i >n$.
[i]Proposed by Warut Suksompong, Thailand[/i]
Let $ A_n $ be the set of partitions of the sequence $ 1,2,..., n $ into several subsequences such that every two neighbouring terms of each subsequence have different parity,and $ B_n $ the set of partitions of the sequence $ 1,2,..., n $ into several subsequences such that all the terms of each subsequence have the same parity ( for example,the partition $ {(1,4,5,8),(2,3),(6,9),(7)} $ is an element of $ A_9 $,and the partition $ {(1,3,5),(2,4),(6)} $ is an element of $ B_6 $ ).
Prove that for every positive integer $ n $ the sets $ A_n $ and $ B_{n+1} $ contain the same number of elements.
Given $m\in\mathbb{N}$. Find all functions $f:\mathbb{R^{+}}\rightarrow\mathbb{R^{+}}$ such that $$f(f(x)+y)-f(x)=\left( \frac{f(y)}{y}-1\right)x+f^m(y)$$
holds for all $x,y\in\mathbb{R^{+}}.$
($f^m(x) =$ $f$ applies $m$ times.)
If $n$ is an integer greater than $7$, prove that ${n \choose 7} - \left[ \frac{n}{7} \right]$ is divisible by $7$.
Show that $n!=a^{n-1}+b^{n-1}+c^{n-1}$ has only finitely many solutions in positive integers.
[i]Proposed by Dorlir Ahmeti, Albania[/i]
Let $n \geq 3$ be a fixed integer. The number $1$ is written $n$ times on a blackboard. Below the blackboard, there are two buckets that are initially empty. A move consists of erasing two of the numbers $a$ and $b$, replacing them with the numbers $1$ and $a+b$, then adding one stone to the first bucket and $\gcd(a, b)$ stones to the second bucket. After some finite number of moves, there are $s$ stones in the first bucket and $t$ stones in the second bucket, where $s$ and $t$ are positive integers. Find all possible values of the ratio $\frac{t}{s}$.
Find the magnitude of the product of all complex numbers $c$ such that the recurrence defined by $x_1 = 1$, $x_2 = c^2 - 4c + 7$, and $x_{n+1} = (c^2 - 2c)^2 x_n x_{n-1} + 2x_n - x_{n-1}$ also satisfies $x_{1006} = 2011$.
[i]Author: Alex Zhu[/i]
Let $n \geqslant 3$ be integer. Given convex $n-$polygon $\mathcal{P}$. A $3-$coloring of the vertices of $\mathcal{P}$ is called [i]nice[/i] such that every interior point of $\mathcal{P}$ is inside or on the bound of a triangle formed by polygon vertices with pairwise distinct colors. Determine the number of different nice colorings.
([I]Two colorings are different as long as they differ at some vertices. [/i])
Prove that for any $n$ ($n \geq 2$) pairwise distinct fractions in the interval $(0,1)$, the sum of their denominators is no less than $\frac{1}{3} n^{\frac{3}{2}}$.
Show that for every natural number $n$ there are $n$ natural numbers $ x_1 < x_2 < ... < x_n $ such that
$$\frac{1}{x_1}+\frac{1}{x_2}+...+\frac{1}{x_n}-\frac{1}{x_1x_2...x_n}\in \mathbb{N}\cup {0}$$
(15 points )
For the NEMO, Kevin needs to compute the product
\[
9 \times 99 \times 999 \times \cdots \times 999999999.
\]
Kevin takes exactly $ab$ seconds to multiply an $a$-digit integer by a $b$-digit integer. Compute the minimum number of seconds necessary for Kevin to evaluate the expression together by performing eight such multiplications.
[i]Proposed by Evan Chen[/i]
The sequence $a_0,a_1,a_2,\dots$ is recursively defined by \[ a_0 = 1 \quad \text{and} \quad a_n = a_{n-1} \cdot \left(4-\frac{2}{n} \right) \quad \text{for } n \geq 1. \] Prove for each integer $n \geq 1$:
(a) The number $a_n$ is a positive integer.
(b) Each prime $p$ with $n < p \leq 2n$ is a divisor of $a_n$.
(c) If $n$ is a prime, then $a_n-2$ is divisible by $n$.
Find all pairs $(m, n)$ of positive integers satsifying $m^6+5n^2=m+n^3$.
For any function $f:\mathbb{N}\to\mathbb{N}$ we define $P(n)=f(1)f(2)...f(n)$ . Find all functions $f:\mathbb{N}\to\mathbb{N}$ st for each $a,b$ :
$$P(a)+P(b) | a! + b!$$
Let $a_1 < a_2 < \cdots <a_n$ be pairwise coprime positive integers with $a_1$ being prime and $a_1 \ge n + 2$. On the segment $I = [0, a_1 a_2 \cdots a_n ]$ of the real line, mark all integers that are divisible by at least one of the numbers $a_1 , \ldots , a_n$ . These points split $I$ into a number of smaller segments. Prove that the sum of the squares of the lengths of these segments is divisible by $a_1$.
[i]Proposed by Serbia[/i]
A number of $N$ children are at a party and they sit in a circle to play a game of Pass and Parcel. Because the host has no other form of entertainment, the parcel has infinitely many layers. On turn $i$, starting with $i=1$, the following two things happen in order:
[b]$(1)$[/b] The parcel is passed $i^2$ positions clockwise; and
[b]$(2)$[/b] The child currently holding the parcel unwraps a layer and claims the prize inside.
For what values of $N$ will every chidren receive a prize?
$Patrick \ Winter \, United \ Kingdom$
Let the function $f:N^*\to N^*$ such that
[b](1)[/b] $(f(m),f(n))\le (m,n)^{2014} , \forall m,n\in N^*$;
[b](2)[/b] $n\le f(n)\le n+2014 , \forall n\in N^*$
Show that: there exists the positive integers $N$ such that $ f(n)=n $, for each integer $n \ge N$.
(High School Affiliated to Nanjing Normal University )
A sequence of real numbers $ a_{0},\ a_{1},\ a_{2},\dots$ is defined by the formula
\[ a_{i \plus{} 1} \equal{} \left\lfloor a_{i}\right\rfloor\cdot \left\langle a_{i}\right\rangle\qquad\text{for}\quad i\geq 0;
\]here $a_0$ is an arbitrary real number, $\lfloor a_i\rfloor$ denotes the greatest integer not exceeding $a_i$, and $\left\langle a_i\right\rangle=a_i-\lfloor a_i\rfloor$. Prove that $a_i=a_{i+2}$ for $i$ sufficiently large.
[i]Proposed by Harmel Nestra, Estionia[/i]
A function $f:\mathbb{N} \rightarrow \mathbb{N} $ is called nice if $f^a(b)=f(a+b-1)$, where $f^a(b)$ denotes $a$ times applied function $f$.
Let $g$ be a nice function, and an integer $A$ exists such that $g(A+2018)=g(A)+1$.
a) Prove that $g(n+2017^{2017})=g(n)$ for all $n \geq A+2$.
b) If $g(A+1) \neq g(A+1+2017^{2017})$ find $g(n)$ for $n <A$.
Each positive integer is coloured red or blue. A function $f$ from the set of positive integers to itself has the following two properties:
(a) if $x\le y$, then $f(x)\le f(y)$; and
(b) if $x,y$ and $z$ are (not necessarily distinct) positive integers of the same colour and $x+y=z$, then $f(x)+f(y)=f(z)$.
Prove that there exists a positive number $a$ such that $f(x)\le ax$ for all positive integers $x$.
[i](United Kingdom) Ben Elliott[/i]
Let $k \geq 2, 1 < n_1 < n_2 < \ldots < n_k$ are positive integers, $a,b \in \mathbb{Z}^+$ satisfy \[ \prod^k_{i=1} \left( 1 - \frac{1}{n_i} \right) \leq \frac{a}{b} < \prod^{k-1}_{i=1} \left( 1 - \frac{1}{n_i} \right) \]
Prove that: \[ \prod^k_{i=1} n_i \geq (4 \cdot a)^{2^k - 1}. \]
Let $n$ be a positive integer. There are $n$ ants walking along a line at constant nonzero speeds. Different ants need not walk at the same speed or walk in the same direction. Whenever two or more ants collide, all the ants involved in this collision instantly change directions. (Different ants need not be moving in opposite directions when they collide, since a faster ant may catch up with a slower one that is moving in the same direction.) The ants keep walking indefinitely.
Assuming that the total number of collisions is finite, determine the largest possible number of collisions in terms of $n$.
Show that there is no integer-valued function on the integers such that $f(m+f(n))=f(m)-n$ for all $m,n$.
Let $f:\mathbb{N} \longrightarrow \mathbb{N}$ such that $f(m) - f(n) = f(m-n)10^n \forall m>n \in \mathbb{N}$. Additionally, gcd$(f(k),f(k+1)) = 1 \forall k \in \mathbb{N}$. Show that if $a,b$ are coprime natural numbers, that is, gcd$(a,b) = 1$ then $f(a),f(b)$ are also coprime.
Several triangles are [b]intersecting[/b] if any two of them have non-empty intersections.
Show that for any two finite collections of intersecting triangles, there exists a line that intersects all the triangles.
[i]
Proposed by usjl[/i]