Problem

Source: India Postal Set 2 P2 2016

Tags: number theory, prime divisor



Let $\pi (n)$ denote the largest prime divisor of $n$ for any positive integer $n > 1$. Let $q$ be an odd prime. Show that there exists a positive integer $k$ such that $$\pi \left(q^{2^k}-1\right)< \pi\left(q^{2^k}\right)<\pi \left( q^{2^k}+1\right).$$