Journal Archive
2022
function solution52() {
let x = 0;
for (let i = 10 ; i < Infinity; i++) {
x = i;
const multiples = [2 * x, 3 * x, 4 * x, 5 * x, 6 * x];
const digits = getDigits(x);
const multiplesDigits = multiples.map(getDigits);
if (checkForPermutation(digits, multiplesDigits)) {
break;
}
}
function checkForPermutation(num, multiples) {
return multiples.every( multiplesDigitArr => multiplesDigitArr.every( digit => num.includes(digit)));
}
function getDigits(num) {
const numArr = num.toString().split('')
return numArr.map( digit => +digit);
}
return x;
}
Day 1: Solving one of Project Euler's problems
Permuted multiples
It can be seen that the number, 125874, and its double, 251748, contain exactly the same digits, but in a different order. Find the smallest positive integer, x, such that 2x, 3x, 4x, 5x, and 6x, contain the same digits.