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