2
$\begingroup$

Do we know anything about sums over primes in arithmetic progressions like the following: $$\sum_{\substack{q \equiv a (\text{mod } l) \\ q \le x}} q^{\alpha}$$ where $q$ is a prime and $\alpha > 0$? If we consider the average over this sum: $$ \frac{1}{\pi(x,l,a)} \sum_{\substack{q \equiv a (\text{mod } l) \\ q \le x}} q^{\alpha}$$ where $\pi(x,l,a)$ is the number of primes $\le x$ in the residue class of $a$ modulo $l$, can we say that this average will be equal for all residue classes? Can we say anything of this sort even for specific values of $\alpha$?

$\endgroup$
1
  • $\begingroup$ @MatemáticosChibchas Thanks for pointing that out. I meant to write $\pi(x,l,a)$. $\endgroup$
    – Iguana
    Sep 4, 2022 at 2:46

1 Answer 1

4
$\begingroup$

The standard analytic proof of the prime number theorem for arithmetic progressions will work here as well, just replacing $L(s,\chi)$ with $L(s-\alpha,\chi)$; the asymptotic size of your first sum will be $$ \frac{x^{1+\alpha}}{(1+\alpha)\phi(l)\log x}. $$

$\endgroup$
3
  • $\begingroup$ Does this mean that asymptotically the "average" value should be equal across residue classes since the main term for $\pi(x,q,a)$ is also not dependent on $a$? $\endgroup$
    – Iguana
    Oct 28, 2019 at 6:35
  • $\begingroup$ Thanks for your answer. Could you please refer to a specific proof of the PNT for arithmetic progressions that can be tweaked in the form you indicate? I tried without success. $\endgroup$ Sep 3, 2022 at 22:26
  • $\begingroup$ If you know of a proof of PNT for arithmetic progressions that uses contour integration, almost surely that proof can be adapted to this scenario as well. $\endgroup$ Sep 3, 2022 at 23:12

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.

Not the answer you're looking for? Browse other questions tagged or ask your own question.