olymmath

OIM 2016 Problem 6

    Let kk be a positive integer and a1,a2,a_1, a_2, ⋅⋅⋅\cdot \cdot \cdot ,ak, a_k digits. Prove that there exists a positive integer nn such that the last 2k2k digits of 2n2^n are, in the following order, a1,a2,a_1, a_2, ⋅⋅⋅\cdot \cdot \cdot ,ak,b1,b2,, a_k , b_1, b_2, ⋅⋅⋅\cdot \cdot \cdot ,bk, b_k , for certain digits b1,b2,b_1, b_2, ⋅⋅⋅\cdot \cdot \cdot ,bk, b_k

    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 ibero/2016/p6 · Tag TWDG300E57 · Edit this page on GitHub · Keys: j next, k previous