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

Files

Randell Dawson a7eb800450 fix(curriculum): Remove unnecessary assert message argument from English Coding Interview Prep challenges - Project Euler - 04 (#36418 )

* fix: removed assert msg argument-4

* fix: remove double quotes surrounding testString code

Co-Authored-By: Tom <20648924+moT01@users.noreply.github.com>

2019-07-27 07:34:19 -05:00

906 B

Raw Blame History

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

Challenge Seed

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

euler355();

Solution

// solution required

906 B Raw Blame History