3.2-4

$f(n)多项式有解即存在c_1,c_2,n_0使得n>=n_0时有$
$c_1n^k\leq f(n) \leq c_2n^k成立,即lgc_1+klgn\leq lgf(n) \leq lgc_2+klgn$
故$lgf(n)=\Theta(lgn)$

$\because lg(\lceil lgn\rceil !)=\Theta(\lceil lgn\rceil\cdot lg\lceil lgn\rceil)=\omega(lgn)$
$\therefore \lceil lgn\rceil !多项式无界$

$\because lg(\lceil lglgn\rceil !)=\Theta(\lceil lglgn\rceil\cdot lg\lceil lglgn\rceil)=\Theta(lglgn\cdot lglglgn) = o(lg^2lgn)=o(lgn)$
$\therefore \lceil lglgn\rceil !多项式有界，且比多项式增长更缓慢$