56 lines
1.1 KiB
Markdown
56 lines
1.1 KiB
Markdown
---
|
|
id: 5900f4791000cf542c50ff8b
|
|
challengeType: 5
|
|
title: 'Problem 268: Counting numbers with at least four distinct prime factors less than 100'
|
|
videoUrl: ''
|
|
localeTitle: 'Problema 268: contar números con al menos cuatro factores primos distintos menos de 100'
|
|
---
|
|
|
|
## Description
|
|
<section id="description"> Se puede verificar que hay 23 enteros positivos menores que 1000 que son divisibles por al menos cuatro primos distintos menores que 100. <p> Calcule cuántos enteros positivos menores de 1016 son divisibles por al menos cuatro primos distintos menores de 100. </p></section>
|
|
|
|
## Instructions
|
|
<section id="instructions">
|
|
</section>
|
|
|
|
## Tests
|
|
<section id='tests'>
|
|
|
|
```yml
|
|
tests:
|
|
- text: <code>euler268()</code> debe devolver 785478606870985.
|
|
testString: 'assert.strictEqual(euler268(), 785478606870985, "<code>euler268()</code> should return 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>
|