**9**

votes

**1**answer

284 views

### Largeness and arithmetic progression properties of generic reals

Consider the following properties for a subset $A$ of $\mathbb{N}$:
(1) $A$ is large: $\sum_{n \in A}$$ 1\over n$$=\infty,$
(2) $A^\infty=\limsup \frac{|A \cap \{ 1, \dots, n\}|}{n} >0$,
(3) ...

**4**

votes

**0**answers

226 views

### The original proof of Szemerédi's Theorem

Nowadays there are plenty of different proofs of the celebrated Szemerédi's Theorem but for historical reasons I would like to read and understand the original proof. The proof is very tricky and, for ...

**0**

votes

**0**answers

42 views

### Arithmetic progressions on a graph

Given $K_k$ a complete graph what is the minimum $n\in\Bbb N$ needed so that there is a map:
$$f:\{0,1,\dots,n\}\rightarrow\mathsf{Edges}(K_k)$$ which makes every simple cycle to be $r$-term ...

**1**

vote

**0**answers

79 views

### Consecutive integers divisible by consecutive small numbers

Given $n$, what is the largest set of consecutive integers in $[n,2n]$ can we have so that each integer is divisible by a distinct element from $[\log n,2\log n]$ (no partiular order)? So apriori I am ...

**8**

votes

**1**answer

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

**6**

votes

**1**answer

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

**0**

votes

**0**answers

45 views

### What is the maximum possible size of a $k$-average free subset of $[1, \dots, n]$?

Say that a subset $S \subset [1, \dots, n]$ is $k$-average free if, for all multi-subsets $A$ of $S$ with $|A| \le k$, the arithmetic mean of $A$ is not in $A$ (except for the trivial case when all ...

**1**

vote

**1**answer

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

**7**

votes

**1**answer

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

**0**

votes

**0**answers

151 views

### arithmetic progressions with few primes

Is this true ?
Let $\beta_0$ be a positive number. One may find $\beta>\beta_0$, $0<\lambda<1$, and infinitely many $q>1$ so that there exists an arithmetic progression of step $q$, $a_1, ...

**2**

votes

**1**answer

243 views

### Siegel-Walfisz for the Möbius function

I am working through the proof of the Bombieri-Vinogradov theorem in Analytic Number Theory (Iwaniec, Kowalski). My problem is that on page 424, it is said that $\mu(m)$ satisfies $D_f(x;q,a)\ll ...

**6**

votes

**1**answer

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

**11**

votes

**2**answers

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

**6**

votes

**0**answers

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

**4**

votes

**1**answer

218 views

### Thin sets that are well-distributed over arithmetic progressions?

The primes do a nice job of intersecting an arithmetic progression $\{a+dn\}_{n=0}^\infty$ when $a$ and $d$ are coprime (see Dirichlet's theorem).
I would like a set of integers $S$ such that
the ...

**0**

votes

**1**answer

333 views

### Covering a finite subset of $\mathbb{N}$ with prime arithmetic progressions

Because of a problem I ran into I am trying to get a quick start in covering with arithmetic progressions.
First I want to say I am aware of this previously asked question:
Covering $\mathbb{N}$ with ...

**3**

votes

**1**answer

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

**0**

votes

**0**answers

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

**3**

votes

**2**answers

456 views

### Primes from a Dirichlet sequence and an irrational number

From Dirichlet's theorem on arithmetic progressions, if $\text{gcd}(a,b)=1$ we know $\{ak+b\}_{k\ge 0}$ contains infinitely many primes. Let those primes be $p_1,p_2,\cdots$. Then the real
...

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

**0**

votes

**0**answers

116 views

### Arithmetic progression and 3^m,3^{m+1} intervals

I'm trying to prove (or disprove) the following "conjecture".Given the following set of powers of two:
$$A = \{ x \mid x = 2^n \text{ and } 2^{n-1} < 3^m < x < 3^{m+1} < 2^{n+1}\}$$
...

**0**

votes

**1**answer

132 views

### Arithmetic progression and most significant digits in different bases

Given a number $x \geq 3$, let $b(x) \in \{0,1\}$ be the second most significant digit (bit) of its binary representation, and $t(x)\in \{1,2\}$ the most significant digit of its ternary ...

**9**

votes

**1**answer

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

**6**

votes

**2**answers

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

**0**

votes

**0**answers

210 views

### Conjecture about distribution of primes in arithmetic progression

For my work, i need the following
Conjecture: Let $N$ large number such that exist a prime number $q$ and $A>\frac{1}{2}$ such that $N^{1/2}<N^{A}\leq q-1<N.$ Then $\forall a\in\left[1,\, ...

**6**

votes

**2**answers

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

**0**

votes

**0**answers

293 views

### Greedy sequences without k-term arithmetic progressions

If $S_k$ is the greedy sequence with no length-k arithmetic subsequence, (ie $S_3$ = A003278 , $S_4$ = A005837 , $S_5$ = A020655 ), is it guaranteed that any other sequence $a$ with no length-k ...

**3**

votes

**1**answer

164 views

### Non-asymptotically densest progression-free sets

For the context of this question, a progression-free set is a subset of integers that does not contain length-three arithmetic progressions.
For large $N$, it is known that $[N] = \{1, \ldots, N\}$ ...

**0**

votes

**1**answer

758 views

### Intersection of two arithmetic progressions

Using elementary matrix row and column operations on the system of two diophantine equations, namely, $N=an+b$ and $N=cn+d$, where $n\in\mathbb{N}^0$, it can be shown that the intersection of these ...

**9**

votes

**2**answers

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

**13**

votes

**1**answer

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

**0**

votes

**2**answers

313 views

### sequences - recurrence relation [closed]

I have to find the expression of $(y_n)$ defined by :
$$y_{n+1}=a y_n+b z_n+c$$
where $(z_n)$ is an arithmetico-geometric sequence :
$$z_{n+1}=d z_n+e$$
and $a,b,c,d,e$ real numbers.
Thank you ...

**10**

votes

**0**answers

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

**8**

votes

**1**answer

869 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

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

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

**8**

votes

**2**answers

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

**2**

votes

**2**answers

845 views

### Sum of Series Where Exponent is Sum of Arithmetic Progression

Hi,
How do i get the sum of such a sequence:
$1 + x^{-1} + x^{-3} + x^{-6} + ...$
where the exponents are actually sum of arithmetic progression. i.e.
$x^{-0} + x^{-(0 + 1)} + x^{-(0 + 1 + 2)} + ...

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

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

**6**

votes

**1**answer

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

**10**

votes

**2**answers

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

**2**

votes

**3**answers

632 views

### Arithmetic progressions of length 3 in subset of Z_n of size n^d

Let $A\subset\mathbb{Z}/n\mathbb{Z}$ such that: $|A|>n^{d}$ ($0< d <1$).
Let $C=\{(x,y,2y-x)\in A\times A \times A\}$ be the set of $3$-term arithmetic progressions within $A$.
[The ...

**16**

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

**5**

votes

**2**answers

559 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

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

**6**

votes

**1**answer

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

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

**2**

votes

**0**answers

967 views

### Fun question in additive combinatorics

It is easy to see that for a finite set of integers $A$ of cardinality $n$, the cardinality of the sumset $A+A$ satisfies
$$
2n-1\leq |A+A|\leq \frac{n(n+1)}{2}.
$$
The lower bound is essentially ...

**6**

votes

**1**answer

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