47 lines
852 B
Markdown
47 lines
852 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)\bmod {10}^{16}$.
|
|
|
|
# --hints--
|
|
|
|
`pseudoSquareRoot()` should return `1096883702440585`.
|
|
|
|
```js
|
|
assert.strictEqual(pseudoSquareRoot(), 1096883702440585);
|
|
```
|
|
|
|
# --seed--
|
|
|
|
## --seed-contents--
|
|
|
|
```js
|
|
function pseudoSquareRoot() {
|
|
|
|
return true;
|
|
}
|
|
|
|
pseudoSquareRoot();
|
|
```
|
|
|
|
# --solutions--
|
|
|
|
```js
|
|
// solution required
|
|
```
|