56 lines
1.4 KiB
Markdown
56 lines
1.4 KiB
Markdown
---
|
||
id: 5900f3e81000cf542c50fefb
|
||
challengeType: 5
|
||
title: 'Problem 124: Ordered radicals'
|
||
videoUrl: ''
|
||
localeTitle: 'Problema 124: Radicales ordenados.'
|
||
---
|
||
|
||
## Description
|
||
<section id="description"> El radical de n, rad (n), es el producto de los distintos factores primos de n. Por ejemplo, 504 = 23 × 32 × 7, entonces rad (504) = 2 × 3 × 7 = 42. Si calculamos rad (n) para 1 ≤ n ≤ 10, clasifíquelos en rad (n) y clasifíquelos en n si los valores radicales son iguales, obtenemos: Sin clasificar <p> Ordenado n rad (n) </p><p> n rad (n) k 11 </p><p> 111 22 </p><p> 222 33 </p><p> 423 42 </p><p> 824 55 </p><p> 335 66 </p><p> 936 77 </p><p> 557 82 </p><p> 668 93 </p><p> 779 1010 </p><p> 101010 Sea E (k) el elemento kth en la columna ordenada n; por ejemplo, E (4) = 8 y E (6) = 9. Si rad (n) se clasifica para 1 ≤ n ≤ 100000, encuentre E (10000). </p></section>
|
||
|
||
## Instructions
|
||
<section id="instructions">
|
||
</section>
|
||
|
||
## Tests
|
||
<section id='tests'>
|
||
|
||
```yml
|
||
tests:
|
||
- text: <code>euler124()</code> debe devolver 21417.
|
||
testString: 'assert.strictEqual(euler124(), 21417, "<code>euler124()</code> should return 21417.");'
|
||
|
||
```
|
||
|
||
</section>
|
||
|
||
## Challenge Seed
|
||
<section id='challengeSeed'>
|
||
|
||
<div id='js-seed'>
|
||
|
||
```js
|
||
function euler124() {
|
||
// Good luck!
|
||
return true;
|
||
}
|
||
|
||
euler124();
|
||
|
||
```
|
||
|
||
</div>
|
||
|
||
|
||
|
||
</section>
|
||
|
||
## Solution
|
||
<section id='solution'>
|
||
|
||
```js
|
||
// solution required
|
||
```
|
||
</section>
|