ee1e8abd87
* feat(tools): add seed/solution restore script * chore(curriculum): remove empty sections' markers * chore(curriculum): add seed + solution to Chinese * chore: remove old formatter * fix: update getChallenges parse translated challenges separately, without reference to the source * chore(curriculum): add dashedName to English * chore(curriculum): add dashedName to Chinese * refactor: remove unused challenge property 'name' * fix: relax dashedName requirement * fix: stray tag Remove stray `pre` tag from challenge file. Signed-off-by: nhcarrigan <nhcarrigan@gmail.com> Co-authored-by: nhcarrigan <nhcarrigan@gmail.com>
47 lines
796 B
Markdown
47 lines
796 B
Markdown
---
|
|
id: 5900f4771000cf542c50ff89
|
|
title: 'Problem 266: Pseudo Square Root'
|
|
challengeType: 5
|
|
forumTopicId: 301915
|
|
dashedName: problem-266-pseudo-square-root
|
|
---
|
|
|
|
# --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.
|
|
|
|
# --hints--
|
|
|
|
`euler266()` should return 1096883702440585.
|
|
|
|
```js
|
|
assert.strictEqual(euler266(), 1096883702440585);
|
|
```
|
|
|
|
# --seed--
|
|
|
|
## --seed-contents--
|
|
|
|
```js
|
|
function euler266() {
|
|
|
|
return true;
|
|
}
|
|
|
|
euler266();
|
|
```
|
|
|
|
# --solutions--
|
|
|
|
```js
|
|
// solution required
|
|
```
|