Erdős Problem #425
Let $F(n)$ be the maximum possible size of a subset $A\subseteq\{1,\ldots,N\}$ such that the products $ab$ are distinct for all $a<b$. Is there a cons...
Erdős Problem #428
Is there a set $A\subseteq \mathbb{N}$ such that, for infinitely many $n$, all of $n-a$ are prime for all $a\in A$ with $0<a<n$ and $ \liminf\frac{\lv...
Erdős Problem #430
Fix some integer $n$ and define a decreasing sequence in $[1,n)$ by $a_1=n-1$ and, for $k\geq 2$, letting $a_k$ be the greatest integer in $[1,a_{k-1}...
Erdős Problem #431
Are there two infinite sets $A$ and $B$ such that $A+B$ agrees with the set of prime numbers up to finitely many exceptions?...
Erdős Problem #432
Let $A,B\subseteq \mathbb{N}$ be two infinite sets. How dense can $A+B$ be if all elements of $A+B$ are pairwise relatively prime?...
Erdős Problem #436
If $p$ is a prime and $k,m\geq 2$ then let $r(k,m,p)$ be the minimal $r$ such that $r,r+1,\ldots,r+m-1$ are all $k$th power residues modulo $p$. Let $...
Erdős Problem #445
Is it true that, for any $c>1/2$, if $p$ is a sufficiently large prime then, for any $n\geq 0$, there exist $a,b\in(n,n+p^c)$ such that $ab\equiv 1\pm...
Erdős Problem #450
How large must $y=y(\epsilon,n)$ be such that the number of integers in $(x,x+y)$ with a divisor in $(n,2n)$ is at most $\epsilon y$?...
Erdős Problem #451
Estimate $n_k$, the smallest integer $>2k$ such that $\prod_{1\leq i\leq k}(n_k-i)$ has no prime factor in $(k,2k)$....
Erdős Problem #452
Let $\omega(n)$ count the number of distinct prime factors of $n$. What is the size of the largest interval $I\subseteq [x,2x]$ such that $\omega(n)>\...
Erdős Problem #454
Let $ f(n) = \min_{i<n} (p_{n+i}+p_{n-i}), $ where $p_k$ is the $k$th prime. Is it true that $ \limsup_n (f(n)-2p_n)=\infty? $ ...
Erdős Problem #455
Let $q_1<q_2<\cdots$ be a sequence of primes such that $ q_{n+1}-q_n\geq q_n-q_{n-1}. $ Must $ \lim_n \frac{q_n}{n^2}=\infty? $ ...
Erdős Problem #456
Let $p_n$ be the smallest prime $\equiv 1\pmod{n}$ and let $m_n$ be the smallest integer such that $n\mid \phi(m_n)$. Is it true that $m_n<p_n$ for al...
Erdős Problem #457
Is there some $\epsilon>0$ such that there are infinitely many $n$ where all primes $p\leq (2+\epsilon)\log n$ divide $ \prod_{1\leq i\leq \log n}(n+i...
Erdős Problem #460
Let $a_0=0$ and $a_1=1$, and in general define $a_k$ to be the least integer $>a_{k-1}$ for which $(n-a_k,n-a_i)=1$ for all $0\leq i<k$. Does $ \sum_{...
Erdős Problem #461
Let $s_t(n)$ be the $t$-smooth component of $n$ - that is, the product of all primes $p$ (with multiplicity) dividing $n$ such that $p<t$. Let $f(n,t)...
Erdős Problem #462
Let $p(n)$ denote the least prime factor of $n$. There is a constant $c>0$ such that $ \sum_{\substack{n<x\\ n\textrm{ not prime}}}\frac{p(n)}{n}\sim ...
Erdős Problem #463
Is there a function $f$ with $f(n)\to \infty$ as $n\to \infty$ such that, for all large $n$, there is a composite number $m$ such that $ n+f(n)<m<n+p(...
Erdős Problem #467
Prove the following for all large $x$: there is a choice of congruence classes $a_p$ for all primes $p\leq x$ and a decomposition $\{p\leq x\}=A\sqcup...
Erdős Problem #468
For any $n$ let $D_n$ be the set of sums of the shape $d_1,d_1+d_2,d_1+d_2+d_3,\ldots$ where $1<d_1<d_2<\cdots$ are the divisors of $n$. What is the s...
Erdős Problem #469
Let $A$ be the set of all $n$ such that $n=d_1+\cdots+d_k$ with $d_i$ distinct proper divisors of $n$, but this is not true for any $m\mid n$ with $m<...
Erdős Problem #470
Call $n$ weird if $\sigma(n)\geq 2n$ and $n$ is not pseudoperfect, that is, it is not the sum of any set of its divisors. Are there any odd weird numb...
Erdős Problem #472
Given some initial finite sequence of primes $q_1<\cdots<q_m$ extend it so that $q_{n+1}$ is the smallest prime of the form $q_n+q_i-1$ for $n\geq m$....
Erdős Problem #477
Is there a polynomial $f:\mathbb{Z}\to \mathbb{Z}$ of degree at least $2$ and a set $A\subset \mathbb{Z}$ such that for any $n\in \mathbb{Z}$ there is...
Erdős Problem #478
Let $p$ be a prime and $ A_p = \{ k! \pmod{p} : 1\leq k<p\}. $ Is it true that $ \lvert A_p\rvert \sim (1-\tfrac{1}{e})p? $ ...
Erdős Problem #479
Is it true that, for all $k eq 1$, there are infinitely many $n$ such that $2^n\equiv k\pmod{n}$?...
Erdős Problem #483
Let $f(k)$ be the minimal $N$ such that if $\{1,\ldots,N\}$ is $k$-coloured then there is a monochromatic solution to $a+b=c$. Estimate $f(k)$. In par...
Erdős Problem #486
Let $A\subseteq \mathbb{N}$, and for each $n\in A$ choose some $X_n\subseteq \mathbb{Z}/n\mathbb{Z}$. Let $ B = \{ m\in \mathbb{N} : m ot\in X_n\pmod{...
Erdős Problem #488
Let $A$ be a finite set and $ B=\{ n \geq 1 : a\mid n\textrm{ for some }a\in A\}. $ Is it true that, for every $m>n\geq \max(A)$, $ \frac{\lvert B\cap...
Erdős Problem #489
Let $A\subseteq \mathbb{N}$ be a set such that $\lvert A\cap [1,x]\rvert=o(x^{1/2})$. Let $ B=\{ n\geq 1 : a mid n\textrm{ for all }a\in A\}. $ If $B=...
Erdős Problem #495
Let $\alpha,\beta \in \mathbb{R}$. Is it true that $ \liminf_{n\to \infty} n \| n\alpha \| \| n\beta\| =0 $ where $\|x\|$ is the distance from $x$ to ...
Erdős Problem #500
What is $\mathrm{ex}_3(n,K_4^3)$? That is, the largest number of $3$-edges which can placed on $n$ vertices so that there exists no $K_4^3$, a set of ...
Erdős Problem #501
For every $x\in\mathbb{R}$ let $A_x\subset \mathbb{R}$ be a bounded set with outer measure $<1$. Must there exist an infinite independent set, that is...
Erdős Problem #503
What is the size of the largest $A\subseteq \mathbb{R}^d$ such that every three points from $A$ determine an isosceles triangle? That is, for any thre...
Erdős Problem #507
Let $\alpha(n)$ be such that every set of $n$ points in the unit disk contains three points which determine a triangle of area at most $\alpha(n)$. Es...
Erdős Problem #508
What is the chromatic number of the plane? That is, what is the smallest number of colours required to colour $\mathbb{R}^2$ such that no two points o...
Erdős Problem #509
Let $f(z)\in\mathbb{C}[z]$ be a monic non-constant polynomial. Can the set $ \{ z\in \mathbb{C} : \lvert f(z)\rvert \leq 1\} $ be covered by a set of ...
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) < ...
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...
Erdős Problem #514
Let $f(z)$ be an entire transcendental function. Does there exist a path $L$ so that, for every $n$, $ \lvert f(z)/z^n\rvert \to \infty $ as $z\to \in...
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...
Erdős Problem #520
Let $f$ be a Rademacher multiplicative function: a random $\{-1,0,1\}$-valued multiplicative function, where for each prime $p$ we independently choos...
Erdős Problem #521
Let $(\epsilon_k)_{k\geq 0}$ be independently uniformly chosen at random from $\{-1,1\}$. If $R_n$ counts the number of real roots of $f_n(z)=\sum_{0\...
Erdős Problem #522
Let $f(z)=\sum_{0\leq k\leq n} \epsilon_k z^k$ be a random polynomial, where $\epsilon_k\in \{-1,1\}$ independently uniformly at random for $0\leq k\l...
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...
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...
Erdős Problem #529
Let $d_k(n)$ be the expected distance from the origin after taking $n$ random steps from the origin in $\mathbb{Z}^k$ (conditional on no self intersec...
Erdős Problem #530
Let $\ell(N)$ be maximal such that in any finite set $A\subset \mathbb{R}$ of size $N$ there exists a Sidon subset $S$ of size $\ell(N)$ (i.e. the onl...
Erdős Problem #531
Let $F(k)$ be the minimal $N$ such that if we two-colour $\{1,\ldots,N\}$ there is a set $A$ of size $k$ such that all subset sums $\sum_{a\in S}a$ (f...
Erdős Problem #533
Let $\delta>0$. If $n$ is sufficiently large and $G$ is a graph on $n$ vertices with no $K_5$ and at least $\delta n^2$ edges then $G$ contains a set ...