Unsolved Problems

Showing 101-150 of 195 problems (Page 3 of 4)

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-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-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-260
Open

Erdős Problem #260

Let $a_1<a_2<\cdots$ be an increasing sequence such that $a_n/n\to \infty$. Is the sum $ \sum_n \frac{a_n}{2^{a_n}} $ irrational?...

L1
Combinatorics
0
0
EP-288
Open

Erdős Problem #288

Is it true that there are only finitely many pairs of intervals $I_1,I_2$ such that $ \sum_{n_1\in I_1}\frac{1}{n_1}+\sum_{n_2\in I_2}\frac{1}{n_2}\in...

L1
Combinatorics
0
0
EP-295
Open

Erdős Problem #295

Let $N\geq 1$ and let $k(N)$ denote the smallest $k$ such that there exist $N\leq n_1<\cdots <n_k$ with $ 1=\frac{1}{n_1}+\cdots+\frac{1}{n_k}. $ Is i...

L1
Combinatorics
0
0
EP-317
Open

Erdős Problem #317

Is there some constant $c>0$ such that for every $n\geq 1$ there exists some $\delta_k\in \{-1,0,1\}$ for $1\leq k\leq n$ with $ 0< \left\lvert \sum_{...

L1
Combinatorics
0
0
EP-320
Open

Erdős Problem #320

Let $S(N)$ count the number of distinct sums of the form $\sum_{n\in A}\frac{1}{n}$ for $A\subseteq \{1,\ldots,N\}$. Estimate $S(N)$....

L1
Combinatorics
0
0
EP-321
Open

Erdős Problem #321

What is the size of the largest $A\subseteq \{1,\ldots,N\}$ such that all sums $\sum_{n\in S}\frac{1}{n}$ are distinct for $S\subseteq A$?...

L1
Combinatorics
0
0
EP-326
Open

Erdős Problem #326

Let $A\subset \mathbb{N}$ be an additive basis of order $2$. Must there exist $B=\{b_1<b_2<\cdots\}\subseteq A$ which is also a basis such that $ \lim...

L1
Combinatorics
0
0
EP-327
Open

Erdős Problem #327

Suppose $A\subseteq \{1,\ldots,N\}$ is such that if $a,b\in A$ and $a eq b$ then $a+b mid ab$. Can $A$ be 'substantially more' than the odd numbers? W...

L1
Combinatorics
0
0
EP-335
Open

Erdős Problem #335

Let $d(A)$ denote the density of $A\subseteq \mathbb{N}$. Characterise those $A,B\subseteq \mathbb{N}$ with positive density such that $ d(A+B)=d(A)+d...

L1
Combinatorics
0
0
EP-388
Open

Erdős Problem #388

Can one classify all solutions of $ \prod_{1\leq i\leq k_1}(m_1+i)=\prod_{1\leq j\leq k_2}(m_2+j) $ where $k_1,k_2>3$ and $m_1+k_1\leq m_2$? Are there...

L1
Combinatorics
0
0
EP-389
Open

Erdős Problem #389

Is it true that for every $n\geq 1$ there is a $k$ such that $ n(n+1)\cdots(n+k-1)\mid (n+k)\cdots (n+2k-1)? $ ...

L1
Combinatorics
0
0
EP-390
Open

Erdős Problem #390

Let $f(n)$ be the minimal $m$ such that $ n! = a_1\cdots a_k $ with $n< a_1<\cdots <a_k=m$. Is there (and what is it) a constant $c$ such that $ f(n)-...

L1
Combinatorics
0
0
EP-417
Open

Erdős Problem #417

Let $ V'(x)=\#\{\phi(m) : 1\leq m\leq x\} $ and $ V(x)=\#\{\phi(m) \leq x : 1\leq m\}. $ Does $\lim V(x)/V'(x)$ exist? Is it $>1$?...

L1
Combinatorics
0
0
EP-421
Open

Erdős Problem #421

Is there a sequence $1\leq d_1<d_2<\cdots$ with density $1$ such that all products $\prod_{u\leq i\leq v}d_i$ are distinct?...

L1
Combinatorics
0
0
EP-479
Open

Erdős Problem #479

Is it true that, for all $k eq 1$, there are infinitely many $n$ such that $2^n\equiv k\pmod{n}$?...

L1
Combinatorics
0
0
EP-501
Open

Erdős Problem #501

For every $x\in\mathbb{R}$ let $A_x\subset \mathbb{R}$ be a bounded set with outer measure $<1$. Must there exist an infinite independent set, that is...

L1
Combinatorics
0
0
EP-503
Open

Erdős Problem #503

What is the size of the largest $A\subseteq \mathbb{R}^d$ such that every three points from $A$ determine an isosceles triangle? That is, for any thre...

L1
Combinatorics
0
0
EP-509
Open

Erdős Problem #509

Let $f(z)\in\mathbb{C}[z]$ be a monic non-constant polynomial. Can the set $ \{ z\in \mathbb{C} : \lvert f(z)\rvert \leq 1\} $ be covered by a set of ...

L1
Combinatorics
0
0
EP-510
Open

Erdős Problem #510

If $A\subset \mathbb{Z}$ is a finite set of size $N$ then is there some absolute constant $c>0$ and $\theta$ such that $ \sum_{n\in A}\cos(n\theta) < ...

L1
Combinatorics
0
0
EP-513
Open

Erdős Problem #513

Let $f=\sum_{n=0}^\infty a_nz^n$ be a transcendental entire function. What is the greatest possible value of $ \liminf_{r\to \infty} \frac{\max_n\lver...

L1
Combinatorics
0
0
EP-517
Open

Erdős Problem #517

Let $f(z)=\sum_{k=1}^\infty a_kz^{n_k}$ be an entire function (with $a_k eq 0$ for all $k\geq 1$). Is it true that if $n_k/k\to \infty$ then $f(z)$ as...

L1
Combinatorics
0
0
EP-524
Open

Erdős Problem #524

For any $t\in (0,1)$ let $t=\sum_{k=1}^\infty \epsilon_k(t)2^{-k}$ (where $\epsilon_k(t)\in \{0,1\}$). What is the correct order of magnitude (for alm...

L1
Combinatorics
0
0
EP-528
Open

Erdős Problem #528

Let $f(n,k)$ count the number of self-avoiding walks of $n$ steps (beginning at the origin) in $\mathbb{Z}^k$ (i.e. those walks which do not intersect...

L1
Combinatorics
0
0
EP-536
Open

Erdős Problem #536

Let $\epsilon>0$ and $N$ be sufficiently large. Is it true that if $A\subseteq \{1,\ldots,N\}$ has size at least $\epsilon N$ then there must be disti...

L1
Combinatorics
0
0
EP-539
Open

Erdős Problem #539

Let $h(n)$ be such that, for any set $A\subseteq \mathbb{N}$ of size $n$, the set $ \left\{ \frac{a}{(a,b)}: a,b\in A\right\} $ has size at least $h(n...

L1
Combinatorics
0
0
EP-543
Open

Erdős Problem #543

Define $f(N)$ be the minimal $k$ such that the following holds: if $G$ is an abelian group of size $N$ and $A\subseteq G$ is a random set of size $k$ ...

L1
Combinatorics
0
0
EP-588
Open

Erdős Problem #588

Let $f_k(n)$ be minimal such that if $n$ points in $\mathbb{R}^2$ have no $k+1$ points on a line then there must be at most $f_k(n)$ many lines contai...

L1
Combinatorics
0
0
EP-598
Open

Erdős Problem #598

Let $m$ be an infinite cardinal and $\kappa$ be the successor cardinal of $2^{\aleph_0}$. Can one colour the countable subsets of $m$ using $\kappa$ m...

L1
Combinatorics
0
0
EP-623
Open

Erdős Problem #623

Let $X$ be a set of cardinality $\aleph_\omega$ and $f$ be a function from the finite subsets of $X$ to $X$ such that $f(A) ot\in A$ for all $A$. Must...

L1
Combinatorics
0
0
EP-624
Open

Erdős Problem #624

Let $X$ be a finite set of size $n$ and $H(n)$ be such that there is a function $f:\{A : A\subseteq X\}\to X$ so that for every $Y\subseteq X$ with $\...

L1
Combinatorics
0
0
EP-635
Open

Erdős Problem #635

Let $t\geq 1$ and $A\subseteq \{1,\ldots,N\}$ be such that whenever $a,b\in A$ with $b-a\geq t$ we have $b-a mid b$. How large can $\lvert A\rvert$ be...

L1
Combinatorics
0
0
EP-654
Open

Erdős Problem #654

Let $x_1,\ldots,x_n\in \mathbb{R}^2$ with no four points on a circle. Must there exist some $x_i$ with at least $(1-o(1))n$ distinct distances to othe...

L1
Combinatorics
0
0
EP-657
Open

Erdős Problem #657

Is it true that if $A\subset \mathbb{R}^2$ is a set of $n$ points such that every subset of $3$ points determines $3$ distinct distances (i.e. $A$ has...

L1
Combinatorics
0
0
EP-670
Open

Erdős Problem #670

Let $A\subseteq \mathbb{R}^d$ be a set of $n$ points such that all pairwise distances differ by at least $1$. Is the diameter of $A$ at least $(1+o(1)...

L1
Combinatorics
0
0
EP-725
Open

Erdős Problem #725

Give an asymptotic formula for the number of $k\times n$ Latin rectangles....

L1
Combinatorics
0
0
EP-734
Open

Erdős Problem #734

Find, for all large $n$, a non-trivial pairwise balanced block design $A_1,\ldots,A_m\subseteq \{1,\ldots,n\}$ such that, for all $t$, there are $O(n^...

L1
Combinatorics
0
0
EP-741
Open

Erdős Problem #741

Let $A\subseteq \mathbb{N}$ be such that $A+A$ has positive density. Can one always decompose $A=A_1\sqcup A_2$ such that $A_1+A_1$ and $A_2+A_2$ both...

L1
Combinatorics
0
0
EP-749
Open

Erdős Problem #749

Let $\epsilon>0$. Does there exist $A\subseteq \mathbb{N}$ such that the lower density of $A+A$ is at least $1-\epsilon$ and yet $1_A\ast 1_A(n) \ll_\...

L1
Combinatorics
0
0
EP-776
Open

Erdős Problem #776

Let $r\geq 2$ and $A_1,\ldots,A_m\subseteq \{1,\ldots,n\}$ be such that $A_i ot\subseteq A_j$ for all $i eq j$ and for any $t$ if there exists some $i...

L1
Combinatorics
0
0
EP-782
Open

Erdős Problem #782

Do the squares contain arbitrarily long quasi-progressions? That is, does there exist some constant $C>0$ such that, for any $k$, the squares contain ...

L1
Combinatorics
0
0
EP-787
Open

Erdős Problem #787

Let $g(n)$ be maximal such that given any set $A\subset \mathbb{R}$ with $\lvert A\rvert=n$ there exists some $B\subseteq A$ of size $\lvert B\rvert\g...

L1
Combinatorics
0
0
EP-788
Open

Erdős Problem #788

Let $f(n)$ be maximal such that if $B\subset (2n,4n)\cap \mathbb{N}$ there exists some $C\subset (n,2n)\cap \mathbb{N}$ such that $c_1+c_2 ot\in B$ fo...

L1
Combinatorics
0
0
EP-789
Open

Erdős Problem #789

Let $h(n)$ be maximal such that if $A\subseteq \mathbb{Z}$ with $\lvert A\rvert=n$ then there is $B\subseteq A$ with $\lvert B\rvert \geq h(n)$ such t...

L1
Combinatorics
0
0
EP-790
Open

Erdős Problem #790

Let $l(n)$ be maximal such that if $A\subset\mathbb{Z}$ with $\lvert A\rvert=n$ then there exists a sum-free $B\subseteq A$ with $\lvert B\rvert \geq ...

L1
Combinatorics
0
0
EP-791
Open

Erdős Problem #791

Let $g(n)$ be minimal such that there exists $A\subseteq \{0,\ldots,n\}$ of size $g(n)$ with $\{0,\ldots,n\}\subseteq A+A$. Estimate $g(n)$. In partic...

L1
Combinatorics
0
0
EP-812
Open

Erdős Problem #812

Is it true that $ \frac{R(n+1)}{R(n)}\geq 1+c $ for some constant $c>0$, for all large $n$? Is it true that $ R(n+1)-R(n) \gg n^2? $ ...

L1
Combinatorics
0
0
EP-817
Open

Erdős Problem #817

Let $k\geq 3$ and define $g_k(n)$ to be the minimal $N$ such that $\{1,\ldots,N\}$ contains some $A$ of size $\lvert A\rvert=n$ such that $ \langle A\...

L1
Combinatorics
0
0