Theorems and problems on \(p^k/k\). (Q775858)

The main result is the following: if \(p_k\) stands for the \(k^{\text{th}}\) prime, then \(c_1\log^2x \leq \sum_{p_k \leq x} \left | {p_{k+1} \over k+1} - {p_k \over k} \right | \leq c_2 \log^2 x\) with some positive constants \(c_1,c_2\). The proof is elementary and appeals only once to an estimate obtainable by Brun's method.