Erdős Problem #604
Given $n$ distinct points $A\subset\mathbb{R}^2$ must there be a point $x\in A$ such that $ \#\{ d(x,y) : y \in A\} \gg n^{1-o(1)}? $ Or even $\gg n/\...
Erdős Problem #633
Classify those triangles which can only be cut into a square number of congruent triangles....
Erdős Problem #634
Find all $n$ such that there is at least one triangle which can be cut into $n$ congruent triangles....
Erdős Problem #650
Let $f(m)$ be such that if $A\subseteq \{1,\ldots,N\}$ has $\lvert A\rvert=m$ then every interval in $[1,\infty)$ of length $2N$ contains $\geq f(m)$ ...
Erdős Problem #663
Let $k\geq 2$ and $q(n,k)$ denote the least prime which does not divide $\prod_{1\leq i\leq k}(n+i)$. Is it true that, if $k$ is fixed and $n$ is suff...
Erdős Problem #665
A pairwise balanced design for $\{1,\ldots,n\}$ is a collection of sets $A_1,\ldots,A_m\subseteq \{1,\ldots,n\}$ such that $2\leq \lvert A_i\rvert <n$...
Erdős Problem #667
Let $p,q\geq 1$ be fixed integers. We define $H(n)=H(N;p,q)$ to be the largest $m$ such that any graph on $n$ vertices where every set of $p$ vertices...
Erdős Problem #675
We say that $A\subset \mathbb{N}$ has the translation property if, for every $n$, there exists some integer $t_n\geq 1$ such that, for all $1\leq a\le...
Erdős Problem #676
Is every sufficiently large integer of the form $ ap^2+b $ for some prime $p$ and integer $a\geq 1$ and $0\leq b<p$?...
Erdős Problem #677
Let $M(n,k)=[n+1,\ldots,n+k]$ be the least common multiple of $\{n+1,\ldots,n+k\}$. Is it true that for all $m\geq n+k$ $ M(n,k) eq M(m,k)? $ ...
Erdős Problem #679
Let $\epsilon>0$ and $\omega(n)$ count the number of distinct prime factors of $n$. Are there infinitely many values of $n$ such that $ \omega(n-k) < ...
Erdős Problem #680
Is it true that, for all sufficiently large $n$, there exists some $k$ such that $ p(n+k)>k^2+1, $ where $p(m)$ denotes the least prime factor of $m$?...
Erdős Problem #681
Is it true that for all large $n$ there exists $k$ such that $n+k$ is composite and $ p(n+k)>k^2, $ where $p(m)$ is the least prime factor of $m$?...
Erdős Problem #683
Is it true that for every $1\leq k\leq n$ the largest prime divisor of $\binom{n}{k}$, say $P(\binom{n}{k})$, satisfies $ P\left(\binom{n}{k}\right)\g...
Erdős Problem #684
For $0\leq k\leq n$ write $ \binom{n}{k} = uv $ where the only primes dividing $u$ are in $[2,k]$ and the only primes dividing $v$ are in $(k,n]$. Let...
Erdős Problem #685
Let $\epsilon>0$ and $n$ be large depending on $\epsilon$. Is it true that for all $n^\epsilon<k\leq n^{1-\epsilon}$ the number of distinct prime divi...
Erdős Problem #686
Can every integer $N\geq 2$ be written as $ N=\frac{\prod_{1\leq i\leq k}(m+i)}{\prod_{1\leq i\leq k}(n+i)} $ for some $k\geq 2$ and $m\geq n+k$?...
Erdős Problem #687
Let $Y(x)$ be the maximal $y$ such that there exists a choice of congruence classes $a_p$ for all primes $p\leq x$ such that every integer in $[1,y]$ ...
Erdős Problem #688
Define $\epsilon_n$ to be maximal such that there exists some choice of congruence class $a_p$ for all primes $n^{\epsilon_n}<p\leq n$ such that every...
Erdős Problem #689
Let $n$ be sufficiently large. Is there some choice of congruence class $a_p$ for all primes $2\leq p\leq n$ such that every integer in $[1,n]$ satisf...
Erdős Problem #690
Let $d_k(p)$ be the density of those integers whose $k$th smallest prime factor is $p$ (i.e. if $p_1<p_2<\cdots$ are the primes dividing $n$ then $p_k...
Erdős Problem #691
Given $A\subseteq \mathbb{N}$ let $M_A=\{ n \geq 1 : a\mid n\textrm{ for some }a\in A\}$ be the set of multiples of $A$. Find a necessary and sufficie...
Erdős Problem #693
Let $k\geq 2$ and $n$ be sufficiently large depending on $k$. Let $A=\{a_1<a_2<\cdots \}$ be the set of those integers in $[n,n^k]$ which have a divis...
Erdős Problem #694
Let $f_{\max}(n)$ be the largest $m$ such that $\phi(m)=n$, and $f_{\min}(n)$ be the smallest such $m$, where $\phi$ is Euler's totient function. Inve...
Erdős Problem #695
Let $p_1<p_2<\cdots$ be a sequence of primes such that $p_{i+1}\equiv 1\pmod{p_i}$. Is it true that $ \lim_k p_k^{1/k}=\infty? $ Does there exist such...
Erdős Problem #696
Let $h(n)$ be the largest $\ell$ such that there is a sequence of primes $p_1<\cdots < p_\ell$ all dividing $n$ with $p_{i+1}\equiv 1\pmod{p_i}$. Let ...
Erdős Problem #700
Let $ f(n)=\min_{1<k\leq n/2}\textrm{gcd}\left(n,\binom{n}{k}\right). $ {UL} {LI}Characterise those composite $n$ such that $f(n)=n/P(n)$, where $P(n)...
Erdős Problem #708
Let $g(n)$ be minimal such that for any $A\subseteq [2,\infty)\cap \mathbb{N}$ with $\lvert A\rvert =n$ and any set $I$ of $\max(A)$ consecutive integ...
Erdős Problem #709
Let $f(n)$ be minimal such that, for any $A=\{a_1,\ldots,a_n\}\subseteq [2,\infty)\cap\mathbb{N}$ of size $n$, in any interval $I$ of $f(n)\max(A)$ co...
Erdős Problem #710
Let $f(n)$ be minimal such that in $(n,n+f(n))$ there exist distinct integers $a_1,\ldots,a_n$ such that $k\mid a_k$ for all $1\leq k\leq n$. Obtain a...
Erdős Problem #711
Let $f(n,m)$ be minimal such that in $(m,m+f(n,m))$ there exist distinct integers $a_1,\ldots,a_n$ such that $k\mid a_k$ for all $1\leq k\leq n$. Prov...
Erdős Problem #713
Is it true that, for every bipartite graph $G$, there exists some $\alpha\in [1,2)$ and $c>0$ such that $ \mathrm{ex}(n;G)\sim cn^\alpha? $ Must $\alp...
Erdős Problem #724
Let $f(n)$ be the maximum number of mutually orthogonal Latin squares of order $n$. Is it true that $ f(n) \gg n^{1/2}? $ ...
Erdős Problem #726
As $n\to \infty$ ranges over integers $ \sum_{p\leq n}1_{n\in (p/2,p)\pmod{p}}\frac{1}{p}\sim \frac{\log\log n}{2}. $ ...
Erdős Problem #727
Let $k\geq 2$. Does $ (n+k)!^2 \mid (2n)! $ for infinitely many $n$?...
Erdős Problem #730
Are there infinitely many pairs of integers $n eq m$ such that $\binom{2n}{n}$ and $\binom{2m}{m}$ have the same set of prime divisors?...
Erdős Problem #731
Find some reasonable function $f(n)$ such that, for almost all integers $n$, the least integer $m$ such that $m mid \binom{2n}{n}$ satisfies $ m\sim f...
Erdős Problem #740
Let $\mathfrak{m}$ be an infinite cardinal and $G$ be a graph with chromatic number $\mathfrak{m}$. Let $r\geq 1$. Must $G$ contain a subgraph of chro...
Erdős Problem #757
Let $A\subset \mathbb{R}$ be a set of size $n$ such that every subset $B\subseteq A$ with $\lvert B\rvert =4$ has $\lvert B-B\rvert\geq 11$. Find the ...
Erdős Problem #768
Let $A\subset\mathbb{N}$ be the set of $n$ such that for every prime $p\mid n$ there exists some $d\mid n$ with $d>1$ such that $d\equiv 1\pmod{p}$. I...
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...
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...
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)}$?...
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}$...
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}{...
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...
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...
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$. ...
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 $...
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-...