MathDB

There exists a power of 2 with exactly k consecutive zeroes

Source: Czech-Polish-Slovak 2006 Q4

April 27, 2013

modular arithmeticnumber theory unsolvednumber theory

Problem Statement

Show that for every integer

k \ge 1

there is a positive integer

n

such that the decimal representation of

2^n

contains a block of exactly

k

zeros, i.e.

2^n = \dots a00 \dots 0b \cdots

with

k

zeros and

a, b \ne 0