Unsolved Problems

Showing 451-500 of 662 problems (Page 10 of 14)

EP-769
Open

Erdős Problem #769

Let $c(n)$ be minimal such that if $k\geq c(n)$ then the $n$-dimensional unit cube can be decomposed into $k$ homothetic $n$-dimensional cubes. Give g...

L1
Number Theory
0
0
EP-770
Open

Erdős Problem #770

Let $h(n)$ be minimal such that $2^n-1,3^n-1,\ldots,h(n)^n-1$ are mutually coprime. Does, for every prime $p$, the density $\delta_p$ of integers with...

L1
Number Theory
0
0
EP-773
Open

Erdős Problem #773

What is the size of the largest Sidon subset $A\subseteq\{1,2^2,\ldots,N^2\}$? Is it $N^{1-o(1)}$?...

L1
Number Theory
0
0
EP-774
Open

Erdős Problem #774

We call $A\subset \mathbb{N}$ dissociated if $\sum_{n\in X}n eq \sum_{m\in Y}m$ for all finite $X,Y\subset A$ with $X eq Y$. Let $A\subset \mathbb{N}$...

L1
Number Theory
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-778
Open

Erdős Problem #778

Alice and Bob play a game on the edges of $K_n$, alternating colouring edges by red (Alice) and blue (Bob). Alice goes first, and wins if at the end t...

L1
Graph Theory
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-783
Open

Erdős Problem #783

