olymmath

PAMO 2002 Problem 3

  • Day 1

Prove for every integer n>0n>0 , there exists an integer k>0k>0 such that 2nk2^nk can be written in decimal notation using only digits 1 and 2.

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 pamo/2002/p3 · Tag MBTQEJ7BA5 · Edit this page on GitHub · Keys: j next, k previous