freeCodeCamp/problem-266-pseudo-square-root.english.md at 92377cf71af628cb5ea6b28ff7d6fa66a9b52449

mrugesh 22afc2a0ca feat(learn): python certification projects (#38216 )

Co-authored-by: Oliver Eyton-Williams <ojeytonwilliams@gmail.com>
Co-authored-by: Kristofer Koishigawa <scissorsneedfoodtoo@gmail.com>
Co-authored-by: Beau Carnes <beaucarnes@gmail.com>

2020-05-27 13:19:08 +05:30

1.0 KiB

Raw Blame History

id, challengeType, isHidden, title, forumTopicId

id	challengeType	isHidden	title	forumTopicId
5900f4771000cf542c50ff89	5	false	Problem 266: Pseudo Square Root	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

tests:
  - text: <code>euler266()</code> should return 1096883702440585.
    testString: assert.strictEqual(euler266(), 1096883702440585);

Challenge Seed

function euler266() {
  // Good luck!
  return true;
}

euler266();

Solution

// solution required

1.0 KiB Raw Blame History