Let k be a positive integer, and n a positive integer greater than 2. Define
f1(n)=n,f2(n)=nf1(n),…,fj+1(n)=nfj(n).
Prove either part of the inequality
fk(n)<n!!⋯!<fk+1(n),
where the middle term has k factorial symbols. Putnaminequalitiesfactorial