olymmath

VTRMC 2006 Problem 1

    Find, with proof, all positive integers nn such that neither nn nor n2n^2 contain a 11 when written in base 33 .

    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 vtrmc/2006/p1 · Tag YTXQSXTP3P · Edit this page on GitHub · Keys: j next, k previous