Let A , B , C be non negative integers such that A + M + C = 1 2 . What is the maximum value of A M C + A M + M C + C 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.
What is the proof that A M C + A M + M C + C A will be maximum when A = M = C = 4 ?
Log in to reply
Apply to AM-GM inequality,the maximum value of A M C occurs when A = M = C = 4 .
And about A M + M C + C A ,because A 2 + M 2 + C 2 ≥ A M + M C + C A , 1 4 4 = ( A + M + C ) 2 ≥ 3 ( A M + M C + C A ) ,the maximum value also occurs when A = M = C = 4
Problem Loading...
Note Loading...
Set Loading...
A M C + A M + M C + C A + A + M + C + 1 = ( A + 1 ) ( M + 1 ) ( C + 1 ) A M C + A M + M C + C A = ( A + 1 ) ( M + 1 ) ( C + 1 ) − 1 3
By AM-GM Inequality, ( A + 1 ) ( M + 1 ) ( C + 1 ) ≤ ( 3 A + 1 + M + 1 + C + 1 ) 3 = 1 2 5
A M C + A M + M C + C A ≤ 1 2 5 − 1 3 = 1 1 2