Problem

Source:

Tags: number theory, Bases



Find all prime numbers whose base $b$ representations (for some $b$) contain each of the digits $0,1,\ldots,b-1$ exactly once. (Digit $0$ may appear as the first digit.)