freeCodeCamp/problem-347-largest-integer-divisible-by-two-primes.english.md at df88daa4820671fc55d5856a9abd38ae141ca83e

Files

Valeriy 79d9012432 fix(curriculum): quotes in tests (#18828 )

* fix(curriculum): tests quotes

* fix(curriculum): fill seed-teardown

* fix(curriculum): fix tests and remove unneeded seed-teardown

2018-10-20 23:32:47 +05:30

1.2 KiB

Raw Blame History

id, challengeType, title

id	challengeType	title
5900f4c81000cf542c50ffd9	5	Problem 347: Largest integer divisible by two primes

Description

The largest integer ≤ 100 that is only divisible by both the primes 2 and 3 is 96, as 96=32*3=25*3. For two distinct primes p and q let M(p,q,N) be the largest positive integer ≤N only divisible by both p and q and M(p,q,N)=0 if such a positive integer does not exist.

E.g. M(2,3,100)=96. M(3,5,100)=75 and not 90 because 90 is divisible by 2 ,3 and 5. Also M(2,73,100)=0 because there does not exist a positive integer ≤ 100 that is divisible by both 2 and 73.

Let S(N) be the sum of all distinct M(p,q,N). S(100)=2262.

Find S(10 000 000).

Instructions

Tests

tests:
  - text: <code>euler347()</code> should return 11109800204052.
    testString: assert.strictEqual(euler347(), 11109800204052, '<code>euler347()</code> should return 11109800204052.');

Challenge Seed

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

euler347();

Solution

// solution required

1.2 KiB Raw Blame History