IMO 1979 LL YUG78

Origin: YUG

Problem

By \omega(n), where n is an integer greater than 1, let us denote the number of different prime divisors of the number n. Prove that there exist infinitely many numbers n for which \omega(n) < \omega(n + 1) < \omega(n + 2) holds.