64 lines
1.1 KiB
Markdown
64 lines
1.1 KiB
Markdown
|
---
|
||
|
|
id: 5
|
||
|
|
localeTitle: 5900f4771000cf542c50ff89
|
||
|
|
challengeType: 5
|
||
|
|
title: 'Problem 266: Pseudo Square Root'
|
||
|
|
---
|
||
|
|
|
||
|
|
## Description
|
||
|
|
<section id='description'>
|
||
|
|
Los divisores de 12 son: 1,2,3,4,6 y 12.
|
||
|
|
El divisor más grande de 12 que no excede la raíz cuadrada de 12 es 3.
|
||
|
|
Llamaremos el divisor más grande de un entero n que hace no exceda la raíz cuadrada de n la pseudo raíz cuadrada (PSR) de n.
|
||
|
|
Se puede ver que PSR (3102) = 47.
|
||
|
|
|
||
|
|
|
||
|
|
Sea p el producto de los números primos por debajo de 190.
|
||
|
|
Encuentre PSR (p) mod 1016.
|
||
|
|
</section>
|
||
|
|
|
||
|
|
## Instructions
|
||
|
|
<section id='instructions'>
|
||
|
|
|
||
|
|
</section>
|
||
|
|
|
||
|
|
## Tests
|
||
|
|
<section id='tests'>
|
||
|
|
|
||
|
|
```yml
|
||
|
|
tests:
|
||
|
|
- text: <code>euler266()</code> debe devolver 1096883702440585.
|
||
|
|
testString: 'assert.strictEqual(euler266(), 1096883702440585, "<code>euler266()</code> should return 1096883702440585.");'
|
||
|
|
|
||
|
|
```
|
||
|
|
|
||
|
|
</section>
|
||
|
|
|
||
|
|
## Challenge Seed
|
||
|
|
<section id='challengeSeed'>
|
||
|
|
|
||
|
|
<div id='js-seed'>
|
||
|
|
|
||
|
|
```js
|
||
|
|
function euler266() {
|
||
|
|
// Good luck!
|
||
|
|
return true;
|
||
|
|
}
|
||
|
|
|
||
|
|
euler266();
|
||
|
|
```
|
||
|
|
|
||
|
|
</div>
|
||
|
|
|
||
|
|
|
||
|
|
|
||
|
|
</section>
|
||
|
|
|
||
|
|
## Solution
|
||
|
|
<section id='solution'>
|
||
|
|
|
||
|
|
```js
|
||
|
|
// solution required
|
||
|
|
```
|
||
|
|
</section>
|