olymmath

CAPS 2006 Problem 4

    Show that for every integer k≥1k \ge 1 there is a positive integer nn such that the decimal representation of 2n2^n contains a block of exactly kk zeros, i.e. 2n=…a00…0b⋯2^n = \dots a00 \dots 0b \cdots with kk zeros and a,b≠0a, b \ne 0 .

    Dataset text AI-MO AoPS. Quoted with source.

    Solutions

    No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.

    Add a solution

    Similar problems

    These problems have the most words in common with this statement.

    Locator caps/2006/p4 · Tag AJG81357PE · Edit this page on GitHub · Keys: j next, k previous