freeCodeCamp

id	challengeType	title	forumTopicId
5900f42b1000cf542c50ff3d	5	Problem 190: Maximising a weighted product	301828

Description

Let Sm = (x1, x2, ... , xm) be the m-tuple of positive real numbers with x1 + x2 + ... + xm = m for which Pm = x1 * x22 * ... * xmm is maximised.

For example, it can be verified that [P10] = 4112 ([ ] is the integer part function).

Find Σ[Pm] for 2 ≤ m ≤ 15.

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

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

euler190();

// solution required