Gilbreath's Conjecture
Define $d_n^k$ by $d_n^1 = p_{n+1} - p_n$ and $d_n^{k+1} = |d_{n+1}^k - d_n^k|$, the successive absolute differences of the sequence of primes. Is it ...
Erdős $100 Problem on Increasing and Decreasing Gaps
Does there exist an $n_0$ such that for every $i$ and $n > n_0$ we have $d_{n+2i} > d_{n+2i+1}$ and $d_{n+2i+1} < d_{n+2i+2}$, where $d_n = p_{n+1} - ...
Erdős Conjecture on Carmichael Numbers
Let $C(x)$ be the number of Carmichael numbers less than $x$. Does $(\ln C(x))/\ln x$ tend to 1 as $x$ tends to infinity?...
Pomerance's Questions on Good Primes
Call prime $p_n$ good if $p_n^2 > p_{n-i}p_{n+i}$ for all $i$, $1 \le i \le n-1$. Is it true that the set of $n$ for which $p_n$ is good has density 0...
Congruent Products of Consecutive Numbers
What is the least prime $p$ such that there are integers $a, k_1, k_2, k_3$ with $\prod_{i=1}^{k_1} (a+i) \equiv \prod_{i=1}^{k_2} (a+k_1+i) \equiv \p...
Walking to Infinity on Gaussian Primes
Can one walk from the origin to infinity using Gaussian primes as stepping stones and taking steps of bounded length?...
Giuga's Conjecture on Prime Characterization
Is it true that if $n$ divides $1^{n-1} + 2^{n-1} + \dots + (n-1)^{n-1} + 1$, then $n$ is prime?...
Erdős-Selfridge Classification: Infinitely Many Primes in Each Class
In the Erdős-Selfridge classification of primes, are there infinitely many primes in each class? Prime $p$ is in class 1 if the only prime divisors of...
Erdős Conjecture on $n - 2^k$ Prime
Are 4, 7, 15, 21, 45, 75, and 105 the only values of $n$ for which $n - 2^k$ is prime for all $k$ such that $2 \le 2^k < n$?...
Cohen-Selfridge Problem on $\pm p^a \pm 2^b$
What is the least positive odd number not of the form $\pm p^a \pm 2^b$, where $p$ is an odd prime?...
Density of Symmetric Primes
Given pairs of odd primes $p, q$, define $S(q,p)$ as the number of lattice points $(m, n)$ in the rectangle $0 < m < p/2$, $0 < n < q/2$ below the dia...
Square Pseudoprimes
Are there any square pseudoprimes (base 2) other than multiples of $1194649 = 1093^2$ or $12327121 = 3511^2$?...
Selfridge-Wagstaff-Pomerance Prize Problem
Does there exist a composite number $n \equiv 3$ or $7 \pmod{10}$ which divides both $2^n - 2$ and the Fibonacci number $u_{n+1}$?...
Even Fibonacci Pseudoprimes
Does there exist an even Fibonacci pseudoprime?...
Erdős Problem #1
If $A\subseteq \{1,\ldots,N\}$ with $\lvert A\rvert=n$ is such that the subset sums $\sum_{a\in S}a$ are distinct for all $S\subseteq A$ then $ N \gg ...
Erdős Problem #3
If $A\subseteq \mathbb{N}$ has $\sum_{n\in A}\frac{1}{n}=\infty$ then must $A$ contain arbitrarily long arithmetic progressions?...
Erdős Problem #5
Let $C\geq 0$. Is there an infinite sequence of $n_i$ such that $ \lim_{i\to \infty}\frac{p_{n_i+1}-p_{n_i}}{\log n_i}=C? $ ...
Erdős Problem #9
Let $A$ be the set of all odd integers not of the form $p+2^{k}+2^l$ (where $k,l\geq 0$ and $p$ is prime). Is the upper density of $A$ positive?...
Erdős Problem #10
Is there some $k$ such that every integer is the sum of a prime and at most $k$ powers of 2?...
Erdős Problem #12
Let $A$ be an infinite set such that there are no distinct $a,b,c\in A$ such that $a\mid (b+c)$ and $b,c>a$. Is there such an $A$ with $ \liminf \frac...
Erdős Problem #14
Let $A\subseteq \mathbb{N}$. Let $B\subseteq \mathbb{N}$ be the set of integers which are representable in exactly one way as the sum of two elements ...
Erdős Problem #15
Is it true that $ \sum_{n=1}^\infty(-1)^n\frac{n}{p_n} $ converges, where $p_n$ is the sequence of primes?...
Erdős Problem #17
Are there infinitely many primes $p$ such that every even number $n\leq p-3$ can be written as a difference of primes $n=q_1-q_2$ where $q_1,q_2\leq p...
Erdős Problem #18
We call $m$ practical if every integer $n<m$ is the sum of distinct divisors of $m$. If $m$ is practical then let $h(m)$ be such that $h(m)$ many divi...
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 #25
Let $n_1<n_2<\cdots$ be an arbitrary sequence of integers, each with an associated residue class $a_i\pmod{n_i}$. Let $A$ be the set of integers $n$ s...
Erdős Problem #28
If $A\subseteq \mathbb{N}$ is such that $A+A$ contains all but finitely many integers then $\limsup 1_A\ast 1_A(n)=\infty$....
Erdős Problem #30
Let $h(N)$ be the maximum size of a Sidon set in $\{1,\ldots,N\}$. Is it true that, for every $\epsilon>0$, $ h(N) = N^{1/2}+O_\epsilon(N^\epsilon)? $...
Erdős Problem #32
Is there a set $A\subset\mathbb{N}$ such that $ \lvert A\cap\{1,\ldots,N\}\rvert = o((\log N)^2) $ and such that every large integer can be written as...
Erdős Problem #33
Let $A\subset\mathbb{N}$ be such that every large integer can be written as $n^2+a$ for some $a\in A$ and $n\geq 0$. What is the smallest possible val...
Erdős Problem #36
Find the optimal constant $c>0$ such that the following holds. For all sufficiently large $N$, if $A\sqcup B=\{1,\ldots,2N\}$ is a partition into two ...
Erdős Problem #38
Does there exist $B\subset\mathbb{N}$ which is not an additive basis, but is such that for every set $A\subseteq\mathbb{N}$ of Schnirelmann density $\...
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 #51
Is there an infinite set $A\subset \mathbb{N}$ such that for every $a\in A$ there is an integer $n$ such that $\phi(n)=a$, and yet if $n_a$ is the sma...
Erdős Problem #52
Let $A$ be a finite set of integers. Is it true that for every $\epsilon>0$ $ \max( \lvert A+A\rvert,\lvert AA\rvert)\gg_\epsilon \lvert A\rvert^{2-\e...
Erdős Problem #60
Does every graph on $n$ vertices with $>\mathrm{ex}(n;C_4)$ edges contain $\gg n^{1/2}$ many copies of $C_4$?...
Erdős Problem #61
For any graph $H$ is there some $c=c(H)>0$ such that every graph $G$ on $n$ vertices that does not contain $H$ as an induced subgraph contains either ...
Erdős Problem #62
If $G_1,G_2$ are two graphs with chromatic number $\aleph_1$ then must there exist a graph $G$ whose chromatic number is $4$ (or even $\aleph_0$) whic...
Erdős Problem #65
Let $G$ be a graph with $n$ vertices and $kn$ edges, and $a_1<a_2<\cdots $ be the lengths of cycles in $G$. Is it true that $ \sum\frac{1}{a_i}\gg \lo...
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 #68
Is $ \sum_{n\geq 2}\frac{1}{n!-1} $ irrational?...
Erdős Problem #70
Let $\mathfrak{c}$ be the ordinal of the real numbers, $\beta$ be any countable ordinal, and $2\leq n<\omega$. Is it true that $\mathfrak{c}\to (\beta...
Erdős Problem #74
Let $f(n)\to \infty$ (possibly very slowly). Is there a graph of infinite chromatic number such that every finite subgraph on $n$ vertices can be made...
Erdős Problem #75
Is there a graph of chromatic number $\aleph_1$ such that for all $\epsilon>0$ if $n$ is sufficiently large and $H$ is a subgraph on $n$ vertices then...