Let where denotes the number of primes not exceeding
Find the closed form of and submit your answer as
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 l m = k ≥ m in f π ( k ) k ln k , u m = k ≥ m sup π ( k ) k ln k then l m → 1 and u m → 1 by the Prime Number Theorem.
For n ≥ k ≥ m > 1 , using n k ln k n ≤ e 1 we have
n + π ( k ) ln n n + π ( k ) ln n ≥ ≤ n + l m k ln k ln n ≥ n + l m k n + u m k + u m k ln k ln k n ≤ n + u m k + u m e ln m n
Then
n → ∞ lim sup k = 1 ∑ n n + π ( k ) ln n 1 = n → ∞ lim sup k = m ∑ n n + π ( k ) ln n 1 ≤ n → ∞ lim sup k = m ∑ n n + l m k 1 = n → ∞ lim sup n 1 k = 1 ∑ n 1 + l m n k 1 = 0 ∫ 1 1 + l m x d x
In a similar way we get n → ∞ lim in f k = 1 ∑ n n + π ( k ) ln n 1 ≥ 0 ∫ 1 1 + u m x + e ln m u m d x
Taking m → ∞ , the limit is ∫ 0 1 1 + x d x = ln 2 .
So ⌈ 1 0 0 0 L ⌉ = 6 9 4 .