我正在解决一个来自 CLRS 的问题,我们需要证明 (ceil(lg lg n))!是多项式有界的。
Let g(n)=(ceil(lg lg n))!
lg(g(n))=lg((ceil(lg lg n))!)
=theta(ceil(lg lg n) * lg (ceil(lg lg n))) [since lg(n!)=theta(n * lg n)
and replacing n by ceil(lg lg n) here.]
=theta((lg lg n) * (lg lg lg n)) ----(1) [since ceil(n)=theta(n)
and replacing n by (lg lg n) here.]
现在如果我能证明 theta(lg n)=o(n)
=>theta(lg lg lg n)=o(lg lg n)
=>theta((lg lg n) * (lg lg lg n))=o((lg lg n) * (lg lg n))
=o((lg lg n)^2)
=o(lg^2(lg n))
=o(lg n) ----(2) [Polylogarithmic functions grow slower than
polynomial functions.
=>log^b(n)=o(n^a)
=>log^2(log n)=o(logn^1)
=>log^2(log n)=o(log n)]
From (1) and (2) we have log(g(n))=o(log n)
=>g(n)=o(n^a) that is g(n) is polynomially bounded.
我面临的唯一问题是证明theta(lg n)=o(n)。请帮忙!