Found problems: 86
Determine all non-constant monic polynomials $P(x)$ with integer coefficients such that no prime $p>10^{100}$ divides any number of the form $P(2^n)$
You are given a positive integer $n$. Find the smallest positive integer $k$, for which there exist integers $a_1, a_2, \ldots, a_k$, for which the following equality holds:
$$2^{a_1} + 2^{a_2} + \ldots + 2^{a_k} = 2^n - n + k$$
[i]Proposed by Mykhailo Shtandenko[/i]
For each positive integer $ n$, let $ f(n)$ denote the number of ways of representing $ n$ as a sum of powers of 2 with nonnegative integer exponents. Representations which differ only in the ordering of their summands are considered to be the same. For instance, $ f(4) \equal{} 4$, because the number 4 can be represented in the following four ways: 4; 2+2; 2+1+1; 1+1+1+1.
Prove that, for any integer $ n \geq 3$ we have $ 2^{\frac {n^2}{4}} < f(2^n) < 2^{\frac {n^2}2}$.
Let \(n\) be a non-negative integer and define \(a_n = 2^n - n\). Determine all non-negative integers \(m\) such that \(s_m = a_0 + a_1 + \dots + a_m\) is a power of 2.
Prove that no number of the form $ 2^n $, where $ n $ is a natural number, is the sum of two or more consecutive natural numbers.
Find the smallest positive integer $n$ which can not be expressed as $n =\frac{2^a - 2^b}{2^c - 2^d}$ for some positive integers $a, b, c, d$
Determine the highest power of $2$ that divides $2^n!$.
Is there a quadratic trinomial with integer coefficients, such that all values which are natural to be natural powers of two?
It is stated that $2^{2010}$ is a $606$-digit number that begins with $1$. How many of the numbers $1, 2,2^2,2^3, ..., 2^{2009}$ start with $4$?
A sequence $(u_{n})$ is defined by \[ u_{0}=2 \quad u_{1}=\frac{5}{2}, u_{n+1}=u_{n}(u_{n-1}^{2}-2)-u_{1} \quad \textnormal{for } n=1,\ldots \] Prove that for any positive integer $n$ we have \[ [u_{n}]=2^{\frac{(2^{n}-(-1)^{n})}{3}} \](where [x] denotes the smallest integer $\leq$ x)$.$
Let $ b, m, n$ be positive integers such that $ b > 1$ and $ m \neq n.$ Prove that if $ b^m \minus{} 1$ and $ b^n \minus{} 1$ have the same prime divisors, then $ b \plus{} 1$ is a power of 2.
A sequence $(u_{n})$ is defined by \[ u_{0}=2 \quad u_{1}=\frac{5}{2}, u_{n+1}=u_{n}(u_{n-1}^{2}-2)-u_{1} \quad \textnormal{for } n=1,\ldots \] Prove that for any positive integer $n$ we have \[ [u_{n}]=2^{\frac{(2^{n}-(-1)^{n})}{3}} \](where $[x]$ denotes the smallest integer $\leq x)$
The sum of all terms of a finite arithmetical progression of integers is a power of two. Prove that the number of terms is also a power of two.
$(SWE 4)$ Let $a_0, a_1, a_2, \cdots$ be determined with $a_0 = 0, a_{n+1} = 2a_n + 2^n$. Prove that if $n$ is power of $2$, then so is $a_n$
Let $n$ be a natural number. We define sequences $\langle a_i\rangle$ and $\langle b_i\rangle$ of integers as follows. We let $a_0=1$ and $b_0=n$. For $i>0$, we let $$\left( a_i,b_i\right)=\begin{cases} \left(2a_{i-1}+1,b_{i-1}-a_{i-1}-1\right) & \text{if } a_{i-1}<b_{i-1},\\
\left( a_{i-1}-b_{i-1}-1,2b_{i-1}+1\right) & \text{if } a_{i-1}>b_{i-1},\\
\left(a_{i-1},b_{i-1}\right) & \text{if } a_{i-1}=b_{i-1}.\end{cases}$$
Given that $a_k=b_k$ for some natural number $k$, prove that $n+3$ is a power of two.
The decimal representation of an integer uses only two different digits. The number is at least $10$ digits long, and any two neighbouring digits are distinct. What is the greatest power of two that can divide this number?
For every non-negative integer $i$, define the number $M(i)$ as follows:
write $i$ down as a binary number, so that we have a string of zeroes and ones, if the number of ones in this string is even, then set $M(i) = 0$, otherwise set $M(i) = 1$. (The first terms of the sequence $M(i)$, $i = 0, 1, 2, ...$ are $0, 1, 1, 0, 1, 0, 0, 1,...$ )
(a) Consider the finite sequence $M(O), M(1), . . . , M(1000) $.
Prove that there are at least $320$ terms in this sequence which are equal to their neighbour on the right : $M(i) = M(i + 1 )$ .
(b) Consider the finite sequence $M(O), M(1), . . . , M(1000000)$ .
Prove that the number of terms $M(i)$ such that $M(i) = M(i +7)$ is at least $450000$.
(A Kanel)
For any positive integer $ n$, prove that there exists a polynomial $ P$ of degree $ n$ such that all coeffients of this polynomial $ P$ are integers, and such that the numbers $ P\left(0\right)$, $ P\left(1\right)$, $ P\left(2\right)$, ..., $ P\left(n\right)$ are pairwisely distinct powers of $ 2$.
For every positive integer $n$, find the maximum power of $2$ that divides the number $$1 + 2019 + 2019^2 + 2019^3 +.. + 2019^{n-1}.$$
On the squares $a1, a2,... , a8$ of a chessboard there are respectively $2^0, 2^1, ..., 2^7$ grains of oat, on the squares $b8, b7,..., b1$ respectively $2^8, 2^9, ..., 2^{15}$ grains of oat, on the squares $c1, c2,..., c8$ respectively $2^{16}, 2^{17}, ..., 2^{23}$ grains of oat etc. (so there are $2^{63}$ grains of oat on the square $h1$). A knight starts moving from some square and eats after each move all the grains of oat on the square to which it had jumped, but immediately after the knight leaves the square the same number of grains of oat reappear. With the last move the knight arrives to the same square from which it started moving. Prove that the number of grains of oat eaten by the knight is divisible by $3$.
Let $a,b,c,d$ be odd integers such that $0<a<b<c<d$ and $ad=bc$. Prove that if $a+d=2^k$ and $b+c=2^m$ for some integers $k$ and $m$, then $a=1$.
Let $n$ be a natural number. We define sequences $\langle a_i\rangle$ and $\langle b_i\rangle$ of integers as follows. We let $a_0=1$ and $b_0=n$. For $i>0$, we let $$\left( a_i,b_i\right)=\begin{cases} \left(2a_{i-1}+1,b_{i-1}-a_{i-1}-1\right) & \text{if } a_{i-1}<b_{i-1},\\
\left( a_{i-1}-b_{i-1}-1,2b_{i-1}+1\right) & \text{if } a_{i-1}>b_{i-1},\\
\left(a_{i-1},b_{i-1}\right) & \text{if } a_{i-1}=b_{i-1}.\end{cases}$$
Given that $a_k=b_k$ for some natural number $k$, prove that $n+3$ is a power of two.
Prove that the integer $1^1 + 3^3 + 5^5 + .. + (2^n - 1)^{2^n-1}$ is a multiple of $2^n$ but not a multiple of $2^{n+1}$.
Consider the sequence $x_n = 2^n-n$, $n = 0,1 ,2 ,...$.
Find all integers $m \ge 0$ such that $s_m = x_0 + x_1 + x_2 + ... + x_m$ is a power of $2$.
Prove that the sequence $5, 12, 19, 26, 33,\cdots $ contains no term of the form $2^n -1.$