Let $\mathcal {P}$ be the set of primes and $\pi (x)$ the number of primes not exceeding x. Let $P^+(n)$ be the largest prime factor of n, with the convention $P^+(1)=1$, and $ T_c(x)=\#\{p\le x:p\in \mathcal {P},P^+(p-1)\ge p^c\}. $ Motivated by a conjecture of Chen and Chen [‘On the largest prime factor of shifted primes’, Acta Math. Sin. (Engl. Ser.) 33 (2017), 377–382], we show that for any c with $8/9\le c<1$,

$$ \begin{align*} \limsup_{x\rightarrow\infty}T_c(x)/\pi(x)\le 8(1/c-1), \end{align*} $$

which clearly means that

$$ \begin{align*} \limsup_{x\rightarrow\infty}T_c(x)/\pi(x)\rightarrow 0 \quad \text{as } c\rightarrow 1. \end{align*} $$

The Euler–Mascheroni constant $\gamma =0.5772\ldots \!$ is the $K={\mathbb Q}$ example of an Euler–Kronecker constant $\gamma _K$ of a number field $K.$ In this note, we consider the size of the $\gamma _q=\gamma _{K_q}$ for cyclotomic fields $K_q:={\mathbb Q}(\zeta _q).$ Assuming the Elliott–Halberstam Conjecture (EH), we prove uniformly in Q that

$$ \begin{align*} \frac{1}{Q}\sum_{Q<q\le 2Q} |{\gamma_q - \log q}| = o(\log Q).\end{align*} $$

In other words, under EH, the $\gamma _q /\!\log q$ in these ranges converge to the one point distribution at $1$ . This theorem refines and extends a previous result of Ford, Luca and Moree for prime $q.$ The proof of this result is a straightforward modification of earlier work of Fouvry under the assumption of EH.

The level of distribution of a complex-valued sequence $b$ measures the quality of distribution of $b$ along sparse arithmetic progressions $nd+a$. We prove that the Thue–Morse sequence has level of distribution $1$, which is essentially best possible. More precisely, this sequence gives one of the first nontrivial examples of a sequence satisfying a Bombieri–Vinogradov-type theorem for each exponent $\theta <1$. This result improves on the level of distribution $2/3$ obtained by Müllner and the author. As an application of our method, we show that the subsequence of the Thue–Morse sequence indexed by $\lfloor n^c\rfloor$, where $1 < c < 2$, is simply normal. This result improves on the range $1 < c < 3/2$ obtained by Müllner and the author and closes the gap that appeared when Mauduit and Rivat proved (in particular) that the Thue–Morse sequence along the squares is simply normal.