Skip to main content

All Questions

Filter by
Sorted by
Tagged with
2 votes
0 answers
125 views

Conditional stronger bounds on Linnik theorem with prime power modulus

This post is related to questions asked here and here. However, I include the relevant background on least prime in arithmetic progressions presented here for benefit of the reader. By Linnik's ...
Hhhhhhhhhhh's user avatar
  • 1,042
5 votes
1 answer
214 views

Remainder terms of congruence sums in sets of positive density

Let $\mathcal{A} \subset \mathbb{N}$ be an infinite sequence with positive density, in the sense that $$ \tag{1} \lim_{x\to\infty} \frac{|\mathcal{A} \cap x|}{x} = c > 0, $$ and define the ...
Joshua Stucky's user avatar
2 votes
1 answer
273 views

Primes in modular arithmetic progression

Fix a prime $p$. I want to get $k<p$ primes $p_1<\dots<p_k$ such that at every $i\in\{1,\dots,k\}$ we have $$p_i\equiv (2i+1+c)\bmod p$$ where $c$ is fixed and $2k+1+c<p$ holds. For a ...
Turbo's user avatar
  • 13.9k
1 vote
1 answer
177 views

Arithmetic progressions, given a prime

I have recently become interested in reading a little more on certain directions regarding primes in arithmetic progressions (AP). I would appreciate specific paper references (with the journal and ...
user avatar
3 votes
2 answers
417 views

Infinitely many primes in particular progressions

I'm faced with the following problem on primes. Does someone have any clue? Is it (a reformulation of) an open problem? Let $d$ be a positive integer, $d\geq 2$. By Dirichlet's theorem, there is an ...
E. Delaygue's user avatar
3 votes
1 answer
359 views

Primes in simultaneous arithmetic progressions

Suppose we're given four positive integers $a$, $b$, $c$, $d$ such that $a$ and $b$ are coprime, and $c$ and $d$ are coprime. Is there a non-negative integer $k$ such that both $ak+b$ and $ck+d$ are ...
Filip Nikšić's user avatar
9 votes
1 answer
843 views

Bounded gaps between primes in arithmetic progressions

Has Zhang's work on bounded gaps between primes been extended to the following theorem? For any arithmetic progression $an+b,\gcd(a,b)=1$, there is a constant $H$ (depending only on $a$) such that ...
Wojowu's user avatar
  • 28.2k
4 votes
1 answer
980 views

Smallest prime in an arithmetic progression

Let $\{a_n\}_{n\in\mathbb{N}}$ be defined as $a_n = a + bn$ for some $a, b >0,(a, b) = 1$. Are there good bounds on the minimal $k$ s.t. $a_k$ is prime. It is well known that there are infinitely ...
Mayank Pandey's user avatar
2 votes
0 answers
617 views

Arithmetic progression and average of two prime numbers

Let $A=(a_n : n \in \mathbb{N})$ be the sequence given by: $$ \ a_n = a_1 + (n - 1)d,\quad a_1,\ d,\ n \in \mathbb N,\quad d\gt a_1,\quad \gcd(a_1,\ d)=1. $$ For all terms of $A$ greater than $\ \...
Mike's user avatar
  • 359
14 votes
1 answer
1k views

Small primes in arithmetic sequences

Fix an integer $a>1$. For $n \geq 1$ an integer, let $\pi_{n,1}(an)$ the number of primes $p \leq an$ such that $p \equiv 1 \pmod{n}$, and $\pi(an)$ the number of all primes $p \leq an$. Let $$Q_a(...
Joël's user avatar
  • 26k
8 votes
1 answer
863 views

On the least prime in arithmetic progressions

My question concerns the least prime (denoted $p(a, q)$) in the arithmetic progression $a \pmod q$ where $a$ and $q$ are coprime. Quite a time ago Linnik demonstrated that $$p(a, q) \ll q^L$$ for some ...
kdr's user avatar
  • 463
11 votes
2 answers
3k views

least prime in a arithmetic progression

Hello Here I want to consider the simplest arithmetic progression $n\equiv 1\pmod{q}$ where $q$ is a prime. Is it true that we can find a prime $p\leq q^2$ in this arithmetic progression? This ...
M.B's user avatar
  • 2,508
4 votes
1 answer
3k views

Is there another proof for Dirichlet's theorem? [duplicate]

Possible Duplicate: Is a “non-analytic” proof of Dirichlet’s theorem on primes known or possible? Dirichlet's theorem on primes in arithmetic progression states that there are ...
Hashem sazegar's user avatar
62 votes
1 answer
14k views

Is the Green-Tao theorem true for primes within a given arithmetic progression?

Ben Green and Terrence Tao proved that there are arbitrary length arithmetic progressions among the primes. Now, consider an arithmetic progression with starting term $a$ and common difference $d$. ...
Akela's user avatar
  • 3,699
12 votes
3 answers
929 views

Mertens-like sum in arithmetic progressions

I find myself needing a good estimate for $\sum_{p\le x,\, p\equiv a\bmod q} 1/p$, perhaps something like $$ \sum_{p\le x,\, p\equiv a\bmod q} \frac1p = \frac{\log\log x}{\phi(q)} + b(q,a) + O\big(\...
Greg Martin's user avatar
  • 12.8k
69 votes
4 answers
14k views

Is a "non-analytic" proof of Dirichlet's theorem on primes known or possible?

It is well-known that one can prove certain special cases of Dirichlet's theorem by exhibiting an integer polynomial $p(x)$ with the properties that the prime divisors of $\{ p(n) | n \in \mathbb{Z} \}...
Qiaochu Yuan's user avatar
7 votes
2 answers
564 views

Smallest k-term AP of primes

Let $S(k)$ denote the smallest integer such that there exists a k-term arithmetic progression of primes among the integers $[1,S(k)]$. Green and Tao have an unpublished note that gives a very large ...
Mark Lewko's user avatar
16 votes
4 answers
2k views

Arithmetic progressions without small primes

The following question came up in the discussion at How small can a group with an n-dimensional irreducible complex representation be? : Is it known that there are infinitely many primes p for which ...
David E Speyer's user avatar