olymmath

KöMaL 2016 B4761

    Let nn be an integer greater than 3. Prove that if each digit occurs exactly once in the base-nn representation of an integer then the number cannot be a prime.

    Official text KöMaL. 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 hu-komal/2016/b4761 · Tag EV7Z2VWAW1 · Edit this page on GitHub · Keys: j next, k previous