Which of the following inequality holds true for whole number value of n ?
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.
It is Choice A above, which can be proved via Induction:
CASE I ( n = 1 ): 2 2 ⋅ 1 ≤ ( 1 + 1 ) ⋅ ( 1 2 ) ⇒ 4 ≤ 4 (TRUE).
CASE II ( n = k ): 2 2 k ≤ ( k + 1 ) ⋅ ( k 2 k ) (ASSUMED TRUE).
CASE III ( n = k + 1 ) : 2 2 k 2 2 ≤ 2 2 ⋅ ( k + 1 ) ⋅ ( k 2 k ) ⇒ 2 2 ( k + 1 ) ≤ 4 ( k + 1 ) ⋅ ( k 2 k ) ;
or 2 2 ( k + 1 ) ≤ 4 ⋅ ( k + 1 ) ( k + 2 k + 2 ) ⋅ ( k 2 k ) ( k + 1 2 ( k + 1 ) ) ( k + 1 2 ( k + 1 ) ) ;
or 2 2 ( k + 1 ) ≤ [ ( ( k + 1 ) + 1 ) ⋅ ( k + 1 2 ( k + 1 ) ) ] ⋅ [ k + 2 4 k + 4 ⋅ ( k ! ) 2 ( 2 k ) ! ( 2 k + 2 ) ! ( ( k + 1 ) ! ) 2 ] ;
or 2 2 ( k + 1 ) ≤ [ ( ( k + 1 ) + 1 ) ⋅ ( k + 1 2 ( k + 1 ) ) ] ⋅ [ k + 2 4 k + 4 ⋅ ( k ! ) 2 ( 2 k ) ! ( 2 k + 2 ) ( 2 k + 1 ) ( 2 k ) ! ( k + 1 ) 2 ( k ! ) 2 ] ;
or 2 2 ( k + 1 ) ≤ [ ( ( k + 1 ) + 1 ) ⋅ ( k + 1 2 ( k + 1 ) ) ] ⋅ [ ( k + 2 ) ( 2 k + 1 ) 2 ( k + 1 ) 2 ] ;
or 2 2 ( k + 1 ) ≤ [ ( ( k + 1 ) + 1 ) ⋅ ( k + 1 2 ( k + 1 ) ) ] ⋅ [ 2 k 2 + 5 k + 2 2 k 2 + 4 k + 2 ] ;
or 2 2 ( k + 1 ) ≤ [ ( ( k + 1 ) + 1 ) ⋅ ( k + 1 2 ( k + 1 ) ) ] ⋅ [ 1 − 2 k 2 + 5 k + 2 k ] ≤ [ ( k + 1 ) + 1 ] ⋅ ( k + 1 2 ( k + 1 ) ) ;
or 2 2 ( k + 1 ) ≤ [ ( k + 1 ) + 1 ] ⋅ ( k + 1 2 ( k + 1 ) ) . (TRUE).
Q . E . D .
Problem Loading...
Note Loading...
Set Loading...
Applying Cauchy-Schwarz inequality on sets { ( 0 n ) , ( 1 n ) , . . . , ( n n ) } & { 1 , 1 , . . . , 1 } k = 0 ∑ n ( k n ) ≤ ( 1 + 1 + . . . + 1 ) ( 0 n ) 2 + ( 1 n ) 2 + . . . + ( n n ) 2 ⇒ 2 n ≤ ( n + 1 ) ( n 2 n ) ⇒ 2 2 n ≤ ( n + 1 ) ( n 2 n )