Prove that for any positive integer nnn, the following inequality holds: lgn⩾klg2\lg n \geqslant k \lg 2lgn⩾klg2 where kkk is the number of distinct prime factors of .