Fix some constant $C>0$ and let $n$ be large. Let $A\subseteq \{2,\ldots,n\}$ be such that $(a,b)=1$ for all $a eq b\in A$ and $\sum_{n\in A}\frac{1}{...

L1
Number Theory
0
0
EP-786
Open

Erdős Problem #786

Let $\epsilon>0$. Is there some set $A\subset \mathbb{N}$ of density $>1-\epsilon$ such that $a_1\cdots a_r=b_1\cdots b_s$ with $a_i,b_j\in A$ can onl...

L1
Number Theory
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-792
Open

Erdős Problem #792

Let $f(n)$ be maximal such that in any $A\subset \mathbb{Z}$ with $\lvert A\rvert=n$ there exists some sum-free subset $B\subseteq A$ with $\lvert B\r...

L1
Number Theory
0
0
EP-793
Open

Erdős Problem #793

Let $F(n)$ be the maximum possible size of a subset $A\subseteq\{1,\ldots,n\}$ such that $a mid bc$ whenever $a,b,c\in A$ with $a eq b$ and $a eq c$. ...

L1
Number Theory
0
0
EP-796
Open

Erdős Problem #796

Let $k\geq 2$ and let $g_k(n)$ be the largest possible size of $A\subseteq \{1,\ldots,n\}$ such that every $m$ has $<k$ solutions to $m=a_1a_2$ with $...

L1
Number Theory
0
0
EP-802
Open

Erdős Problem #802

Is it true that any $K_r$-free graph on $n$ vertices with average degree $t$ contains an independent set on $ \gg_r \frac{\log t}{t}n $ many vertices?...

L1
Graph Theory
0
0
EP-805
Open

Erdős Problem #805

For which functions $g(n)$ with $n>g(n)\geq (\log n)^2$ is there a graph on $n$ vertices in which every induced subgraph on $g(n)$ vertices contains a...

L1
Graph Theory
0
0
EP-809
Open

Erdős Problem #809

Let $k\geq 3$ and define $F_k(n)$ to be the minimal $r$ such that there is a graph $G$ on $n$ vertices with $\lfloor n^2/4\rfloor+1$ many edges such t...

L1
Graph Theory
0
0
EP-810
Open

Erdős Problem #810

Does there exist some $\epsilon>0$ such that, for all sufficiently large $n$, there exists a graph $G$ on $n$ vertices with at least $\epsilon n^2$ ma...

L1
Graph Theory
0
0
EP-811
Open

Erdős Problem #811

Suppose $n\equiv 1\pmod{m}$. We say that an edge-colouring of $K_n$ using $m$ colours is balanced if every vertex sees exactly $\lfloor n/m\rfloor$ ma...

L1
Graph Theory
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-813
Open

Erdős Problem #813

Let $h(n)$ be minimal such that every graph on $n$ vertices where every set of $7$ vertices contains a triangle (a copy of $K_3$) must contain a cliqu...

L1
Graph Theory
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-820
Open

Erdős Problem #820

Let $H(n)$ be the smallest integer $l$ such that there exist $k<l$ with $(k^n-1,l^n-1)=1$. Is it true that $H(n)=3$ infinitely often? (That is, $(2^n-...

L1
Number Theory
0
0
EP-821
Open

Erdős Problem #821

Let $g(n)$ count the number of $m$ such that $\phi(m)=n$. Is it true that, for every $\epsilon>0$, there exist infinitely many $n$ such that $ g(n) > ...

L1
Number Theory
0
0
EP-824
Open

Erdős Problem #824

Let $h(x)$ count the number of integers $1\leq a<b<x$ such that $(a,b)=1$ and $\sigma(a)=\sigma(b)$, where $\sigma$ is the sum of divisors function. I...

L1
Number Theory
0
0
EP-825
Open

Erdős Problem #825

Is there an absolute constant $C>0$ such that every integer $n$ with $\sigma(n)>Cn$ is the distinct sum of proper divisors of $n$?...

L1
Number Theory
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-828
Open

Erdős Problem #828

Is it true that, for any $a\in\mathbb{Z}$, there are infinitely many $n$ such that $ \phi(n) \mid n+a? $ ...

L1
Number Theory
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-831
Open

Erdős Problem #831

Let $h(n)$ be maximal such that in any $n$ points in $\mathbb{R}^2$ (with no three on a line and no four on a circle) there are at least $h(n)$ many c...

L1
Geometry
0
0
EP-836
Open

Erdős Problem #836

Let $r\geq 2$ and $G$ be a $r$-uniform hypergraph with chromatic number $3$ (that is, there is a $3$-colouring of the vertices of $G$ such that no edg...

L1
Number Theory
0
0
EP-837
Open

Erdős Problem #837

Let $k\geq 2$ and $A_k\subseteq [0,1]$ be the set of $\alpha$ such that there exists some $\beta(\alpha)>\alpha$ with the property that, if $G_1,G_2,\...

L1
Graph Theory
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-839
Open

Erdős Problem #839

Let $1\leq a_1<a_2<\cdots$ be a sequence of integers such that no $a_i$ is the sum of consecutive $a_j$ for $j<i$. Is it true that $ \limsup \frac{a_n...

L1
Number Theory
0
0
EP-840
Open

Erdős Problem #840

Let $f(N)$ be the size of the largest quasi-Sidon subset $A\subset\{1,\ldots,N\}$, where we say that $A$ is quasi-Sidon if $ \lvert A+A\rvert=(1+o(1))...

L1
Number Theory
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-849
Open

Erdős Problem #849

Is it true that, for every integer $t\geq 1$, there is some integer $a$ such that $ \binom{n}{k}=a $ (with $1\leq k\leq n/2$) has exactly $t$ solution...

L1
Number Theory
0
0
EP-850
Open

Erdős Problem #850

Can there exist two distinct integers $x$ and $y$ such that $x,y$ have the same prime factors, $x+1,y+1$ have the same prime factors, and $x+2,y+2$ al...

L1
Number Theory
0
0
EP-851
Open

Erdős Problem #851

Let $\epsilon>0$. Is there some $r\ll_\epsilon 1$ such that the density of integers of the form $2^k+n$, where $k\geq 0$ and $n$ has at most $r$ prime...

L1
Number Theory
0
0
EP-852
Open

Erdős Problem #852

Let $d_n=p_{n+1}-p_n$, where $p_n$ is the $n$th prime. Let $h(x)$ be maximal such that for some $n<x$ the numbers $d_n,d_{n+1},\ldots,d_{n+h(x)-1}$ ar...

L1
Number Theory
0
0
EP-853
Open

Erdős Problem #853

Let $d_n=p_{n+1}-p_n$, where $p_n$ is the $n$th prime. Let $r(x)$ be the smallest even integer $t$ such that $d_n=t$ has no solutions for $n\leq x$. I...

L1
Number Theory
0
0
EP-854
Open

Erdős Problem #854

Let $n_k$ denote the $k$th primorial, i.e. the product of the first $k$ primes. If $1=a_1<a_2<\cdots a_{\phi(n_k)}=n_k-1$ is the sequence of integers ...

L1
Number Theory
0
0
EP-856
Open

Erdős Problem #856

Let $k\geq 3$ and $f_k(N)$ be the maximum value of $\sum_{n\in A}\frac{1}{n}$, where $A$ ranges over all subsets of $\{1,\ldots,N\}$ which contain no ...

L1
Number Theory
0
0