59 lines
950 B
Markdown
59 lines
950 B
Markdown
---
|
|
id: 5900f4791000cf542c50ff8b
|
|
challengeType: 5
|
|
title: 'Problem 268: Counting numbers with at least four distinct prime factors less than 100'
|
|
---
|
|
|
|
## Description
|
|
<section id='description'>
|
|
It can be verified that there are 23 positive integers less than 1000 that are divisible by at least four distinct primes less than 100.
|
|
|
|
Find how many positive integers less than 1016 are divisible by at least four distinct primes less than 100.
|
|
</section>
|
|
|
|
## Instructions
|
|
<section id='instructions'>
|
|
|
|
</section>
|
|
|
|
## Tests
|
|
<section id='tests'>
|
|
|
|
```yml
|
|
tests:
|
|
- text: <code>euler268()</code> should return 785478606870985.
|
|
testString: assert.strictEqual(euler268(), 785478606870985);
|
|
|
|
```
|
|
|
|
</section>
|
|
|
|
## Challenge Seed
|
|
<section id='challengeSeed'>
|
|
|
|
<div id='js-seed'>
|
|
|
|
```js
|
|
function euler268() {
|
|
// Good luck!
|
|
return true;
|
|
}
|
|
|
|
euler268();
|
|
```
|
|
|
|
</div>
|
|
|
|
|
|
|
|
</section>
|
|
|
|
## Solution
|
|
<section id='solution'>
|
|
|
|
```js
|
|
// solution required
|
|
```
|
|
|
|
</section>
|