freeCodeCamp/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-355-maximal-coprime-subset.english.md

id, challengeType, title

id	challengeType	title
5900f4d01000cf542c50ffe2	5	Problem 355: Maximal coprime subset

Description

Define Co(n) to be the maximal possible sum of a set of mutually co-prime elements from {1, 2, ..., n}. For example Co(10) is 30 and hits that maximum on the subset {1, 5, 7, 8, 9}.

You are given that Co(30) = 193 and Co(100) = 1356.

Find Co(200000).

Instructions

Tests

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

Challenge Seed

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

euler355();

Solution

// solution required