**6**

votes

**1**answer

362 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, ...

**0**

votes

**1**answer

464 views

### greatest common divisor of p-1 and q-1 [closed]

Hi there,
Can we say that if $p$ and $q$ are distinct prime number diving $n$
$\Omega(gcd(p-1,q-1)) \leq \Omega(n)$
Where $\Omega(n)$ denotes the number of prime powers dividing $n$
Best
rahmi

**4**

votes

**5**answers

1k views

### residue classes of primes, covering intervals and bounds on the different ways

Take the first $n$ primes $p_1,...,p_n$ and the primorial $P_n$ .Denote by $p_i$ every prime bigger than $p_n$ and smaller than $P_n$.
1) Is that true that there always be a number in any interval of ...

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

**4**

votes

**1**answer

262 views

### non-asymptotic Bertrand-type theorems for arithmetic progression

It is well known that primes of form $4k+3$, call them $3=q_1 < q_2 < \dots$ satisfy $q_{n+1}/q_n\rightarrow 1$ (and even $q_n=\frac{n}{2\log n}(1+o(1))$). I would be glad to see results of ...

**4**

votes

**1**answer

370 views

### How large can a non-sumset be?

The theory of sumsets $A+B$ where $A$ and $B$ are finite subsets of an additive group $Z$ is extensively studied in additive combinatorics: finding long arithmetic progressions inside them, finding ...

**12**

votes

**2**answers

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

**5**

votes

**3**answers

510 views

### Any rigorous way to claim that sums with repeat summands are few?

Let $B \subset \mathbb{Z}^+$. Define $r_{B,h}(n)$ to be the number of ways of writing $n$ as the sum of $h$ elements of $B$ and $R_{B,h}(n)$ the number of ways to write $n$ as the sum of $h$ DISTINCT ...

**1**

vote

**1**answer

806 views

### Covering Systems of infinite sets of residue classes mod primes

Take an infinite set of distinct primes and a (edit: or 2 , etc.) residue class for every prime. For exammple you can take all the primes bigger than some prime or the primes of a specific form (i.e. ...

**6**

votes

**1**answer

738 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$?

**1**

vote

**1**answer

321 views

### Do there exist sets of integers with arbitrarily large upper density which contains infinitely many elements that are not in an arithmetic progression of length 3?

Given that simply stipulating positive upper density is not sufficient to guarantee that all but finitely many members are in an arithmetic progression of length 3, that there indeed exists sets of ...

**6**

votes

**2**answers

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

**15**

votes

**3**answers

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

**16**

votes

**1**answer

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

**7**

votes

**1**answer

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

**11**

votes

**3**answers

771 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, ...

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

**3**

votes

**1**answer

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

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

**10**

votes

**2**answers

772 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
$$\...

**8**

votes

**2**answers

525 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 (\log{X})^{-1}$...

**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$. ...

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

**12**

votes

**2**answers

628 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) + O\big(\exp(...

**3**

votes

**1**answer

769 views

### Can every finite graph be represented by an arithmetic sequence of natural numbers?

(This is a follow-up to my previous questions Natural models of graphs?.)
Erdös in The Representation of a Graph by Set Intersections (1966) states:
Theorem. Let $G$ be an arbitrary
graph. Then ...

**3**

votes

**1**answer

1k views

### Strengthening of Dirichlet's theorem on arithmetic progressions

Hello all, Dirichlet's famous theorem asserts that any arithmetic progression
$\lbrace ax+b | x \in {\mathbb N}\rbrace$ contains infinitely many primes if a
and b are relatively prime.
I am ...

**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} \}...

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

**14**

votes

**1**answer

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

**7**

votes

**1**answer

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

**6**

votes

**2**answers

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

**5**

votes

**2**answers

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

**3**

votes

**2**answers

497 views

### “half arithmetic progressions” in dense sets

Fix a positive real number d>0. Szemeredi's theorem implies that for every integer k, there exists an integer N(k,d) such that if A is a subset of the interval [1,N] with density greater than d >0, ...

**10**

votes

**1**answer

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

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