Loading...
Project Euler 190: Maximizing a weighted product
Project Euler 190 Problem Description
Project Euler 190: 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.
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.
Afterthoughts
-
No afterthoughts yet.
Project Euler 190 Solution last updated
Discussion
No comments yet.