2021-06-15 07:49:18 +00:00
---
id: 5900f42b1000cf542c50ff3d
2022-02-28 19:22:39 +00:00
title: 'Problema 190: Massimizzare un prodotto pesato'
2022-07-12 11:56:02 +00:00
challengeType: 1
2021-06-15 07:49:18 +00:00
forumTopicId: 301828
dashedName: problem-190-maximising-a-weighted-product
---
# --description--
2022-02-28 19:22:39 +00:00
Sia $S_m = (x_1, x_2, \ldots, x_m)$ la $m$-tuple di numeri reali poisitivi con $x_1 + x_2 + \cdots + x_m = m$ per i quali$P_m = x_1 \times {x_2}^2 \times \cdots \times {x_m}^m$ è massimizzato.
2021-06-15 07:49:18 +00:00
2022-02-28 19:22:39 +00:00
Ad esempio, si può verificare che $[P_{10}] = 4112$ ([ ] è la funzione parte intera).
2021-06-15 07:49:18 +00:00
2022-02-28 19:22:39 +00:00
Trova $\sum {[P_m]}$ per $2 ≤ m ≤ 15$.
2021-06-15 07:49:18 +00:00
# --hints--
2022-02-28 19:22:39 +00:00
`maximisingWeightedProduct()` dovrebbe restituire `371048281` .
2021-06-15 07:49:18 +00:00
```js
2022-02-28 19:22:39 +00:00
assert.strictEqual(maximisingWeightedProduct(), 371048281);
2021-06-15 07:49:18 +00:00
```
# --seed--
## --seed-contents--
```js
2022-02-28 19:22:39 +00:00
function maximisingWeightedProduct() {
2021-06-15 07:49:18 +00:00
return true;
}
2022-02-28 19:22:39 +00:00
maximisingWeightedProduct();
2021-06-15 07:49:18 +00:00
```
# --solutions--
```js
// solution required
```