(A,B,C) is a 'pandigital' set of positive integers where the concatenated A|B|C is comprised of all, and only, the ten decimal digits (0 to 9) with no repeated digits. (In the following, except where the base number has a radix, all integers are in base 10.)
How many of these 'pandigital' sets exist for
- AB = C [A in base B equals C]
- AB = C [A to the power of B equals C]
Provide a separate value for each specification.
There are 40,320 solutions (i.e. 8!) where B = 0 and c = 1.
For instance 73962845^0 = 1.
Of course, arguably, once you get over 40,000 they are no longer trivial.
I found these solutions without a computer.
Part 2: Trivial (?) solutions
