Found problems: 5802
Let the number $x$. Using multiply and division operations of any 2 given or already given numbers we can obtain powers with natural exponent of the number $x$ (for example, $x\cdot x=x^{2}$, $x^{2}\cdot x^{2}=x^{4}$, $x^{4}: x=x^{3}$, etc). Determine the minimal number of operations needed for calculating $x^{2006}$.
Prove that for any positive integer $n$, the number of odd integers among the binomial coefficients $\binom nh \ ( 0 \leq h \leq n)$ is a power of 2.
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}$.
Show that there are no functions $f : R \to R$ satisfying $f(x + f(y)) = f(x) + y^2$ for all real numbers $x$ and $y$
Is it possible to fill the cells of a table of size $2019\times2019$ with pairwise distinct positive integers in such a way that in each rectangle of size $1\times2$ or $2\times1$ the larger number is divisible by the smaller one, and the ratio of the largest number in the table to the smallest one is at most $2019?$
Let $n$ be a positive integer. Initially, a $2n \times 2n$ grid has $k$ black cells and the rest white cells. The following two operations are allowed :
(1) If a $2\times 2$ square has exactly three black cells, the fourth is changed to a black cell;
(2) If there are exactly two black cells in a $2 \times 2$ square, the black cells are changed to white and white to black.
Find the smallest positive integer $k$ such that for any configuration of the $2n \times 2n$ grid with $k$ black cells, all cells can be black after a finite number of operations.
Let $ \,n > 6\,$ be an integer and $ \,a_{1},a_{2},\cdots ,a_{k}\,$ be all the natural numbers less than $ n$ and relatively prime to $ n$. If
\[ a_{2} \minus{} a_{1} \equal{} a_{3} \minus{} a_{2} \equal{} \cdots \equal{} a_{k} \minus{} a_{k \minus{} 1} > 0,
\]
prove that $ \,n\,$ must be either a prime number or a power of $ \,2$.
Show that there exists a degree $58$ monic polynomial
$$P(x) = x^{58} + a_1x^{57} + \cdots + a_{58}$$
such that $P(x)$ has exactly $29$ positive real roots and $29$ negative real roots and that $\log_{2017} |a_i|$ is a positive integer for all $1 \leq i \leq 58$.
Find all functions $f: \mathbb{R}^{+} \rightarrow \mathbb{R}^{+}$, such that $f(x+f(x)+f(y))=2f(x)+y$ for all positive reals $x,y$.
[i]Proposed by Athanasios Kontogeorgis, Greece[/i]
Find all pairs of integers $(c, d)$, both greater than 1, such that the following holds:
For any monic polynomial $Q$ of degree $d$ with integer coefficients and for any prime $p > c(2c+1)$, there exists a set $S$ of at most $\big(\tfrac{2c-1}{2c+1}\big)p$ integers, such that
\[\bigcup_{s \in S} \{s,\; Q(s),\; Q(Q(s)),\; Q(Q(Q(s))),\; \dots\}\]
contains a complete residue system modulo $p$ (i.e., intersects with every residue class modulo $p$).
Determine all $f:\mathbb{Z}^+ \rightarrow \mathbb{Z}^+$ such that $f(m)\geq m$ and $f(m+n) \mid f(m)+f(n)$ for all $m,n\in \mathbb{Z}^+$
Let $n$ be a given positive integer. Sisyphus performs a sequence of turns on a board consisting of $n + 1$ squares in a row, numbered $0$ to $n$ from left to right. Initially, $n$ stones are put into square $0$, and the other squares are empty. At every turn, Sisyphus chooses any nonempty square, say with $k$ stones, takes one of these stones and moves it to the right by at most $k$ squares (the stone should say within the board). Sisyphus' aim is to move all $n$ stones to square $n$.
Prove that Sisyphus cannot reach the aim in less than
\[ \left \lceil \frac{n}{1} \right \rceil + \left \lceil \frac{n}{2} \right \rceil + \left \lceil \frac{n}{3} \right \rceil + \dots + \left \lceil \frac{n}{n} \right \rceil \]
turns. (As usual, $\lceil x \rceil$ stands for the least integer not smaller than $x$. )
Let $\alpha \geq 1$ be a real number. Hephaestus and Poseidon play a turn-based game on an infinite grid of unit squares. Before the game starts, Poseidon chooses a finite number of cells to be [i]flooded[/i]. Hephaestus is building a [i]levee[/i], which is a subset of unit edges of the grid (called [i]walls[/i]) forming a connected, non-self-intersecting path or loop*.
The game then begins with Hephaestus moving first. On each of Hephaestus’s turns, he adds one or more walls to the levee, as long as the total length of the levee is at most $\alpha n$ after his $n$th turn. On each of Poseidon’s turns, every cell which is adjacent to an already flooded cell and with no wall between them becomes flooded as well. Hephaestus wins if the levee forms a closed loop such that all flooded cells are contained in the interior of the loop — hence stopping the flood and saving the world. For which $\alpha$ can Hephaestus guarantee victory in a finite number of turns no matter how Poseidon chooses the initial cells to flood?
-----
[size=75]*More formally, there must exist lattice points $\mbox{\footnotesize \(A_0, A_1, \dotsc, A_k\)}$, pairwise distinct except possibly $\mbox{\footnotesize \(A_0 = A_k\)}$, such that the set of walls is exactly $\mbox{\footnotesize \(\{A_0A_1, A_1A_2, \dotsc , A_{k-1}A_k\}\)}$. Once a wall is built it cannot be destroyed; in particular, if the levee is a closed loop (i.e. $\mbox{\footnotesize \(A_0 = A_k\)}$) then Hephaestus cannot add more walls. Since each wall has length $\mbox{\footnotesize \(1\)}$, the length of the levee is $\mbox{\footnotesize \(k\)}$.[/size]
[i]Nikolai Beluhov[/i]
Let $M=\{1,2,\ldots,3 \cdot n\}$. Partition $M$ into three sets $A,B,C$ which $card$ $A$ $=$ $card$ $B$ $=$ $card$ $C$ $=$ $n .$
Prove that there exists $a$ in $A,b$ in $B, c$ in $C$ such that or $a=b+c,$ or $b=c+a,$ or $c=a+b$
[i]Edited by orl.[/i]
Let $n$ be a positive integer and let $\alpha_n $ be the number of $1$'s within binary representation of $n$.
Show that for all positive integers $r$,
\[2^{2n-\alpha_n}\phantom{-1} \bigg|^{\phantom{0}}_{\phantom{-1}} \sum_{k=-n}^{n} \binom{2n}{n+k} k^{2r}.\]
Let $p > 1$ be a natural number. Consider the set $F_p$ of all non-constant sequences of non-negative integers that satisfy the recursive relation $a_{n+1} = (p+1)a_n - pa_{n-1}$ for all $n > 0$.
Show that there exists a sequence ($a_n$) in $F_p$ with the property that for every other sequence ($b_n$) in $F_p$, the inequality $a_n \le b_n$ holds for all $n$.
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]
For positive integers $a$ and $k$, define the sequence $a_1,a_2,\ldots$ by \[a_1=a,\qquad\text{and}\qquad a_{n+1}=a_n+k\cdot\varrho(a_n)\qquad\text{for } n=1,2,\ldots\] where $\varrho(m)$ denotes the product of the decimal digits of $m$ (for example, $\varrho(413)=12$ and $\varrho(308)=0$). Prove that there are positive integers $a$ and $k$ for which the sequence $a_1,a_2,\ldots$ contains exactly $2009$ different numbers.
For a finite simple graph $G$, we define $G'$ to be the graph on the same vertex set as $G$, where for any two vertices $u \neq v$, the pair $\{u,v\}$ is an edge of $G'$ if and only if $u$ and $v$ have a common neighbor in $G$.
Prove that if $G$ is a finite simple graph which is isomorphic to $(G')'$, then $G$ is also isomorphic to $G'$.
[i]Mehtaab Sawhney and Zack Chroman[/i]
Show that the inequality \[\sum_{i=1}^n \sum_{j=1}^n \sqrt{|x_i-x_j|}\leqslant \sum_{i=1}^n \sum_{j=1}^n \sqrt{|x_i+x_j|}\]holds for all real numbers $x_1,\ldots x_n.$
We are given an infinite deck of cards, each with a real number on it. For every real number $x$, there is exactly one card in the deck that has $x$ written on it. Now two players draw disjoint sets $A$ and $B$ of $100$ cards each from this deck. We would like to define a rule that declares one of them a winner. This rule should satisfy the following conditions:
1. The winner only depends on the relative order of the $200$ cards: if the cards are laid down in increasing order face down and we are told which card belongs to which player, but not what numbers are written on them, we can still decide the winner.
2. If we write the elements of both sets in increasing order as $A =\{ a_1 , a_2 , \ldots, a_{100} \}$ and $B= \{ b_1 , b_2 , \ldots , b_{100} \}$, and $a_i > b_i$ for all $i$, then $A$ beats $B$.
3. If three players draw three disjoint sets $A, B, C$ from the deck, $A$ beats $B$ and $B$ beats $C$ then $A$ also beats $C$.
How many ways are there to define such a rule? Here, we consider two rules as different if there exist two sets $A$ and $B$ such that $A$ beats $B$ according to one rule, but $B$ beats $A$ according to the other.
[i]Proposed by Ilya Bogdanov, Russia[/i]
In Greifswald there are three schools called $A,B$ and $C$, each of which is attended by at least one student. Among any three students, one from $A$, one from $B$ and one from $C$, there are two knowing each other and two not knowing each other. Prove that at least one of the following holds:
[list]
[*]Some student from $A$ knows all students from $B$.
[*]Some student from $B$ knows all students from $C$.
[*] Some student from $C$ knows all students from $A$.[/list]
Find all functions $f$ from positive integers to themselves such that:
1)$f(mn)=f(m)f(n)$ for all positive integers $m, n$
2)$\{1, 2, ..., n\}=\{f(1), f(2), ... f(n)\}$ is true for infinitely many positive integers $n$.
Suppose that $f$ and $g$ are two functions defined on the set of positive integers and taking positive integer values. Suppose also that the equations $f(g(n)) = f(n) + 1$ and $g(f(n)) = g(n) + 1$ hold for all positive integers. Prove that $f(n) = g(n)$ for all positive integer $n.$
[i]Proposed by Alex Schreiber, Germany[/i]
Let $P(x)$ be a nonzero polynomial with integer coefficients. Let $a_{0}=0$ and for $i \ge 0$ define $a_{i+1}=P(a_{i})$. Show that $\gcd ( a_{m}, a_{n})=a_{ \gcd (m, n)}$ for all $m, n \in \mathbb{N}$.