olymmath

OBM 1994 Problem 5

    Call a super-integer an infinite sequence of decimal digits: …dn…d2d1\ldots d_n \ldots d_2d_1 .

    (Formally speaking, it is the sequence (d1,d2d1,d3d2d1,…)(d_1,d_2d_1,d_3d_2d_1,\ldots) )

    Given two such super-integers …cn…c2c1\ldots c_n \ldots c_2c_1 and …dn…d2d1\ldots d_n \ldots d_2d_1 , their product …pn…p2p1\ldots p_n \ldots p_2p_1 is formed by taking pn…p2p1p_n \ldots p_2p_1 to be the last n digits of the product cn…c2c1c_n \ldots c_2c_1 and dn…d2d1d_n \ldots d_2d_1 . Can we find two non-zero super-integers with zero product? (a zero super-integer has all its digits zero)

    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 br-obm/1994/p5 · Tag EVG7CA3RZ2 · Edit this page on GitHub · Keys: j next, k previous