A Superlogarithmic Lower Bound for Prime-Free Intervals Following Even Powers of a Fixed Prime

We investigate the distance to the next prime following even powers of a fixed prime \(q\), defining \(K_q(n)=nextprime(q²ⁿ)-q²ⁿ\). Using Fermat's little theorem, a constructive least-common-multiple argument, and a known upper-bound sieve estimate, we establish that for every fixed prime \(q\), there exist infinitely many positive integers \(n\) satisfying \(K_q(n)_q log nloglog n/logloglog n\). Consequently, \(n→∞K_q(n)/log n=∞\). The result provides a quantitative construction of arbitrarily long sequences of consecutive composite integers immediately following numbers of the form \(q²ⁿ\). It also establishes that no finite upper bound depending only on \(q\), including one of the form \(Cq^α\) with absolute constants \(C>0\) and \(α∈ R\), can universally bound the distance to the next prime for all positive integers \(n\). The note presents a self-contained derivation using established number-theoretic techniques and illustrates the construction with an explicit numerical example.