MathDB
Problems
Contests
International Contests
Czech-Polish-Slovak Match
2006 Czech-Polish-Slovak Match
4
4
Part of
2006 Czech-Polish-Slovak Match
Problems
(1)
There exists a power of 2 with exactly k consecutive zeroes
Source: Czech-Polish-Slovak 2006 Q4
4/27/2013
Show that for every integer
k
≥
1
k \ge 1
k
≥
1
there is a positive integer
n
n
n
such that the decimal representation of
2
n
2^n
2
n
contains a block of exactly
k
k
k
zeros, i.e.
2
n
=
…
a
00
…
0
b
⋯
2^n = \dots a00 \dots 0b \cdots
2
n
=
…
a
00
…
0
b
⋯
with
k
k
k
zeros and
a
,
b
≠
0
a, b \ne 0
a
,
b
=
0
.
modular arithmetic
number theory unsolved
number theory