Determine all positive integers n such that the concatenation of n and n^2 in base b uses at most k distinct characters, for fixed b and k.

Open the “Other problems” section on Wikipedia →

Source: List of unsolved problems in computer science (CC BY-SA 4.0)