Sum-Free Subsets of [N]^d
Fix an integer $d$. What is the largest sum-free subset of $[N]^d$?...
Roth's Theorem with Random Common Differences
Let $S \subset \mathbb{N}$ be random. Under what conditions is Roth's theorem for progressions of length 3 true with common differences in $S$?...
Lipschitz AP-Free Graphs
Does there exist a Lipschitz function $f : \mathbb{N} \to \mathbb{Z}$ whose graph $\Gamma = \{(n, f(n)) : n \in \mathbb{Z}\} \subset \mathbb{Z}^2$ is ...
Linear Equation x + 3y = 2z + 2w
What is the largest subset of $[N]$ with no solution to $x + 3y = 2z + 2w$ in distinct integers $x, y, z, w$?...
Corner Problem in Product Sets
Suppose $G$ is a finite group, and let $A \subset G \times G$ be a subset of density $\alpha$. Are there $\gg_\alpha |G|^3$ triples $x, y, g$ such tha...
Largest Coset in 2A
Suppose that $A \subset \mathbb{F}_2^n$ has density $\alpha$. What is the largest size of coset guaranteed to be contained in $2A$?...
Comparable Elements in Integer Lattices
Consider a set $S \subset [N]^3$ with the property that any two distinct elements $s, s'$ of $S$ are comparable (in the coordinatewise partial order)....
N Queens Problem Asymptotics
In how many ways (asymptotically) $Q(n)$ may $n$ non-attacking queens be placed on an $n \times n$ chessboard?...
Monochromatic x+y and xy
If $\{1, \dots, N\}$ is $r$-coloured, then for $N \geq N_0(r)$ there exist integers $x, y \geq 3$ such that $x+y$ and $xy$ have the same colour. Find ...
Affine Translates of {0,1,3}
If $A$ is a set of $n$ integers, what is the maximum number of affine translates of the set $\{0, 1, 3\}$ that $A$ can contain?...
Uniform Random Variables with Uniform Sum
Suppose $X, Y$ are finitely-supported independent random variables taking integer values such that $X + Y$ is uniformly distributed on its range. Are ...
Large Gaps in Dilates
Let $p$ be a prime and let $A \subset \mathbb{Z}/p\mathbb{Z}$ be a set of size $\sqrt{p}$. Is there a dilate of $A$ with a gap of length $100\sqrt{p}$...
Structure of Sets with Bounded Representation
Suppose $A \subset [N]$ has size $\geq c\sqrt{N}$ and representation function $r_A(n) \leq r$ for all $n$. What can be said about the structure of $A$...
Covering by Random Translates
If $A \subset \mathbb{Z}/p\mathbb{Z}$ is random with $|A| = \sqrt{p}$, can we almost surely cover $\mathbb{Z}/p\mathbb{Z}$ with $100\sqrt{p}$ translat...
N-Queens Problem Asymptotics
In how many ways (asymptotically) $Q(n)$ may $n$ non-attacking queens be placed on an $n \times n$ chessboard?...
Erdős Problem #20
Let $f(n,k)$ be minimal such that every family $\mathcal{F}$ of $n$-uniform sets with $\lvert \mathcal{F}\rvert \geq f(n,k)$ contains a $k$-sunflower....
Erdős Problem #39
Is there an infinite Sidon set $A\subset \mathbb{N}$ such that $ \lvert A\cap \{1\ldots,N\}\rvert \gg_\epsilon N^{1/2-\epsilon} $ for all $\epsilon>0$...
Erdős Problem #40
For what functions $g(N)\to \infty$ is it true that $ \lvert A\cap \{1,\ldots,N\}\rvert \gg \frac{N^{1/2}}{g(N)} $ implies $\limsup 1_A\ast 1_A(n)=\in...
Erdős Problem #41
Let $A\subset\mathbb{N}$ be an infinite set such that the triple sums $a+b+c$ are all distinct for $a,b,c\in A$ (aside from the trivial coincidences)....
Erdős Problem #42
Let $M\geq 1$ and $N$ be sufficiently large in terms of $M$. Is it true that for every Sidon set $A\subset \{1,\ldots,N\}$ there is another Sidon set ...
Erdős Problem #43
If $A,B\subset \{1,\ldots,N\}$ are two Sidon sets such that $(A-A)\cap(B-B)=\{0\}$ then is it true that $ \binom{\lvert A\rvert}{2}+\binom{\lvert B\r...
Erdős Problem #44
Let $N\geq 1$ and $A\subset \{1,\ldots,N\}$ be a Sidon set. Is it true that, for any $\epsilon>0$, there exist $M$ and $B\subset \{N+1,\ldots,M\}$ (wh...
Erdős Problem #50
Schoenberg proved that for every $c\in [0,1]$ the density of $ \{ n\in \mathbb{N} : \phi(n)<cn\} $ exists. Let this density be denoted by $f(c)$. Is i...
Erdős Problem #66
Is there $A\subseteq \mathbb{N}$ such that $ \lim_{n\to \infty}\frac{1_A\ast 1_A(n)}{\log n} $ exists and is $ eq 0$?...
Erdős Problem #101
Given $n$ points in $\mathbb{R}^2$, no five of which are on a line, the number of lines containing four points is $o(n^2)$....
Erdős Problem #102
Let $c>0$ and $h_c(n)$ be such that for any $n$ points in $\mathbb{R}^2$ such that there are $\geq cn^2$ lines each containing more than three points,...
Erdős Problem #117
Let $h(n)$ be minimal such that any group $G$ with the property that any subset of $>n$ elements contains some $x eq y$ such that $xy=yx$ can be cover...
Erdős Problem #119
Let $z_i$ be an infinite sequence of complex numbers such that $\lvert z_i\rvert=1$ for all $i\geq 1$, and for $n\geq 1$ let $ p_n(z)=\prod_{i\leq n} ...
Erdős Problem #120
Let $A\subseteq\mathbb{R}$ be an infinite set. Must there be a set $E\subset \mathbb{R}$ of positive measure which does not contain any set of the sha...
Erdős Problem #131
Let $F(N)$ be the maximal size of $A\subseteq\{1,\ldots,N\}$ such that no $a\in A$ divides the sum of any distinct elements of $A\backslash\{a\}$. Est...
Erdős Problem #142
Let $r_k(N)$ be the largest possible size of a subset of $\{1,\ldots,N\}$ that does not contain any non-trivial $k$-term arithmetic progression. Prove...
Erdős Problem #145
Let $s_1<s_2<\cdots$ be the sequence of squarefree numbers. Is it true that, for any $\alpha \geq 0$, $ \lim_{x\to \infty}\frac{1}{x}\sum_{s_n\leq x}(...
Erdős Problem #152
For any $M\geq 1$, if $A\subset \mathbb{N}$ is a sufficiently large finite Sidon set then there are at least $M$ many $a\in A+A$ such that $a+1,a-1 ot...
Erdős Problem #153
Let $A$ be a finite Sidon set and $A+A=\{s_1<\cdots<s_t\}$. Is it true that $ \frac{1}{t}\sum_{1\leq i<t}(s_{i+1}-s_i)^2 \to \infty $ as $\lvert A\rve...
Erdős Problem #155
Let $F(N)$ be the size of the largest Sidon subset of $\{1,\ldots,N\}$. Is it true that for every $k\geq 1$ we have $ F(N+k)\leq F(N)+1 $ for all suff...
Erdős Problem #156
Does there exist a maximal Sidon set $A\subset \{1,\ldots,N\}$ of size $O(N^{1/3})$?...
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...
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...
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...
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...
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 $ ...
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$ ...
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 ...
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...
Erdős Problem #212
Is there a dense subset of $\mathbb{R}^2$ such that all pairwise distances are rational?...
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...
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...
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?...
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...
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...