Found problems: 5802
Let $n$ be odd natural number and $x_1,x_2,\cdots,x_n$ be pairwise distinct numbers. Prove that someone can divide the difference of these number into two sets with equal sum.
( $X=\{\mid x_i-x_j \mid | i<j\}$ )
Find all positive integers $n$ such that the following statement holds: Suppose real numbers $a_1$, $a_2$, $\dots$, $a_n$, $b_1$, $b_2$, $\dots$, $b_n$ satisfy $|a_k|+|b_k|=1$ for all $k=1,\dots,n$. Then there exists $\varepsilon_1$, $\varepsilon_2$, $\dots$, $\varepsilon_n$, each of which is either $-1$ or $1$, such that
\[ \left| \sum_{i=1}^n \varepsilon_i a_i \right| + \left| \sum_{i=1}^n \varepsilon_i b_i \right| \le 1. \]
A positive integer $n$ is called $oeirense$ if there exist two positive integers $a$ and $b$, not necessarily distinct, such that $n=a^2+b^2$.
Determine the greatest integer $k$ such that there exist infinitely many positive integers $n$ such that $n$, $n+1$, $\dots$, $n+k$ are oeirenses.
Let $n$ be a positive integer. A frog starts on the number line at $0$. Suppose it makes a finite sequence of hops, subject to two conditions: [list] [*]The frog visits only points in $\{1, 2, \dots, 2^n-1\}$, each at most once. [*]The length of each hop is in $\{2^0, 2^1, 2^2, \dots\}$. (The hops may be either direction, left or right.) [/list] Let $S$ be the sum of the (positive) lengths of all hops in the sequence. What is the maximum possible value of $S$?
[i]Ashwin Sah[/i]
As usual, let ${\mathbb Z}[x]$ denote the set of single-variable polynomials in $x$ with integer coefficients. Find all functions $\theta : {\mathbb Z}[x] \to {\mathbb Z}$ such that for any polynomials $p,q \in {\mathbb Z}[x]$, [list] [*]$\theta(p+1) = \theta(p)+1$, and [*]if $\theta(p) \neq 0$ then $\theta(p)$ divides $\theta(p \cdot q)$. [/list]
[i]Evan Chen and Yang Liu[/i]
Find all polynomials $P$ with real coefficients which satisfy
\[P(x)P(x+1)=P(x^2-x+3) \quad \forall x \in \mathbb{R}\]
In the interior of the convex 2011-gon are $2011$ points, such that no three among the given $4022$ points (the interior points and the vertices) are collinear. The points are coloured one of two different colours and a colouring is called "good" if some of the points can be joined in such a way that the following conditions are satisfied:
1) Each segment joins two points of the same colour.
2) None of the line segments intersect.
3) For any two points of the same colour there exists a path of segments connecting them.
Find the number of "good" colourings.
Show that the set of positive integers that cannot be represented as a sum of distinct perfect squares is finite.
Some time ago there was a war across the world. In the plane $n$ lines are moving, with the regions contained by the lines being the territories of the countries at war. Each line moves parallel to itself with constant speed (each with its own speed), and no line can reverse its direction. Some of the original countries disappeared (a country disappears iff its area is converted to zero) and within the course of the time, other countries appeared.
After some time, the presidents of the existing countries made a treaty to end the war, created the United Nations, and all borders ceased movement. The UN then counted the total numbers of sovereign states that were destroyed and the existing ones, obtaining a total of $k$.
Prove that $k\leq \frac{n^3+5n}{6}+1$. Is is possible to have equality?
Let $F_m$ be the $m$'th Fibonacci number, defined by $F_1=F_2=1$ and $F_m = F_{m-1}+F_{m-2}$ for all $m \geq 3$. Let $p(x)$ be the polynomial of degree 1008 such that $p(2n+1)=F_{2n+1}$ for $n=0,1,2,\ldots,1008$. Find integers $j$ and $k$ such that $p(2019) = F_j - F_k$.
For a non-empty finite set $A$ of positive integers, let $\text{lcm}(A)$ denote the least common multiple of elements in $A$, and let $d(A)$ denote the number of prime factors of $\text{lcm}(A)$ (counting multiplicity). Given a finite set $S$ of positive integers, and $$f_S(x)=\sum_{\emptyset \neq A \subset S} \frac{(-1)^{|A|} x^{d(A)}}{\text{lcm}(A)}.$$
Prove that, if $0 \le x \le 2$, then $-1 \le f_S(x) \le 0$.
Find all positive integers $n$ for which there exist positive integers $x_1, x_2, \dots, x_n$ such that
$$ \frac{1}{x_1^2}+\frac{2}{x_2^2}+\frac{2^2}{x_3^2}+\cdots +\frac{2^{n-1}}{x_n^2}=1.$$
Denote by $l(n)$ the largest prime divisor of $n$. Let $a_{n+1} = a_n + l(a_n)$ be a recursively
defined sequence of integers with $a_1 = 2$. Determine all natural numbers $m$ such that there
exists some $i \in \mathbb{N}$ with $a_i = m^2$.
[i]Proposed by Nikola Velov, North Macedonia[/i]
Find all positive integers $k$ such that there exists a positive integer $n$, for which $2^n + 11$ is divisible by $2^k - 1$.
Let the sequence of real numbers $(a_n),n=1,2,3...$ with $a_1=2$ and $a_n=\left(\frac{n+1}{n-1} \right)\left(a_1+a_2+...+a_{n-1} \right),n\geq 2$.
Find the term $a_{2013}$.
Does there exist $ 2002$ distinct positive integers $ k_1, k_2, \cdots k_{2002}$ such that for any positive integer $ n \geq 2001$, one of $ k_12^n \plus{} 1, k_22^n \plus{} 1, \cdots, k_{2002}2^n \plus{} 1$ is prime?
Let $Q$ be a $(2n+1) \times (2n+1)$ board. Some of its cells are colored black in such a way that every $2 \times 2$ board of $Q$ has at most $2$ black cells. Find the maximum amount of black cells that the board may have.
A brick has the shape of a cube of size $2$ with one corner unit cube removed. Given a cube of side $2^{n}$ divided into unit cubes from which an arbitrary unit cube is removed, show that the remaining figure can be built using the described bricks.
A strip of width $w$ is the set of all points which lie on, or between, two parallel lines distance $w$ apart. Let $S$ be a set of $n$ ($n \ge 3$) points on the plane such that any three different points of $S$ can be covered by a strip of width $1$.
Prove that $S$ can be covered by a strip of width $2$.
Consider a finite binary string $b$ with at least $2017$ ones. Show that one can insert some plus signs in between pairs of digits such that the resulting sum, when performed in base $2$, is equal to a power of two.
[i]Proposed by David Stoner
Let $n$ be a positive integer. Consider an infinite checkered board. A set $S$ of cells is [i]connected[/i] if one may get from any cell in $S$ to any other cell in $S$ by only traversing edge-adjacent cells in $S$. Find the largest integer $k_n$ with the following property: in any connected set with $n$ cells, one can find $k_n$ disjoint pairs of adjacent cells (that is, $k_n$ disjoint dominoes).
[i]Proposed by David Anghel and Vlad Spătaru[/i]
Find all integers $n$ with $n \geq 4$ for which there exists a sequence of distinct real numbers $x_1, \ldots, x_n$ such that each of the sets $$\{x_1, x_2, x_3\}, \{x_2, x_3, x_4\},\ldots,\{x_{n-2}, x_{n-1}, x_n\}, \{x_{n-1}, x_n, x_1\},\text{ and } \{x_n, x_1, x_2\}$$ forms a 3-term arithmetic progression when arranged in increasing order.
The following solitaire game is played on an $m\times n$ rectangular board, $m,n\ge 2$, divided into unit squares. First, a rook is placed on some square. At each move, the rook can be moved an arbitrary number of squares horizontally or vertically, with the extra condition that each move has to be made in the $90^{\circ}$ clockwise direction compared to the previous one (e.g. after a move to the left, the next one has to be done upwards, the next one to the right etc). For which values of $m$ and $n$ is it possible that the rook visits every square of the board exactly once and returns to the first square? (The rook is considered to visit only those squares it stops on, and not the ones it steps over.)
Let $k$ be an odd number that is greater than or equal to $3$. Prove that there exists a $k^{th}$-degree integer-valued polynomial with non-integer-coefficients that has the following properties:
(1) $f(0)=0$ and $f(1)=1$; and.
(2) There exist infinitely many positive integers $n$ so that if the following equation: \[ n= f(x_1)+\cdots+f(x_s), \] has integer solutions $x_1, x_2, \dots, x_s$, then $s \geq 2^k-1$.
There is graph $ G_0$ on vertices $ A_1, A_2, \ldots, A_n$. Graph $ G_{n \plus{} 1}$ on vertices $ A_1, A_2, \ldots, A_n$ is constructed by the rule: $ A_i$ and $ A_j$ are joined only if in graph $ G_n$ there is a vertices $ A_k\neq A_i, A_j$ such that $ A_k$ is joined with both $ A_i$ and $ A_j$. Prove that the sequence $ \{G_n\}_{n\in\mathbb{N}}$ is periodic after some term with period $ T \le 2^n$.