Project Euler 190: Maximizing a weighted product
Project Euler 190 Problem Description
Project Euler 190: Let S_{m} = (x_{1}, x_{2}, … , x_{m}) be the mtuple of positive real numbers with x_{1} + x_{2} + … + x_{m} = m for which P_{m} = x_{1} * x_{2}^{2} * … * x_{m}^{m} is maximised.
For example, it can be verified that [P_{10}] = 4112 ([ ] is the integer part function).
Find Σ[P_{m}] for 2 ≤ m ≤ 15.
Project Euler 190 Solution
Runs < 0.001 seconds in Python 2.7.Use this link to get the Project Euler 190 Solution Python 2.7 source.
Answer
Slowly swipe from either end beginning with the white vertical bar to get an idea of the starting or ending digits. For less drama, just double click the answer area. The distance between the two bars will give you an idea of the magnitude. Touch devices can tap and hold the center of the box between the two bars and choose define to reveal the answer.371048281
Afterthoughts

No afterthoughts yet.
Project Euler 190 Solution last updated
Discussion
No comments yet.