freeCodeCamp/curriculum/challenges/portuguese/08-coding-interview-prep/project-euler/problem-268-counting-number...

56 lines
1.1 KiB
Markdown
Raw Normal View History

---
id: 5900f4791000cf542c50ff8b
challengeType: 5
title: 'Problem 268: Counting numbers with at least four distinct prime factors less than 100'
videoUrl: ''
localeTitle: 'Problema 268: Contando números com pelo menos quatro fatores primos distintos menores que 100'
---
## Description
<section id="description"> Pode-se verificar que existem 23 inteiros positivos menores que 1000 que são divisíveis por pelo menos quatro primos distintos menores que 100. <p> Encontre quantos inteiros positivos menores que 1016 são divisíveis por pelo menos quatro primos distintos menores que 100. </p></section>
## Instructions
<section id="instructions">
</section>
## Tests
<section id='tests'>
```yml
tests:
- text: <code>euler268()</code> deve retornar 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>