ee1e8abd87
* feat(tools): add seed/solution restore script * chore(curriculum): remove empty sections' markers * chore(curriculum): add seed + solution to Chinese * chore: remove old formatter * fix: update getChallenges parse translated challenges separately, without reference to the source * chore(curriculum): add dashedName to English * chore(curriculum): add dashedName to Chinese * refactor: remove unused challenge property 'name' * fix: relax dashedName requirement * fix: stray tag Remove stray `pre` tag from challenge file. Signed-off-by: nhcarrigan <nhcarrigan@gmail.com> Co-authored-by: nhcarrigan <nhcarrigan@gmail.com>
726 B
726 B
id, title, challengeType, forumTopicId, dashedName
| id | title | challengeType | forumTopicId | dashedName |
|---|---|---|---|---|
| 5900f42b1000cf542c50ff3d | Problem 190: Maximising a weighted product | 5 | 301828 | problem-190-maximising-a-weighted-product |
--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.
--hints--
euler190() should return 371048281.
assert.strictEqual(euler190(), 371048281);
--seed--
--seed-contents--
function euler190() {
return true;
}
euler190();
--solutions--
// solution required