Fastest structured way to get max(abc) if a+b+c=30

kelsiu

kelsiu

New member
Joined
Jun 15, 2014
Messages
9
What is the fastest and structured way to get maximum of abc if a+b+c=n, say n=30? a,b,c are non-negative and can be non-integer.
What is the fastest and structured way to get maximum of abc if a+b+c=n, say n=30? a,b,c are non-negative and can be non-integer.
 
Last edited:
kelsiu said:
What is the fastest and structured way to get maximum of abc if a+b+c=n, say n=30? a,b,c are non-negative and can be non-integer.
What is the fastest and structured way to get maximum of abc if a+b+c=n, say n=30? a,b,c are non-negative and can be non-integer.
Click to expand...
Hi, you should know by now that we want to see some work so we know where you need help. It's silly for us to show you something that you already know and tried.

Do you think that using n/3 = 10 for a, b and c would work? Why/why not?
 
10 + 10 + 10 = 30
10 * 10 * 10 = 1000

9.99 + 10 + 10.01 = 30
9.99 * 10 * 10.01 = 999.99899....

Get my drift?
 
You must log in or register to reply here.
Top