Finding the greatest product

Hi all,

I came up with an interesting question for myself, but I can't find the answer. Here are the rules:

You take any number, let's say we take 9.

You're then allowed to use any group of positive numbers whose sum is 9, and try to get the biggest product out of them.

For example, you might try 4*5 or 3*3*3 or 4.5*4.5, etc. There is no limit to how many multiplications you use.

That's pretty much it. Basically I wanted to see if there was some sort of formula for always finding the greatest product for any number while abiding by these rules, or any way of showing what the greatest product was even for a particular number.

I came up with this: (N^0.5)^(N^0.5) which as far as I know abides by the rules above - although I don't know how to write it out with normal multiplications - but it turns out not to be the answer after all. Any help or comments much appreciated!

Re: Finding the greatest product

Re: Finding the greatest product

Quote:

Originally Posted by

**earboth** 1. Let n denotes the number you choose (in your example n = 9)

2. Then the 1st factor of the product is x and the 2nd consequently (n - x)

3. The product p can be written as

4. This is a quadratic function opening down whose maximum is at it's vertex which is

5. So the maximum value is

(with your example

)

Hmm. Not sure I agree with this solution. According to the rules in the OP, you're allowed to use as many multiplications as you want (could be more than two). I think, by symmetry, you can say that, given multiplicands, the maximum product you can get would be given by , multiplied times. That is, if you allow two multiplicands, then the max occurs at as earboth found. If you have three multiplicands, then I think the maximum would occur at which gives the product So, given this way of choosing the maximum product, given the number of multiplicands, which number of multiplicands gives the maximum product? Obviously, is less than , so there is a maximum in there somewhere. The formula to use is . I admit to using a bit of calculus to maximize this function. The max occurs at . The closest integer (you have to have an integer number of multiplicands) is so I think the maximum is in this case. As another example, if you're solving the problem with, say, instead of then the max occurs at So, since I would try taking the number and dividing by and then dividing by to see which one of them is greater when plugged into your function . Probably dividing by is going to give you the maximum most of the time, if not all the time.

Re: Finding the greatest product

Thanks for the replies chaps.

I had also reasoned that dividing by the number of multiplicands always yielded the highest product. It's because of the rule that everything always has to sum to the same amount (I think).

That's also why I thought of putting it to a power rather than using multiplication, so I could use the same technique for numbers that didn't divide neatly into integers. I.e. (N^0.5)^(N^0.5). Apologies for the awkward formatting.

(Actually, could someone just clarify whether this still falls within the rules or not? I'm working on the assumption that powers are just a different way of expressing normal multiplication)

In conclusion, it doesn't seem like there's a particular formula for getting at the highest product (within this rule set), unless you set the number of multiplicands. Is that right?

Re: Finding the greatest product

, with equality if and only if (inequality of arithmetic and geometric means)

Your sum is: . Obviously, the product maxim value is .