Let a , b and c be three integers such that;
Find the minimum value of ∣ a 2 b + b 2 c + c 2 a ∣ .
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
In your code you have put a condition u>w . Rather it should be u>v .
Log in to reply
Thank you, you're right. I've re-run the code with that correction. There are still two solutions, however.
Log in to reply
Yep... But since one has 3 tries, he/she can do it.
Log in to reply
@Zeeshan Ali – Please consider adjusting the problem statement to make the solution correct. 1585 is not wrong given the stated restrictions, so marking it wrong is the wrong thing to do.
For example, you could ask for min a 2 b + b 2 c + c 2 a , or you could ask for ( ∣ a ∣ + ∣ b ∣ + ∣ c ∣ ) , which is 2 4 in all cases.
Thanks.
In future, if you spot any errors with a problem, you can “report” it by selecting "report problem" in the “dot dot dot” menu in the lower right corner. This will notify the problem creator who can fix the issues.
Problem Loading...
Note Loading...
Set Loading...
Are you quite sure that the answer offered for this problem is correct? Two answers seem possible to me.