Problem 190

A place to air possible concerns or difficulties in understanding ProjectEuler problems. This forum is not meant to publish solutions. This forum is NOT meant to discuss solution methods or giving hints how a problem can be solved.
Forum rules
As your posts will be visible to the general public you are requested to be thoughtful in not posting anything that might explicitly give away how to solve a particular problem.

This forum is NOT meant to discuss solution methods for a problem.

In particular don't post any code fragments or results.

Don't start begging others to give partial answers to problems

Don't ask for hints how to solve a problem

Don't start a new topic for a problem if there already exists one


See also the topics:
Don't post any spoilers
Comments, questions and clarifications about PE problems.
Post Reply
Zkid
Posts: 4
Joined: Wed Apr 04, 2012 12:09 am

Problem 190

Post by Zkid »

Let Sm = (x1, x2, ... , xm) be the m-tuple of positive real numbers with x1 + x2 + ... + xm = m for which Pm = x1 * x2^2 * ... * xm^m is maximised.

For example, it can be verified that [P10] = 4112 ([ ] is the integer part function).

I must be misunderstanding this as it seems to be that, for example, S10 = (2, 2, 2, 2, 2) gives P10 = 32768 which is much greater. What am I misreading?
Image
User avatar
jaap
Posts: 588
Joined: Tue Mar 25, 2008 3:57 pm
Contact:

Re: Problem 190

Post by jaap »

Zkid wrote:Let Sm = (x1, x2, ... , xm) be the m-tuple of positive real numbers with x1 + x2 + ... + xm = m for which Pm = x1 * x2^2 * ... * xm^m is maximised.

For example, it can be verified that [P10] = 4112 ([ ] is the integer part function).

I must be misunderstanding this as it seems to be that, for example, S10 = (2, 2, 2, 2, 2) gives P10 = 32768 which is much greater. What am I misreading?
S10 needs to have 10 numbers in it, x1...x10 that sum to 10. You are only using five.
Zkid
Posts: 4
Joined: Wed Apr 04, 2012 12:09 am

Re: Problem 190

Post by Zkid »

That makes a lot more sense - I read that pretty carelessly. Thanks
Image
User avatar
PropagandaPanda
Posts: 3
Joined: Sat Sep 26, 2009 4:29 am

Re: Problem 190

Post by PropagandaPanda »

From what I understand right now, Pm should be an integer since we need to compute its integer partition.

However, it seems that Pm is not an integer. Taking m=2, the simple corresponding function is:
y = x*(2-x)^2

which is maximized for x>0 and (2-x)>0 at (2/3, 32/27 ). 32/27 is not an integer. I must be misunderstanding something.

Thanks.
User avatar
TheEvil
Posts: 84
Joined: Sun Nov 13, 2011 10:38 am
Location: Szeged, Hungary

Re: Problem 190

Post by TheEvil »

The point is, that P_m should not be integer. If your answer (a=32/27) is correct, then you have to take the greatest integer which is less or equal to a, in this case, you should type 1 as a correct answer.
Image
User avatar
PropagandaPanda
Posts: 3
Joined: Sat Sep 26, 2009 4:29 am

Re: Problem 190

Post by PropagandaPanda »

Ah I see. Thank you!
User avatar
PropagandaPanda
Posts: 3
Joined: Sat Sep 26, 2009 4:29 am

Re: Problem 190

Post by PropagandaPanda »

For some reason, I had interpreted that as the Integer Partition function.
philiplu
Posts: 92
Joined: Wed Aug 02, 2017 8:51 pm
Location: Redmond, WA, USA

Re: Problem 190

Post by philiplu »

There's a 19 Nov 2013 post by dcterr with 8 kudos but no permanent lock on it in the PE190 forum, and it's only a few posts from being deleted. Can it be made permanent? It's a really good explanation of the theory behind the problem which I refer to occasionally, and I'd hate to see it disappear.

https://projecteuler.net/thread=190;page=5#142817
Image
User avatar
RobertStanforth
Administrator
Posts: 2666
Joined: Mon Dec 30, 2013 11:25 pm

Re: Problem 190

Post by RobertStanforth »

Thanks - I've made it permanent.
Post Reply