**45**

votes

**3**answers

7k 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} ...

**42**

votes

**1**answer

9k 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$. ...

**23**

votes

**1**answer

1k views

### Arithmetic Progressions of Squares

Fermat may or may not have known that there are 3-term arithmetic progressions of squares (like $1^2, 5^2, 7^2$, and that there are no 4-term APs. Murky history aside, Keith Conrad has two pleasant ...

**22**

votes

**5**answers

5k views

### Erdos Conjecture on arithmetic progressions

Introduction:
Let A be a subset of the naturals such that $\sum_{n\in A}\frac{1}{n}=\infty$. The Erdos Conjecture states that A must have arithmetic progressions of arbitrary length.
Question:
I ...

**19**

votes

**4**answers

2k views

### Arithmetic progressions inside polynomial sets

There are at most 3 perfect squares in arithmetic progression (Fermat, Euler). It was shown in [1] that if $n>2$ there are no three term arithmetic progression consisting of nth powers.
Take a ...

**17**

votes

**5**answers

2k views

### Finitely many arithmetic progressions

A few years ago, somebody told me a lovely problem. I suspect there may be more to it (which I would be interested in learning), and would very much like to find a reference, it makes me uncomfortable ...

**16**

votes

**1**answer

1k views

### Are all primes in a PAP-3?

Van der Corput [1] proved that there are infinitely many arithmetic progressions of primes of length 3 (PAP-3). (Green & Tao [2] famously extended this theorem to length $k$.)
But taking this in ...

**16**

votes

**1**answer

845 views

### Covering the primes by arithmetic progressions

Define the length of a set of arithmetic progressions
of natural numbers
$A=\lbrace A_1, A_2, \ldots \rbrace$
to be $\min_i | A_i |$: the length of the shortest sequence
among all the progressions.
...

**15**

votes

**4**answers

1k 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 ...

**15**

votes

**2**answers

1k views

### Roth's theorem and Behrend's lower bound

Roth's theorem on 3-term arithmetic progressions (3AP) is concerned with the value of $r_3(N)$, which is defined as the cardinality of the largest subset of the integers between 1 and N with no ...

**15**

votes

**3**answers

1k views

### What is the shortest route to Roth's theorem?

Roth first proved that any subset of the integers with positive density contains a three term arithmetic progression in 1953. Since then, many other proofs have emerged (I can think of eight off the ...

**14**

votes

**1**answer

629 views

### Goldbach-type theorems from dense models?

I'm not a number theorist, so apologies if this is trivial or obvious.
From what I understand of the results of Green-Tao-Ziegler on additive combinatorics in the primes, the main new technical tool ...

**13**

votes

**7**answers

2k views

### Special arithmetic progressions involving perfect squares

Prove that there are infinitely many positive integers $a$, $b$, $c$ that are consecutive terms of an arithmetic progression and also satisfy the condition that $ab+1$, $bc+1$, $ca+1$ are all perfect ...

**13**

votes

**1**answer

904 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
...

**12**

votes

**2**answers

1k views

### Arithmetic progressions in power sequences

In connection with this MO post (and without any applications / motivation whatsoever), here is an apparently difficult - but nice - problem.
For a non-zero real number $s$, consider the infinite ...

**12**

votes

**2**answers

628 views

### Arithmetic progressions modulo $p$ under the squaring map

I feel that the following problem should be known, but I'm not sure where to look for it.
Fix a real constant $\frac{1}{2} \ge \epsilon > 0$. For varying primes $p$, Let $A_p$ denote the set of ...

**12**

votes

**2**answers

611 views

### Mertens-like sum in arithmetic progressions

I find myself needing a good estiamate for $\sum_{p\le x,\, p\equiv a\mod q} 1/p$, perhaps something like
$$
\sum_{p\le x,\, p\equiv a\mod q} \frac1p = \frac{\log\log x}{\phi(q)} + b(q,a) + ...

**11**

votes

**2**answers

736 views

### Most dense subset of numbers that avoids arbitrarily long arithmetic progressions

The famous Green-Tao theorem says that there exist arbitrarily long sequences of primes in arithmetic progression.
I am wondering: How dense can a subset $S \subset \mathbb{N}$ be and still avoid
...

**11**

votes

**1**answer

2k views

### The Green-Tao theorem and positive binary quadratic forms

Some time ago I asked a question on consecutive numbers represented integrally by an integral positive binary quadratic form. It has occurred to me that, instead, the Green-Tao theorem may include a ...

**11**

votes

**3**answers

768 views

### What does the computer suggest about the parity of p(n), for n in a fixed arithmetic progression?

Let p(n) be the number of partitions of n. A famous theorem of Euler allows one to compute
the parity of p(n) quickly for quite large n. In:
On the distribution of parity in the partition function, ...

**10**

votes

**2**answers

768 views

### What are the analytic properties of Dirichlet Euler products restricted to arithmetic progressions?

There are (at least) two ways of writing down the Dirichlet L-function associated to a given character χ: as a Dirichlet series
$$\sum_{n=1}^\infty \frac{\chi(n)}{n^s}$$
or as an Euler product
...

**10**

votes

**2**answers

889 views

### What Dirichlet doesn't tell…

Let $n>1$ be an integer, and let us consider the set $P(n)$ of all prime numbers $p$ such that $p$ is not congruent to $1$ modulo $n$. Dirichlet's Density Theorem tells us that $P(n)$ has a natural ...

**10**

votes

**1**answer

605 views

### Covering the primes by 3-term APs ?

Hello, the Green-Tao theorem says infinitely many k-term Arithmetic Progressions exist for any integer k.
My question is: can we actually partition the primes into 3-term APs only (or is there a ...

**10**

votes

**0**answers

561 views

### What are the limits of the Erdős-Rankin method for covering intervals by arithmetic progressions?

To construct gaps between primes which are marginally larger than average, Erdős and Rankin covered an interval $[1,y]$ with arithmetic progressions with prime differences. A nice short exposition is ...

**9**

votes

**1**answer

551 views

### 4 squares almost in an arithmetic progression

Does there exist infinitely many coprime pairs of integers x,d such that x, x+d, x+2d, x+4d are all square numbers?
One example would be 49,169,289,529. This is the only example I have found so far ...

**9**

votes

**2**answers

434 views

### Largest number of k-arithmetic progressions without a (k+1)-arithmetic progression

Suppose $A \subseteq \{1,\dots,n\}$ does not contain any arithmetic progressions of length $k+1$. What is the largest number of $k$-term arithmetic progressions that $A$ can have? (one may also wish ...

**8**

votes

**4**answers

1k views

### Arbitrarily long arithmetic progressions

Are there arbitrarily long arithmetic progressions in which all the
prime factors of all the terms are at most $N$, for some $N$? Assume
all the terms are positive and the sequence of terms is ...

**8**

votes

**1**answer

1k views

### Are most primes in a prime arithmetic progression of length at least 3?

Following the following two previous questions on mathoverflow:
Are all primes in a PAP-3?
and
Covering the primes by 3-term APs ?
I have attempted to show that infinitely many primes are in an ...

**8**

votes

**2**answers

517 views

### Primes in quasi-arithmetic progressions?

Suppose $\alpha > 1$ is irrational. Are there infinitely many primes of the form $\left\lfloor \alpha n \right\rfloor$? Is the number of $p \leq X$ of this form $\sim \alpha^{-1} X ...

**8**

votes

**1**answer

851 views

### Squares in an Arithmetic Progession

Let $P(x;a,b) := \{an+b, 0\leq n \leq x \} $ denote an arithmetic progression. Further let $A(x;a,b)$ denote the number of elements of $P(x;a,b)$ that are squares. It's an old conjecture of Rudin ...

**8**

votes

**1**answer

252 views

### Primes in arithmetic progression with a moduli equal to a power of 2

I am currently looking for a result stronger than Siegel-Walfisz theorem, which gives an upper bound on the error term $|\pi(x,a,b)-\frac{\pi(x)}{\phi(a)}|$ for particular $a$.
The Siegel Walfisz is ...

**8**

votes

**1**answer

517 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 ...

**7**

votes

**1**answer

638 views

### Upper bound for number of k-term arithmetic progressions in the primes

Normal heuristics give that number of k-term arithmetic progressions in [1,N] should be about
\[c_k\frac{N^2}{\log^kN}\]
for some constant $c_k$ dependent on k. ...

**7**

votes

**2**answers

1k 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 ...

**7**

votes

**1**answer

355 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 ...

**7**

votes

**1**answer

627 views

### Homogeneous arithmetic progressions in difference sets

I have a nasty feeling that I ought to be able to answer this question, but I've got other things to think about right now and I'm interested in the answer just so that I can reply to a mathematical ...

**6**

votes

**2**answers

695 views

### Inverse Length 3 Arithmetic Progression Problem for sets with positive upper density

It is a famous theorem of Roth, which Szemerédi famously generalized, that if a set of natural numbers has positive upper density then it contains arithmetic progressions of length $k$. The famous ...

**6**

votes

**2**answers

545 views

### On the prime number theorem in arithmetic progression

The prime number theorem tells us that , if $\pi\left(x\right)$ denotes the number of primes less than or equal to $x$, we have $$\pi\left(x\right)\sim\frac{x}{\log x}.$$
In a similar manner ...

**6**

votes

**1**answer

736 views

### Primes in arithmetic progressions

Denote by $\pi(x,a,q)$ the number of primes $p\le x$ of the form $p=qk+a$
and $E(x,a,q)=\phi(q)^{-1}\mathrm{Li}(x)-\pi(x,a,q)$.
What is the strongest conjectured bound on $E(x,a,q)$ in terms of $x,q$?
...

**6**

votes

**1**answer

462 views

### Adding sets not containing arithmetic progressions of length three by forcing

Consider the following forcing notion: conditions in $\mathbb{P}$ are pairs $(s, N),$ where:
1) $s\in 2^{<\omega}$,
2) $N\in \mathbb{N}$,
3) (by identifying $s$ with a subset of $lh(s)$) $s$ ...

**6**

votes

**1**answer

523 views

### Minimum cardinality of a difference set in $R^n$

Cross-posted from http://math.stackexchange.com/questions/65195/minimum-cardinality-of-a-difference-set-in-mathbb-rn.
Given a finite set $S$ of $m$ points in $\mathbb R^n$ that do not all lie in the ...

**6**

votes

**1**answer

244 views

### Subsets of [1..N] with no three-term arithmetic progressions and no large gaps

Let S be a subset of [1..N] containing no three-term arithmetic progression, and let h(S) be the size of the largest gap between two consecutive elements of S. By Roth's theorem, h(S) has to grow ...

**6**

votes

**2**answers

674 views

### Sum of divisor function over arithmetic progression

I am trying to find an estimate for the following sum:
$$
\sum_{\substack{n \leq x \\ n \equiv k (m)}} d(n),
$$
where $d(n)$ is number of divisors of $n$. I found estimates for the case when $k$ and ...

**6**

votes

**1**answer

317 views

### Distribution of a function in an arithmetic progression

I am going to have to borrow the opening passage from Bombieri, Friedlander, Iwaniec${}^*$ since they state this idea so well. In the following $\|f\|$ means $\big(\sum_{n\leqslant x} ...

**6**

votes

**2**answers

438 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 ...

**6**

votes

**1**answer

353 views

### Bounds on the size of sets not containing a given finite pattern

Recall the following version of Szemerédi's Theorem: let $r_k(N)$ be the largest cardinality of a subset of $[N]:=\{1,\ldots, N\}$ which does not contain an arithmetic progression of length $k$. Then, ...

**6**

votes

**0**answers

328 views

### Large sets not containing arithmetic progressions of length 3 in intervals

Given a large enough natural number $N$, let $\Delta_N=\{A \subseteq [N, 2N]: A$ contains no arithmetic progressions of length $3 \},$ where for natural numbers $N<M$ we have $[N, M]=\{N, N+1, ..., ...

**5**

votes

**2**answers

554 views

### Asymptotic Distribution of Primes

Given an integer $n$ and let $1\leq m\leq n$ be such that $n$ and $m$ are coprimes define
$$
\mathcal{N_{n,m}}:=\text{the set of primes $p$ such that $p\equiv{m}\hspace{0.1cm}\mathrm{mod}(n)$}.
$$
...

**5**

votes

**3**answers

389 views

### Structure of nonaveraging sets of integers

A set of integers is said to be nonaveraging if it contains no three-term arithmetic progression. I call a nonaveraging subset of $\lbrace 1,2, \ldots ,n \rbrace$ optimal when it has maximal ...

**5**

votes

**2**answers

405 views

### k-pseudorandom measures

In reading the paper of Green and Tao on arithmetic progressions within the primes, I became very interested in the notion of a k-pseudorandom measure discussed in that paper.
A measure here is a ...