Found problems: 471
Prove that there are infinitely many multiples of 2005 that contain all the digits 0, 1, 2,...,9 an equal number of times.
(a) Find all positive integers $ n$ for which $ 2^n\minus{}1$ is divisible by $ 7$.
(b) Prove that there is no positive integer $ n$ for which $ 2^n\plus{}1$ is divisible by $ 7$.
For any positive integer $n>1$, let $p(n)$ be the greatest prime factor of $n$. Find all the triplets of distinct positive integers $(x,y,z)$ which satisfy the following properties: $x,y$ and $z$ form an arithmetic progression, and $p(xyz)\leq 3.$
Let $ m \equal{} 2007^{2008}$, how many natural numbers n are there such that $ n < m$ and $ n(2n \plus{} 1)(5n \plus{} 2)$ is divisible by $ m$ (which means that $ m \mid n(2n \plus{} 1)(5n \plus{} 2)$) ?
Determine all $(m,n) \in \mathbb{Z}^+ \times \mathbb{Z}^+$ which satisfy $3^m-7^n=2.$
Let $n$ be a positive integer. Prove that $a(n) = n^5 +5^n$ is divisible by $11$ if and only if $b(n) = n^5 · 5^n +1$ is divisible by $11$.
[i](Walther Janous)[/i]
For each integer $1\le j\le 2017$, let $S_j$ denote the set of integers $0\le i\le 2^{2017} - 1$ such that $\left\lfloor \frac{i}{2^{j-1}} \right\rfloor$ is an odd integer. Let $P$ be a polynomial such that
\[P\left(x_0, x_1, \ldots, x_{2^{2017} - 1}\right) = \prod_{1\le j\le 2017} \left(1 - \prod_{i\in S_j} x_i\right).\]
Compute the remainder when
\[ \sum_{\left(x_0, \ldots, x_{2^{2017} - 1}\right)\in\{0, 1\}^{2^{2017}}} P\left(x_0, \ldots, x_{2^{2017} - 1}\right)\]
is divided by $2017$.
[i]Proposed by Ashwin Sah[/i]
There are given integers $a$ and $b$ such that $a$ is different from $0$ and the number $3+ a +b^2$ is divisible by $6a$. Prove that $a$ is negative.
For any odd prime $p$ and any integer $n,$ let $d_p (n) \in \{ 0,1, \dots, p-1 \}$ denote the remainder when $n$ is divided by $p.$ We say that $(a_0, a_1, a_2, \dots)$ is a [i]p-sequence[/i], if $a_0$ is a positive integer coprime to $p,$ and $a_{n+1} =a_n + d_p (a_n)$ for $n \geqslant 0.$
(a) Do there exist infinitely many primes $p$ for which there exist $p$-sequences $(a_0, a_1, a_2, \dots)$ and $(b_0, b_1, b_2, \dots)$ such that $a_n >b_n$ for infinitely many $n,$ and $b_n > a_n$ for infinitely many $n?$
(b) Do there exist infinitely many primes $p$ for which there exist $p$-sequences $(a_0, a_1, a_2, \dots)$ and $(b_0, b_1, b_2, \dots)$ such that $a_0 <b_0,$ but $a_n >b_n$ for all $n \geqslant 1?$
[I]United Kingdom[/i]
Find all triples $(p, x, y)$ consisting of a prime number $p$ and two positive integers $x$ and $y$ such that $x^{p -1} + y$ and $x + y^ {p -1}$ are both powers of $p$.
[i]Proposed by Belgium[/i]
The sequence $ \{ a_n \} _ { n \ge 0 } $ is defined by $ a_0 = 2 , a_1 = 4 $ and
\[ a_{n+1} = \frac{a_n a_{n-1}}{2} + a_n + a_{n-1} \]
for all positive integers $ n $. Determine all prime numbers $ p $ for which there exists a positive integer $ m $ such that $ p $ divides the number $ a_m - 1 $.
Let $\phi(n)$ be the number of positive integers less than $n$ that are relatively prime to $n$, where $n$ is a positive integer. Find all pairs of positive integers $(m,n)$ such that \[2^n + (n-\phi(n)-1)! = n^m+1.\]
Let $p$ be a prime number, $n$ a natural number which is not divisible by $p$, and $\mathbb{K}$ is a finite field, with $char(K) = p, |K| = p^n, 1_{\mathbb{K}}$ unity element and $\widehat{0} = 0_{\mathbb{K}}.$ For every $m \in \mathbb{N}^{*}$ we note
$ \widehat{m} = \underbrace{1_{\mathbb{K}} + 1_{\mathbb{K}} + \ldots + 1_{\mathbb{K}}}_{m \text{ times}} $ and define the polynomial
\[
f_m = \sum_{k = 0}^{m} (-1)^{m - k} \widehat{\binom{m}{k}} X^{p^k} \in \mathbb{K}[X].
\]
a) Show that roots of $f_1$ are $ \left\{ \widehat{k} | k \in \{0,1,2, \ldots , p - 1 \} \right\}$.
b) Let $m \in \mathbb{N}^{*}.$ Determine the set of roots from $\mathbb{K}$ of polynomial $f_{m}.$
We say that a set $S$ of integers is [i]rootiful[/i] if, for any positive integer $n$ and any $a_0, a_1, \cdots, a_n \in S$, all integer roots of the polynomial $a_0+a_1x+\cdots+a_nx^n$ are also in $S$. Find all rootiful sets of integers that contain all numbers of the form $2^a - 2^b$ for positive integers $a$ and $b$.
Does there exist $2017$ consecutive positive integers, none of which could be written as $a^2 + b^2$ for some integers $a, b$? Justify your answer.
Find all prime numbers $p$ for which there exist positive integers $x$, $y$, and $z$ such that the number
$x^p + y^p + z^p - x - y - z$
is a product of exactly three distinct prime numbers.
Find all prime numbers $p$ for which there exist positive integers $x$, $y$, and $z$ such that the number
$x^p + y^p + z^p - x - y - z$
is a product of exactly three distinct prime numbers.
Big Bird has a polynomial $P$ with integer coefficients such that $n$ divides $P(2^n)$ for every positive integer $n$. Prove that Big Bird's polynomial must be the zero polynomial.
[i]Ashwin Sah[/i]
Find all real-valued functions on the positive integers such that $f(x + 1019) = f(x)$ for all $x$, and $f(xy) = f(x) f(y)$ for all $x,y$.
Determine all integers $ n > 1$ such that
\[ \frac {2^n \plus{} 1}{n^2}
\]
is an integer.
Find all polynomials $W$ with integer coefficients satisfying the following condition: For every natural number $n, 2^n - 1$ is divisible by $W(n).$
Solve in prime numbers the equation $x^y - y^x = xy^2 - 19$.
Find all prime numbers $p$ such that the number
$$3^p+4^p+5^p+9^p-98$$
has at most $6$ positive divisors.
Let $P(x)$ be a polynomial with integer coefficients such that $P(0)=1$, and let $c > 1$ be an integer. Define $x_0=0$ and $x_{i+1} = P(x_i)$ for all integers $i \ge 0$. Show that there are infinitely many positive integers $n$ such that $\gcd (x_n, n+c)=1$.
[i]Proposed by Milan Haiman and Carl Schildkraut[/i]
Let $ n$ be a natural number $ \ge 2$ which divides $ 3^n\plus{}4^n$.Prove That $ 7\mid n$.