Find the minimum value of ( 1 + a ) ( 1 + b ) ( 1 + c ) ( 1 + d ) if a , b , c and d are positive real numbers satisfying a b c d = 1 .
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.
By AM-GM: 1 + a ≥ 2 a × 1 = 2 a and similarly for b , c , d :
( 1 + a ) ( 1 + b ) ( 1 + c ) ( 1 + d ) ≥ 1 6 a b c d = 1 6
Simple standard approach.
Problem Loading...
Note Loading...
Set Loading...
( 1 + a ) ( 1 + b ) ( 1 + c ) ( 1 + d ) = 1 + a + b + c + d + a b + a c + a d + b c + b d + c d + a b c + a b d + a c d + b c d + a b c d
Using the AM-GM inequality, we have:
1 + a + b + c + d + a b + a c + a d + b c + b d + c d + a b c + a b d + a c d + b c d + a b c d ≥ 1 6 a b c d = 1 6
Equality is established when a = b = c = d = 1
⟹ ( 1 + a ) ( 1 + b ) ( 1 + c ) ( 1 + d ) ≥ 1 6