Source: Lusophon MO 2016 Prove that any positive power of $2$ can be written as: $$5xy-x^2-2y^2$$ where $x$ and $y$ are odd numbers.

For every positive integer $n$, define the remainder sum $r(n)$ as the sum of the remainders upon division of $n$ by each of the numbers $1$ through $n$. Prove that $r(2^{k}-1) =r(2^{k})$ for every $k\geq 1.$

Let $k$ and $d$ be integers such that $k>1$ and $0\leq d<9$. Prove that there exists some integer $n$ such that the $k$th digit from the right of $2^n$ is $d$. [i](tatari/nightmare)[/i]

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$?

For $n\in\mathbb{N}$, prove that $2^n$ can begin with any sequence of digits. Hint: $\log 2$ is irrational number.

Let $n$ be a positive number. Prove that there exists an integer $N =\overline{m_1m_2...m_n}$ with $m_i \in \{1, 2\}$ which is divisible by $2^n$.

Prove that there is a unique positive integer formed only by the digits $2$ and $5$, which has $ 2007$ digits and is divisible by $2^{2007}$.

15 boxes are given. They all are initially empty. By one move it is allowed to choose some boxes and to put in them numbers of apricots which are pairwise distinct powers of 2. Find the least positive integer $k$ such that it is possible to have equal numbers of apricots in all the boxes after $k$ moves.

Find all positive integers $n$, such that $n$ is a perfect number and $\varphi (n)$ is power of $2$. [i]Note:a positive integer $n$, is called perfect if the sum of all its positive divisors is equal to $2n$.[/i]

Prove that the sequence $5, 12, 19, 26, 33,\cdots $ contains no term of the form $2^n -1.$

Is there a power of $2$ that when written in the decimal system has all its digits different from zero and it is possible to reorder them to form another power of $2$?

Let $a, b, c$ and $d$ be non-negative integers. Prove that the numbers $2^a7^b$ and $2^c7^d$ give the same remainder when divided by $15$ iff the numbers $3^a5^b$ and $3^c5^d$ give the same remainder when divided by $16$.

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$.

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.

Find the greatest power of $2$ that divides $a_n = [(3+\sqrt{11} )^{2n+1}]$, where $n$ is a given positive integer.

We have a set of weights with masses $1$ gm, $2$ gm, $4$ gm and so on, all values being powers of $2$ . Some of these weights may have equal mass. Some weights were put on both sides of a balance beam, resulting in equilibrium. It is known that on the left hand side all weights were distinct . Prove that on the right hand side there were no fewer weights than on the left hand side.

For a positive integer $s$, denote with $v_2(s)$ the maximum power of $2$ that divides $s$. Prove that for any positive integer $m$ that: $$v_2\left(\prod_{n=1}^{2^m}\binom{2n}{n}\right)=m2^{m-1}+1.$$ (FYROM)

For every positive integer $n$, find the maximum power of $2$ that divides the number $$1 + 2019 + 2019^2 + 2019^3 +.. + 2019^{n-1}.$$

Find the highest power of 2 that is a factor of the number $$ L_n = (n+1)(n+2)... 2n,$$ where $n$is a natural number.

Is there a power of $2$ such that it is possible to rearrange the digits, giving another power of $2$?

Prove that for every natural $n$ there exists a number, containing only digits "$1$" and "$2$" in its decimal notation, that is divisible by $2^n$ ( $n$-th power of two ).

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)$

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 no number of the form $ 2^n $, where $ n $ is a natural number, is the sum of two or more consecutive natural numbers.