Unsolved Problems

Showing 151-195 of 195 problems (Page 4 of 4)

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

Erdős Problem #956

If $C,D\subseteq \mathbb{R}^2$ then the distance between $C$ and $D$ is defined by $ \delta(C,D)=\inf_{\substack{c\in C\\ d\in D}}\| c-d\|. $ Let $h(n...

L1
Combinatorics
0
0
EP-959
Open

Erdős Problem #959

Let $A\subset \mathbb{R}^2$ be a set of size $n$ and let $\{d_1,\ldots,d_k\}$ be the set of distinct distances determined by $A$. Let $f(d)$ be the nu...

L1
Combinatorics
0
0
EP-960
Open

Erdős Problem #960

Let $r,k\geq 2$ be fixed. Let $A\subset \mathbb{R}^2$ be a set of $n$ points with no $k$ points on a line. Determine the threshold $f_{r,k}(n)$ such t...

L1
Combinatorics
0
0
EP-963
Open

Erdős Problem #963

Let $f(n)$ be the maximal $k$ such that in any set $A\subset \mathbb{R}$ of size $n$ there is a subset $B\subseteq A$ of size $\lvert B\rvert\geq k$ w...

L1
Combinatorics
0
0
EP-973
Open

Erdős Problem #973

Does there exist a constant $C>1$ such that, for every $n\geq 2$, there exists a sequence $z_i\in \mathbb{C}$ with $z_1=1$ and $\lvert z_i\rvert \geq ...

L1
Combinatorics
0
0
EP-990
Open

Erdős Problem #990

Let $f=a_0+\cdots+a_dx^d\in \mathbb{C}[x]$ be a polynomial. Is it true that, if $f$ has roots $z_1,\ldots,z_d$ with corresponding arguments $\theta_1,...

L1
Combinatorics
0
0
EP-1002
Open

Erdős Problem #1002

For any $0<\alpha<1$, let $ f(\alpha,n)=\frac{1}{\log n}\sum_{1\leq k\leq n}(\tfrac{1}{2}-\{ \alpha k\}). $ Does $f(\alpha,n)$ have an asymptotic dist...

L1
Combinatorics
0
0
EP-1030
Open

Erdős Problem #1030

If $R(k,l)$ is the Ramsey number then prove the existence of some $c>0$ such that $ \lim_k \frac{R(k+1,k)}{R(k,k)}> 1+c. $ ...

L1
Combinatorics
0
0
EP-1038
Open

Erdős Problem #1038

Determine the infimum and supremum of $ \lvert \{ x\in \mathbb{R} : \lvert f(x)\rvert < 1\}\rvert $ as $f\in \mathbb{R}[x]$ ranges over all non-consta...

L1
Combinatorics
0
0
EP-1039
Open

Erdős Problem #1039

Let $f(z)=\prod_{i=1}^n(z-z_i)\in \mathbb{C}[z]$ with $\lvert z_i\rvert \leq 1$ for all $i$. Let $\rho(f)$ be the radius of the largest disc which is ...

L1
Combinatorics
0
0
EP-1040
Open

Erdős Problem #1040

Let $F\subseteq \mathbb{C}$ be a closed infinite set, and let $\mu(F)$ be the infimum of $ \lvert \{ z: \lvert f(z)\rvert < 1\}\rvert, $ as $f$ ranges...

L1
Combinatorics
0
0
EP-1062
Open

Erdős Problem #1062

Let $f(n)$ be the size of the largest subset $A\subseteq \{1,\ldots,n\}$ such that there are no three distinct elements $a,b,c\in A$ such that $a\mid ...

L1
Combinatorics
0
0
EP-1063
Open

Erdős Problem #1063

Let $k\geq 2$ and define $n_k\geq 2k$ to be the least value of $n$ such that $n-i$ divides $\binom{n}{k}$ for all but one $0\leq i<k$. Estimate $n_k$....

L1
Combinatorics
0
0
EP-1071
Open

Erdős Problem #1071

Is there a finite set of unit line segments (rotated and translated copies of $(0,1)$) in the unit square, no two of which intersect, which are maxima...

L1
Combinatorics
0
0
EP-1083
Open

Erdős Problem #1083

Let $d\geq 3$, and let $f_d(n)$ be the minimal $m$ such that every set of $n$ points in $\mathbb{R}^d$ determines at least $m$ distinct distances. Est...

L1
Combinatorics
0
0
EP-1087
Open

Erdős Problem #1087

Let $f(n)$ be minimal such that every set of $n$ points in $\mathbb{R}^2$ contains at most $f(n)$ many sets of four points which are 'degenerate' in t...

L1
Combinatorics
0
0
EP-1088
Open

Erdős Problem #1088

Let $f_d(n)$ be the minimal $m$ such that any set of $m$ points in $\mathbb{R}^d$ contains a set of $n$ points such that any two determined distances ...

L1
Combinatorics
0
0
EP-1096
Open

Erdős Problem #1096

Let $1<q<1+\epsilon$ and consider the set of numbers of the shape $\sum_{i\in S}q^i$ (for all finite $S$), ordered by size as $0=x_1<x_2<\cdots$. Is i...

L1
Combinatorics
0
0
EP-1108
Open

Erdős Problem #1108

Let $ A = \left\{ \sum_{n\in S}n! : S\subset \mathbb{N}\textrm{ finite}\right\}. $ If $k\geq 2$, then does $A$ contain only finitely many $k$th powers...

L1
Combinatorics
0
0
EP-1117
Open

Erdős Problem #1117

Let $f(z)$ be an entire function which is not a monomial. Let $ u(r)$ count the number of $z$ with $\lvert z\rvert=r$ such that $\lvert f(z)\rvert=\ma...

L1
Combinatorics
0
0
EP-1122
Open

Erdős Problem #1122

Let $f:\mathbb{N}\to \mathbb{R}$ be an additive function (i.e. $f(ab)=f(a)+f(b)$ whenever $(a,b)=1$). Let $ A=\{ n \geq 1: f(n+1)< f(n)\}. $ If $\lver...

L1
Combinatorics
0
0
EP-1130
Open

Erdős Problem #1130

For $x_1,\ldots,x_n\in [-1,1]$ let $ l_k(x)=\frac{\prod_{i eq k}(x-x_i)}{\prod_{i eq k}(x_k-x_i)}, $ which are such that $l_k(x_k)=1$ and $l_k(x_i)=0$...

L1
Combinatorics
0
0
EP-1131
Open

Erdős Problem #1131

For $x_1,\ldots,x_n\in [-1,1]$ let $ l_k(x)=\frac{\prod_{i eq k}(x-x_i)}{\prod_{i eq k}(x_k-x_i)}, $ which are such that $l_k(x_k)=1$ and $l_k(x_i)=0$...

L1
Combinatorics
0
0
EP-1132
Open

Erdős Problem #1132

For $x_1,\ldots,x_n\in [-1,1]$ let $ l_k(x)=\frac{\prod_{i eq k}(x-x_i)}{\prod_{i eq k}(x_k-x_i)}, $ which are such that $l_k(x_k)=1$ and $l_k(x_i)=0$...

L1
Combinatorics
0
0