Files
freeCodeCamp/curriculum/challenges/spanish/08-coding-interview-prep/project-euler/problem-190-maximising-a-weighted-product.spanish.md

61 lines
998 B
Markdown
Raw Normal View History

---
id: 5
localeTitle: 5900f42b1000cf542c50ff3d
challengeType: 5
title: 'Problem 190: Maximising a weighted product'
---
## Description
<section id='description'>
Sea Sm = (x1, x2, ..., xm) la m-tupla de números reales positivos con x1 + x2 + ... + xm = m para la cual Pm = x1 * x22 * ... * xmm es maximizado
Por ejemplo, se puede verificar que [P10] = 4112 ([] es la función de la parte entera).
Encuentra Σ [Pm] para 2 ≤ m ≤ 15.
</section>
## Instructions
<section id='instructions'>
</section>
## Tests
<section id='tests'>
```yml
tests:
- text: <code>euler190()</code> debe devolver 371048281.
testString: 'assert.strictEqual(euler190(), 371048281, "<code>euler190()</code> should return 371048281.");'
```
</section>
## Challenge Seed
<section id='challengeSeed'>
<div id='js-seed'>
```js
function euler190() {
// Good luck!
return true;
}
euler190();
```
</div>
</section>
## Solution
<section id='solution'>
```js
// solution required
```
</section>