Found problems: 5802
Find all functions $f: \mathbb R^+ \rightarrow \mathbb R^+$ satisfying the following condition: for any three distinct real numbers $a,b,c$, a triangle can be formed with side lengths $a,b,c$, if and only if a triangle can be formed with side lengths $f(a),f(b),f(c)$.
For the positive integers $a, b, x_1$ we construct the sequence of numbers $(x_n)_{n=1}^{\infty}$ such that $x_n = ax_{n-1} + b$ for each $n \ge 2$. Specify the conditions for the given numbers $a, b$ and $x_1$ which are necessary and sufficient for all indexes $m, n$ to apply the implication $m | n \Rightarrow x_m | x_n$.
(Jaromír Šimša)
Let $p$ be an odd prime. Prove that for every integer $k$, there exist integers $a, b$ such that $p|a^2 + b^2 - k$.
Find the number of integers $ c$ such that $ \minus{}2007 \leq c \leq 2007$ and there exists an integer $ x$ such that $ x^2 \plus{} c$ is a multiple of $ 2^{2007}$.
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 $n \ge 3$ be a fixed integer. A game is played by $n$ players sitting in a circle. Initially, each player draws three cards from a shuffled deck of $3n$ cards numbered $1, 2, \dots, 3n$. Then, on each turn, every player simultaneously passes the smallest-numbered card in their hand one place clockwise and the largest-numbered card in their hand one place counterclockwise, while keeping the middle card.
Let $T_r$ denote the configuration after $r$ turns (so $T_0$ is the initial configuration). Show that $T_r$ is eventually periodic with period $n$, and find the smallest integer $m$ for which, regardless of the initial configuration, $T_m=T_{m+n}$.
[i]Proposed by Carl Schildkraut and Colin Tang[/i]
Determine all functions $f\colon\mathbb{Z}_{>0}\to\mathbb{Z}_{>0}$ such that, for all positive integers $a$ and $b$,
\[
f^{bf(a)}(a+1)=(a+1)f(b).
\]
Determine if there are positive integers $a, b$ such that all terms of the sequence defined by
\[ x_{1}= 2010,x_{2}= 2011\\ x_{n+2}= x_{n}+ x_{n+1}+a\sqrt{x_{n}x_{n+1}+b}\quad (n\ge 1) \] are integers.
Determine the sum of all possible positive integers $n, $ the product of whose digits equals $n^2 -15n -27$.
Solve the following diophantine equation in the set of nonnegative integers:
$11^{a}5^{b}-3^{c}2^{d}=1$.
Find all positive integers $n\geq 3$ such that it is possible to triangulate a convex $n$-gon such that all vertices of the $n$-gon have even degree.
The sequences of natural numbers $p_n$ and $q_n$ are given such that
$$p_1 = 1,\ q_1 = 1,\ p_{n + 1} = 2q_n^2-p_n^2,\ q_{n + 1} = 2q_n^2+p_n^2 $$
Prove that $p_n$ and $q_m$ are coprime for any m and n.
Each student in a classroom has $0,1,2,3,4,5$ or $6$ pieces of candy. At each step the teacher chooses some of the students, and gives one piece of candy to each of them and also to any other student in the classroom who is friends with at least one of these students. A student who receives the seventh piece eats all $7$ pieces. Assume that for every pair of students in the classroom, there is at least one student who is friend swith exactly one of them. Show that no matter how many pieces each student has at the beginning, the teacher can make them to have any desired numbers of pieces after finitely many steps.
Given positive numbers $a_1, \ldots , a_n$, $b_1, \ldots , b_n$, $c_1, \ldots , c_n$. Let $m_k$ be the maximum of the products $a_ib_jc_l$ over the sets $(i, j, l)$ for which $max(i, j, l) = k$. Prove that
$$(a_1 + \ldots + a_n) (b_1 +\ldots + b_n) (c_1 +\ldots + c_n) \leq n^2 (m_1 + \ldots + m_n).$$
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]
The sequence of real numbers $a_0,a_1,a_2,\ldots$ is defined recursively by \[a_0=-1,\qquad\sum_{k=0}^n\dfrac{a_{n-k}}{k+1}=0\quad\text{for}\quad n\geq 1.\]Show that $ a_{n} > 0$ for all $ n\geq 1$.
[i]Proposed by Mariusz Skalba, Poland[/i]
Let $f$ and $g$ be two continuous, distinct functions from $[0,1] \rightarrow (0,+\infty)$ such that
$\int_{0}^{1}f(x)dx = \int_{0}^{1}g(x)dx$
Let
$y_n=\int_{0}^{1}{\frac{f^{n+1}(x)}{g^{n}(x)}dx}$, for $n\geq 0$, natural.
Prove that $(y_n)$ is an increasing and divergent sequence.
Let $n$ be a positive integer and let $a_1 \le a_2 \le \dots \le a_n$ and $b_1 \le b_2 \le \dots \le b_n$ be two nondecreasing sequences of real numbers such that
\[ a_1 + \dots + a_i \le b_1 + \dots + b_i \text{ for every } i = 1, \dots, n \]
and
\[ a_1 + \dots + a_n = b_1 + \dots + b_n. \]
Suppose that for every real number $m$, the number of pairs $(i,j)$ with $a_i-a_j=m$ equals the numbers of pairs $(k,\ell)$ with $b_k-b_\ell = m$. Prove that $a_i = b_i$ for $i=1,\dots,n$.
There are $n$ boys $a_1, a_2, \ldots, a_n$ and $n$ girls $b_1, b_2, \ldots, b_n $. Some pairs of them are connected. Any two boys or two girls are not connected, and $a_i$ and $b_i$ are not connected for all $i \in \{ 1,2,\ldots,n\}$. Now all boys and girls are divided into several groups satisfying two conditions:
(i) Every groups contains an equal number of boys and girls.
(ii) There is no connected pair in the same group.
Assume that the number of connected pairs is $m$. Show that we can make the number of groups not larger than $\max\left \{2, \dfrac{2m}{n} +1\right \}$.
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}$.
$5000$ movie fans gathered at a convention. Each participant had watched at least one movie. The participants should be split into discussion groups of two kinds. In each group of the fi rst kind, the members would discuss a movie they all watched. In each group of the second kind, each member would tell about the movie that no one else in this group had watched. Prove that the chairman can always split the participants into exactly 100 groups. (A group consisting of one person is allowed; in this case this person submits a report).
Let $m>1$ be an integer. Find the smallest positive integer $n$, such that for any integers $a_1,a_2,\ldots ,a_n; b_1,b_2,\ldots ,b_n$ there exists integers $x_1,x_2,\ldots ,x_n$ satisfying the following two conditions:
i) There exists $i\in \{1,2,\ldots ,n\}$ such that $x_i$ and $m$ are coprime
ii) $\sum^n_{i=1} a_ix_i \equiv \sum^n_{i=1} b_ix_i \equiv 0 \pmod m$
The sequence $(a_n)_{n>=1}$ satisfies that : $a_1=a_2=1$ $a_n=7a_{n-1}-a_{n-2}$ ($n>=3$) , prove that : for all positive integer n , number $a_n+2+a_{n+1}$ is a perfect square .
Let $ c$ be a positive integer. The sequence $ a_1,a_2,\ldots$ is defined as follows $ a_1\equal{}c$, $ a_{n\plus{}1}\equal{}a_n^2\plus{}a_n\plus{}c^3$ for all positive integers $ n$. Find all $ c$ so that there are integers $ k\ge1$ and $ m\ge2$ so that $ a_k^2\plus{}c^3$ is the $ m$th power of some integer.
Given an alfabet of $n$ letters. A sequence of letters such that between any 2 identical letters there are no 2 identical letters is called a [i]word[/i].
a) Find the maximal possible length of a [i]word[/i].
b) Find the number of the [i]words[/i] of maximal length.