freeCodeCamp/problem-355-maximal-coprime-subset.english.md at 908adc2c372f2c1af0c8d1c80b264c23f96fd7d7

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

943 B

Raw Blame History

id, challengeType, isHidden, title, forumTopicId

id	challengeType	isHidden	title	forumTopicId
5900f4d01000cf542c50ffe2	5	false	Problem 355: Maximal coprime subset	302015

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);

Challenge Seed

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

euler355();

Solution

// solution required

943 B Raw Blame History