Find all numbers that can be expressed in exactly $2010$ different ways as the sum of powers of two with non-negative exponents, each power appearing as a summand at most three times. A sum can also be made from just one summand.

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.

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

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

$n$ is a positive integer, $F_n=2^{2^{n}}+1$. Prove that for $n \geq 3$, there exists a prime factor of $F_n$ which is larger than $2^{n+2}(n+1)$.

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]

Show that there are infinitely many triangles with side lengths $a$, $b$, $c$, where $a$ is a prime, $b$ is a power of $2$ and $c$ is the square of an odd integer.

$(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 $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 $P(n)$ be the number of ways to split a natural number $n$ to the sum of powers of two, when the order does not matter. For example $P(5) = 4$, as $5=4+1=2+2+1=2+1+1+1=1+1+1+1+1$. Prove that for any natural the identity $P(n) + (-1)^{a_1} P(n-1) + (-1)^{a_2} P(n-2) + \ldots + (-1)^{a_{n-1}} P(1) + (-1)^{a_n} = 0,$ is true, where $a_k$ is the number of units in the binary number record $k$ . [url=http://matol.kz/comments/2720/show]source[/url]

1 - Prove that $55 < (1+\sqrt{3})^4 < 56$ . 2 - Find the largest power of $2$ that divides $\lceil(1+\sqrt{3})^{2n}\rceil$ for the positive integer $n$

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

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

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

Determine the smallest integer $k > 1$ such that there exist $k$ distinct primes whose squares sum to a power of $2$.

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]

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.

Let $a_1, a_2, a_3, . . . , a_n, . . . $ be an infinite sequence of natural numbers in which $a_1$ is not divisible by $5$. Suppose $a_{n+1} = a_n + b_n$ where bn is the last digit of $a_n$, for every $n$. Prove that the sequence $\{a_n\}$ contains infinitely many powers of 2.

Some distinct positive integers were written on a blackboard such that the sum of any two integers is a power of $2$. What is the maximal possible number written on the blackboard?

Find all natural numbers $n$ for which the number of all positive divisors of the number lcm $(1,2,..., n)$ is equal to $2^k$ for some non-negative integer $k$.

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 all natural numbers $n$ for which the number of all positive divisors of the number lcm $(1,2,..., n)$ is equal to $2^k$ for some non-negative integer $k$.

Determine all pairs $(a,b)$ of positive integers such that $(a+b)^3-2a^3-2b^3$ is a power of two.