Question 1
The complexity of an integer $n\gt 1$ is the number of prime factors in its factorisation, counted with multiplicity; for example 4 and 6 both have complexity 2. Find all $n$ for which every integer $m$ strictly between $n$ and $2n$ has complexity (a) no greater than that of $n$; (b) strictly less than that of $n$. Original weights:2+2.
