MathNet 2013 Question 6

For each integer k≥2, let P(k) be its greatest prime divisor. Prove that infinitely many integers n satisfy $P(n)\lt P(n+1)\lt P(n+2)$.