Computation Workshop Solution Checker

Pandigital Primes

A \((1,k)\)-pandigital integer is any number which contains all the digits from \(1\) to \(k\) exactly once each. A \((0,k)\)-pandigital integer is any number which contains all the digits from \(0\) to \(k\) exactly once each. We are interested in counting how many \((1,k)\)-pandigital prime numbers exist.

Part A How many \((1,7)\)-pandigital prime numbers are there?
Part B How many \((0,7)\)-pandigital prime numbers are there?