f1c9b08cf3
This includes certificates (where it does nothing), but does not include any translations.
66 lines
1.0 KiB
Markdown
66 lines
1.0 KiB
Markdown
---
|
|
id: 5900f4771000cf542c50ff89
|
|
challengeType: 5
|
|
isHidden: false
|
|
title: 'Problem 266: Pseudo Square Root'
|
|
forumTopicId: 301915
|
|
---
|
|
|
|
## Description
|
|
<section id='description'>
|
|
The divisors of 12 are: 1,2,3,4,6 and 12.
|
|
The largest divisor of 12 that does not exceed the square root of 12 is 3.
|
|
We shall call the largest divisor of an integer n that does not exceed the square root of n the pseudo square root (PSR) of n.
|
|
It can be seen that PSR(3102)=47.
|
|
|
|
|
|
Let p be the product of the primes below 190.
|
|
Find PSR(p) mod 1016.
|
|
</section>
|
|
|
|
## Instructions
|
|
<section id='instructions'>
|
|
|
|
</section>
|
|
|
|
## Tests
|
|
<section id='tests'>
|
|
|
|
```yml
|
|
tests:
|
|
- text: <code>euler266()</code> should return 1096883702440585.
|
|
testString: assert.strictEqual(euler266(), 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>
|