A pretentious proof of Linnik's estimate for primes in arithmetic progressions

Fuente: arXiv
Gespeichert in:
Bibliographische Detailangaben
1. Verfasser: Sachpazis, Stelios
Format: Preprint
Veröffentlicht: 2022
Schlagworte:
Online-Zugang:
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
_version_ 1866909317550047232
author Sachpazis, Stelios
author_facet Sachpazis, Stelios
contents In the present paper, we adopt a pretentious approach and prove a strongly uniform estimate for the sums of the von Mangoldt function $Λ$ on arithmetic progressions. This estimate is analogous to an estimate that Linnik established in his attempt to prove his celebrated theorem concerning the size of the smallest prime number of an arithmetic progression. Our work builds on ideas coming from the pretentious large sieve of Granville, Harper and Soundararajan and it also borrows insights from the treatment of Koukoulopoulos on multiplicative functions with small averages.
format Preprint
id arxiv_https___arxiv_org_abs_2209_14538
institution arXiv
publishDate 2022
record_format arxiv
spellingShingle A pretentious proof of Linnik's estimate for primes in arithmetic progressions
Sachpazis, Stelios
Number Theory
11N05, 11N13, 11N37
In the present paper, we adopt a pretentious approach and prove a strongly uniform estimate for the sums of the von Mangoldt function $Λ$ on arithmetic progressions. This estimate is analogous to an estimate that Linnik established in his attempt to prove his celebrated theorem concerning the size of the smallest prime number of an arithmetic progression. Our work builds on ideas coming from the pretentious large sieve of Granville, Harper and Soundararajan and it also borrows insights from the treatment of Koukoulopoulos on multiplicative functions with small averages.
title A pretentious proof of Linnik's estimate for primes in arithmetic progressions
topic Number Theory
11N05, 11N13, 11N37
url https://arxiv.org/abs/2209.14538