Unsolved Problems

Showing 51-100 of 124 problems (Page 2 of 3)

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
EP-819
Open

Erdős Problem #819

Let $f(N)$ be maximal such that there exists $A\subseteq \{1,\ldots,N\}$ with $\lvert A\rvert=\lfloor N^{1/2}\rfloor$ such that $\lvert (A+A)\cap [1,N...

L1
Combinatorics
0
0
EP-826
Open

Erdős Problem #826

Are there infinitely many $n$ such that, for all $k\geq 1$, $ \tau(n+k)\ll k? $ ...

L1
Combinatorics
0
0
EP-827
Open

Erdős Problem #827

Let $n_k$ be minimal such that if $n_k$ points in $\mathbb{R}^2$ are in general position then there exists a subset of $k$ points such that all $\bino...

L1
Combinatorics
0
0
EP-829
Open

Erdős Problem #829

Let $A\subset\mathbb{N}$ be the set of cubes. Is it true that $ 1_A\ast 1_A(n) \ll (\log n)^{O(1)}? $ ...

L1
Combinatorics
0
0
EP-830
Open

Erdős Problem #830

We say that $a,b\in \mathbb{N}$ are an amicable pair if $\sigma(a)=\sigma(b)=a+b$. Are there infinitely many amicable pairs? If $A(x)$ counts the numb...

L1
Combinatorics
0
0
EP-838
Open

Erdős Problem #838

Let $f(n)$ be maximal such that any $n$ points in $\mathbb{R}^2$, with no three on a line, determine at least $f(n)$ different convex subsets. Estimat...

L1
Combinatorics
0
0
EP-846
Open

Erdős Problem #846

Let $A\subset \mathbb{R}^2$ be an infinite set for which there exists some $\epsilon>0$ such that in any subset of $A$ of size $n$ there are always at...

L1
Combinatorics
0
0
EP-847
Open

Erdős Problem #847

Let $A\subset \mathbb{N}$ be an infinite set for which there exists some $\epsilon>0$ such that in any subset of $A$ of size $n$ there is a subset of ...

L1
Combinatorics
0
0
EP-857
Open

Erdős Problem #857

Let $m=m(n,k)$ be minimal such that in any collection of sets $A_1,\ldots,A_m\subseteq \{1,\ldots,n\}$ there must exist a sunflower of size $k$ - that...

L1
Combinatorics
0
0
EP-863
Open

Erdős Problem #863

Let $r\geq 2$ and let $A\subseteq \{1,\ldots,N\}$ be a set of maximal size such that there are at most $r$ solutions to $n=a+b$ with $a\leq b$ for any...

L1
Combinatorics
0
0
EP-864
Open

Erdős Problem #864

Let $A\subseteq \{1,\ldots N\}$ be a set such that there exists at most one $n$ with more than one solution to $n=a+b$ (with $a\leq b\in A$). Estimate...

L1
Combinatorics
0
0
EP-873
Open

Erdős Problem #873

Let $A=\{a_1<a_2<\cdots\}\subseteq \mathbb{N}$ and let $F(A,X,k)$ count the number of $i$ such that $ [a_i,a_{i+1},\ldots,a_{i+k-1}] < X, $ where the ...

L1
Combinatorics
0
0
EP-875
Open

Erdős Problem #875

Let $A=\{a_1<a_2<\cdots\}\subset \mathbb{N}$ be an infinite set such that the sets $ S_r = \{ a_1+\cdots +a_r : a_1<\cdots<a_r\in A\} $ are disjoint f...

L1
Combinatorics
0
0
EP-876
Open

Erdős Problem #876

Let $A=\{a_1<a_2<\cdots\}\subset \mathbb{N}$ be an infinite sum-free set - that is, there are no solutions to $ a=b_1+\cdots+b_r $ with $b_1<\cdots<b_...

L1
Combinatorics
0
0
EP-881
Open

Erdős Problem #881

Let $A\subset\mathbb{N}$ be an additive basis of order $k$ which is minimal, in the sense that if $B\subset A$ is any infinite set then $A\backslash B...

L1
Combinatorics
0
0
EP-896
Open

Erdős Problem #896

Estimate the maximum of $F(A,B)$ as $A,B$ range over all subsets of $\{1,\ldots,N\}$, where $F(A,B)$ counts the number of $m$ such that $m=ab$ has exa...

L1
Combinatorics
0
0
EP-906
Open

Erdős Problem #906

Is there an entire non-zero function $f:\mathbb{C}\to \mathbb{C}$ such that, for any infinite sequence $n_1<n_2<\cdots$, the set $ \{ z: f^{(n_k)}(z)=...

L1
Combinatorics
0
0
EP-936
Open

Erdős Problem #936

Are $ 2^n\pm 1 $ and $ n!\pm 1 $ powerful (i.e. if $p\mid m$ then $p^2\mid m$) for only finitely many $n$?...

L1
Combinatorics
0
0
EP-938
Open

Erdős Problem #938

Let $A=\{n_1<n_2<\cdots\}$ be the sequence of powerful numbers (if $p\mid n$ then $p^2\mid n$). Are there only finitely many three-term progressions o...

L1
Combinatorics
0
0
EP-943
Open

Erdős Problem #943

Let $A$ be the set of powerful numbers (if $p\mid n$ then $p^2\mid n$). Is it true that $ 1_A\ast 1_A(n)=n^{o(1)} $ for every $n$?", "difficulty":...

L1
Combinatorics
0
0
EP-949
Open

Erdős Problem #949

Let $S\subset \mathbb{R}$ be a set containing no solutions to $a+b=c$. Must there be a set $A\subseteq \mathbb{R}\backslash S$ of cardinality continuu...

L1
Combinatorics
0
0