--- id: 5900f4791000cf542c50ff8b challengeType: 5 title: 'Problem 268: Counting numbers with at least four distinct prime factors less than 100' videoUrl: '' localeTitle: '' --- ## Description undefined ## Instructions undefined ## Tests
```yml tests: - text: '' testString: 'assert.strictEqual(euler268(), 785478606870985, "euler268() should return 785478606870985.");' ```
## Challenge Seed
```js function euler268() { // Good luck! return true; } euler268(); ```
## Solution
```js // solution required ```