user
Task

The following problem is taken from Project Euler problem 41.
  
  
We shall say that an n-digit number is pandigital if it makes use of all the digits 1 to n exactly once. For example, 2143 is a 4-digit pandigital and is also prime.
  
  
What is the largest **pandigital prime** that exists?

Optional

Further say that an n+1-digit number is pandigital0 if it makes use of all the digits 0 to n exactly once. For example 10243 is a 5-digit pandigital0 and is also prime.
  
  
What is the largest **pandigital0 prime** that exists?
  
  
Assume that the problem is talking about **decimal** numbers.
assistant
```
say ($_..7).reverse.permutations».join.first: &is-prime for 1,0;

```

Output:

```
7652413
76540231
```