Unsolved Problems

Showing 601-650 of 1146 problems (Page 13 of 23)

EP-158
Open

Erdős Problem #158

Let $A\subset \mathbb{N}$ be an infinite set such that, for any $n$, there are most $2$ solutions to $a+b=n$ with $a\leq b$. Must $ \liminf_{N\to\inft...

L1
Combinatorics
0
0
EP-159
Open

Erdős Problem #159

There exists some constant $c>0$ such that $$R(C_4,K_n) \ll n^{2-c}.$$...

L1
Graph Theory
0
0
EP-160
Open

Erdős Problem #160

Let $h(N)$ be the smallest $k$ such that $\{1,\ldots,N\}$ can be coloured with $k$ colours so that every four-term arithmetic progression must contain...

L1
Combinatorics
0
0
EP-161
Open

Erdős Problem #161

Let $\alpha\in[0,1/2)$ and $n,t\geq 1$. Let $F^{(t)}(n,\alpha)$ be the smallest $m$ such that we can $2$-colour the edges of the complete $t$-uniform ...

L1
Graph Theory
0
0
EP-162
Open

Erdős Problem #162

Let $\alpha>0$ and $n\geq 1$. Let $F(n,\alpha)$ be the largest $k$ such that there exists some 2-colouring of the edges of $K_n$ in which any induced ...

L1
Graph Theory
0
0
EP-165
Open

Erdős Problem #165

Give an asymptotic formula for $R(3,k)$....

L1
Graph Theory
0
0
EP-168
Open

Erdős Problem #168

Let $F(N)$ be the size of the largest subset of $\{1,\ldots,N\}$ which does not contain any set of the form $\{n,2n,3n\}$. What is $ \lim_{N\to \inft...

L1
Combinatorics
0
0
EP-169
Open

Erdős Problem #169

Let $k\geq 3$ and $f(k)$ be the supremum of $\sum_{n\in A}\frac{1}{n}$ as $A$ ranges over all sets of positive integers which do not contain a $k$-ter...

L1
Number Theory
0
0
EP-170
Open

Erdős Problem #170

Let $F(N)$ be the smallest possible size of $A\subset \{0,1,\ldots,N\}$ such that $\{0,1,\ldots,N\}\subset A-A$. Find the value of $ \lim_{N\to \infty...

L1
Combinatorics
0
0
EP-172
Open

Erdős Problem #172

Is it true that in any finite colouring of $\mathbb{N}$ there exist arbitrarily large finite $A$ such that all sums and products of distinct elements ...

L1
Number Theory
0
0
EP-173
Open

Erdős Problem #173

In any $2$-colouring of $\mathbb{R}^2$, for all but at most one triangle $T$, there is a monochromatic congruent copy of $T$....

L1
Graph Theory
0
0
EP-174
Open

Erdős Problem #174

A finite set $A\subset \mathbb{R}^n$ is called Ramsey if, for any $k\geq 1$, there exists some $d=d(A,k)$ such that in any $k$-colouring of $\mathbb{R...

L1
Number Theory
0
0
EP-176
Open

Erdős Problem #176

Let $N(k,\ell)$ be the minimal $N$ such that for any $f:\{1,\ldots,N\}\to\{-1,1\}$ there must exist a $k$-term arithmetic progression $P$ such that $ ...

L1
Combinatorics
0
0
EP-177
Open

Erdős Problem #177

Find the smallest $h(d)$ such that the following holds. There exists a function $f:\mathbb{N}\to\{-1,1\}$ such that, for every $d\geq 1$, $ \max_{P_d}...

L1
Number Theory
0
0
EP-180
Open

Erdős Problem #180

If $\mathcal{F}$ is a finite set of finite graphs then $\mathrm{ex}(n;\mathcal{F})$ is the maximum number of edges a graph on $n$ vertices can have wi...

L1
Graph Theory
0
0
EP-181
Open

Erdős Problem #181

Let $Q_n$ be the $n$-dimensional hypercube graph (so that $Q_n$ has $2^n$ vertices and $n2^{n-1}$ edges). Prove that $ R(Q_n) \ll 2^n. $ ...

L1
Graph Theory
0
0
EP-183
Open

Erdős Problem #183

Let $R(3;k)$ be the minimal $n$ such that if the edges of $K_n$ are coloured with $k$ colours then there must exist a monochromatic triangle. Determin...

L1
Number Theory
0
0
EP-184
Open

Erdős Problem #184

Any graph on $n$ vertices can be decomposed into $O(n)$ many edge-disjoint cycles and edges....

L1
Graph Theory
0
0
EP-187
Open

Erdős Problem #187

Find the best function $f(d)$ such that, in any 2-colouring of the integers, at least one colour class contains an arithmetic progression with common ...

L1
Number Theory
0
0
EP-188
Open

Erdős Problem #188

What is the smallest $k$ such that $\mathbb{R}^2$ can be red/blue coloured with no pair of red points unit distance apart, and no $k$-term arithmetic ...

L1
Number Theory
0
0
EP-190
Open

Erdős Problem #190

Let $H(k)$ be the smallest $N$ such that in any finite colouring of $\{1,\ldots,N\}$ (into any number of colours) there is always either a monochromat...

L1
Graph Theory
0
0
EP-193
Open

Erdős Problem #193

Let $S\subseteq \mathbb{Z}^3$ be a finite set and let $A=\{a_1,a_2,\ldots,\}\subset \mathbb{Z}^3$ be an infinite $S$-walk, so that $a_{i+1}-a_i\in S$ ...

L1
Combinatorics
0
0
EP-195
Open

Erdős Problem #195

What is the largest $k$ such that in any permutation of $\mathbb{Z}$ there must exist a monotone $k$-term arithmetic progression $x_1<\cdots<x_k$?...

L1
Number Theory
0
0
EP-196
Open

Erdős Problem #196

Must every permutation of $\mathbb{N}$ contain a monotone 4-term arithmetic progression? In other words, given a permutation $x$ of $\mathbb{N}$ must ...

L1
Combinatorics
0
0
EP-197
Open

Erdős Problem #197

Can $\mathbb{N}$ be partitioned into two sets, each of which can be permuted to avoid monotone 3-term arithmetic progressions?...

L1
Number Theory
0
0
EP-200
Open

Erdős Problem #200

Does the longest arithmetic progression of primes in $\{1,\ldots,N\}$ have length $o(\log N)$?...

L1
Number Theory
0
0
EP-201
Open

Erdős Problem #201

Let $G_k(N)$ be such that any set of $N$ integers contains a subset of size at least $G_k(N)$ which does not contain a $k$-term arithmetic progression...

L1
Number Theory
0
0
EP-202
Open

Erdős Problem #202

Let $n_1<\cdots < n_r\leq N$ with associated $a_i\pmod{n_i}$ such that the congruence classes are disjoint (that is, every integer is $\equiv a_i\pmod...

L1
Number Theory
0
0
EP-203
Open

Erdős Problem #203

Is there an integer $m\geq 1$ with $(m,6)=1$ such that none of $2^k3^\ell m+1$ are prime, for any $k,\ell\geq 0$?...

L1
Number Theory
0
0
EP-208
Open

Erdős Problem #208

Let $s_1<s_2<\cdots$ be the sequence of squarefree numbers. Is it true that, for any $\epsilon>0$ and large $n$, $ s_{n+1}-s_n \ll_\epsilon s_n^{\epsi...

L1
Combinatorics
0
0
EP-212
Open

Erdős Problem #212

Is there a dense subset of $\mathbb{R}^2$ such that all pairwise distances are rational?...

L1
Combinatorics
0
0
EP-213
Open

Erdős Problem #213

Let $n\geq 4$. Are there $n$ points in $\mathbb{R}^2$, no three on a line and no four on a circle, such that all pairwise distances are integers?...

L1
Number Theory
0
0
EP-217
Open

Erdős Problem #217

For which $n$ are there $n$ points in $\mathbb{R}^2$, no three on a line and no four on a circle, which determine $n-1$ distinct distances and so that...

L1
Combinatorics
0
0
EP-218
Open

Erdős Problem #218

Let $d_n=p_{n+1}-p_n$. The set of $n$ such that $d_{n+1}\geq d_n$ has density $1/2$, and similarly for $d_{n+1}\leq d_n$. Furthermore, there are infin...

L1
Number Theory
0
0
EP-222
Open

Erdős Problem #222

Let $n_1<n_2<\cdots$ be the sequence of integers which are the sum of two squares. Explore the behaviour of (i.e. find good upper and lower bounds for...

L1
Number Theory
0
0
EP-233
Open

Erdős Problem #233

Let $d_n=p_{n+1}-p_n$, where $p_n$ is the $n$th prime. Prove that $ \sum_{1\leq n\leq N}d_n^2 \ll N(\log N)^2. $ ...

L1
Number Theory
0
0
EP-234
Open

Erdős Problem #234

For every $c\geq 0$ the density $f(c)$ of integers for which $ \frac{p_{n+1}-p_n}{\log n}< c $ exists and is a continuous function of $c$. ", "dif...

L1
Number Theory
0
0
EP-236
Open

Erdős Problem #236

Let $f(n)$ count the number of solutions to $n=p+2^k$ for prime $p$ and $k\geq 0$. Is it true that $f(n)=o(\log n)$?...

L1
Number Theory
0
0
EP-238
Open

Erdős Problem #238

Let $c_1,c_2>0$. Is it true that, for any sufficiently large $x$, there exist more than $c_1\log x$ many consecutive primes $\leq x$ such that the dif...

L1
Number Theory
0
0
EP-241
Open

Erdős Problem #241

Let $f(N)$ be the maximum size of $A\subseteq \{1,\ldots,N\}$ such that the sums $a+b+c$ with $a,b,c\in A$ are all distinct (aside from the trivial co...

L1
Combinatorics
0
0
EP-243
Open

Erdős Problem #243

Let $1\leq a_1<a_2<\cdots$ be a sequence of integers such that $ \lim_{n\to \infty}\frac{a_n}{a_{n-1}^2}=1 $ and $\sum\frac{1}{a_n}\in \mathbb{Q}$. Th...

L1
Number Theory
0
0
EP-244
Open

Erdős Problem #244

Let $C>1$. Does the set of integers of the form $p+\lfloor C^k\rfloor$, for some prime $p$ and $k\geq 0$, have density $>0$?...

L1
Number Theory
0
0
EP-247
Open

Erdős Problem #247

Let $1\leq a_1<a_2<\cdots$ be a sequence of integers such that $ \limsup \frac{a_n}{n}=\infty. $ Is $ \sum_{n=1}^\infty \frac{1}{2^{a_n}} $ transcende...

L1
Number Theory
0
0
EP-249
Open

Erdős Problem #249

Is $ \sum_n \frac{\phi(n)}{2^n} $ irrational? Here $\phi$ is the Euler totient function....

L1
Number Theory
0
0
EP-251
Open

Erdős Problem #251

Is $ \sum \frac{p_n}{2^n} $ irrational? (Here $p_n$ is the $n$th prime.)...

L1
Number Theory
0
0
EP-252
Open

Erdős Problem #252

Let $k\geq 1$ and $\sigma_k(n)=\sum_{d\mid n}d^k$. Is $ \sum \frac{\sigma_k(n)}{n!} $ irrational?...

L1
Number Theory
0
0
EP-254
Open

Erdős Problem #254

Let $A\subseteq \mathbb{N}$ be such that $ \lvert A\cap [1,2x]\rvert -\lvert A\cap [1,x]\rvert \to \infty\textrm{ as }x\to \infty $ and $ \sum_{n\in A...

L1
Number Theory
0
0
EP-256
Open

Erdős Problem #256

Let $n\geq 1$ and $f(n)$ be maximal such that for any integers $1\leq a_1\leq \cdots \leq a_n$ we have $ \max_{\lvert z\rvert=1}\left\lvert \prod_{i}(...

L1
Number Theory
0
0
EP-257
Open

Erdős Problem #257

Let $A\subseteq \mathbb{N}$ be an infinite set. Is $ \sum_{n\in A}\frac{1}{2^n-1} $ irrational?...

L1
Number Theory
0
0
EP-258
Open

Erdős Problem #258

Let $a_1,a_2,\ldots$ be a sequence of positive integers with $a_n\to \infty$. Is $ \sum_{n} \frac{\tau(n)}{a_1\cdots a_n} $ irrational, where $\tau(n)...

L1
Number Theory
0
0