Found problems: 5802
If natural numbers $ x$, $ y$, $ p$, $ n$, $ k$ with $ n > 1$ odd and $ p$ an odd prime satisfy $ x^n \plus{} y^n \equal{} p^k$, prove that $ n$ is a power of $ p$.
Let $m$ and $n$ be arbitrary non-negative integers. Prove that \[\frac{(2m)!(2n)!}{m! n!(m+n)!}\] is an integer.
Find all polynomials $P$ such that
$P(x) + \binom{2018}{2}P(x+2)+...+\binom{2018}{2106}P(x+2016)+P(x+2018)=$
$=\binom{2018}{1}P(x+1)+\binom{2018}{3}P(x+3)+...+\binom{2018}{2105}P(x+2015)+\binom{2018}{2107}P(x+2017)$
for all real numbers $x$.
Fifty teams participate in a round robin competition over 50 days. Moreover, all the teams (at least two) that show up in any day must play against each other. Prove that on every pair of consecutive days, there is a team that has to play on those two days.
Let $n$ be a given positive integer. Say that a set $K$ of points with integer coordinates in the plane is connected if for every pair of points $R, S\in K$, there exists a positive integer $\ell$ and a sequence $R=T_0,T_1, T_2,\ldots ,T_{\ell}=S$ of points in $K$, where each $T_i$ is distance $1$ away from $T_{i+1}$. For such a set $K$, we define the set of vectors
\[\Delta(K)=\{\overrightarrow{RS}\mid R, S\in K\}\]
What is the maximum value of $|\Delta(K)|$ over all connected sets $K$ of $2n+1$ points with integer coordinates in the plane?
[i]Grigory Chelnokov, Russia[/i]
Let $x$ and $y$ be positive integers. If ${x^{2^n}}-1$ is divisible by $2^ny+1$ for every positive integer $n$, prove that $x=1$.
Let $a, b, c \in \mathbb{R}$ be such that
$$a + b + c = a^2 + b^2 + c^2 = 1, \hspace{8px} a^3 + b^3 + c^3 \neq 1.$$
We say that a function $f$ is a [i]Palić function[/i] if $f: \mathbb{R} \rightarrow \mathbb{R}$, $f$ is continuous and satisfies
$$f(x) + f(y) + f(z) = f(ax + by + cz) + f(bx + cy + az) + f(cx + ay + bz)$$
for all $x, y, z \in \mathbb{R}.$
Prove that any Palić function is infinitely many times differentiable and find all Palić functions.
For $ n\ge 2$, let $ S_1$, $ S_2$, $ \ldots$, $ S_{2^n}$ be $ 2^n$ subsets of $ A \equal{} \{1, 2, 3, \ldots, 2^{n \plus{} 1}\}$ that satisfy the following property: There do not exist indices $ a$ and $ b$ with $ a < b$ and elements $ x$, $ y$, $ z\in A$ with $ x < y < z$ and $ y$, $ z\in S_a$, and $ x$, $ z\in S_b$. Prove that at least one of the sets $ S_1$, $ S_2$, $ \ldots$, $ S_{2^n}$ contains no more than $ 4n$ elements.
[i]Proposed by Gerhard Woeginger, Netherlands[/i]
Let n be the sum of the digits in a natural number A. The number A it's said to be "surtido" if every number 1,2,3,4....,n can be expressed as a sum of digits in A.
a)Prove that, if 1,2,3,4,5,6,7,8 are sums of digits in A, then A is "Surtido"
b)If 1,2,3,4,5,6,7 are sums of digits in A, does it follow that A is "Surtido"?
Let $k$ be a positive integer and $m$ be an odd integer. Prove that there exists a positive integer $n$ such that $n^n-m$ is divisible by $2^k$.
In the game of [i]Ring Mafia[/i], there are $2019$ counters arranged in a circle. $673$ of these counters are mafia, and the remaining $1346$ counters are town. Two players, Tony and Madeline, take turns with Tony going first. Tony does not know which counters are mafia but Madeline does.
On Tony’s turn, he selects any subset of the counters (possibly the empty set) and removes all counters in that set. On Madeline’s turn, she selects a town counter which is adjacent to a mafia counter and removes it. Whenever counters are removed, the remaining counters are brought closer together without changing their order so that they still form a circle. The game ends when either all mafia counters have been removed, or all town counters have been removed.
Is there a strategy for Tony that guarantees, no matter where the mafia counters are placed and what Madeline does, that at least one town counter remains at the end of the game?
[i]Proposed by Andrew Gu[/i]
Zeroes and ones are arranged in all the squares of $n\times n$ table.
All the squares of the left column are filled by ones, and the sum of numbers in every figure of the form
[asy]size(50); draw((2,1)--(0,1)--(0,2)--(2,2)--(2,0)--(1,0)--(1,2));[/asy]
(consisting of a square and its neighbours from left and from below)
is even.
Prove that no two rows of the table are identical.
[i]Proposed by O. Vanyushina[/i]
Determine all polynomials $P(x)$ with integer coefficients such that, for any positive integer $n$, the equation $P(x)=2^n$ has an integer root.
Each $1 \times 1$ square of an $n \times n$ table contains a different number. The smallest number in each row is marked, and these marked numbers are in different columns. Then the smallest number in each column is marked, and these marked numbers are in different rows. Prove that the two sets of marked numbers are identical.
(V Klepcyn)
Determine all functions $f: \mathbb{Q} \to \mathbb{Q}$ such that
$$f(2xy + \frac{1}{2}) + f(x-y) = 4f(x)f(y) + \frac{1}{2}$$
for all $x,y \in \mathbb{Q}$.
Let $n$ be a positive integer. Given is a subset $A$ of $\{0,1,...,5^n\}$ with $4n+2$ elements. Prove that there exist three elements $a<b<c$ from $A$ such that $c+2a>3b$.
[i]Proposed by Dominik Burek and Tomasz Ciesla, Poland[/i]
$ p >3 $ is a prime number such that $ p | 2^{p-1} -1 $ and $ p \not | 2^x - 1 $ for $ x = 1, 2, \cdots , p-2 $. Let $ p = 2k+3 $. Now we define sequence $ \{ a_n \} $ as
\[ a_i = a_{i+k}= 2^i ( 1 \le i \le k ) , \ a_{j+2k} = a_j a_{j+k} \ ( j \ge 1 ) \]
Prove that there exist $2k$ consecutive terms of sequence $ a_{x+1} , a_{x+2} , \cdots , a_{x+2k} $ such that for all $ 1 \le i < j \le 2k $, $ a_{x+i} \not \equiv a_{x+j} \ (mod \ p) $.
Every non-negative integer is coloured white or red, so that:
• there are at least a white number and a red number;
• the sum of a white number and a red number is white;
• the product of a white number and a red number is red.
Prove that the product of two red numbers is always a red number, and the sum of two red numbers is always a red number.
Let $a \neq b a,b \in \mathbb{R}$ such that $(x^2+20ax+10b)(x^2+20bx+10a)=0$ has no roots for $x$. Prove that $20(b-a)$ is not an integer.
During a lecture, each of $26$ mathematicians falls asleep exactly once, and stays asleep for a nonzero amount of time. Each mathematician is awake at the moment the lecture starts, and the moment the lecture finishes. Prove that there are either $6$ mathematicians such that no two are asleep at the same time, or $6$ mathematicians such that there is some point in time during which all $6$ are asleep.
Let $a,b,c\in \mathbb N$ be such that $a,b\neq c$. Prove that there are infinitely many prime numbers $p$ for which there exists $n\in\mathbb N$ that $p|a^n+b^n-c^n$.
Let $a_1, a_2, \ldots, a_n$ be real numbers lying in $[-1, 1]$ such that $a_1 + a_2 + \cdots + a_n = 0$. Prove that there is a $k \in \{1, 2, \ldots, n\}$ such that $|a_1 + 2a_2 + 3a_3 + \cdots + k a_k | \le \frac{2k+1}4$ .
Prove that for any positive integer $n\geq 2$ we have that \[\sum_{k=2}^n \lfloor \sqrt[k]{n}\rfloor=\sum_{k=2}^n\lfloor\log_{k}n\rfloor.\]
Answer either (i) or (ii).
(i) Given that the sequence whose $n$th term is $(s_n + 2s_{n + 1})$ converges, show that the sequence $\{ s_n \}$ converges also.
(ii) A plane varies so that it includes a cone of constant value equal to $\pi a^3 / 3$ with the surface the equation of which in rectangular coordinates is $2xy = z^2.$ Find the equation of the envelope of the various positions of this plane.
State the result so that it applies to a general cone (that is, conic surface) of the second order.
Given [i]Fibonacci[/i] sequence $(F_n),$ and a positive integer $m$, denote $k(m)$ by the smallest positive integer satisfying $F_{n+k(m)}\equiv F_n(\bmod m),$ for all natural numbers $n$.
Prove that: $k(m)$ is even for all $m>2.$