For all positive integer and , is it always true that ?
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.
Let us use Induction to prove Σ i = 2 n i + 1 l n ( i ) < 4 n 2 , n ≥ 2 :
CASE I ( n = 2 ): 2 + 1 l n ( 2 ) < 4 2 2 ⇒ 3 l n ( 2 ) < 1 (TRUE).
CASE ( n = k ): Σ i = 2 k i + 1 l n ( i ) < 4 k 2 (ASSUMED TRUE).
CASE III ( n = k + 1 ): ( k + 1 ) + 1 l n ( k + 1 ) + Σ i = 2 k i + 1 l n ( i ) < 4 k 2 + ( k + 1 ) + 1 l n ( k + 1 ) ;
or Σ i = 2 k + 1 i + 1 l n ( i ) < [ 4 k 2 + ( k + 1 ) + 1 l n ( k + 1 ) ] ⋅ 4 ( k + 1 ) 2 ⋅ ( k + 1 ) 2 4 ;
or Σ i = 2 k + 1 i + 1 l n ( i ) < [ ( k + 1 ) 2 k 2 + ( k + 2 ) ( k + 1 ) 2 4 l n ( k + 1 ) ] ⋅ 4 ( k + 1 ) 2 ;
or Σ i = 2 k + 1 i + 1 l n ( i ) < [ 1 + k + 2 4 l n ( k + 1 ) − k + 1 2 + 4 l n ( k + 1 ) + ( k + 1 ) 2 1 + 4 l n ( k + 1 ) ] ⋅ 4 ( k + 1 ) 2 ;
or Σ i = 2 k + 1 i + 1 l n ( i ) < f ( k ) ⋅ 4 ( k + 1 ) 2 .
Since lim x → ∞ f ( x ) → 1 AND f ′ ( x ) > 0 for all x ≥ 2 (i.e. a strictly increasing function over this interval) , we conclude Σ i = 2 k + 1 i + 1 l n ( i ) < 4 ( k + 1 ) 2 (TRUE).
Q . E . D .