6cfd0fc503
* fix: improve Project Euler descriptions and test case Improve formatting of Project Euler test descriptions. Also add poker hands array and new test case for problem 54 * feat: add typeof tests and gave functions proper names for first 100 challenges * fix: continue fixing test descriptions and adding "before test" sections * fix: address review comments * fix: adjust grids in 18 and 67 and fix some text that reference files rather than the given arrays * fix: implement bug fixes and improvements from review * fix: remove console.log statements from seed and solution
1.9 KiB
1.9 KiB
id, challengeType, title, forumTopicId
| id | challengeType | title | forumTopicId |
|---|---|---|---|
| 5900f3971000cf542c50feaa | 5 | Problem 43: Sub-string divisibility | 302100 |
Description
The number, 1406357289, is a 0 to 9 pandigital number because it is made up of each of the digits 0 to 9 in some order, but it also has a rather interesting sub-string divisibility property.
Let d1 be the 1st digit, d2 be the 2nd digit, and so on. In this way, we note the following:
- d2d3d4 = 406 is divisible by 2
- d3d4d5 = 063 is divisible by 3
- d4d5d6 = 635 is divisible by 5
- d5d6d7 = 357 is divisible by 7
- d6d7d8 = 572 is divisible by 11
- d7d8d9 = 728 is divisible by 13
- d8d9d10 = 289 is divisible by 17
Find the numbers of all 0 to 9 pandigital numbers with this property.
Instructions
Tests
tests:
- text: <code>substringDivisibility()</code> should return an array.
testString: assert(Array.isArray(substringDivisibility()));
- text: <code>substringDivisibility()</code> should return [ 1430952867, 1460357289, 1406357289, 4130952867, 4160357289, 4106357289 ].
testString: assert.deepEqual(substringDivisibility(), [ 1430952867, 1460357289, 1406357289, 4130952867, 4160357289, 4106357289 ]);
Challenge Seed
function substringDivisibility() {
// Good luck!
return [];
}
substringDivisibility();
Solution
// solution required