Found problems: 5802
Let $n$ be a positive integer, set $S_n = \{ (a_1,a_2,\cdots,a_{2^n}) \mid a_i=0 \ \text{or} \ 1, 1 \leq i \leq 2^n\}$. For any two elements $a=(a_1,a_2,\cdots,a_{2^n})$ and $b=(b_1,b_2,\cdots,b_{2^n})$ of $S_n$, define
\[ d(a,b)= \sum_{i=1}^{2^n} |a_i - b_i| \]
We call $A \subseteq S_n$ a $\textsl{Good Subset}$ if $d(a,b) \geq 2^{n-1}$ holds for any two distinct elements $a$ and $b$ of $A$. How many elements can the $\textsl{Good Subset}$ of $S_n$ at most have?
Let $a$ and $n$ denote positive integers such that $n|a^n-1$. Prove that the numbers $a+1,a^2+2, \cdots a^n+n$ all leave different remainders when divided by $n$.
Suppose $f : \mathbb{N} \longrightarrow \mathbb{N}$ is a function that satisfies $f(1) = 1$ and
$f(n + 1) =\{\begin{array}{cc} f(n)+2&\mbox{if}\ n=f(f(n)-n+1),\\f(n)+1& \mbox{Otherwise}\end {array}$
$(a)$ Prove that $f(f(n)-n+1)$ is either $n$ or $n+1$.
$(b)$ Determine$f$.
Let $k$ be a natural number. For each function $f : \mathbb{N}\to \mathbb{N}$ define the sequence of functions $(f_{m})_{m\geq 1}$ by $f_{1}= f$ and $f_{m+1}= f \circ f_{m}$ for $m \geq 1$ . Function $f$ is called $k$-[i]nice[/i] if for each $n \in\mathbb{N}: f_{k}(n) = f (n)^{k}$.
(a) For which $k$ does there exist an injective $k$-nice function $f$ ?
(b) For which $k$ does there exist a surjective $k$-nice function $f$ ?
Functions $f,g:\mathbb{Z}\to\mathbb{Z}$ satisfy $$f(g(x)+y)=g(f(y)+x)$$ for any integers $x,y$. If $f$ is bounded, prove that $g$ is periodic.
Given a polyhedron $P$. Mikita claims that he can write one integer on each face of $P$ such that not all the written numbers are zeros, and for each vertex $V$ of $P$ the sum of numbers on faces containing $V$ is equals to 0. Matvei claims that he can write one integer in each vertex of $P$ such that not all the written numbers are zeros, and for each face $F$ of $P$ the sum of numbers in vertices belonging to $F$ is equals to 0. Show that if the number of edges of polyhedron $P$ is odd, then at least one of the boys is right.
Assume real numbers $a_i,b_i\,(i=0,1,\cdots,2n)$ satisfy the following conditions:
(1) for $i=0,1,\cdots,2n-1$, we have $a_i+a_{i+1}\geq 0$;
(2) for $j=0,1,\cdots,n-1$, we have $a_{2j+1}\leq 0$;
(2) for any integer $p,q$, $0\leq p\leq q\leq n$, we have $\sum_{k=2p}^{2q}b_k>0$.
Prove that $\sum_{i=0}^{2n}(-1)^i a_i b_i\geq 0$, and determine when the equality holds.
Let $A = \{1,...,n\}$ with $n \textgreater 5$. Prove that one can find $B$ a finite set of positive integers such that $A$ is a subset of $B$ and
$\displaystyle\sum_{x \in B} x^2 = \displaystyle\prod_{x \in B} x$
The numbers $2, 2, ..., 2$ are written on a blackboard (the number $2$ is repeated $n$ times). One step consists of choosing two numbers from the blackboard, denoting them as $a$ and $b$, and replacing them with $\sqrt{\frac{ab + 1}{2}}$.
$(a)$ If $x$ is the number left on the blackboard after $n - 1$ applications of the above operation, prove that $x \ge \sqrt{\frac{n + 3}{n}}$.
$(b)$ Prove that there are infinitely many numbers for which the equality holds and infinitely many for which the inequality is strict.
Let $P \in \mathbb{R}[x]$. Suppose that the multiset of real roots (where roots are counted with multiplicity) of $P(x)-x$ and $P^3(x)-x$ are distinct. Prove that for all $n\in \mathbb{N}$, $P^n(x)-x$ has at least $\sigma(n)-2$ distinct real roots.
(Here $P^n(x):=P(P^{n-1}(x))$ with $P^1(x) = P(x)$, and $\sigma(n)$ is the sum of all positive divisors of $n$).
[i]Proposed by Malay Mahajan[/i]
Let $\{a_n\}_{n\geq 0}$ be an arithmetic sequence with difference $d$ and $1\leq a_0\leq d$. Denote the sequence as $S_0$, and define $S_n$ recursively by two operations below:
Step $1$: Denote the first number of $S_n$ as $b_n$, and remove $b_n$.
Step $2$: Add $1$ to the first $b_n$ numbers to get $S_{n+1}$.
Prove that there exists a constant $c$ such that $b_n=[ca_n]$ for all $n\geq 0$, where $[]$ is the floor function.
There are $4n$ pebbles of weights $1, 2, 3, \dots, 4n.$ Each pebble is coloured in one of $n$ colours and there are four pebbles of each colour. Show that we can arrange the pebbles into two piles so that the following two conditions are both satisfied:
[list]
[*]The total weights of both piles are the same.
[*] Each pile contains two pebbles of each colour.
[/list]
[i]Proposed by Milan Haiman, Hungary and Carl Schildkraut, USA[/i]
Prove that for all odd $ n > 1$, we have $ 8n \plus{} 4|C^{4n}_{2n}$.
Find all functions $f : \mathbb{Q} \to \mathbb{R}$ such that $f(x)f(y)f(x+y) = f(xy)(f(x) + f(y))$ for all $x,y\in\mathbb{Q}$.
[i]Sammy Luo and Alex Zhu.[/i]
Determine the maximum value of $m^2+n^2$, where $m$ and $n$ are integers in the range $1,2,\ldots,1981$ satisfying $(n^2-mn-m^2)^2=1$.
Let $(F_n)_{n\geq 1} $ be the Fibonacci sequence $F_1 = F_2 = 1, F_{n+2} = F_{n+1} + F_n (n \geq 1),$ and $P(x)$ the polynomial of degree $990$ satisfying
\[ P(k) = F_k, \qquad \text{ for } k = 992, . . . , 1982.\]
Prove that $P(1983) = F_{1983} - 1.$
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 $a_1, a_2, ..., a_n$ be real numbers such that $a_1 = a_n = a$ and $a_{k+1} \le \frac{a_k + a_{k+2}}{2} $, for all $k = 1, 2, ..., n - 2$. Prove that $a_k \le a,$ for all $k = 1, 2, ..., n.$
For a positive integer $k$, let us denote by $u(k)$ the greatest odd divisor of $k$.
Prove that, for each $n \in N$, $\frac{1}{2^n} \sum_{k = 1}^{2^n} \frac{u(k)}{k}> \frac{2}{3}$.
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}$.
Let $\{x_n\}$ be a real sequence defined by:
\[x_1=a,x_{n+1}=3x_n^3-7x_n^2+5x_n\]
For all $n=1,2,3...$ and a is a real number.
Find all $a$ such that $\{x_n\}$ has finite limit when $n\to +\infty$ and find the finite limit in that cases.
Find all groups of positive integers $ (a,x,y,n,m)$ that satisfy $ a(x^n \minus{} x^m) \equal{} (ax^m \minus{} 4) y^2$ and $ m \equiv n \pmod{2}$ and $ ax$ is odd.
Find all positive integers $n$ such that the number $\frac{(2n)!+1}{n!+1}$ is positive integer.
Let $r$ and $s$ be positive integers. Define $a_0 = 0$, $a_1 = 1$, and $a_n = ra_{n-1} + sa_{n-2}$ for $n \geq 2$. Let $f_n = a_1a_2\cdots a_n$. Prove that $\displaystyle\frac{f_n}{f_kf_{n-k}}$ is an integer for all integers $n$ and $k$ such that $0 < k < n$.
[i]Evan O' Dorney.[/i]
a) Find at least two functions $f: \mathbb{R}^+ \rightarrow \mathbb{R}^+$ such that $$\displaystyle{2f(x^2)\geq xf(x) + x,}$$ for all $x \in \mathbb{R}^+.$
b) Let $f: \mathbb{R}^+ \rightarrow \mathbb{R}^+$ be a function such that $$\displaystyle{2f(x^2)\geq xf(x) + x,}$$ for all $x \in \mathbb{R}^+.$ Show that $ f(x^3)\geq x^2,$ for all $x \in \mathbb{R}^+.$
Can we find the best constant $a\in \Bbb{R}$ such that $f(x)\geq x^a,$ for all $x \in \mathbb{R}^+?$