2018-09-30 22:01:58 +00:00
---
id: 5900f3951000cf542c50fea8
title: 'Problem 41: Pandigital prime'
2020-11-27 18:02:05 +00:00
challengeType: 5
2019-08-05 16:17:33 +00:00
forumTopicId: 302078
2021-01-13 02:31:00 +00:00
dashedName: problem-41-pandigital-prime
2018-09-30 22:01:58 +00:00
---
2020-11-27 18:02:05 +00:00
# --description--
2020-02-28 12:39:47 +00:00
2020-11-27 18:02:05 +00:00
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.
2020-02-28 12:39:47 +00:00
What is the largest `n` -length digit pandigital prime that exists?
2020-11-27 18:02:05 +00:00
# --hints--
2018-09-30 22:01:58 +00:00
2020-11-27 18:02:05 +00:00
`pandigitalPrime(4)` should return a number.
2018-09-30 22:01:58 +00:00
2020-11-27 18:02:05 +00:00
```js
assert(typeof pandigitalPrime(4) === 'number');
```
2018-09-30 22:01:58 +00:00
2020-11-27 18:02:05 +00:00
`pandigitalPrime(4)` should return 4231.
2018-09-30 22:01:58 +00:00
2020-11-27 18:02:05 +00:00
```js
assert(pandigitalPrime(4) == 4231);
2018-09-30 22:01:58 +00:00
```
2020-11-27 18:02:05 +00:00
`pandigitalPrime(7)` should return 7652413.
2018-09-30 22:01:58 +00:00
2020-11-27 18:02:05 +00:00
```js
assert(pandigitalPrime(7) == 7652413);
```
2018-09-30 22:01:58 +00:00
2020-11-27 18:02:05 +00:00
# --seed--
## --seed-contents--
2018-09-30 22:01:58 +00:00
```js
function pandigitalPrime(n) {
2020-09-15 16:57:40 +00:00
2018-09-30 22:01:58 +00:00
return n;
}
pandigitalPrime(7);
```
2020-11-27 18:02:05 +00:00
# --solutions--
2018-09-30 22:01:58 +00:00
```js
function pandigitalPrime(n) {
function isPrime(num) {
for (let i = 2, s = Math.sqrt(num); i < = s; i++) {
if (num % i === 0) {
return false;
}
}
return num !== 1;
}
function getPermutations(n) {
if (n === 1) {
2018-10-02 14:02:53 +00:00
permutations.push(digitsArr.join(''));
2018-09-30 22:01:58 +00:00
} else {
for (let i = 0; i < n - 1 ; i + + ) {
getPermutations(n - 1);
// swap(n % 2 === 0 ? i : 0, n - 1);
if (n % 2 === 0) {
swap(i, n - 1);
} else {
swap(0, n - 1);
}
}
getPermutations(n - 1);
}
}
function swap(x, y) {
let temp = digitsArr[x];
digitsArr[x] = digitsArr[y];
digitsArr[y] = temp;
}
let max = 0;
let permutations = [];
let digitsArr;
2018-10-20 18:02:47 +00:00
let pandigitalNum = '';
2018-09-30 22:01:58 +00:00
for (let max = n; max > 0; max--) {
pandigitalNum += max;
}
for (let i = 0; i < pandigitalNum.length ; i + + ) {
if (max > 0) {
break;
} else {
permutations = [];
const currMax = pandigitalNum.slice(i);
2018-10-02 14:02:53 +00:00
digitsArr = currMax.split('');
2018-09-30 22:01:58 +00:00
getPermutations(digitsArr.length);
// sort permutations in descending order
permutations.sort(function(a, b) {
return b - a;
});
for (let perm of permutations) {
const thisPerm = parseInt(perm);
if (isPrime(thisPerm)) {
max = thisPerm;
break;
}
}
}
}
return max;
}
```