MathDB
game, filling in digits and not having a perfect power

Source: IMOC 2017 N2

August 13, 2021
gamenumber theorycombinatorics

Problem Statement

On the blackboard, there are KK blanks. Alice decides NN values of blanks (0āˆ’9)(0-9) and then Bob determines the remaining digits. Find the largest possible integer NN such that Bob can guarantee to make the final number isn't a power of an integer.