---
id: 5900f4771000cf542c50ff89
challengeType: 5
title: 'Problem 266: Pseudo Square Root'
forumTopicId: 301915
---
## 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.
## Instructions
## Tests
```yml
tests:
- text: euler266() should return 1096883702440585.
testString: assert.strictEqual(euler266(), 1096883702440585);
```
## Challenge Seed
```js
function euler266() {
// Good luck!
return true;
}
euler266();
```