open-research-protocol 0.3.0

package/packs/erdos-open-problems/data/erdos_open_problems.md

@@ -0,0 +1,697 @@
+# Erdos Open Problems (Active Snapshot)
+
+- generated_at_utc: `2026-03-05T15:52:31Z`
+- source_url: `https://erdosproblems.com/range/1-end`
+- total_open: `691`
+
+- [#1](https://erdosproblems.com/1) — OPEN | $500 | number theory, additive combinatorics — edited: 23 January 2026 — 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$...
+- [#3](https://erdosproblems.com/3) — OPEN | $5000 | number theory, additive combinatorics, arithmetic progressions — edited: 23 January 2026 — If $A\subseteq \mathbb{N}$ has $\sum_{n\in A}\frac{1}{n}=\infty$ then must $A$ contain arbitrarily long arithmetic progressions?
+- [#5](https://erdosproblems.com/5) — OPEN | number theory, primes — 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?\]
+- [#7](https://erdosproblems.com/7) — VERIFIABLE | $25 | number theory, covering systems — edited: 22 January 2026 — Is there a distinct covering system all of whose moduli are odd?
+- [#9](https://erdosproblems.com/9) — OPEN | number theory, additive basis, primes — edited: 20 January 2026 — Let $A$ be the set of all odd integers $\geq 1$ not of the form $p+2^{k}+2^l$ (where $k,l\geq 0$ and $p$ is prime). Is the upper density...
+- [#10](https://erdosproblems.com/10) — OPEN | number theory, additive basis, primes — edited: 24 January 2026 — Is there some $k$ such that every large integer is the sum of a prime and at most $k$ powers of 2?
+- [#11](https://erdosproblems.com/11) — FALSIFIABLE | number theory, additive basis — edited: 20 January 2026 — Is every large odd integer $n$ the sum of a squarefree number and a power of 2?
+- [#12](https://erdosproblems.com/12) — OPEN | number theory — 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\[\...
+- [#14](https://erdosproblems.com/14) — OPEN | number theory, sidon sets, additive combinatorics — edited: 14 September 2025 — 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...
+- [#15](https://erdosproblems.com/15) — OPEN | number theory, primes — Is it true that\[\sum_{n=1}^\infty(-1)^n\frac{n}{p_n}\]converges, where $p_n$ is the sequence of primes?
+- [#17](https://erdosproblems.com/17) — OPEN | number theory, primes — edited: 28 December 2025 — 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 $...
+- [#18](https://erdosproblems.com/18) — OPEN | $250 | number theory, divisors, factorials — edited: 20 January 2026 — We call $m$ practical if every integer $1\leq n<m$ is the sum of distinct divisors of $m$. If $m$ is practical then let $h(m)$ be such th...
+- [#20](https://erdosproblems.com/20) — OPEN | $1000 | combinatorics — edited: 25 January 2026 — 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 $...
+- [#23](https://erdosproblems.com/23) — FALSIFIABLE | graph theory — edited: 18 January 2026 — Can every triangle-free graph on $5n$ vertices be made bipartite by deleting at most $n^2$ edges?
+- [#25](https://erdosproblems.com/25) — OPEN | number theory — edited: 20 January 2026 — Let $1\leq 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 se...
+- [#28](https://erdosproblems.com/28) — OPEN | $500 | number theory, additive basis — edited: 23 January 2026 — 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$.
+- [#30](https://erdosproblems.com/30) — OPEN | $1000 | number theory, sidon sets, additive combinatorics — edited: 23 January 2026 — 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^...
+- [#32](https://erdosproblems.com/32) — OPEN | $50 | number theory, additive basis — edited: 23 January 2026 — 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...
+- [#33](https://erdosproblems.com/33) — OPEN | number theory, additive basis — edited: 27 December 2025 — 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...
+- [#36](https://erdosproblems.com/36) — OPEN | number theory, additive combinatorics — edited: 23 January 2026 — 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 partit...
+- [#38](https://erdosproblems.com/38) — OPEN | number theory — edited: 16 September 2025 — 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 Schnirelma...
+- [#39](https://erdosproblems.com/39) — OPEN | $500 | number theory, sidon sets, additive combinatorics — edited: 23 January 2026 — 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 $...
+- [#40](https://erdosproblems.com/40) — OPEN | $500 | number theory, additive basis — 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...
+- [#41](https://erdosproblems.com/41) — OPEN | $500 | number theory, sidon sets, additive combinatorics — edited: 23 January 2026 — 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 c...
+- [#42](https://erdosproblems.com/42) — OPEN | number theory, sidon sets, additive combinatorics — edited: 23 January 2026 — 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 anoth...
+- [#43](https://erdosproblems.com/43) — OPEN | $100 | number theory, sidon sets, additive combinatorics — edited: 20 December 2025 — 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}+\bino...
+- [#44](https://erdosproblems.com/44) — OPEN | number theory, sidon sets, additive combinatorics — edited: 09 January 2026 — 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,\l...
+- [#50](https://erdosproblems.com/50) — OPEN | $250 | number theory — 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 $...
+- [#51](https://erdosproblems.com/51) — OPEN | number theory — edited: 30 September 2025 — 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_...
+- [#52](https://erdosproblems.com/52) — OPEN | $250 | number theory, additive combinatorics — edited: 23 January 2026 — 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...
+- [#60](https://erdosproblems.com/60) — OPEN | graph theory, cycles — edited: 18 November 2025 — Does every graph on $n$ vertices with $>\mathrm{ex}(n;C_4)$ edges contain $\gg n^{1/2}$ many copies of $C_4$?
+- [#61](https://erdosproblems.com/61) — OPEN | graph theory — edited: 23 January 2026 — 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 con...
+- [#62](https://erdosproblems.com/62) — OPEN | graph theory — edited: 23 January 2026 — 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 $\a...
+- [#64](https://erdosproblems.com/64) — FALSIFIABLE | $1000 | graph theory, cycles — edited: 18 January 2026 — Does every finite graph with minimum degree at least 3 contain a cycle of length $2^k$ for some $k\geq 2$?
+- [#65](https://erdosproblems.com/65) — OPEN | graph theory, cycles — edited: 08 February 2026 — 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}...
+- [#66](https://erdosproblems.com/66) — OPEN | $500 | number theory, additive basis — edited: 23 January 2026 — Is there $A\subseteq \mathbb{N}$ such that\[\lim_{n\to \infty}\frac{1_A\ast 1_A(n)}{\log n}\]exists and is $\neq 0$?
+- [#68](https://erdosproblems.com/68) — OPEN | number theory, irrationality — edited: 28 September 2025 — Is\[\sum_{n\geq 2}\frac{1}{n!-1}\]irrational?
+- [#70](https://erdosproblems.com/70) — OPEN | graph theory, ramsey theory, set theory — edited: 23 January 2026 — 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...
+- [#74](https://erdosproblems.com/74) — OPEN | $500 | graph theory, chromatic number, cycles — edited: 25 January 2026 — Let $f(n)\to \infty$ (possibly very slowly). Is there a graph of infinite chromatic number such that every finite subgraph on $n$ vertice...
+- [#75](https://erdosproblems.com/75) — OPEN | graph theory, chromatic number — edited: 29 January 2026 — Is there a graph of chromatic number $\aleph_1$ with $\aleph_1$ vertices such that for all $\epsilon>0$ if $n$ is sufficiently large and...
+- [#77](https://erdosproblems.com/77) — OPEN | $250 | graph theory, ramsey theory — edited: 08 February 2026 — If $R(k)$ is the Ramsey number for $K_k$, the minimal $n$ such that every $2$-colouring of the edges of $K_n$ contains a monochromatic co...
+- [#78](https://erdosproblems.com/78) — OPEN | $100 | graph theory, ramsey theory — edited: 23 January 2026 — Let $R(k)$ be the Ramsey number for $K_k$, the minimal $n$ such that every $2$-colouring of the edges of $K_n$ contains a monochromatic c...
+- [#80](https://erdosproblems.com/80) — OPEN | graph theory, ramsey theory — Let $c>0$ and let $f_c(n)$ be the maximal $m$ such that every graph $G$ with $n$ vertices and at least $cn^2$ edges, where each edge is c...
+- [#81](https://erdosproblems.com/81) — OPEN | graph theory — edited: 28 December 2025 — Let $G$ be a chordal graph on $n$ vertices - that is, $G$ has no induced cycles of length greater than $3$. Can the edges of $G$ be parti...
+- [#82](https://erdosproblems.com/82) — OPEN | graph theory — edited: 06 October 2025 — Let $F(n)$ be maximal such that every graph on $n$ vertices contains a regular induced subgraph on at least $F(n)$ vertices. Prove that $...
+- [#84](https://erdosproblems.com/84) — OPEN | graph theory, cycles — The cycle set of a graph $G$ on $n$ vertices is a set $A\subseteq \{3,\ldots,n\}$ such that there is a cycle in $G$ of length $\ell$ if a...
+- [#85](https://erdosproblems.com/85) — FALSIFIABLE | graph theory, ramsey theory — edited: 06 December 2025 — Let $n\geq 4$ and $f(n)$ be minimal such that every graph on $n$ vertices with minimal degree $\geq f(n)$ contains a $C_4$. Is it true th...
+- [#86](https://erdosproblems.com/86) — OPEN | $100 | graph theory — edited: 27 December 2025 — Let $Q_n$ be the $n$-dimensional hypercube graph (so that $Q_n$ has $2^n$ vertices and $n2^{n-1}$ edges). Is it true that every subgraph...
+- [#87](https://erdosproblems.com/87) — OPEN | graph theory, ramsey theory — edited: 17 January 2026 — Let $\epsilon >0$. Is it true that, if $k$ is sufficiently large, then\[R(G)>(1-\epsilon)^kR(k)\]for every graph $G$ with chromatic numbe...
+- [#89](https://erdosproblems.com/89) — OPEN | $500 | geometry, distances — edited: 23 January 2026 — Does every set of $n$ distinct points in $\mathbb{R}^2$ determine $\gg n/\sqrt{\log n}$ many distinct distances?
+- [#90](https://erdosproblems.com/90) — OPEN | $500 | geometry, distances — edited: 23 January 2026 — Does every set of $n$ distinct points in $\mathbb{R}^2$ contain at most $n^{1+O(1/\log\log n)}$ many pairs which are distance 1 apart?
+- [#91](https://erdosproblems.com/91) — OPEN | geometry, distances — edited: 16 January 2026 — Let $n$ be a sufficently large integer. Suppose $A\subset \mathbb{R}^2$ has $\lvert A\rvert=n$ and minimises the number of distinct dista...
+- [#92](https://erdosproblems.com/92) — OPEN | $500 | geometry, distances — edited: 28 December 2025 — Let $f(n)$ be maximal such that there exists a set $A$ of $n$ points in $\mathbb{R}^2$ in which every $x\in A$ has at least $f(n)$ points...
+- [#96](https://erdosproblems.com/96) — OPEN | geometry, distances, convex — edited: 23 January 2026 — If $n$ points in $\mathbb{R}^2$ form a convex polygon then there are $O(n)$ many pairs which are distance $1$ apart.
+- [#97](https://erdosproblems.com/97) — FALSIFIABLE | $100 | geometry, distances, convex — edited: 27 October 2025 — Does every convex polygon have a vertex with no other $4$ vertices equidistant from it?
+- [#98](https://erdosproblems.com/98) — OPEN | geometry, distances — edited: 15 October 2025 — Let $h(n)$ be such that any $n$ points in $\mathbb{R}^2$, with no three on a line and no four on a circle, determine at least $h(n)$ dist...
+- [#99](https://erdosproblems.com/99) — OPEN | $100 | geometry, distances — Let $A\subseteq\mathbb{R}^2$ be a set of $n$ points with minimum distance equal to 1, chosen to minimise the diameter of $A$. If $n$ is s...
+- [#100](https://erdosproblems.com/100) — OPEN | geometry, distances — Let $A$ be a set of $n$ points in $\mathbb{R}^2$ such that all pairwise distances are at least $1$ and if two distinct distances differ t...
+- [#101](https://erdosproblems.com/101) — OPEN | $100 | geometry — edited: 27 December 2025 — 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)$.
+- [#102](https://erdosproblems.com/102) — OPEN | geometry — 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...
+- [#103](https://erdosproblems.com/103) — OPEN | geometry, distances — Let $h(n)$ count the number of incongruent sets of $n$ points in $\mathbb{R}^2$ which minimise the diameter subject to the constraint tha...
+- [#104](https://erdosproblems.com/104) — OPEN | $100 | geometry — Given $n$ points in $\mathbb{R}^2$ the number of distinct unit circles containing at least three points is $o(n^2)$.
+- [#106](https://erdosproblems.com/106) — FALSIFIABLE | geometry — Draw $n$ squares inside the unit square with no common interior point. Let $f(n)$ be the maximum possible sum of the side-lengths of the...
+- [#107](https://erdosproblems.com/107) — FALSIFIABLE | $500 | geometry, convex — edited: 23 January 2026 — Let $f(n)$ be minimal such that any $f(n)$ points in $\mathbb{R}^2$, no three on a line, contain $n$ points which form the vertices of a...
+- [#108](https://erdosproblems.com/108) — OPEN | graph theory, chromatic number, cycles — edited: 23 January 2026 — For every $r\geq 4$ and $k\geq 2$ is there some finite $f(k,r)$ such that every graph of chromatic number $\geq f(k,r)$ contains a subgra...
+- [#111](https://erdosproblems.com/111) — OPEN | graph theory, chromatic number, set theory — If $G$ is a graph let $h_G(n)$ be defined such that any subgraph of $G$ on $n$ vertices can be made bipartite after deleting at most $h_G...
+- [#112](https://erdosproblems.com/112) — OPEN | graph theory, ramsey theory — Let $k=k(n,m)$ be minimal such that any directed graph on $k$ vertices must contain either an independent set of size $n$ or a transitive...
+- [#114](https://erdosproblems.com/114) — OPEN | $250 | polynomials, analysis — edited: 23 January 2026 — If $p(z)\in\mathbb{C}[z]$ is a monic polynomial of degree $n$ then is the length of the curve $\{ z\in \mathbb{C} : \lvert p(z)\rvert=1\}...
+- [#117](https://erdosproblems.com/117) — OPEN | group theory — edited: 23 January 2026 — Let $h(n)$ be minimal such that any group $G$ with the property that any subset of $>n$ elements contains some $x\neq y$ such that $xy=yx...
+- [#119](https://erdosproblems.com/119) — OPEN | $100 | analysis, polynomials — edited: 23 January 2026 — 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)=\pro...
+- [#120](https://erdosproblems.com/120) — OPEN | $100 | combinatorics — edited: 23 January 2026 — 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 s...
+- [#122](https://erdosproblems.com/122) — OPEN | number theory — edited: 01 February 2026 — For which number theoretic functions $f$ is it true that, for any $F(n)$ such that $f(n)/F(n)\to 0$ for almost all $n$, there are infinit...
+- [#123](https://erdosproblems.com/123) — OPEN | $250 | number theory — edited: 20 January 2026 — Let $a,b,c\geq 1$ be three integers which are pairwise coprime. Is every large integer the sum of distinct integers of the form $a^kb^lc^...
+- [#124](https://erdosproblems.com/124) — OPEN | number theory, base representations, complete sequences — edited: 01 December 2025 — For any $d\geq 1$ and $k\geq 0$ let $P(d,k)$ be the set of integers which are the sum of distinct powers $d^i$ with $i\geq k$. Let $3\leq...
+- [#125](https://erdosproblems.com/125) — OPEN | number theory, base representations — Let $A = \{ \sum\epsilon_k3^k : \epsilon_k\in \{0,1\}\}$ be the set of integers which have only the digits $0,1$ when written base $3$, a...
+- [#126](https://erdosproblems.com/126) — OPEN | $250 | number theory — Let $f(n)$ be maximal such that if $A\subseteq\mathbb{N}$ has $\lvert A\rvert=n$ then $\prod_{a\neq b\in A}(a+b)$ has at least $f(n)$ dis...
+- [#128](https://erdosproblems.com/128) — FALSIFIABLE | $250 | graph theory — edited: 31 October 2025 — Let $G$ be a graph with $n$ vertices such that every induced subgraph on $\geq \lfloor n/2\rfloor$ vertices has more than $n^2/50$ edges....
+- [#129](https://erdosproblems.com/129) — OPEN | graph theory, ramsey theory — Let $R(n;k,r)$ be the smallest $N$ such that if the edges of $K_N$ are $r$-coloured then there is a set of $n$ vertices which does not co...
+- [#130](https://erdosproblems.com/130) — OPEN | graph theory, chromatic number — Let $A\subset\mathbb{R}^2$ be an infinite set which contains no three points on a line and no four points on a circle. Consider the graph...
+- [#131](https://erdosproblems.com/131) — OPEN | number theory — edited: 30 September 2025 — 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\backsla...
+- [#132](https://erdosproblems.com/132) — OPEN | $100 | distances — Let $A\subset \mathbb{R}^2$ be a set of $n$ points. Must there be two distances which occur at least once but between at most $n$ pairs o...
+- [#137](https://erdosproblems.com/137) — OPEN | number theory, powerful — edited: 20 January 2026 — We say that $N$ is powerful if whenever $p\mid N$ we also have $p^2\mid N$. Let $k\geq 3$. Can the product of any $k$ consecutive positiv...
+- [#138](https://erdosproblems.com/138) — OPEN | $500 | additive combinatorics — edited: 28 December 2025 — Let the van der Waerden number $W(k)$ be such that whenever $N\geq W(k)$ and $\{1,\ldots,N\}$ is $2$-coloured there must exist a monochro...
+- [#141](https://erdosproblems.com/141) — OPEN | additive combinatorics, primes, arithmetic progressions — edited: 28 September 2025 — Let $k\geq 3$. Are there $k$ consecutive primes in arithmetic progression?
+- [#142](https://erdosproblems.com/142) — OPEN | $10000 | additive combinatorics, arithmetic progressions — edited: 23 January 2026 — 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 progr...
+- [#143](https://erdosproblems.com/143) — OPEN | $500 | primitive sets — Let $A\subset (1,\infty)$ be a countably infinite set such that for all $x\neq y\in A$ and integers $k\geq 1$ we have\[ \lvert kx -y\rver...
+- [#145](https://erdosproblems.com/145) — OPEN | number theory — edited: 19 October 2025 — 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_...
+- [#146](https://erdosproblems.com/146) — OPEN | $500 | graph theory, turan number — edited: 18 January 2026 — If $H$ is bipartite and is $r$-degenerate, that is, every induced subgraph of $H$ has minimum degree $\leq r$, then\[\mathrm{ex}(n;H) \ll...
+- [#148](https://erdosproblems.com/148) — OPEN | number theory, unit fractions — edited: 27 September 2025 — Let $F(k)$ be the number of solutions to\[ 1= \frac{1}{n_1}+\cdots+\frac{1}{n_k},\]where $1\leq n_1<\cdots<n_k$ are distinct integers. Fi...
+- [#149](https://erdosproblems.com/149) — OPEN | graph theory — edited: 01 February 2026 — Let $G$ be a graph with maximum degree $\Delta$. Is $G$ the union of at most $\tfrac{5}{4}\Delta^2$ sets of strongly independent edges (s...
+- [#151](https://erdosproblems.com/151) — OPEN | graph theory — edited: 02 December 2025 — For a graph $G$ let $\tau(G)$ denote the minimal number of vertices that include at least one from each maximal clique of $G$ on at least...
+- [#152](https://erdosproblems.com/152) — OPEN | sidon sets — 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 tha...
+- [#153](https://erdosproblems.com/153) — OPEN | sidon sets — 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 $\...
+- [#155](https://erdosproblems.com/155) — OPEN | additive combinatorics, sidon sets — 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\]f...
+- [#156](https://erdosproblems.com/156) — OPEN | sidon sets — Does there exist a maximal Sidon set $A\subset \{1,\ldots,N\}$ of size $O(N^{1/3})$?
+- [#158](https://erdosproblems.com/158) — OPEN | sidon sets — 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\[\limin...
+- [#159](https://erdosproblems.com/159) — OPEN | graph theory, ramsey theory — There exists some constant $c>0$ such that $$R(C_4,K_n) \ll n^{2-c}.$$
+- [#160](https://erdosproblems.com/160) — OPEN | additive combinatorics, arithmetic progressions — edited: 02 December 2025 — 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...
+- [#161](https://erdosproblems.com/161) — OPEN | $500 | combinatorics, hypergraphs, ramsey theory, discrepancy — edited: 16 January 2026 — Let $\alpha\in[0,1/2)$ and $n,t\geq 1$. Let $F^{(t)}(n,\alpha)$ be the smallest $m$ such that we can $2$-colour the edges of the complete...
+- [#162](https://erdosproblems.com/162) — OPEN | combinatorics, ramsey theory, discrepancy — edited: 30 December 2025 — Let $\alpha>0$ and $n\geq 1$. Let $F(n,\alpha)$ be the largest $k$ such that there exists some 2-colouring of the edges of $K_n$ in which...
+- [#165](https://erdosproblems.com/165) — OPEN | $250 | graph theory, ramsey theory — edited: 28 December 2025 — Give an asymptotic formula for $R(3,k)$.
+- [#167](https://erdosproblems.com/167) — FALSIFIABLE | graph theory — edited: 13 October 2025 — If $G$ is a graph with at most $k$ edge disjoint triangles then can $G$ be made triangle-free after removing at most $2k$ edges?
+- [#168](https://erdosproblems.com/168) — OPEN | additive combinatorics — edited: 24 October 2025 — 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...
+- [#169](https://erdosproblems.com/169) — OPEN | additive combinatorics, arithmetic progressions — Let $k\geq 3$ and $f(k)$ be the supremum of $\sum_{n\in A}\frac{1}{n}$ as $A$ ranges over all sets of positive integers which do not cont...
+- [#170](https://erdosproblems.com/170) — OPEN | additive combinatorics — 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_...
+- [#172](https://erdosproblems.com/172) — OPEN | additive combinatorics, ramsey theory — edited: 01 February 2026 — Is it true that in any finite colouring of $\mathbb{N}$ there exist arbitrarily large finite $A$ such that all sums and products of disti...
+- [#173](https://erdosproblems.com/173) — OPEN | geometry, ramsey theory — edited: 16 October 2025 — In any $2$-colouring of $\mathbb{R}^2$, for all but at most one triangle $T$, there is a monochromatic congruent copy of $T$.
+- [#174](https://erdosproblems.com/174) — OPEN | geometry, ramsey theory — edited: 16 October 2025 — A finite set $A\subset \mathbb{R}^n$ is called Ramsey if, for any $k\geq 1$, there exists some $d=d(A,k)$ such that in any $k$-colouring...
+- [#176](https://erdosproblems.com/176) — OPEN | additive combinatorics, arithmetic progressions, discrepancy — edited: 28 December 2025 — 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$...
+- [#177](https://erdosproblems.com/177) — OPEN | discrepancy, arithmetic progressions — Find the smallest $h(d)$ such that the following holds. There exists a function $f:\mathbb{N}\to\{-1,1\}$ such that, for every $d\geq 1$,...
+- [#180](https://erdosproblems.com/180) — OPEN | graph theory, turan number — edited: 18 January 2026 — If $\mathcal{F}$ is a finite set of finite graphs then $\mathrm{ex}(n;\mathcal{F})$ is the maximum number of edges a graph on $n$ vertice...
+- [#181](https://erdosproblems.com/181) — OPEN | graph theory, ramsey theory — Let $Q_n$ be the $n$-dimensional hypercube graph (so that $Q_n$ has $2^n$ vertices and $n2^{n-1}$ edges). Prove that\[R(Q_n) \ll 2^n.\]
+- [#183](https://erdosproblems.com/183) — OPEN | $250 | graph theory, ramsey theory — Let $R(3;k)$ be the minimal $n$ such that if the edges of $K_n$ are coloured with $k$ colours then there must exist a monochromatic trian...
+- [#184](https://erdosproblems.com/184) — OPEN | graph theory, cycles — Any graph on $n$ vertices can be decomposed into $O(n)$ many edge-disjoint cycles and edges.
+- [#187](https://erdosproblems.com/187) — OPEN | additive combinatorics, ramsey theory, arithmetic progressions — edited: 01 January 2026 — Find the best function $f(d)$ such that, in any 2-colouring of the integers, at least one colour class contains an arithmetic progression...
+- [#188](https://erdosproblems.com/188) — OPEN | geometry, ramsey theory — edited: 14 October 2025 — What is the smallest $k$ such that $\mathbb{R}^2$ can be red/blue coloured with no pair of red points unit distance apart, and no $k$-ter...
+- [#190](https://erdosproblems.com/190) — OPEN | additive combinatorics, arithmetic progressions — edited: 27 October 2025 — Let $H(k)$ be the smallest $N$ such that in any finite colouring of $\{1,\ldots,N\}$ (into any number of colours) there is always either...
+- [#193](https://erdosproblems.com/193) — OPEN | geometry — 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+...
+- [#195](https://erdosproblems.com/195) — OPEN | arithmetic progressions — What is the largest $k$ such that in any permutation of $\mathbb{Z}$ there must exist a monotone $k$-term arithmetic progression $x_1<\cd...
+- [#196](https://erdosproblems.com/196) — OPEN | arithmetic progressions — Must every permutation of $\mathbb{N}$ contain a monotone 4-term arithmetic progression? In other words, given a permutation $x$ of $\mat...
+- [#197](https://erdosproblems.com/197) — OPEN | arithmetic progressions — Can $\mathbb{N}$ be partitioned into two sets, each of which can be permuted to avoid monotone 3-term arithmetic progressions?
+- [#200](https://erdosproblems.com/200) — OPEN | primes, arithmetic progressions — Does the longest arithmetic progression of primes in $\{1,\ldots,N\}$ have length $o(\log N)$?
+- [#201](https://erdosproblems.com/201) — OPEN | additive combinatorics, arithmetic progressions — Let $G_k(N)$ be such that any set of $N$ integers contains a subset of size at least $G_k(N)$ which does not contain a $k$-term arithmeti...
+- [#202](https://erdosproblems.com/202) — OPEN | covering systems — edited: 23 January 2026 — Let $n_1<\cdots < n_r\leq N$ with associated $a_i\pmod{n_i}$ such that the congruence classes are disjoint (that is, every integer is $\e...
+- [#203](https://erdosproblems.com/203) — OPEN | primes, covering systems — edited: 20 January 2026 — Is there an integer $m\geq 1$ with $(m,6)=1$ such that none of $2^k3^\ell m+1$ are prime, for any $k,\ell\geq 0$?
+- [#208](https://erdosproblems.com/208) — OPEN | number theory — edited: 19 October 2025 — 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_\epsilo...
+- [#212](https://erdosproblems.com/212) — OPEN | geometry, distances — edited: 16 October 2025 — Is there a dense subset of $\mathbb{R}^2$ such that all pairwise distances are rational?
+- [#213](https://erdosproblems.com/213) — OPEN | geometry, distances — edited: 16 October 2025 — Let $n\geq 4$. Are there $n$ points in $\mathbb{R}^2$, no three on a line and no four on a circle, such that all pairwise distances are i...
+- [#217](https://erdosproblems.com/217) — OPEN | geometry, distances — edited: 02 October 2025 — 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 distance...
+- [#218](https://erdosproblems.com/218) — OPEN | number theory, primes — edited: 29 January 2026 — Let $d_n=p_{n+1}-p_n$. The set of $n$ such that $d_{n+1}\geq d_n$ has density $1/2$, and similarly for $d_{n+1}\leq d_n$. Furthermore, th...
+- [#222](https://erdosproblems.com/222) — OPEN | number theory, squares — Let $n_1<n_2<\cdots$ be the sequence of integers which are the sum of two squares. Explore the behaviour of (i.e. find good upper and low...
+- [#233](https://erdosproblems.com/233) — OPEN | number theory, primes — edited: 18 January 2026 — Let $d_n=p_{n+1}-p_n$, where $p_n$ is the $n$th prime. Prove that\[\sum_{1\leq n\leq N}d_n^2 \ll N(\log N)^2.\]
+- [#234](https://erdosproblems.com/234) — OPEN | number theory, primes — For every $c\geq 0$ the density $f(c)$ of integers for which\[\frac{p_{n+1}-p_n}{\log n}< c\]exists and is a continuous function of $c$.
+- [#236](https://erdosproblems.com/236) — OPEN | number theory, primes — edited: 23 January 2026 — Let $f(n)$ count the number of solutions to $n=p+2^k$ for prime $p$ and $k\geq 0$. Is it true that $f(n)=o(\log n)$?
+- [#238](https://erdosproblems.com/238) — OPEN | number theory, primes — edited: 13 January 2026 — Let $c_1,c_2>0$. Is it true that, for any sufficiently large $x$, there exist more than $c_1\log x$ many consecutive primes $\leq x$ such...
+- [#241](https://erdosproblems.com/241) — OPEN | $100 | additive combinatorics, sidon sets — edited: 30 September 2025 — 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 t...
+- [#242](https://erdosproblems.com/242) — FALSIFIABLE | number theory, unit fractions — edited: 28 January 2026 — For every $n>2$ there exist distinct integers $1\leq x<y<z$ such that\[\frac{4}{n} = \frac{1}{x}+\frac{1}{y}+\frac{1}{z}.\]
+- [#243](https://erdosproblems.com/243) — OPEN | number theory, irrationality — edited: 21 January 2026 — Let $1\leq a_1<a_2<\cdots$ be a sequence of integers such that\[\lim_{n\to \infty}\frac{a_n}{a_{n-1}^2}=1\]and $\sum\frac{1}{a_n}\in \mat...
+- [#244](https://erdosproblems.com/244) — OPEN | number theory, primes — edited: 28 October 2025 — Let $C>1$. Does the set of integers of the form $p+\lfloor C^k\rfloor$, for some prime $p$ and $k\geq 0$, have density $>0$?
+- [#247](https://erdosproblems.com/247) — OPEN | number theory, irrationality — edited: 20 January 2026 — Let $1\leq a_1<a_2<\cdots$ be a sequence of integers such that\[\limsup \frac{a_n}{n}=\infty.\]Is\[\sum_{n=1}^\infty \frac{1}{2^{a_n}}\]t...
+- [#249](https://erdosproblems.com/249) — OPEN | number theory, irrationality — edited: 28 September 2025 — Is\[\sum_n \frac{\phi(n)}{2^n}\]irrational? Here $\phi$ is the Euler totient function .
+- [#251](https://erdosproblems.com/251) — OPEN | number theory, irrationality — edited: 28 September 2025 — Is\[\sum \frac{p_n}{2^n}\]irrational? (Here $p_n$ is the $n$th prime.)
+- [#252](https://erdosproblems.com/252) — OPEN | number theory, irrationality — edited: 22 January 2026 — Let $k\geq 1$ and $\sigma_k(n)=\sum_{d\mid n}d^k$. Is\[\sum \frac{\sigma_k(n)}{n!}\]irrational?
+- [#254](https://erdosproblems.com/254) — OPEN | number theory — edited: 07 December 2025 — Let $A\subseteq \mathbb{N}$ be such that\[\lvert A\cap [1,2x]\rvert -\lvert A\cap [1,x]\rvert \to \infty\textrm{ as }x\to \infty\]and\[\s...
+- [#256](https://erdosproblems.com/256) — OPEN | analysis — edited: 20 January 2026 — Let $n\geq 1$ and $f(n)$ be maximal such that for any integers $1\leq a_1\leq \cdots \leq a_n$ we have\[\max_{\lvert z\rvert=1}\left\lver...
+- [#257](https://erdosproblems.com/257) — OPEN | irrationality — edited: 02 December 2025 — Let $A\subseteq \mathbb{N}$ be an infinite set. Is\[\sum_{n\in A}\frac{1}{2^n-1}\]irrational?
+- [#258](https://erdosproblems.com/258) — OPEN | irrationality — edited: 20 January 2026 — Let $a_1,a_2,\ldots$ be a sequence of positive integers with $a_n\to \infty$. Is\[\sum_{n} \frac{\tau(n)}{a_1\cdots a_n}\]irrational, whe...
+- [#260](https://erdosproblems.com/260) — OPEN | irrationality — edited: 01 February 2026 — 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?
+- [#261](https://erdosproblems.com/261) — OPEN | number theory — edited: 01 December 2025 — Are there infinitely many $n$ such that there exists some $t\geq 2$ and distinct integers $a_1,\ldots,a_t\geq 1$ such that\[\frac{n}{2^n}...
+- [#263](https://erdosproblems.com/263) — OPEN | irrationality — edited: 20 January 2026 — Let $a_n$ be a sequence of positive integers such that for every sequence of positive integers $b_n$ with $b_n/a_n\to 1$ the sum\[\sum\fr...
+- [#264](https://erdosproblems.com/264) — OPEN | irrationality — edited: 20 January 2026 — Let $a_n$ be a sequence of positive integers such that for every bounded sequence of integers $b_n$ (with $a_n+b_n\neq 0$ and $b_n\neq 0$...
+- [#265](https://erdosproblems.com/265) — OPEN | irrationality — edited: 21 January 2026 — Let $1\leq a_1<a_2<\cdots$ be an increasing sequence of integers. How fast can $a_n\to \infty$ grow if\[\sum\frac{1}{a_n}\quad\textrm{and...
+- [#267](https://erdosproblems.com/267) — OPEN | irrationality — edited: 18 January 2026 — Let $F_1=F_2=1$ and $F_{n+1}=F_n+F_{n-1}$ be the Fibonacci sequence. Let $n_1<n_2<\cdots $ be an infinite sequence with $n_{k+1}/n_k \geq...
+- [#269](https://erdosproblems.com/269) — OPEN | irrationality — edited: 28 December 2025 — Let $P$ be a finite set of primes with $\lvert P\rvert \geq 2$ and let $\{a_1<a_2<\cdots\}=\{ n\in \mathbb{N} : \textrm{if }p\mid n\textr...
+- [#271](https://erdosproblems.com/271) — OPEN | additive combinatorics, arithmetic progressions — edited: 20 January 2026 — Let $A(n)=\{a_0<a_1<\cdots\}$ be the sequence defined by $a_0=0$ and $a_1=n$, and for $k\geq 1$ define $a_{k+1}$ as the least positive in...
+- [#272](https://erdosproblems.com/272) — OPEN | additive combinatorics, arithmetic progressions — Let $N\geq 1$. What is the largest $t$ such that there are $A_1,\ldots,A_t\subseteq \{1,\ldots,N\}$ with $A_i\cap A_j$ a non-empty arithm...
+- [#273](https://erdosproblems.com/273) — OPEN | number theory, covering systems — edited: 01 October 2025 — Is there a covering system all of whose moduli are of the form $p-1$ for some primes $p\geq 5$?
+- [#274](https://erdosproblems.com/274) — OPEN | group theory, covering systems — edited: 31 October 2025 — If $G$ is a group then can there exist an exact covering of $G$ by more than one cosets of different sizes? (i.e. each element is contain...
+- [#276](https://erdosproblems.com/276) — OPEN | number theory, covering systems — edited: 29 December 2025 — Is there an infinite Lucas sequence $a_0,a_1,\ldots$ where $a_{n+2}=a_{n+1}+a_n$ for $n\geq 0$ such that all $a_k$ are composite, and yet...
+- [#278](https://erdosproblems.com/278) — OPEN | number theory, covering systems — edited: 20 January 2026 — Let $A=\{n_1<\cdots<n_r\}$ be a finite set of positive integers. What is the maximum density of integers covered by a suitable choice of...
+- [#279](https://erdosproblems.com/279) — OPEN | number theory, covering systems, primes — edited: 20 January 2026 — Let $k\geq 3$. Is there a choice of congruence classes $a_p\pmod{p}$ for every prime $p$ such that all sufficiently large integers can be...
+- [#282](https://erdosproblems.com/282) — OPEN | number theory, unit fractions — Let $A\subseteq \mathbb{N}$ be an infinite set and consider the following greedy algorithm for a rational $x\in (0,1)$: choose the minima...
+- [#283](https://erdosproblems.com/283) — OPEN | number theory, unit fractions — edited: 28 December 2025 — Let $p:\mathbb{Z}\to \mathbb{Z}$ be a polynomial whose leading coefficient is positive and such that there exists no $d\geq 2$ with $d\mi...
+- [#287](https://erdosproblems.com/287) — FALSIFIABLE | number theory, unit fractions — edited: 23 January 2026 — Let $k\geq 2$. Is it true that, for any distinct integers $1<n_1<\cdots <n_k$ such that\[1=\frac{1}{n_1}+\cdots+\frac{1}{n_k}\]we must ha...
+- [#288](https://erdosproblems.com/288) — OPEN | number theory, unit fractions — 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}\fra...
+- [#289](https://erdosproblems.com/289) — OPEN | number theory, unit fractions — edited: 22 September 2025 — Is it true that, for all sufficiently large $k$, there exist finite intervals $I_1,\ldots,I_k\subset \mathbb{N}$, distinct, not overlappi...
+- [#291](https://erdosproblems.com/291) — OPEN | number theory, unit fractions — edited: 12 January 2026 — Let $n\geq 1$ and define $L_n$ to be the least common multiple of $\{1,\ldots,n\}$ and $a_n$ by\[\sum_{1\leq k\leq n}\frac{1}{k}=\frac{a_...
+- [#293](https://erdosproblems.com/293) — OPEN | number theory, unit fractions — edited: 29 December 2025 — Let $k\geq 1$ and let $v(k)$ be the minimal integer which does not appear as some $n_i$ in a solution to\[1=\frac{1}{n_1}+\cdots+\frac{1}...
+- [#295](https://erdosproblems.com/295) — OPEN | number theory, unit fractions — edited: 01 October 2025 — 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}{...
+- [#301](https://erdosproblems.com/301) — OPEN | number theory, unit fractions — edited: 16 January 2026 — Let $f(N)$ be the size of the largest $A\subseteq \{1,\ldots,N\}$ such that there are no solutions to\[\frac{1}{a}= \frac{1}{b_1}+\cdots+...
+- [#302](https://erdosproblems.com/302) — OPEN | number theory, unit fractions — Let $f(N)$ be the size of the largest $A\subseteq \{1,\ldots,N\}$ such that there are no solutions to\[\frac{1}{a}= \frac{1}{b}+\frac{1}{...
+- [#304](https://erdosproblems.com/304) — OPEN | number theory, unit fractions — edited: 29 December 2025 — For integers $1\leq a<b$ let $N(a,b)$ denote the minimal $k$ such that there exist integers $1<n_1<\cdots<n_k$ with\[\frac{a}{b}=\frac{1}...
+- [#306](https://erdosproblems.com/306) — OPEN | number theory, unit fractions — Let $a/b\in \mathbb{Q}_{>0}$ with $b$ squarefree. Are there integers $1<n_1<\cdots<n_k$, each the product of two distinct primes, such th...
+- [#307](https://erdosproblems.com/307) — VERIFIABLE | number theory, unit fractions — Are there two finite sets of primes $P,Q$ such that\[1=\left(\sum_{p\in P}\frac{1}{p}\right)\left(\sum_{q\in Q}\frac{1}{q}\right)?\]
+- [#311](https://erdosproblems.com/311) — OPEN | number theory, unit fractions — edited: 16 January 2026 — Let $\delta(N)$ be the minimal non-zero value of $\lvert 1-\sum_{n\in A}\frac{1}{n}\rvert$ as $A$ ranges over all subsets of $\{1,\ldots,...
+- [#312](https://erdosproblems.com/312) — OPEN | number theory, unit fractions — edited: 20 January 2026 — Does there exist some $c>0$ such that, for any $K>1$, whenever $A$ is a sufficiently large finite multiset of positive integers with $\su...
+- [#313](https://erdosproblems.com/313) — OPEN | number theory, unit fractions — Are there infinitely many solutions to\[\frac{1}{p_1}+\cdots+\frac{1}{p_k}=1-\frac{1}{m},\]where $m\geq 2$ is an integer and $p_1<\cdots<...
+- [#317](https://erdosproblems.com/317) — OPEN | number theory, unit fractions — edited: 06 January 2026 — Is there some constant $c>0$ such that for every $n\geq 1$ there exists some $\delta_k\in \{-1,0,1\}$ for $1\leq k\leq n$ with\[0< \left\...
+- [#318](https://erdosproblems.com/318) — OPEN | number theory, unit fractions — edited: 20 December 2025 — Let $A\subseteq \mathbb{N}$ be an infinite arithmetic progression and $f:A\to \{-1,1\}$ be a non-constant function. Must there exist a fi...
+- [#319](https://erdosproblems.com/319) — OPEN | number theory, unit fractions — What is the size of the largest $A\subseteq \{1,\ldots,N\}$ such that there is a function $\delta:A\to \{-1,1\}$ such that\[\sum_{n\in A}...
+- [#320](https://erdosproblems.com/320) — OPEN | number theory, unit fractions — edited: 28 September 2025 — Let $S(N)$ count the number of distinct sums of the form $\sum_{n\in A}\frac{1}{n}$ for $A\subseteq \{1,\ldots,N\}$. Estimate $S(N)$.
+- [#321](https://erdosproblems.com/321) — OPEN | number theory, unit fractions — edited: 28 September 2025 — What is the size of the largest $A\subseteq \{1,\ldots,N\}$ such that all sums $\sum_{n\in S}\frac{1}{n}$ are distinct for $S\subseteq A$?
+- [#322](https://erdosproblems.com/322) — OPEN | number theory, powers — edited: 30 September 2025 — Let $k\geq 3$ and $A\subset \mathbb{N}$ be the set of $k$th powers. What is the order of growth of $1_A^{(k)}(n)$, i.e. the number of rep...
+- [#323](https://erdosproblems.com/323) — OPEN | number theory, powers — Let $1\leq m\leq k$ and $f_{k,m}(x)$ denote the number of integers $\leq x$ which are the sum of $m$ many nonnegative $k$th powers. Is it...
+- [#324](https://erdosproblems.com/324) — OPEN | number theory, powers — Does there exist a polynomial $f(x)\in\mathbb{Z}[x]$ such that all the sums $f(a)+f(b)$ with $a<b$ nonnegative integers are distinct?
+- [#325](https://erdosproblems.com/325) — OPEN | number theory, powers — Let $k\geq 3$ and $f_{k,3}(x)$ denote the number of integers $\leq x$ which are the sum of three nonnegative $k$th powers. Is it true tha...
+- [#326](https://erdosproblems.com/326) — OPEN | number theory, additive basis — Let $A\subset \mathbb{N}$ be an additive basis of order $2$. Must there exist $B=\{b_1<b_2<\cdots\}\subseteq A$ which is also a basis suc...
+- [#327](https://erdosproblems.com/327) — OPEN | number theory, unit fractions — Suppose $A\subseteq \{1,\ldots,N\}$ is such that if $a,b\in A$ and $a\neq b$ then $a+b\nmid ab$. Can $A$ be 'substantially more' than the...
+- [#329](https://erdosproblems.com/329) — OPEN | number theory, sidon sets — edited: 18 November 2025 — Suppose $A\subseteq \mathbb{N}$ is a Sidon set. How large can\[\limsup_{N\to \infty}\frac{\lvert A\cap \{1,\ldots,N\}\rvert}{N^{1/2}}\]be?
+- [#330](https://erdosproblems.com/330) — OPEN | number theory, additive basis — edited: 08 December 2025 — Does there exist a minimal basis with positive density, say $A\subset\mathbb{N}$, such that for any $n\in A$ the (upper) density of integ...
+- [#332](https://erdosproblems.com/332) — OPEN | number theory — edited: 28 October 2025 — Let $A\subseteq \mathbb{N}$ and $D(A)$ be the set of those numbers which occur infinitely often as $a_1-a_2$ with $a_1,a_2\in A$. What co...
+- [#334](https://erdosproblems.com/334) — OPEN | number theory — Find the best function $f(n)$ such that every $n$ can be written as $n=a+b$ where both $a,b$ are $f(n)$-smooth (that is, are not divisibl...
+- [#335](https://erdosproblems.com/335) — OPEN | number theory, additive combinatorics — edited: 28 September 2025 — Let $d(A)$ denote the density of $A\subseteq \mathbb{N}$. Characterise those $A,B\subseteq \mathbb{N}$ with positive density such that\[d...
+- [#336](https://erdosproblems.com/336) — OPEN | number theory, additive basis — edited: 28 October 2025 — For $r\geq 2$ let $h(r)$ be the maximal finite $k$ such that there exists a basis $A\subseteq \mathbb{N}$ of order $r$ (so every large in...
+- [#338](https://erdosproblems.com/338) — OPEN | number theory, additive basis — edited: 14 September 2025 — The restricted order of a basis is the least integer $t$ (if it exists) such that every large integer is the sum of at most $t$ distinct...
+- [#340](https://erdosproblems.com/340) — OPEN | number theory, additive combinatorics, sidon sets — edited: 18 November 2025 — Let $A=\{1,2,4,8,13,21,31,45,66,81,97,\ldots\}$ be the greedy Sidon sequence: we begin with $1$ and iteratively include the next smallest...
+- [#341](https://erdosproblems.com/341) — OPEN | number theory — edited: 20 January 2026 — Let $A=\{a_1<\cdots<a_k\}$ be a finite set of positive integers and extend it to an infinite sequence $\overline{A}=\{a_1<a_2<\cdots \}$...
+- [#342](https://erdosproblems.com/342) — OPEN | number theory — edited: 30 September 2025 — With $a_1=1$ and $a_2=2$ let $a_{n+1}$ for $n\geq 2$ be the least integer $>a_n$ which can be expressed uniquely as $a_i+a_j$ for $i<j\le...
+- [#345](https://erdosproblems.com/345) — OPEN | number theory, complete sequences — edited: 28 December 2025 — Let $A\subseteq \mathbb{N}$ be a complete sequence, and define the threshold of completeness $T(A)$ to be the least integer $m$ such that...
+- [#346](https://erdosproblems.com/346) — OPEN | number theory, complete sequences — edited: 07 December 2025 — Let $A=\{1\leq a_1< a_2<\cdots\}$ be a set of integers such that $A\backslash B$ is complete for any finite subset $B$ and $A\backslash B...
+- [#348](https://erdosproblems.com/348) — OPEN | number theory, complete sequences — For what values of $0\leq m<n$ is there a complete sequence $A=\{a_1\leq a_2\leq \cdots\}$ of integers such that $A$ remains complete aft...
+- [#349](https://erdosproblems.com/349) — OPEN | number theory, complete sequences — For what values of $t,\alpha \in (0,\infty)$ is the sequence $\lfloor t\alpha^n\rfloor$ complete (that is, all sufficiently large integer...
+- [#351](https://erdosproblems.com/351) — OPEN | number theory, complete sequences — edited: 02 December 2025 — Let $p(x)\in \mathbb{Q}[x]$. Is it true that\[A=\{ p(n)+1/n : n\in \mathbb{N}\}\]is strongly complete, in the sense that, for any finite...
+- [#352](https://erdosproblems.com/352) — OPEN | geometry — edited: 23 January 2026 — Is there some $c>0$ such that every measurable $A\subseteq \mathbb{R}^2$ of measure $\geq c$ contains the vertices of a triangle of area 1?
+- [#354](https://erdosproblems.com/354) — OPEN | number theory, complete sequences — edited: 01 December 2025 — Let $\alpha,\beta\in \mathbb{R}_{>0}$ such that $\alpha/\beta$ is irrational. Is the multiset\[\{ \lfloor \alpha\rfloor,\lfloor 2\alpha\r...
+- [#357](https://erdosproblems.com/357) — OPEN | number theory — edited: 12 January 2026 — Let $1\leq a_1<\cdots <a_k\leq n$ be integers such that all sums of the shape $\sum_{u\leq i\leq v}a_i$ are distinct. Let $f(n)$ be the m...
+- [#358](https://erdosproblems.com/358) — OPEN | number theory, additive basis, primes — edited: 01 October 2025 — Let $A=\{a_1<\cdots\}$ be an infinite sequence of integers. Let $f(n)$ count the number of solutions to\[n=\sum_{u\leq i\leq v}a_i.\]Is t...
+- [#359](https://erdosproblems.com/359) — OPEN | number theory — edited: 28 December 2025 — Let $a_1<a_2<\cdots$ be an infinite sequence of integers such that $a_1=n$ and $a_{i+1}$ is the least integer which is not a sum of conse...
+- [#361](https://erdosproblems.com/361) — OPEN | number theory — edited: 17 October 2025 — Let $c>0$ and $n$ be some large integer. What is the size of the largest $A\subseteq \{1,\ldots,\lfloor cn\rfloor\}$ such that $n$ is not...
+- [#364](https://erdosproblems.com/364) — VERIFIABLE | number theory, powerful — edited: 20 December 2025 — Are there any triples of consecutive positive integers all of which are powerful (i.e. if $p\mid n$ then $p^2\mid n$)?
+- [#365](https://erdosproblems.com/365) — OPEN | number theory, powerful — edited: 31 October 2025 — Do all pairs of consecutive powerful numbers $n$ and $n+1$ come from solutions to Pell equations ? In other words, must either $n$ or $n+...
+- [#366](https://erdosproblems.com/366) — VERIFIABLE | number theory, powerful — edited: 20 December 2025 — Are there any 2-full $n$ such that $n+1$ is 3-full? That is, if $p\mid n$ then $p^2\mid n$ and if $p\mid n+1$ then $p^3\mid n+1$.
+- [#367](https://erdosproblems.com/367) — OPEN | number theory, powerful — edited: 08 February 2026 — Let $B_2(n)$ be the 2-full part of $n$ (that is, $B_2(n)=n/n'$ where $n'$ is the product of all primes that divide $n$ exactly once). Is...
+- [#368](https://erdosproblems.com/368) — OPEN | number theory — How large is the largest prime factor of $n(n+1)$?
+- [#369](https://erdosproblems.com/369) — OPEN | number theory — Let $\epsilon>0$ and $k\geq 2$. Is it true that, for all sufficiently large $n$, there is a sequence of $k$ consecutive integers in $\{1,...
+- [#371](https://erdosproblems.com/371) — OPEN | number theory — edited: 23 January 2026 — Let $P(n)$ denote the largest prime factor of $n$. Show that the set of $n$ with $P(n)<P(n+1)$ has density $1/2$.
+- [#373](https://erdosproblems.com/373) — OPEN | number theory, factorials — edited: 29 January 2026 — Show that the equation\[n! = a_1!a_2!\cdots a_k!,\]with $n-1>a_1\geq a_2\geq \cdots \geq a_k\geq 2$, has only finitely many solutions.
+- [#374](https://erdosproblems.com/374) — OPEN | number theory — For any $m\in \mathbb{N}$, let $F(m)$ be the minimal $k\geq 2$ (if it exists) such that there are $a_1<\cdots <a_k=m$ with $a_1!\cdots a_...
+- [#375](https://erdosproblems.com/375) — FALSIFIABLE | number theory, primes — edited: 24 January 2026 — Is it true that for any $n,k\geq 1$, if $n+1,\ldots,n+k$ are all composite then there are distinct primes $p_1,\ldots,p_k$ such that $p_i...
+- [#376](https://erdosproblems.com/376) — OPEN | number theory, binomial coefficients, base representations — edited: 28 December 2025 — Are there infinitely many $n$ such that $\binom{2n}{n}$ is coprime to $105$?
+- [#377](https://erdosproblems.com/377) — OPEN | number theory, binomial coefficients — edited: 30 September 2025 — Is there some absolute constant $C>0$ such that\[\sum_{p\leq n}1_{p\nmid \binom{2n}{n}}\frac{1}{p}\leq C\]for all $n$ (where the summatio...
+- [#380](https://erdosproblems.com/380) — OPEN | number theory — We call an interval $[u,v]$ 'bad' if the greatest prime factor of $\prod_{u\leq m\leq v}m$ occurs with an exponent greater than $1$. Let...
+- [#382](https://erdosproblems.com/382) — OPEN | number theory — Let $u\leq v$ be such that the largest prime dividing $\prod_{u\leq m\leq v}m$ appears with exponent at least $2$. Is it true that $v-u=v...
+- [#383](https://erdosproblems.com/383) — OPEN | number theory — Is it true that for every $k$ there are infinitely many primes $p$ such that the largest prime divisor of\[\prod_{0\leq i\leq k}(p^2+i)\]...
+- [#385](https://erdosproblems.com/385) — OPEN | number theory — Let\[F(n) = \max_{\substack{m<n\\ m\textrm{ composite}}} m+p(m),\]where $p(m)$ is the least prime divisor of $m$. Is it true that $F(n)>n...
+- [#386](https://erdosproblems.com/386) — OPEN | number theory, binomial coefficients — Let $2\leq k\leq n-2$. Can $\binom{n}{k}$ be the product of consecutive primes infinitely often? For example\[\binom{21}{2}=2\cdot 3\cdot...
+- [#387](https://erdosproblems.com/387) — OPEN | number theory, binomial coefficients — edited: 23 January 2026 — Is there an absolute constant $c>0$ such that, for all $1\leq k< n$, the binomial coefficient $\binom{n}{k}$ has a divisor in $(cn,n]$?
+- [#388](https://erdosproblems.com/388) — OPEN | number theory — Can one classify all solutions of\[\prod_{1\leq i\leq k_1}(m_1+i)=\prod_{1\leq j\leq k_2}(m_2+j)\]where $k_1,k_2>3$ and $m_1+k_1\leq m_2$...
+- [#389](https://erdosproblems.com/389) — OPEN | number theory — Is it true that for every $n\geq 1$ there is a $k$ such that\[n(n+1)\cdots(n+k-1)\mid (n+k)\cdots (n+2k-1)?\]
+- [#390](https://erdosproblems.com/390) — OPEN | number theory, factorials — Let $f(n)$ be the minimal $m$ such that\[n! = a_1\cdots a_k\]with $n< a_1<\cdots <a_k=m$. Is there (and what is it) a constant $c$ such t...
+- [#393](https://erdosproblems.com/393) — OPEN | number theory, factorials — Let $f(n)$ denote the minimal $m\geq 1$ such that\[n! = a_1\cdots a_t\]with $a_1<\cdots <a_t=a_1+m$. What is the behaviour of $f(n)$?
+- [#394](https://erdosproblems.com/394) — OPEN | number theory — edited: 28 October 2025 — Let $t_k(n)$ denote the least $m$ such that\[n\mid m(m+1)(m+2)\cdots (m+k-1).\]Is it true that\[\sum_{n\leq x}t_2(n)\ll \frac{x^2}{(\log...
+- [#396](https://erdosproblems.com/396) — OPEN | number theory, binomial coefficients — Is it true that for every $k$ there exists $n$ such that\[\prod_{0\leq i\leq k}(n-i) \mid \binom{2n}{n}?\]
+- [#398](https://erdosproblems.com/398) — FALSIFIABLE | number theory, factorials — Are the only solutions to\[n!=x^2-1\]when $n=4,5,7$?
+- [#400](https://erdosproblems.com/400) — OPEN | number theory, factorials — For any $k\geq 2$ let $g_k(n)$ denote the maximum value of\[(a_1+\cdots+a_k)-n\]where $a_1,\ldots,a_k$ are integers such that $a_1!\cdots...
+- [#404](https://erdosproblems.com/404) — OPEN | number theory, factorials — edited: 29 September 2025 — For which integers $a\geq 1$ and primes $p$ is there a finite upper bound on those $k$ such that there are $a=a_1<\cdots<a_n$ with\[p^k \...
+- [#406](https://erdosproblems.com/406) — OPEN | number theory, base representations — edited: 30 September 2025 — Is it true that there are only finitely many powers of $2$ which have only the digits $0$ and $1$ when written in base $3$?
+- [#408](https://erdosproblems.com/408) — OPEN | number theory, iterated functions — edited: 30 September 2025 — Let $\phi(n)$ be the Euler totient function and $\phi_k(n)$ be the iterated $\phi$ function, so that $\phi_1(n)=\phi(n)$ and $\phi_k(n)=\...
+- [#409](https://erdosproblems.com/409) — OPEN | number theory, iterated functions — edited: 20 December 2025 — How many iterations of $n\mapsto \phi(n)+1$ are needed before a prime is reached? Can infinitely many $n$ reach the same prime? What is t...
+- [#410](https://erdosproblems.com/410) — OPEN | number theory, iterated functions — edited: 18 January 2026 — Let $\sigma_1(n)=\sigma(n)$, the sum of divisors function, and $\sigma_k(n)=\sigma(\sigma_{k-1}(n))$. Is it true that for all $n\geq 2$\[...
+- [#411](https://erdosproblems.com/411) — OPEN | number theory, iterated functions — edited: 28 October 2025 — Let $g_1=g(n)=n+\phi(n)$ and $g_k(n)=g(g_{k-1}(n))$. For which $n$ and $r$ is it true that $g_{k+r}(n)=2g_k(n)$ for all large $k$?
+- [#412](https://erdosproblems.com/412) — OPEN | number theory, iterated functions — Let $\sigma_1(n)=\sigma(n)$, the sum of divisors function, and $\sigma_k(n)=\sigma(\sigma_{k-1}(n))$. Is it true that, for every $m,n\geq...
+- [#413](https://erdosproblems.com/413) — OPEN | number theory, iterated functions — edited: 28 December 2025 — Let $\omega(n)$ count the number of distinct primes dividing $n$. Are there infinitely many $n$ such that, for all $m<n$, we have $m+\ome...
+- [#414](https://erdosproblems.com/414) — OPEN | number theory, iterated functions — edited: 16 November 2025 — Let $h_1(n)=h(n)=n+\tau(n)$ (where $\tau(n)$ counts the number of divisors of $n$) and $h_k(n)=h(h_{k-1}(n))$. Is it true, for any $m,n$,...
+- [#415](https://erdosproblems.com/415) — OPEN | number theory — For any $n$ let $F(n)$ be the largest $k$ such that any of the $k!$ possible ordering patterns appears in some sequence of $\phi(m+1),\ld...
+- [#416](https://erdosproblems.com/416) — OPEN | number theory — edited: 30 September 2025 — Let $V(x)$ count the number of $n\leq x$ such that $\phi(m)=n$ is solvable. Does $V(2x)/V(x)\to 2$? Is there an asymptotic formula for $V...
+- [#417](https://erdosproblems.com/417) — OPEN | number theory — Let\[V'(x)=\#\{\phi(m) : 1\leq m\leq x\}\]and\[V(x)=\#\{\phi(m) \leq x : 1\leq m\}.\]Does $\lim V(x)/V'(x)$ exist? Is it $>1$?
+- [#420](https://erdosproblems.com/420) — OPEN | number theory — edited: 03 December 2025 — If $\tau(n)$ counts the number of divisors of $n$ then let\[F(f,n)=\frac{\tau((n+\lfloor f(n)\rfloor)!)}{\tau(n!)}.\]Is it true that\[\li...
+- [#421](https://erdosproblems.com/421) — OPEN | number theory — Is there a sequence $1\leq d_1<d_2<\cdots$ with density $1$ such that all products $\prod_{u\leq i\leq v}d_i$ are distinct?
+- [#422](https://erdosproblems.com/422) — OPEN | number theory — Let $f(1)=f(2)=1$ and for $n>2$\[f(n) = f(n-f(n-1))+f(n-f(n-2)).\]Does $f(n)$ miss infinitely many integers? What is its behaviour?
+- [#423](https://erdosproblems.com/423) — OPEN | number theory — edited: 16 January 2026 — Let $a_1=1$ and $a_2=2$ and for $k\geq 3$ choose $a_k$ to be the least integer $>a_{k-1}$ which is the sum of at least two consecutive te...
+- [#424](https://erdosproblems.com/424) — OPEN | number theory — Let $a_1=2$ and $a_2=3$ and continue the sequence by appending to $a_1,\ldots,a_n$ all possible values of $a_ia_j-1$ with $i\neq j$. Is i...
+- [#425](https://erdosproblems.com/425) — OPEN | number theory, sidon sets — edited: 28 December 2025 — 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...
+- [#428](https://erdosproblems.com/428) — OPEN | number theory, primes — 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\[\lim...
+- [#430](https://erdosproblems.com/430) — OPEN | number theory — 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 i...
+- [#431](https://erdosproblems.com/431) — OPEN | number theory, primes — Are there two infinite sets $A$ and $B$ such that $A+B$ agrees with the set of prime numbers up to finitely many exceptions?
+- [#432](https://erdosproblems.com/432) — OPEN | number theory — 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?
+- [#436](https://erdosproblems.com/436) — OPEN | number theory — edited: 25 October 2025 — 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 modu...
+- [#445](https://erdosproblems.com/445) — OPEN | number theory — edited: 27 December 2025 — 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 $...
+- [#450](https://erdosproblems.com/450) — OPEN | number theory, divisors — 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$?
+- [#451](https://erdosproblems.com/451) — OPEN | number theory — 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)$.
+- [#452](https://erdosproblems.com/452) — OPEN | number theory — edited: 28 October 2025 — 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...
+- [#454](https://erdosproblems.com/454) — OPEN | number theory, primes — edited: 07 October 2025 — 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?\]
+- [#455](https://erdosproblems.com/455) — OPEN | number theory — edited: 07 October 2025 — 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?\]
+- [#456](https://erdosproblems.com/456) — OPEN | number theory — edited: 07 October 2025 — 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_...
+- [#457](https://erdosproblems.com/457) — OPEN | number theory — edited: 07 October 2025 — 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...
+- [#458](https://erdosproblems.com/458) — FALSIFIABLE | number theory, primes — edited: 07 October 2025 — Let $[1,\ldots,n]$ denote the least common multiple of $\{1,\ldots,n\}$. Is it true that, for all $k\geq 1$,\[[1,\ldots,p_{k+1}-1]< p_k[1...
+- [#460](https://erdosproblems.com/460) — OPEN | number theory — edited: 14 January 2026 — 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$....
+- [#461](https://erdosproblems.com/461) — OPEN | number theory, primes — edited: 28 October 2025 — 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$...
+- [#462](https://erdosproblems.com/462) — OPEN | number theory, primes — 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...
+- [#463](https://erdosproblems.com/463) — OPEN | number theory, primes — 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...
+- [#467](https://erdosproblems.com/467) — OPEN | number theory — edited: 28 October 2025 — 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\le...
+- [#468](https://erdosproblems.com/468) — OPEN | number theory, divisors — 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$....
+- [#469](https://erdosproblems.com/469) — OPEN | number theory, divisors — edited: 19 October 2025 — 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\mi...
+- [#470](https://erdosproblems.com/470) — OPEN | $10 | number theory, divisors — edited: 18 January 2026 — 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 o...
+- [#472](https://erdosproblems.com/472) — OPEN | number theory — 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$ f...
+- [#474](https://erdosproblems.com/474) — NOT PROVABLE | $100 | set theory, ramsey theory — edited: 01 February 2026 — Under what set theoretic assumptions is it true that $\mathbb{R}^2$ can be $3$-coloured such that, for every uncountable $A\subseteq \mat...
+- [#475](https://erdosproblems.com/475) — DECIDABLE | number theory, additive combinatorics — Let $p$ be a prime. Given any finite set $A\subseteq \mathbb{F}_p\backslash \{0\}$, is there always a rearrangement $A=\{a_1,\ldots,a_t\}...
+- [#477](https://erdosproblems.com/477) — OPEN | number theory — edited: 29 December 2025 — 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...
+- [#478](https://erdosproblems.com/478) — OPEN | number theory, factorials — edited: 04 October 2025 — 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?\]
+- [#479](https://erdosproblems.com/479) — OPEN | number theory — edited: 03 December 2025 — Is it true that, for all $k\neq 1$, there are infinitely many $n$ such that $2^n\equiv k\pmod{n}$?
+- [#483](https://erdosproblems.com/483) — OPEN | number theory, additive combinatorics, ramsey theory — edited: 14 October 2025 — 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 $...
+- [#486](https://erdosproblems.com/486) — OPEN | number theory, primitive sets — edited: 12 January 2026 — 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\not...
+- [#488](https://erdosproblems.com/488) — OPEN | number theory — edited: 31 December 2025 — 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{\l...
+- [#489](https://erdosproblems.com/489) — OPEN | number theory — 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\nmid n\textrm{ for all }a\in...
+- [#495](https://erdosproblems.com/495) — OPEN | diophantine approximation, number theory — 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 f...
+- [#500](https://erdosproblems.com/500) — OPEN | $500 | graph theory, hypergraphs, turan number — edited: 05 October 2025 — 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^...
+- [#501](https://erdosproblems.com/501) — OPEN | combinatorics, set theory — edited: 25 January 2026 — 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...
+- [#503](https://erdosproblems.com/503) — OPEN | geometry, distances — edited: 28 October 2025 — 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,...
+- [#507](https://erdosproblems.com/507) — OPEN | geometry — edited: 30 December 2025 — 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 $\...
+- [#508](https://erdosproblems.com/508) — OPEN | geometry, ramsey theory — edited: 22 January 2026 — 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...
+- [#509](https://erdosproblems.com/509) — OPEN | analysis, polynomials — edited: 29 December 2025 — 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 b...
+- [#510](https://erdosproblems.com/510) — OPEN | analysis — edited: 28 September 2025 — 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...
+- [#513](https://erdosproblems.com/513) — OPEN | analysis — edited: 28 December 2025 — 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...
+- [#514](https://erdosproblems.com/514) — OPEN | analysis — edited: 18 January 2026 — 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\]a...
+- [#517](https://erdosproblems.com/517) — OPEN | analysis — edited: 29 December 2025 — Let $f(z)=\sum_{k=1}^\infty a_kz^{n_k}$ be an entire function (with $a_k\neq 0$ for all $k\geq 1$). Is it true that if $n_k/k\to \infty$...
+- [#520](https://erdosproblems.com/520) — OPEN | number theory, probability — Let $f$ be a Rademacher multiplicative function: a random $\{-1,0,1\}$-valued multiplicative function, where for each prime $p$ we indepe...
+- [#521](https://erdosproblems.com/521) — OPEN | analysis, polynomials, probability — edited: 19 October 2025 — 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_...
+- [#522](https://erdosproblems.com/522) — OPEN | analysis, polynomials, probability — edited: 06 December 2025 — 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 f...
+- [#524](https://erdosproblems.com/524) — OPEN | analysis, probability, polynomials — edited: 27 December 2025 — 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 magni...
+- [#528](https://erdosproblems.com/528) — OPEN | geometry — 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...
+- [#529](https://erdosproblems.com/529) — OPEN | geometry, probability — edited: 27 December 2025 — 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...
+- [#530](https://erdosproblems.com/530) — OPEN | number theory, sidon sets — edited: 16 October 2025 — 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)$...
+- [#531](https://erdosproblems.com/531) — OPEN | number theory, ramsey theory — 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_...
+- [#535](https://erdosproblems.com/535) — OPEN | number theory — Let $r\geq 3$, and let $f_r(N)$ denote the size of the largest subset of $\{1,\ldots,N\}$ such that no subset of size $r$ has the same pa...
+- [#536](https://erdosproblems.com/536) — OPEN | number theory — edited: 12 January 2026 — Let $\epsilon>0$ and $N$ be sufficiently large. Is it true that if $A\subseteq \{1,\ldots,N\}$ has size at least $\epsilon N$ then there...
+- [#538](https://erdosproblems.com/538) — OPEN | number theory — Let $r\geq 2$ and suppose that $A\subseteq\{1,\ldots,N\}$ is such that, for any $m$, there are at most $r$ solutions to $m=pa$ where $p$...
+- [#539](https://erdosproblems.com/539) — OPEN | number theory — edited: 22 January 2026 — Let $h(n)$ be such that, for any set $A\subseteq \mathbb{N}$ of size $n$, the set\[\left\{ \frac{a}{(a,b)}: a,b\in A\right\}\]has size at...
+- [#544](https://erdosproblems.com/544) — OPEN | graph theory, ramsey theory — Show that\[R(3,k+1)-R(3,k)\to\infty\]as $k\to \infty$. Similarly, prove or disprove that\[R(3,k+1)-R(3,k)=o(k).\]
+- [#545](https://erdosproblems.com/545) — OPEN | graph theory, ramsey theory — edited: 02 December 2025 — Let $G$ be a graph with $m$ edges and no isolated vertices. Is the Ramsey number $R(G)$ maximised when $G$ is 'as complete as possible'?...
+- [#548](https://erdosproblems.com/548) — FALSIFIABLE | graph theory — edited: 23 January 2026 — Let $n\geq k+1$. Every graph on $n$ vertices with at least $\frac{k-1}{2}n+1$ edges contains every tree on $k+1$ vertices.
+- [#550](https://erdosproblems.com/550) — OPEN | graph theory, ramsey theory — Let $m_1\leq\cdots\leq m_k$ and $n$ be sufficiently large. If $T$ is a tree on $n$ vertices and $G$ is the complete multipartite graph wi...
+- [#552](https://erdosproblems.com/552) — OPEN | $100 | graph theory, ramsey theory — edited: 01 February 2026 — Determine the Ramsey number\[R(C_4,S_n),\]where $S_n=K_{1,n}$ is the star on $n+1$ vertices. In particular, is it true that, for any $c>0...
+- [#554](https://erdosproblems.com/554) — OPEN | graph theory, ramsey theory — edited: 08 February 2026 — Let $R_k(G)$ denote the minimal $m$ such that if the edges of $K_m$ are $k$-coloured then there is a monochromatic copy of $G$. Show that...
+- [#555](https://erdosproblems.com/555) — OPEN | graph theory, ramsey theory — edited: 08 February 2026 — Let $R_k(G)$ denote the minimal $m$ such that if the edges of $K_m$ are $k$-coloured then there is a monochromatic copy of $G$. Determine...
+- [#557](https://erdosproblems.com/557) — OPEN | graph theory, ramsey theory — edited: 08 February 2026 — Let $R_k(G)$ denote the minimal $m$ such that if the edges of $K_m$ are $k$-coloured then there is a monochromatic copy of $G$. Is it tru...
+- [#558](https://erdosproblems.com/558) — OPEN | graph theory, ramsey theory — edited: 08 February 2026 — Let $R_k(G)$ denote the minimal $m$ such that if the edges of $K_m$ are $k$-coloured then there is a monochromatic copy of $G$. Determine...
+- [#560](https://erdosproblems.com/560) — OPEN | graph theory, ramsey theory — edited: 18 January 2026 — Let $\hat{R}(G)$ denote the size Ramsey number, the minimal number of edges $m$ such that there is a graph $H$ with $m$ edges such that i...
+- [#561](https://erdosproblems.com/561) — OPEN | graph theory, ramsey theory — edited: 01 February 2026 — Let $\hat{R}(G)$ denote the size Ramsey number, the minimal number of edges $m$ such that there is a graph $H$ with $m$ edges such that i...
+- [#562](https://erdosproblems.com/562) — OPEN | graph theory, ramsey theory, hypergraphs — edited: 18 January 2026 — Let $R_r(n)$ denote the $r$-uniform hypergraph Ramsey number: the minimal $m$ such that if we $2$-colour all edges of the complete $r$-un...
+- [#563](https://erdosproblems.com/563) — OPEN | graph theory, ramsey theory, hypergraphs — edited: 18 January 2026 — Let $F(n,\alpha)$ denote the smallest $m$ such that there exists a $2$-colouring of the edges of $K_n$ so that every $X\subseteq [n]$ wit...
+- [#564](https://erdosproblems.com/564) — OPEN | $500 | graph theory, ramsey theory, hypergraphs — edited: 18 January 2026 — Let $R_3(n)$ be the minimal $m$ such that if the edges of the $3$-uniform hypergraph on $m$ vertices are $2$-coloured then there is a mon...
+- [#566](https://erdosproblems.com/566) — OPEN | graph theory, ramsey theory — edited: 18 January 2026 — Let $G$ be such that any subgraph on $k$ vertices has at most $2k-3$ edges. Is it true that, if $H$ has $m$ edges and no isolated vertice...
+- [#567](https://erdosproblems.com/567) — OPEN | graph theory, ramsey theory — edited: 18 January 2026 — Let $G$ be either $Q_3$ or $K_{3,3}$ or $H_5$ (the last formed by adding two vertex-disjoint chords to $C_5$). Is it true that, if $H$ ha...
+- [#568](https://erdosproblems.com/568) — OPEN | graph theory, ramsey theory — edited: 18 January 2026 — Let $G$ be a graph such that $R(G,T_n)\ll n$ for any tree $T_n$ on $n$ vertices and $R(G,K_n)\ll n^2$. Is it true that, for any $H$ with...
+- [#569](https://erdosproblems.com/569) — OPEN | graph theory, ramsey theory — edited: 18 January 2026 — Let $k\geq 1$. What is the best possible $c_k$ such that\[R(C_{2k+1},H)\leq c_k m\]for any graph $H$ on $m$ edges without isolated vertices?
+- [#571](https://erdosproblems.com/571) — OPEN | graph theory, turan number — edited: 18 January 2026 — Show that for any rational $\alpha \in [1,2)$ there exists a bipartite graph $G$ such that\[\mathrm{ex}(n;G)\asymp n^{\alpha}.\]
+- [#572](https://erdosproblems.com/572) — OPEN | graph theory, turan number, cycles — edited: 18 January 2026 — Show that for $k\geq 3$\[\mathrm{ex}(n;C_{2k})\gg n^{1+\frac{1}{k}}.\]
+- [#573](https://erdosproblems.com/573) — OPEN | graph theory, turan number — edited: 18 January 2026 — Is it true that\[\mathrm{ex}(n;\{C_3,C_4\})\sim (n/2)^{3/2}?\]
+- [#574](https://erdosproblems.com/574) — OPEN | graph theory, turan number — edited: 18 January 2026 — Is it true that, for $k\geq 2$,\[\mathrm{ex}(n;\{C_{2k-1},C_{2k}\})=(1+o(1))(n/2)^{1+\frac{1}{k}}.\]
+- [#575](https://erdosproblems.com/575) — OPEN | graph theory, turan number — edited: 18 January 2026 — If $\mathcal{F}$ is a finite set of finite graphs then $\mathrm{ex}(n;\mathcal{F})$ is the maximum number of edges a graph on $n$ vertice...
+- [#576](https://erdosproblems.com/576) — OPEN | graph theory, turan number — edited: 18 January 2026 — Let $Q_k$ be the $k$-dimensional hypercube graph (so that $Q_k$ has $2^k$ vertices and $k2^{k-1}$ edges). Determine the behaviour of\[\ma...
+- [#579](https://erdosproblems.com/579) — OPEN | graph theory, turan number — Let $\delta>0$. If $n$ is sufficiently large and $G$ is a graph on $n$ vertices with no $K_{2,2,2}$ and at least $\delta n^2$ edges then...
+- [#580](https://erdosproblems.com/580) — DECIDABLE | graph theory — edited: 24 October 2025 — Let $G$ be a graph on $n$ vertices such that at least $n/2$ vertices have degree at least $n/2$. Must $G$ contain every tree on at most $...
+- [#583](https://erdosproblems.com/583) — FALSIFIABLE | graph theory — edited: 05 March 2026 — Every connected graph on $n$ vertices can be partitioned into at most $\lceil n/2\rceil$ edge-disjoint paths.
+- [#584](https://erdosproblems.com/584) — OPEN | graph theory, cycles — edited: 22 January 2026 — Let $G$ be a graph with $n$ vertices and $\delta n^{2}$ edges. Are there subgraphs $H_1,H_2\subseteq G$ such that $H_1$ has $\gg \delta^3...
+- [#585](https://erdosproblems.com/585) — OPEN | graph theory, cycles — What is the maximum number of edges that a graph on $n$ vertices can have if it does not contain two edge-disjoint cycles with the same v...
+- [#588](https://erdosproblems.com/588) — OPEN | $100 | geometry — Let $f_k(n)$ be minimal such that if $n$ points in $\mathbb{R}^2$ have no $k+1$ points on a line then there must be at most $f_k(n)$ many...
+- [#589](https://erdosproblems.com/589) — OPEN | geometry — Let $g(n)$ be maximal such that in any set of $n$ points in $\mathbb{R}^2$ with no four points on a line there exists a subset on $g(n)$...
+- [#592](https://erdosproblems.com/592) — OPEN | $1000 | set theory, ramsey theory — edited: 23 January 2026 — Determine which countable ordinals $\beta$ have the property that, if $\alpha=\omega^{^\beta}$, then in any red/blue colouring of the edg...
+- [#593](https://erdosproblems.com/593) — OPEN | $500 | set theory, graph theory, hypergraphs, chromatic number — Characterize those finite 3-uniform hypergraphs which appear in every 3-uniform hypergraph of chromatic number $>\aleph_0$.
+- [#595](https://erdosproblems.com/595) — OPEN | $250 | graph theory, set theory — Is there an infinite graph $G$ which contains no $K_4$ and is not the union of countably many triangle-free graphs?
+- [#596](https://erdosproblems.com/596) — OPEN | graph theory, ramsey theory, set theory — For which graphs $G_1,G_2$ is it true that for every $n\geq 1$ there is a graph $H$ without a $G_1$ but if the edges of $H$ are $n$-colou...
+- [#597](https://erdosproblems.com/597) — OPEN | graph theory, ramsey theory, set theory — edited: 23 January 2026 — Let $G$ be a graph on at most $\aleph_1$ vertices which contains no $K_4$ and no $K_{\aleph_0,\aleph_0}$ (the complete bipartite graph wi...
+- [#598](https://erdosproblems.com/598) — OPEN | set theory, ramsey theory — Let $m$ be an infinite cardinal and $\kappa$ be the successor cardinal of $2^{\aleph_0}$. Can one colour the countable subsets of $m$ usi...
+- [#600](https://erdosproblems.com/600) — OPEN | graph theory — Let $e(n,r)$ be minimal such that every graph on $n$ vertices with at least $e(n,r)$ edges, each edge contained in at least one triangle,...
+- [#601](https://erdosproblems.com/601) — OPEN | $500 | graph theory, set theory — For which limit ordinals $\alpha$ is it true that if $G$ is a graph with vertex set $\alpha$ then $G$ must have either an infinite path o...
+- [#602](https://erdosproblems.com/602) — OPEN | combinatorics, set theory — Let $(A_i)$ be a family of sets with $\lvert A_i\rvert=\aleph_0$ for all $i$, such that for any $i\neq j$ we have $\lvert A_i\cap A_j\rve...
+- [#603](https://erdosproblems.com/603) — OPEN | combinatorics, set theory — edited: 28 December 2025 — Let $(A_i)$ be a family of countably infinite sets such that $\lvert A_i\cap A_j\rvert \neq 2$ for all $i\neq j$. Find the smallest cardi...
+- [#604](https://erdosproblems.com/604) — OPEN | $500 | geometry, distances — edited: 15 October 2025 — 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 ev...
+- [#609](https://erdosproblems.com/609) — OPEN | graph theory, ramsey theory — Let $f(n)$ be the minimal $m$ such that if the edges of $K_{2^n+1}$ are coloured with $n$ colours then there must be a monochromatic odd...
+- [#610](https://erdosproblems.com/610) — OPEN | graph theory — edited: 02 December 2025 — For a graph $G$ let $\tau(G)$ denote the minimal number of vertices that include at least one from each maximal clique of $G$ (sometimes...
+- [#611](https://erdosproblems.com/611) — OPEN | graph theory — For a graph $G$ let $\tau(G)$ denote the minimal number of vertices that include at least one from each maximal clique of $G$ (sometimes...
+- [#612](https://erdosproblems.com/612) — OPEN | graph theory — Let $G$ be a connected graph with $n$ vertices, minimum degree $d$, and diameter $D$. Show if that $G$ contains no $K_{2r}$ and $(r-1)(3r...
+- [#614](https://erdosproblems.com/614) — OPEN | graph theory — Let $f(n,k)$ be minimal such that there is a graph with $n$ vertices and $f(n,k)$ edges where every set of $k+2$ vertices induces a subgr...
+- [#616](https://erdosproblems.com/616) — OPEN | graph theory — Let $r\geq 3$. For an $r$-uniform hypergraph $G$ let $\tau(G)$ denote the covering number (or transversal number), the minimum size of a...
+- [#617](https://erdosproblems.com/617) — FALSIFIABLE | graph theory — Let $r\geq 3$. If the edges of $K_{r^2+1}$ are $r$-coloured then there exist $r+1$ vertices with at least one colour missing on the edges...
+- [#619](https://erdosproblems.com/619) — OPEN | graph theory — For a triangle-free graph $G$ let $h_r(G)$ be the smallest number of edges that need to be added to $G$ so that it has diameter $r$ (whil...
+- [#620](https://erdosproblems.com/620) — OPEN | graph theory — If $G$ is a graph on $n$ vertices without a $K_4$ then how large a triangle-free induced subgraph must $G$ contain?
+- [#623](https://erdosproblems.com/623) — OPEN | set theory — Let $X$ be a set of cardinality $\aleph_\omega$ and $f$ be a function from the finite subsets of $X$ to $X$ such that $f(A)\not\in A$ for...
+- [#624](https://erdosproblems.com/624) — OPEN | combinatorics — edited: 27 October 2025 — Let $X$ be a finite set of size $n$ and $H(n)$ be such that there is a function $f:\{A : A\subseteq X\}\to X$ so that for every $Y\subset...
+- [#625](https://erdosproblems.com/625) — OPEN | $1000 | graph theory, chromatic number — The cochromatic number of $G$, denoted by $\zeta(G)$, is the minimum number of colours needed to colour the vertices of $G$ such that eac...
+- [#626](https://erdosproblems.com/626) — OPEN | graph theory, chromatic number, cycles — Let $k\geq 4$ and $g_k(n)$ denote the largest $m$ such that there is a graph on $n$ vertices with chromatic number $k$ and girth $>m$ (i....
+- [#627](https://erdosproblems.com/627) — OPEN | graph theory, chromatic number — edited: 08 February 2026 — Let $\omega(G)$ denote the clique number of $G$ and $\chi(G)$ the chromatic number. If $f(n)$ is the maximum value of $\chi(G)/\omega(G)$...
+- [#628](https://erdosproblems.com/628) — FALSIFIABLE | graph theory, chromatic number — edited: 06 December 2025 — Let $G$ be a graph with chromatic number $k$ containing no $K_k$. If $a,b\geq 2$ and $a+b=k+1$ then must there exist two disjoint subgrap...
+- [#629](https://erdosproblems.com/629) — OPEN | graph theory, chromatic number — edited: 28 October 2025 — The list chromatic number $\chi_L(G)$ is defined to be the minimal $k$ such that for any assignment of a list of $k$ colours to each vert...
+- [#633](https://erdosproblems.com/633) — OPEN | $25 | geometry — Classify those triangles which can only be cut into a square number of congruent triangles.
+- [#634](https://erdosproblems.com/634) — OPEN | $25 | geometry — edited: 30 December 2025 — Find all $n$ such that there is at least one triangle which can be cut into $n$ congruent triangles.
+- [#635](https://erdosproblems.com/635) — OPEN | number theory — edited: 01 February 2026 — Let $t\geq 1$ and $A\subseteq \{1,\ldots,N\}$ be such that whenever $a,b\in A$ with $b-a\geq t$ we have $b-a\nmid b$. How large can $\lve...
+- [#638](https://erdosproblems.com/638) — OPEN | graph theory, ramsey theory — Let $S$ be a family of finite graphs such that for every $n$ there is some $G_n\in S$ such that if the edges of $G_n$ are coloured with $...
+- [#640](https://erdosproblems.com/640) — OPEN | graph theory, chromatic number — edited: 22 January 2026 — Let $k\geq 3$. Does there exist some $f(k)$ such that if a graph $G$ has chromatic number $\geq f(k)$ then $G$ must contain some odd cycl...
+- [#642](https://erdosproblems.com/642) — OPEN | graph theory, cycles — edited: 28 January 2026 — Let $f(n)$ be the maximal number of edges in a graph on $n$ vertices such that all cycles have more vertices than chords. Is it true that...
+- [#643](https://erdosproblems.com/643) — OPEN | graph theory, hypergraphs — edited: 26 October 2025 — Let $f(n;t)$ be minimal such that if a $t$-uniform hypergraph on $n$ vertices contains at least $f(n;t)$ edges then there must be four ed...
+- [#644](https://erdosproblems.com/644) — OPEN | combinatorics — Let $f(k,r)$ be minimal such that if $A_1,A_2,\ldots$ is a family of sets, all of size $k$, such that for every collection of $r$ of the...
+- [#647](https://erdosproblems.com/647) — VERIFIABLE | $44 | number theory — edited: 05 October 2025 — Let $\tau(n)$ count the number of divisors of $n$. Is there some $n>24$ such that\[\max_{m<n}(m+\tau(m))\leq n+2?\]
+- [#650](https://erdosproblems.com/650) — OPEN | number theory — 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...
+- [#653](https://erdosproblems.com/653) — OPEN | geometry, distances — Let $x_1,\ldots,x_n\in \mathbb{R}^2$ and let $R(x_i)=\#\{ \lvert x_j-x_i\rvert : j\neq i\}$, where the points are ordered such that\[R(x_...
+- [#654](https://erdosproblems.com/654) — OPEN | geometry, distances — edited: 01 February 2026 — Let $f(n)$ be such that, given any $x_1,\ldots,x_n\in \mathbb{R}^2$ with no four points on a circle, there exists some $x_i$ with at leas...
+- [#655](https://erdosproblems.com/655) — OPEN | geometry, distances — Let $x_1,\ldots,x_n\in \mathbb{R}^2$ be such that no circle whose centre is one of the $x_i$ contains three other points. Are there at le...
+- [#657](https://erdosproblems.com/657) — OPEN | geometry, distances — edited: 15 October 2025 — Is it true that if $A\subset \mathbb{R}^2$ is a set of $n$ points such that every subset of $3$ points determines $3$ distinct distances...
+- [#660](https://erdosproblems.com/660) — OPEN | geometry, distances, convex — edited: 01 January 2026 — Let $x_1,\ldots,x_n\in \mathbb{R}^3$ be the vertices of a convex polyhedron. Are there at least\[(1-o(1))\frac{n}{2}\]many distinct dista...
+- [#661](https://erdosproblems.com/661) — OPEN | $50 | geometry, distances — edited: 11 January 2026 — Are there, for all large $n$, some points $x_1,\ldots,x_n,y_1,\ldots,y_n\in \mathbb{R}^2$ such that the number of distinct distances $d(x...
+- [#662](https://erdosproblems.com/662) — OPEN | geometry, distances — Consider the triangular lattice with minimal distance between two points $1$. Denote by $f(t)$ the number of distances from any points $\...
+- [#663](https://erdosproblems.com/663) — OPEN | number theory — edited: 02 December 2025 — 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 an...
+- [#665](https://erdosproblems.com/665) — OPEN | combinatorics — edited: 18 January 2026 — 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...
+- [#667](https://erdosproblems.com/667) — OPEN | graph theory, ramsey theory — 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...
+- [#668](https://erdosproblems.com/668) — OPEN | geometry, distances — edited: 27 December 2025 — Is it true that the number of incongruent sets of $n$ points in $\mathbb{R}^2$ which maximise the number of unit distances tends to infin...
+- [#669](https://erdosproblems.com/669) — OPEN | geometry — edited: 27 December 2025 — Let $F_k(n)$ be minimal such that for any $n$ points in $\mathbb{R}^2$ there exist at most $F_k(n)$ many distinct lines passing through a...
+- [#670](https://erdosproblems.com/670) — OPEN | geometry, distances — Let $A\subseteq \mathbb{R}^d$ be a set of $n$ points such that all pairwise distances differ by at least $1$. Is the diameter of $A$ at l...
+- [#671](https://erdosproblems.com/671) — OPEN | $250 | analysis — edited: 23 January 2026 — Given $a_{i}^n\in [-1,1]$ for all $1\leq i\leq n<\infty$ we define $p_{i}^n$ as the unique polynomial of degree $n-1$ such that $p_{i}^n(...
+- [#672](https://erdosproblems.com/672) — VERIFIABLE | number theory — edited: 01 February 2026 — Can the product of an arithmetic progression of positive integers $n,n+d,\ldots,n+(k-1)d$ of length $k\geq 4$ (with $(n,d)=1$) be a perfe...
+- [#675](https://erdosproblems.com/675) — OPEN | number theory — 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 al...
+- [#676](https://erdosproblems.com/676) — OPEN | number theory — 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$?
+- [#677](https://erdosproblems.com/677) — OPEN | number theory — edited: 30 September 2025 — 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) \neq M(m,...
+- [#679](https://erdosproblems.com/679) — OPEN | number theory — edited: 12 January 2026 — Let $\epsilon>0$ and $\omega(n)$ count the number of distinct prime factors of $n$. Are there infinitely many values of $n$ such that\[\o...
+- [#680](https://erdosproblems.com/680) — OPEN | number theory, primes — 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 fac...
+- [#681](https://erdosproblems.com/681) — OPEN | number theory, primes — edited: 01 February 2026 — 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...
+- [#683](https://erdosproblems.com/683) — OPEN | number theory, primes, binomial coefficients — edited: 31 December 2025 — 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}...
+- [#684](https://erdosproblems.com/684) — OPEN | number theory, primes, binomial coefficients — edited: 23 January 2026 — 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 $...
+- [#685](https://erdosproblems.com/685) — OPEN | number theory, primes, binomial coefficients — 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 distin...
+- [#686](https://erdosproblems.com/686) — OPEN | number theory — 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...
+- [#687](https://erdosproblems.com/687) — OPEN | $1000 | number theory — edited: 06 December 2025 — 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 intege...
+- [#688](https://erdosproblems.com/688) — OPEN | number theory — 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$ su...
+- [#689](https://erdosproblems.com/689) — OPEN | number theory — edited: 06 December 2025 — 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 $...
+- [#690](https://erdosproblems.com/690) — OPEN | number theory — 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...
+- [#691](https://erdosproblems.com/691) — OPEN | number theory — edited: 28 December 2025 — 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...
+- [#693](https://erdosproblems.com/693) — OPEN | number theory, divisors — 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...
+- [#694](https://erdosproblems.com/694) — OPEN | number theory — 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 f...
+- [#695](https://erdosproblems.com/695) — OPEN | number theory — edited: 17 October 2025 — 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...
+- [#696](https://erdosproblems.com/696) — OPEN | number theory, divisors — edited: 15 October 2025 — 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\pmo...
+- [#699](https://erdosproblems.com/699) — FALSIFIABLE | number theory, binomial coefficients — edited: 30 September 2025 — Is it true that for every $1\leq i<j\leq n/2$ there exists some prime $p\geq i$ such that\[p\mid \textrm{gcd}\left(\binom{n}{i}, \binom{n...
+- [#700](https://erdosproblems.com/700) — OPEN | number theory, binomial coefficients — Let\[f(n)=\min_{1<k\leq n/2}\textrm{gcd}\left(n,\binom{n}{k}\right).\] Characterise those composite $n$ such that $f(n)=n/P(n)$, where $P...
+- [#701](https://erdosproblems.com/701) — OPEN | combinatorics, intersecting family — Let $\mathcal{F}$ be a family of sets closed under taking subsets (i.e. if $B\subseteq A\in\mathcal{F}$ then $B\in \mathcal{F}$). There e...
+- [#704](https://erdosproblems.com/704) — OPEN | graph theory, geometry, chromatic number — Let $G_n$ be the unit distance graph in $\mathbb{R}^n$, with two vertices joined by an edge if and only if the distance between them is $...
+- [#706](https://erdosproblems.com/706) — OPEN | graph theory, chromatic number — Let $L(r)$ be such that if $G$ is a graph formed by taking a finite set of points $P$ in $\mathbb{R}^2$ and some set $A\subset (0,\infty)...
+- [#708](https://erdosproblems.com/708) — OPEN | $100 | number theory — 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)$ cons...
+- [#709](https://erdosproblems.com/709) — OPEN | number theory — 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(...
+- [#710](https://erdosproblems.com/710) — OPEN | $78 | number theory — 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...
+- [#711](https://erdosproblems.com/711) — OPEN | $78 | number theory — edited: 11 January 2026 — 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...
+- [#712](https://erdosproblems.com/712) — OPEN | $500 | graph theory, turan number, hypergraphs — edited: 05 October 2025 — Determine, for any $k>r>2$, the value of\[\frac{\mathrm{ex}_r(n,K_k^r)}{\binom{n}{r}},\]where $\mathrm{ex}_r(n,K_k^r)$ is the largest num...
+- [#713](https://erdosproblems.com/713) — OPEN | $500 | graph theory, turan number — edited: 06 October 2025 — 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?\...
+- [#714](https://erdosproblems.com/714) — OPEN | graph theory, turan number — edited: 23 January 2026 — Is it true that\[\mathrm{ex}(n; K_{r,r}) \gg n^{2-1/r}?\]
+- [#719](https://erdosproblems.com/719) — OPEN | graph theory, hypergraphs — Let $\mathrm{ex}_r(n;K_{r+1}^r)$ be the maximum number of $r$-edges that can be placed on $n$ vertices without forming a $K_{r+1}^r$ (the...
+- [#723](https://erdosproblems.com/723) — FALSIFIABLE | combinatorics — If there is a finite projective plane of order $n$ then must $n$ be a prime power? A finite projective plane of order $n$ is a collection...
+- [#724](https://erdosproblems.com/724) — OPEN | combinatorics — 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}?\]
+- [#725](https://erdosproblems.com/725) — OPEN | combinatorics — Give an asymptotic formula for the number of $k\times n$ Latin rectangles .
+- [#726](https://erdosproblems.com/726) — OPEN | number theory — 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}.\]
+- [#727](https://erdosproblems.com/727) — OPEN | number theory, factorials — Let $k\geq 2$. Does\[(n+k)!^2 \mid (2n)!\]for infinitely many $n$?
+- [#730](https://erdosproblems.com/730) — OPEN | number theory, binomial coefficients, base representations — edited: 27 December 2025 — Are there infinitely many pairs of integers $n\neq m$ such that $\binom{2n}{n}$ and $\binom{2m}{m}$ have the same set of prime divisors?
+- [#731](https://erdosproblems.com/731) — OPEN | number theory, binomial coefficients — edited: 19 October 2025 — Find some reasonable function $f(n)$ such that, for almost all integers $n$, the least integer $m$ such that $m\nmid \binom{2n}{n}$ satis...
+- [#734](https://erdosproblems.com/734) — OPEN | combinatorics — Find, for all large $n$, a non-trivial pairwise balanced block design $A_1,\ldots,A_m\subseteq \{1,\ldots,n\}$ such that, for all $t$, th...
+- [#736](https://erdosproblems.com/736) — NOT PROVABLE | graph theory, chromatic number — edited: 01 October 2025 — Let $G$ be a graph with chromatic number $\aleph_1$. Is there, for every cardinal number $m$, some graph $G_m$ of chromatic number $m$ su...
+- [#738](https://erdosproblems.com/738) — OPEN | graph theory, chromatic number — If $G$ has infinite chromatic number and is triangle-free (contains no $K_3$) then must $G$ contain every tree as an induced subgraph?
+- [#739](https://erdosproblems.com/739) — NOT PROVABLE | graph theory, chromatic number — edited: 01 October 2025 — Let $\mathfrak{m}$ be an infinite cardinal and $G$ be a graph with chromatic number $\mathfrak{m}$. Is it true that, for every infinite c...
+- [#740](https://erdosproblems.com/740) — OPEN | graph theory, chromatic number — 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 sub...
+- [#741](https://erdosproblems.com/741) — OPEN | additive combinatorics — Let $A\subseteq \mathbb{N}$ be such that $A+A$ has positive density. Can one always decompose $A=A_1\sqcup A_2$ such that $A_1+A_1$ and $...
+- [#743](https://erdosproblems.com/743) — FALSIFIABLE | graph theory — Let $T_2,\ldots,T_n$ be a collection of trees such that $T_k$ has $k$ vertices. Can we always write $K_n$ as the edge disjoint union of t...
+- [#749](https://erdosproblems.com/749) — OPEN | additive combinatorics — Let $\epsilon>0$. Does there exist $A\subseteq \mathbb{N}$ such that the lower density of $A+A$ is at least $1-\epsilon$ and yet $1_A\ast...
+- [#750](https://erdosproblems.com/750) — OPEN | graph theory, chromatic number — edited: 14 October 2025 — Let $f(m)$ be some function such that $f(m)\to \infty$ as $m\to \infty$. Does there exist a graph $G$ of infinite chromatic number such t...
+- [#757](https://erdosproblems.com/757) — OPEN | geometry, distances, sidon sets — edited: 08 January 2026 — 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 1...
+- [#761](https://erdosproblems.com/761) — OPEN | graph theory, chromatic number — The cochromatic number of $G$, denoted by $\zeta(G)$, is the minimum number of colours needed to colour the vertices of $G$ such that eac...
+- [#766](https://erdosproblems.com/766) — OPEN | graph theory, turan number — Let $f(n;k,l)=\min \mathrm{ex}(n;G)$, where $G$ ranges over all graphs with $k$ vertices and $l$ edges. Give good estimates for $f(n;k,l)...
+- [#768](https://erdosproblems.com/768) — OPEN | number theory — edited: 14 September 2025 — 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...
+- [#769](https://erdosproblems.com/769) — OPEN | number theory, geometry — edited: 01 October 2025 — 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...
+- [#770](https://erdosproblems.com/770) — OPEN | number theory — edited: 24 September 2025 — 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...
+- [#773](https://erdosproblems.com/773) — OPEN | number theory, sidon sets, squares — What is the size of the largest Sidon subset $A\subseteq\{1,2^2,\ldots,N^2\}$? Is it $N^{1-o(1)}$?
+- [#774](https://erdosproblems.com/774) — OPEN | number theory — edited: 28 December 2025 — We call $A\subset \mathbb{N}$ dissociated if $\sum_{n\in X}n\neq \sum_{m\in Y}m$ for all finite $X,Y\subset A$ with $X\neq Y$. Let $A\sub...
+- [#776](https://erdosproblems.com/776) — OPEN | combinatorics — Let $r\geq 2$ and $A_1,\ldots,A_m\subseteq \{1,\ldots,n\}$ be such that $A_i\not\subseteq A_j$ for all $i\neq j$ and for any $t$ if there...
+- [#778](https://erdosproblems.com/778) — OPEN | graph theory — 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...
+- [#779](https://erdosproblems.com/779) — FALSIFIABLE | number theory, primes — Let $n> 1$ and $p_1<\cdots<p_n$ denote the first $n$ primes. Let $P=\prod_{1\leq i\leq n}p_i$. Does there always exist some prime $p$ wit...
+- [#782](https://erdosproblems.com/782) — OPEN | number theory — Do the squares contain arbitrarily long quasi-progressions? That is, does there exist some constant $C>0$ such that, for any $k$, the squ...
+- [#783](https://erdosproblems.com/783) — OPEN | number theory — edited: 08 February 2026 — 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\neq b\in A$ and $\sum_{n\...
+- [#786](https://erdosproblems.com/786) — OPEN | number theory — edited: 02 February 2026 — 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\...
+- [#787](https://erdosproblems.com/787) — OPEN | additive combinatorics — edited: 23 January 2026 — 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 $\lv...
+- [#788](https://erdosproblems.com/788) — OPEN | additive combinatorics — edited: 26 January 2026 — 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_...
+- [#789](https://erdosproblems.com/789) — OPEN | additive combinatorics — 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...
+- [#790](https://erdosproblems.com/790) — OPEN | additive combinatorics — edited: 23 January 2026 — 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...
+- [#791](https://erdosproblems.com/791) — OPEN | additive combinatorics — edited: 24 September 2025 — 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...
+- [#792](https://erdosproblems.com/792) — OPEN | additive combinatorics — edited: 23 January 2026 — 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$ wit...
+- [#793](https://erdosproblems.com/793) — OPEN | number theory — edited: 01 December 2025 — Let $F(n)$ be the maximum possible size of a subset $A\subseteq\{1,\ldots,n\}$ such that $a\nmid bc$ whenever $a,b,c\in A$ with $a\neq b$...
+- [#796](https://erdosproblems.com/796) — OPEN | number theory — edited: 16 January 2026 — 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...
+- [#802](https://erdosproblems.com/802) — OPEN | graph theory — edited: 26 October 2025 — 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\]man...
+- [#805](https://erdosproblems.com/805) — OPEN | graph theory — 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)$ vertic...
+- [#809](https://erdosproblems.com/809) — OPEN | graph theory, ramsey theory — 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...
+- [#810](https://erdosproblems.com/810) — OPEN | graph theory, ramsey theory — Does there exist some $\epsilon>0$ such that, for all sufficiently large $n$, there exists a graph $G$ on $n$ vertices with at least $\ep...
+- [#811](https://erdosproblems.com/811) — OPEN | graph theory, ramsey theory — edited: 14 October 2025 — 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...
+- [#812](https://erdosproblems.com/812) — OPEN | graph theory, ramsey theory — 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?\]
+- [#813](https://erdosproblems.com/813) — OPEN | graph theory — 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 co...
+- [#817](https://erdosproblems.com/817) — OPEN | additive combinatorics — 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...
+- [#819](https://erdosproblems.com/819) — OPEN | additive combinatorics — 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 (...
+- [#820](https://erdosproblems.com/820) — OPEN | number theory — edited: 02 December 2025 — 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? (Th...
+- [#821](https://erdosproblems.com/821) — OPEN | number theory — edited: 01 October 2025 — 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 t...
+- [#824](https://erdosproblems.com/824) — OPEN | number theory — edited: 28 September 2025 — 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 divisor...
+- [#826](https://erdosproblems.com/826) — OPEN | number theory — Are there infinitely many $n$ such that, for all $k\geq 1$,\[\tau(n+k)\ll k?\]
+- [#827](https://erdosproblems.com/827) — OPEN | geometry — edited: 24 October 2025 — 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 th...
+- [#828](https://erdosproblems.com/828) — OPEN | number theory — edited: 30 September 2025 — Is it true that, for any $a\in\mathbb{Z}$, there are infinitely many $n$ such that\[\phi(n) \mid n+a?\]
+- [#829](https://erdosproblems.com/829) — OPEN | number theory — edited: 14 October 2025 — 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)}?\]
+- [#830](https://erdosproblems.com/830) — OPEN | number theory — edited: 28 September 2025 — 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)$ co...
+- [#831](https://erdosproblems.com/831) — OPEN | geometry — 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...
+- [#835](https://erdosproblems.com/835) — VERIFIABLE | graph theory, hypergraphs — edited: 22 January 2026 — Does there exist a $k>2$ such that the $k$-sized subsets of $\{1,\ldots,2k\}$ can be coloured with $k+1$ colours such that for every $A\s...
+- [#836](https://erdosproblems.com/836) — OPEN | graph theory, hypergraphs, chromatic number — 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$ suc...
+- [#837](https://erdosproblems.com/837) — OPEN | graph theory, hypergraphs — 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,...
+- [#838](https://erdosproblems.com/838) — OPEN | geometry, convex — 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 sub...
+- [#839](https://erdosproblems.com/839) — OPEN | number theory — 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\[\lims...
+- [#840](https://erdosproblems.com/840) — OPEN | additive combinatorics, sidon sets — edited: 19 October 2025 — 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\rv...
+- [#846](https://erdosproblems.com/846) — DISPROVED (LEAN) | geometry — 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...
+- [#849](https://erdosproblems.com/849) — OPEN | number theory, binomial coefficients — 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 $...
+- [#850](https://erdosproblems.com/850) — OPEN | number theory, primes — edited: 28 September 2025 — 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...
+- [#851](https://erdosproblems.com/851) — PROVED | number theory — 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 m...
+- [#852](https://erdosproblems.com/852) — OPEN | number theory, primes — 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_{...
+- [#853](https://erdosproblems.com/853) — OPEN | number theory, primes — 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...
+- [#854](https://erdosproblems.com/854) — OPEN | number theory — edited: 04 November 2025 — 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...
+- [#855](https://erdosproblems.com/855) — FALSIFIABLE | number theory, primes — edited: 12 January 2026 — If $\pi(x)$ counts the number of primes in $[1,x]$ then is it true that (for large $x$ and $y$)\[\pi(x+y) \leq \pi(x)+\pi(y)?\]
+- [#856](https://erdosproblems.com/856) — OPEN | number theory — edited: 18 January 2026 — 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\}$ whic...
+- [#857](https://erdosproblems.com/857) — OPEN | combinatorics — Let $m=m(n,k)$ be minimal such that in any collection of sets $A_1,\ldots,A_m\subseteq \{1,\ldots,n\}$ there must exist a sunflower of si...
+- [#858](https://erdosproblems.com/858) — OPEN | number theory, primitive sets — Let $A\subseteq \{1,\ldots,N\}$ be such that there is no solution to $at=b$ with $a,b\in A$ and the smallest prime factor of $t$ is $>a$....
+- [#859](https://erdosproblems.com/859) — OPEN | number theory, divisors — Let $t\geq 1$ and let $d_t$ be the density of the set of integers $n\in\mathbb{N}$ for which $t$ can be represented as the sum of distinc...
+- [#860](https://erdosproblems.com/860) — OPEN | number theory, primes — edited: 30 September 2025 — Let $h(n)$ be such that, for any $m\geq 1$, in the interval $(m,m+h(n))$ there exist distinct integers $a_i$ for $1\leq i\leq \pi(n)$ suc...
+- [#863](https://erdosproblems.com/863) — OPEN | number theory, sidon sets, additive combinatorics — Let $r\geq 2$ and let $A\subseteq \{1,\ldots,N\}$ be a set of maximal size such that there are at most $r$ solutions to $n=a+b$ with $a\l...
+- [#864](https://erdosproblems.com/864) — OPEN | number theory, sidon sets, additive combinatorics — Let $A\subseteq \{1,\ldots N\}$ be a set such that there exists at most one $n$ with more than one solution to $n=a+b$ (with $a\leq b\in...
+- [#865](https://erdosproblems.com/865) — OPEN | number theory, additive combinatorics — There exists a constant $C>0$ such that, for all large $N$, if $A\subseteq \{1,\ldots,N\}$ has size at least $\frac{5}{8}N+C$ then there...
+- [#866](https://erdosproblems.com/866) — OPEN | number theory, additive combinatorics — edited: 01 December 2025 — Let $k\geq 3$ and $g_k(N)$ be minimal such that if $A\subseteq \{1,\ldots,2N\}$ has $\lvert A\rvert \geq N+g_k(N)$ then there exist integ...
+- [#869](https://erdosproblems.com/869) — OPEN | number theory, additive basis — If $A_1,A_2$ are disjoint additive bases of order $2$ (i.e. $A_i+A_i$ contains all large integers) then must $A=A_1\cup A_2$ contain a mi...
+- [#870](https://erdosproblems.com/870) — OPEN | number theory, additive basis — Let $k\geq 3$ and $A$ be an additive basis of order $k$. Does there exist a constant $c=c(k)>0$ such that if $r(n)\geq c\log n$ for all l...
+- [#872](https://erdosproblems.com/872) — OPEN | number theory, primitive sets — Consider the two-player game in which players alternately choose integers from $\{2,3,\ldots,n\}$ to be included in some set $A$ (the sam...
+- [#873](https://erdosproblems.com/873) — OPEN | number theory — Let $A=\{a_1<a_2<\cdots\}\subseteq \mathbb{N}$ and let $F(A,X,k)$ count the number of $i$ such that\[[a_i,a_{i+1},\ldots,a_{i+k-1}] < X,\...
+- [#875](https://erdosproblems.com/875) — OPEN | additive combinatorics — Let $A=\{a_1<a_2<\cdots\}\subset \mathbb{N}$ be an infinite set such that the sets\[S_r = \{ a_1+\cdots +a_r : a_1<\cdots<a_r\in A\}\]are...
+- [#876](https://erdosproblems.com/876) — OPEN | additive combinatorics — Let $A=\{a_1<a_2<\cdots\}\subset \mathbb{N}$ be an infinite sum-free set - that is, there are no solutions to\[a=b_1+\cdots+b_r\]with $b_...
+- [#878](https://erdosproblems.com/878) — OPEN | number theory — If $n=\prod_{1\leq i\leq t} p_i^{k_i}$ is the factorisation of $n$ into distinct primes then let\[f(n)=\sum p_i^{\ell_i},\]where $\ell_i$...
+- [#879](https://erdosproblems.com/879) — OPEN | number theory — Call a set $S\subseteq \{1,\ldots,n\}$ admissible if $(a,b)=1$ for all $a\neq b\in S$. Let\[G(n) = \max_{S\subseteq \{1,\ldots,n\}} \sum_...
+- [#881](https://erdosproblems.com/881) — OPEN | number theory, additive basis — Let $A\subset\mathbb{N}$ be an additive basis of order $k$ which is minimal, in the sense that if $B\subset A$ is any infinite set then $...
+- [#883](https://erdosproblems.com/883) — OPEN | number theory, graph theory — edited: 24 October 2025 — For $A\subseteq \{1,\ldots,n\}$ let $G(A)$ be the graph with vertex set $A$, where two integers are joined by an edge if they are coprime...
+- [#884](https://erdosproblems.com/884) — OPEN | number theory, divisors — Is it true that, for any $n$, if $d_1<\cdots <d_t$ are the divisors of $n$, then\[\sum_{1\leq i<j\leq t}\frac{1}{d_j-d_i} \ll 1+\sum_{1\l...
+- [#885](https://erdosproblems.com/885) — OPEN | number theory, divisors — For integer $n\geq 1$ we define the factor difference set of $n$ by\[D(n) = \{\lvert a-b\rvert : n=ab\}.\]Is it true that, for every $k\g...
+- [#886](https://erdosproblems.com/886) — OPEN | number theory, divisors — edited: 01 February 2026 — Let $\epsilon>0$. Is it true that, for all large $n$, the number of divisors of $n$ in $(n^{1/2},n^{1/2}+n^{1/2-\epsilon})$ is $O_\epsilo...
+- [#887](https://erdosproblems.com/887) — OPEN | number theory, divisors — Is there an absolute constant $K$ such that, for every $C>0$, if $n$ is sufficiently large then $n$ has at most $K$ divisors in $(n^{1/2}...
+- [#888](https://erdosproblems.com/888) — OPEN | number theory, squares — edited: 22 January 2026 — What is the size of the largest $A\subseteq \{1,\ldots,n\}$ such that if $a\leq b\leq c\leq d\in A$ are such that $abcd$ is a square then...
+- [#889](https://erdosproblems.com/889) — OPEN | number theory — edited: 02 January 2026 — For $k\geq 0$ and $n\geq 1$ let $v(n,k)$ count the prime factors of $n+k$ which do not divide $n+i$ for $0\leq i<k$. Equivalently, $v(n,k...
+- [#890](https://erdosproblems.com/890) — OPEN | number theory, primes — If $\omega(n)$ counts the number of distinct prime factors of $n$, then is it true that, for every $k\geq 1$,\[\liminf_{n\to \infty}\sum_...
+- [#891](https://erdosproblems.com/891) — OPEN | number theory — Let $2=p_1<p_2<\cdots$ be the primes and $k\geq 2$. Is it true that, for all sufficiently large $n$, there must exist an integer in $[n,n...
+- [#892](https://erdosproblems.com/892) — OPEN | number theory, primitive sets — Is there a necessary and sufficient condition for a sequence of integers $b_1<b_2<\cdots$ that ensures there exists a primitive sequence...
+- [#893](https://erdosproblems.com/893) — OPEN | number theory, divisors — If $\tau(n)$ counts the divisors of $n$ then let\[f(n)=\sum_{1\leq k\leq n}\tau(2^k-1).\]Does $f(2n)/f(n)$ tend to a limit?
+- [#896](https://erdosproblems.com/896) — OPEN | number theory — edited: 06 December 2025 — Estimate the maximum of $F(A,B)$ as $A,B$ range over all subsets of $\{1,\ldots,N\}$, where $F(A,B)$ counts the number of $m$ such that $...
+- [#901](https://erdosproblems.com/901) — OPEN | combinatorics, hypergraphs — edited: 28 December 2025 — Let $m(n)$ be minimal such that there is an $n$-uniform hypergraph with $m(n)$ edges which is $3$-chromatic. Estimate $m(n)$.
+- [#902](https://erdosproblems.com/902) — OPEN | graph theory — Let $f(n)$ be minimal such that there is a tournament (a complete directed graph) on $f(n)$ vertices such that every set of $n$ vertices...
+- [#906](https://erdosproblems.com/906) — OPEN | analysis, iterated functions — edited: 01 October 2025 — Is there an entire non-zero function $f:\mathbb{C}\to \mathbb{C}$ such that, for any infinite sequence $n_1<n_2<\cdots$, the set\[\{ z: f...
+- [#911](https://erdosproblems.com/911) — OPEN | graph theory, ramsey theory — Let $\hat{R}(G)$ denote the size Ramsey number, the minimal number of edges $m$ such that there is a graph $H$ with $m$ edges that is Ram...
+- [#912](https://erdosproblems.com/912) — OPEN | number theory, factorials — If\[n! = \prod_i p_i^{k_i}\]is the factorisation into distinct primes then let $h(n)$ count the number of distinct exponents $k_i$. Prove...
+- [#913](https://erdosproblems.com/913) — OPEN | number theory — Are there infinitely many $n$ such that if\[n(n+1) = \prod_i p_i^{k_i}\]is the factorisation into distinct primes then all exponents $k_i...
+- [#917](https://erdosproblems.com/917) — OPEN | graph theory, chromatic number — Let $k\geq 4$ and $f_k(n)$ be the largest number of edges in a graph on $n$ vertices which has chromatic number $k$ and is critical (i.e....
+- [#918](https://erdosproblems.com/918) — OPEN | graph theory, chromatic number — edited: 24 October 2025 — Is there a graph with $\aleph_2$ vertices and chromatic number $\aleph_2$ such that every subgraph on $\aleph_1$ vertices has chromatic n...
+- [#919](https://erdosproblems.com/919) — OPEN | graph theory, chromatic number — Is there a graph $G$ with vertex set $\omega_2^2$ and chromatic number $\aleph_2$ such that every subgraph whose vertices have a lesser t...
+- [#920](https://erdosproblems.com/920) — OPEN | graph theory, chromatic number — edited: 21 January 2026 — Let $f_k(n)$ be the maximum possible chromatic number of a graph with $n$ vertices which contains no $K_k$. Is it true that, for $k\geq 4...
+- [#928](https://erdosproblems.com/928) — OPEN | number theory — Let $\alpha,\beta\in (0,1)$ and let $P(n)$ denote the largest prime divisor of $n$. Does the density of integers $n$ such that $P(n)<n^{\...
+- [#929](https://erdosproblems.com/929) — OPEN | number theory — edited: 02 December 2025 — Let $k\geq 2$ be large and let $S(k)$ be the minimal $x$ such that there is a positive density set of $n$ where\[n+1,n+2,\ldots,n+k\]are...
+- [#930](https://erdosproblems.com/930) — OPEN | number theory — Is it true that, for every $r$, there is a $k$ such that if $I_1,\ldots,I_r$ are disjoint intervals of consecutive integers, all of lengt...
+- [#931](https://erdosproblems.com/931) — OPEN | number theory — edited: 30 September 2025 — Let $k_1\geq k_2\geq 3$. Are there only finitely many $n_2\geq n_1+k_1$ such that\[\prod_{1\leq i\leq k_1}(n_1+i)\textrm{ and }\prod_{1\l...
+- [#932](https://erdosproblems.com/932) — OPEN | number theory — Let $p_k$ denote the $k$th prime. For infinitely many $r$ there are at least two integers $p_r<n<p_{r+1}$ all of whose prime factors are...
+- [#933](https://erdosproblems.com/933) — OPEN | number theory — If $n(n+1)=2^k3^lm$, where $(m,6)=1$, then is it true that\[\limsup_{n\to \infty} \frac{2^k3^l}{n\log n}=\infty?\]
+- [#934](https://erdosproblems.com/934) — OPEN | graph theory — edited: 28 October 2025 — Let $h_t(d)$ be minimal such that every graph $G$ with $h_t(d)$ edges and maximal degree $\leq d$ contains two edges whose shortest path...
+- [#935](https://erdosproblems.com/935) — OPEN | number theory, powerful — edited: 08 February 2026 — For any integer $n=\prod p^{k_p}$ let $Q_2(n)$ be the powerful part of $n$, so that\[Q_2(n) = \prod_{\substack{p\\ k_p\geq 2}}p^{k_p}.\]I...
+- [#936](https://erdosproblems.com/936) — OPEN | number theory, powerful — edited: 31 October 2025 — Are\[2^n\pm 1\]and\[n!\pm 1\]powerful (i.e. if $p\mid m$ then $p^2\mid m$) for only finitely many $n$?
+- [#938](https://erdosproblems.com/938) — OPEN | number theory, powerful — edited: 31 October 2025 — Let $A=\{n_1<n_2<\cdots\}$ be the sequence of powerful numbers (if $p\mid n$ then $p^2\mid n$). Are there only finitely many three-term p...
+- [#939](https://erdosproblems.com/939) — OPEN | number theory, powerful — edited: 31 October 2025 — Let $r\geq 2$. An $r$-powerful number $n$ is one such that if $p\mid n$ then $p^r\mid n$. If $r\geq 4$ then can the sum of $r-2$ coprime...
+- [#940](https://erdosproblems.com/940) — OPEN | number theory, powerful — edited: 03 November 2025 — Let $r\geq 3$. A number $n$ is $r$-powerful if for every prime $p$ which divides $n$ we have $p^r\mid n$. Are there infinitely many integ...
+- [#942](https://erdosproblems.com/942) — OPEN | number theory, powerful — edited: 08 December 2025 — Let $h(n)$ count the number of powerful (if $p\mid m$ then $p^2\mid m$) integers in $[n^2,(n+1)^2)$. Estimate $h(n)$. In particular is th...
+- [#943](https://erdosproblems.com/943) — OPEN | number theory, powerful — edited: 31 October 2025 — Let $A$ be the set of powerful numbers (if $p\mid n$ then $p^2\mid n$). Is it true that\[1_A\ast 1_A(n)=n^{o(1)}\]for every $n$?
+- [#944](https://erdosproblems.com/944) — OPEN | graph theory, chromatic number — A critical vertex, edge, or set of edges, is one whose deletion lowers the chromatic number. Let $k\geq 4$ and $r\geq 1$. Must there exis...
+- [#945](https://erdosproblems.com/945) — OPEN | number theory, divisors — edited: 05 October 2025 — Let $F(x)$ be the maximal $k$ such that there exist $n+1,\ldots,n+k\leq x$ with $\tau(n+1),\ldots,\tau(n+k)$ all distinct (where $\tau(m)...
+- [#948](https://erdosproblems.com/948) — OPEN | number theory, ramsey theory — edited: 22 September 2025 — Is there a function $f(n)$ and a $k$ such that in any $k$-colouring of the integers there exists a sequence $a_1<\cdots$ such that $a_n<f...
+- [#949](https://erdosproblems.com/949) — OPEN | ramsey theory — edited: 11 January 2026 — Let $S\subset \mathbb{R}$ be a set containing no solutions to $a+b=c$. Must there be a set $A\subseteq \mathbb{R}\backslash S$ of cardina...
+- [#950](https://erdosproblems.com/950) — OPEN | number theory, primes — Let\[f(n) = \sum_{p<n}\frac{1}{n-p}.\]Is it true that\[\liminf f(n)=1\]and\[\limsup f(n)=\infty?\]Is it true that $f(n)=o(\log\log n)$ fo...
+- [#951](https://erdosproblems.com/951) — OPEN | number theory — edited: 28 January 2026 — Let $1<a_1<\cdots$ be a sequence of real numbers such that\[\left\lvert \prod_i a_i^{k_i}-\prod_j a_j^{\ell_j}\right\rvert \geq 1\]for ev...
+- [#952](https://erdosproblems.com/952) — OPEN | number theory — Is there an infinite sequence of distinct Gaussian primes $x_1,x_2,\ldots$ such that\[\lvert x_{n+1}-x_n\rvert \ll 1?\]
+- [#953](https://erdosproblems.com/953) — OPEN | geometry, distances — edited: 01 February 2026 — Let $A\subset \{ x\in \mathbb{R}^2 : \lvert x\rvert <r\}$ be a measurable set with no integer distances, that is, such that $\lvert a-b\r...
+- [#954](https://erdosproblems.com/954) — OPEN | number theory — edited: 25 January 2026 — Let $0=a_0<a_1<a_2<\cdots$ be the sequence of integers defined by $a_0=0$ and $a_1=1$, and $a_{k+1}$ is the smallest integer $n$ for whic...
+- [#955](https://erdosproblems.com/955) — OPEN | number theory — edited: 30 September 2025 — Let\[s(n)=\sigma(n)-n=\sum_{\substack{d\mid n\\ d<n}}d\]be the sum of proper divisors function. If $A\subset \mathbb{N}$ has density $0$...
+- [#956](https://erdosproblems.com/956) — OPEN | geometry, distances, convex — If $C,D\subseteq \mathbb{R}^2$ then the distance between $C$ and $D$ is defined by\[\delta(C,D)=\inf_{\substack{c\in C\\ d\in D}}\| c-d\|...
+- [#959](https://erdosproblems.com/959) — OPEN | geometry, distances — Let $A\subset \mathbb{R}^2$ be a set of size $n$ and let $\{d_1,\ldots,d_k\}$ be the set of distinct distances determined by $A$. Let $f(...
+- [#960](https://erdosproblems.com/960) — OPEN | geometry — Let $r,k\geq 2$ be fixed. Let $A\subset \mathbb{R}^2$ be a set of $n$ points with no $k$ points on a line. Determine the threshold $f_{r,...
+- [#961](https://erdosproblems.com/961) — OPEN | number theory — Let $f(k)$ be the minimal $n$ such that every set of $n$ consecutive integers $>k$ contains an integer divisible by a prime $>k$. Estimat...
+- [#962](https://erdosproblems.com/962) — OPEN | number theory — edited: 30 December 2025 — Let $k(n)$ be the maximal $k$ such that there exists $m\leq n$ such that each of the integers\[m+1,\ldots,m+k\]are divisible by at least...
+- [#963](https://erdosproblems.com/963) — OPEN | number theory — edited: 23 January 2026 — Let $f(n)$ be the maximal $k$ such that in any set $A\subset \mathbb{R}$ of size $n$ there is a subset $B\subseteq A$ of size $\lvert B\r...
+- [#968](https://erdosproblems.com/968) — OPEN | number theory — Let $u_n=p_n/n$, where $p_n$ is the $n$th prime. Does the set of $n$ such that $u_n<u_{n+1}$ have positive density?
+- [#969](https://erdosproblems.com/969) — OPEN | number theory — edited: 19 October 2025 — Let $Q(x)$ count the number of squarefree integers in $[1,x]$. Determine the order of magnitude in the error term in the asymptotic\[Q(x)...
+- [#970](https://erdosproblems.com/970) — OPEN | number theory — Let $h(k)$ be Jacobsthal's function, defined to as the minimal $m$ such that, if $n$ has at most $k$ prime factors, then in any set of $m...
+- [#971](https://erdosproblems.com/971) — OPEN | number theory — Let $p(a,d)$ be the least prime congruent to $a\pmod{d}$. Does there exist a constant $c>0$ such that, for all large $d$,\[p(a,d) > (1+c)...
+- [#972](https://erdosproblems.com/972) — OPEN | number theory — Let $\alpha>1$ be irrational. Are there infinitely many primes $p$ such that $\lfloor p\alpha\rfloor$ is also prime?
+- [#973](https://erdosproblems.com/973) — OPEN | analysis — edited: 23 January 2026 — Does there exist a constant $C>1$ such that, for every $n\geq 2$, there exists a sequence $z_i\in \mathbb{C}$ with $z_1=1$ and $\lvert z_...
+- [#975](https://erdosproblems.com/975) — OPEN | number theory, divisors, polynomials — edited: 27 December 2025 — Let $f\in \mathbb{Z}[x]$ be an irreducible non-constant polynomial such that $f(n)\geq 1$ for all large $n\in\mathbb{N}$. Does there exis...
+- [#976](https://erdosproblems.com/976) — OPEN | number theory — edited: 01 February 2026 — Let $f\in \mathbb{Z}[x]$ be an irreducible polynomial of degree $d\geq 2$. Let $F_f(n)$ be maximal such that there exists $1\leq m\leq n$...
+- [#978](https://erdosproblems.com/978) — OPEN | number theory — edited: 05 March 2026 — Let $f\in \mathbb{Z}[x]$ be an irreducible polynomial of degree $k>2$ (and suppose that $k\neq 2^l$ for any $l\geq 1$) such that the lead...
+- [#979](https://erdosproblems.com/979) — OPEN | number theory — edited: 19 September 2025 — Let $k\geq 2$, and let $f_k(n)$ count the number of solutions to\[n=p_1^k+\cdots+p_k^k,\]where the $p_i$ are prime numbers. Is it true th...
+- [#982](https://erdosproblems.com/982) — FALSIFIABLE | geometry, convex, distances — edited: 19 October 2025 — If $n$ distinct points in $\mathbb{R}^2$ form a convex polygon then some vertex has at least $\lfloor \frac{n}{2}\rfloor$ different dista...
+- [#983](https://erdosproblems.com/983) — OPEN | number theory — edited: 18 January 2026 — Let $n\geq 2$ and $\pi(n)<k\leq n$. Let $f(k,n)$ be the smallest integer $r$ such that in any $A\subseteq \{1,\ldots,n\}$ of size $\lvert...
+- [#985](https://erdosproblems.com/985) — OPEN | number theory — Is it true that, for every prime $p$, there is a prime $q<p$ which is a primitive root modulo $p$?
+- [#986](https://erdosproblems.com/986) — OPEN | graph theory, ramsey theory — For any fixed $k\geq 3$,\[R(k,n) \gg \frac{n^{k-1}}{(\log n)^c}\]for some constant $c=c(k)>0$.
+- [#987](https://erdosproblems.com/987) — OPEN | analysis, discrepancy — edited: 29 December 2025 — Let $x_1,x_2,\ldots \in (0,1)$ be an infinite sequence and let\[A_k=\limsup_{n\to \infty}\left\lvert \sum_{j\leq n} e(kx_j)\right\rvert,\...
+- [#990](https://erdosproblems.com/990) — OPEN | analysis — Let $f=a_0+\cdots+a_dx^d\in \mathbb{C}[x]$ be a polynomial. Is it true that, if $f$ has roots $z_1,\ldots,z_d$ with corresponding argumen...
+- [#993](https://erdosproblems.com/993) — FALSIFIABLE | graph theory — edited: 01 February 2026 — The independent set sequence of any tree or forest is unimodal. In other words, if $i_k(G)$ counts the number of independent sets of vert...
+- [#995](https://erdosproblems.com/995) — OPEN | analysis, discrepancy — Let $n_1<n_2<\cdots$ be a lacunary sequence of integers and $f\in L^2([0,1])$. Estimate the growth of, for almost all $\alpha$,\[\sum_{1\...
+- [#996](https://erdosproblems.com/996) — OPEN | analysis — Let $n_1<n_2<\cdots$ be a lacunary sequence of integers, and let $f\in L^2([0,1])$. Let $f_n$ be the $n$th partial sum of the Fourier ser...
+- [#997](https://erdosproblems.com/997) — OPEN | analysis, discrepancy, primes — Call $x_1,x_2,\ldots \in (0,1)$ well-distributed if, for every $\epsilon>0$, if $k$ is sufficiently large then, for all $n>0$ and interva...
+- [#1002](https://erdosproblems.com/1002) — OPEN | analysis, diophantine approximation — For any $0<\alpha<1$, let\[f(\alpha,n)=\frac{1}{\log n}\sum_{1\leq k\leq n}(\tfrac{1}{2}-\{ \alpha k\}).\]Does $f(\alpha,n)$ have an asym...
+- [#1003](https://erdosproblems.com/1003) — OPEN | number theory — edited: 31 October 2025 — Are there infinitely many solutions to $\phi(n)=\phi(n+1)$, where $\phi$ is the Euler totient function?
+- [#1004](https://erdosproblems.com/1004) — OPEN | number theory — Let $c>0$. If $x$ is sufficiently large then does there exist $n\leq x$ such that the values of $\phi(n+k)$ are all distinct for $1\leq k...
+- [#1005](https://erdosproblems.com/1005) — OPEN | number theory — Let $\frac{a_1}{b_1},\frac{a_2}{b_2},\ldots$ be the Farey fractions of order $n\geq 4$. Let $f(n)$ be the largest integer such that if $1...
+- [#1011](https://erdosproblems.com/1011) — OPEN | graph theory — edited: 06 December 2025 — Let $f_r(n)$ be minimal such that every graph on $n$ vertices with $\geq f_r(n)$ edges and chromatic number $\geq r$ contains a triangle....
+- [#1013](https://erdosproblems.com/1013) — OPEN | graph theory, chromatic number — edited: 21 January 2026 — Let $h_3(k)$ be the minimal $n$ such that there exists a triangle-free graph on $n$ vertices with chromatic number $k$. Find an asymptoti...
+- [#1014](https://erdosproblems.com/1014) — OPEN | graph theory, ramsey theory — Let $R(k,l)$ be the Ramsey number, so the minimal $n$ such that every graph on at least $n$ vertices contains either a $K_k$ or an indepe...
+- [#1016](https://erdosproblems.com/1016) — OPEN | graph theory, cycles — edited: 27 December 2025 — Let $h(n)$ be minimal such that there is a graph on $n$ vertices with $n+h(n)$ edges which contains a cycle on $k$ vertices, for all $3\l...
+- [#1017](https://erdosproblems.com/1017) — OPEN | graph theory — edited: 28 December 2025 — Let $f(n,k)$ be such that every graph on $n$ vertices and $k$ edges can be partitioned into at most $f(n,k)$ edge-disjoint complete graph...
+- [#1020](https://erdosproblems.com/1020) — FALSIFIABLE | graph theory, hypergraphs — edited: 28 December 2025 — Let $f(n;r,k)$ be the maximal number of edges in an $r$-uniform hypergraph which contains no set of $k$ many independent edges. For all $...
+- [#1029](https://erdosproblems.com/1029) — OPEN | $100 | graph theory, ramsey theory — If $R(k)$ is the Ramsey number for $K_k$, the minimal $n$ such that every $2$-colouring of the edges of $K_n$ contains a monochromatic co...
+- [#1030](https://erdosproblems.com/1030) — OPEN | graph theory, ramsey theory — edited: 03 December 2025 — If $R(k,l)$ is the Ramsey number then prove the existence of some $c>0$ such that\[\lim_k \frac{R(k+1,k)}{R(k,k)}> 1+c.\]
+- [#1032](https://erdosproblems.com/1032) — OPEN | graph theory, chromatic number — edited: 23 January 2026 — We say that a graph is $4$-chromatic critical if it has chromatic number $4$, and removing any edge decreases the chromatic number to $3$...
+- [#1033](https://erdosproblems.com/1033) — OPEN | graph theory — Let $h(n)$ be such that every graph on $n$ vertices with $>n^2/4$ many edges contains a triangle whose vertices have degrees summing to a...
+- [#1035](https://erdosproblems.com/1035) — OPEN | graph theory — Is there a constant $c>0$ such that every graph on $2^n$ vertices with minimum degree $>(1-c)2^n$ contains the $n$-dimensional hypercube...
+- [#1038](https://erdosproblems.com/1038) — OPEN | analysis — edited: 11 January 2026 — Determine the infimum and supremum of\[\lvert \{ x\in \mathbb{R} : \lvert f(x)\rvert < 1\}\rvert\]as $f\in \mathbb{R}[x]$ ranges over all...
+- [#1039](https://erdosproblems.com/1039) — OPEN | analysis, polynomials — edited: 27 December 2025 — Let $f(z)=\prod_{i=1}^n(z-z_i)\in \mathbb{C}[z]$ with $\lvert z_i\rvert \leq 1$ for all $i$. Let $\rho(f)$ be the radius of the largest d...
+- [#1040](https://erdosproblems.com/1040) — OPEN | analysis — edited: 01 February 2026 — Let $F\subseteq \mathbb{C}$ be a closed infinite set, and let $\mu(F)$ be the infimum of\[\lvert \{ z: \lvert f(z)\rvert < 1\}\rvert,\]as...
+- [#1041](https://erdosproblems.com/1041) — FALSIFIABLE | analysis, polynomials — edited: 06 December 2025 — Let $f(z)=\prod_{i=1}^n(z-z_i)\in \mathbb{C}[z]$ with $\lvert z_i\rvert < 1$ for all $i$. Must there always exist a path of length less t...
+- [#1045](https://erdosproblems.com/1045) — FALSIFIABLE | analysis — edited: 30 December 2025 — Let $z_1,\ldots,z_n\in \mathbb{C}$ with $\lvert z_i-z_j\rvert\leq 2$ for all $i,j$, and\[\Delta(z_1,\ldots,z_n)=\prod_{i\neq j}\lvert z_i...
+- [#1049](https://erdosproblems.com/1049) — OPEN | irrationality — edited: 28 September 2025 — Let $t>1$ be a rational number. Is\[\sum_{n=1}^\infty\frac{1}{t^n-1}=\sum_{n=1}^\infty \frac{\tau(n)}{t^n}\]irrational, where $\tau(n)$ c...
+- [#1052](https://erdosproblems.com/1052) — OPEN | $10 | number theory — edited: 28 September 2025 — A unitary divisor of $n$ is $d\mid n$ such that $(d,n/d)=1$. A number $n\geq 1$ is a unitary perfect number if it is the sum of its unita...
+- [#1053](https://erdosproblems.com/1053) — OPEN | number theory — Call a number $k$-perfect if $\sigma(n)=kn$, where $\sigma(n)$ is the sum of the divisors of $n$. Must $k=o(\log\log n)$?
+- [#1054](https://erdosproblems.com/1054) — OPEN | number theory, divisors — edited: 06 December 2025 — Let $f(n)$ be the minimal integer $m$ such that $n$ is the sum of the $k$ smallest divisors of $m$ for some $k\geq 1$. Is it true that $f...
+- [#1055](https://erdosproblems.com/1055) — OPEN | number theory, primes — A prime $p$ is in class $1$ if the only prime divisors of $p+1$ are $2$ or $3$. In general, a prime $p$ is in class $r$ if every prime fa...
+- [#1056](https://erdosproblems.com/1056) — OPEN | number theory — edited: 29 September 2025 — Let $k\geq 2$. Does there exist a prime $p$ and consecutive intervals $I_1,\ldots,I_k$ such that\[\prod_{n\in I_i}n \equiv 1\pmod{p}\]for...
+- [#1057](https://erdosproblems.com/1057) — OPEN | number theory — edited: 16 January 2026 — Let $C(x)$ count the number of Carmichael numbers in the interval $[1,x]$. Is it true that $C(x)=x^{1-o(1)}$?
+- [#1059](https://erdosproblems.com/1059) — OPEN | number theory, primes — Are there infinitely many primes $p$ such that $p-k!$ is composite for each $k$ such that $1\leq k!<p$?
+- [#1060](https://erdosproblems.com/1060) — OPEN | number theory — edited: 28 September 2025 — Let $f(n)$ count the number of solutions to $k\sigma(k)=n$, where $\sigma(k)$ is the sum of divisors of $k$. Is it true that $f(n)\leq n^...
+- [#1061](https://erdosproblems.com/1061) — OPEN | number theory — How many solutions are there to\[\sigma(a)+\sigma(b)=\sigma(a+b)\]with $a+b\leq x$, where $\sigma$ is the sum of divisors function? Is it...
+- [#1062](https://erdosproblems.com/1062) — OPEN | number theory — edited: 06 January 2026 — Let $f(n)$ be the size of the largest subset $A\subseteq \{1,\ldots,n\}$ such that there are no three distinct elements $a,b,c\in A$ such...
+- [#1063](https://erdosproblems.com/1063) — OPEN | number theory — edited: 01 February 2026 — Let $k\geq 2$ and define $n_k\geq 2k$ to be the least value of $n$ such that $n-i$ divides $\binom{n}{k}$ for all but one $0\leq i<k$. Es...
+- [#1065](https://erdosproblems.com/1065) — OPEN | number theory — edited: 30 September 2025 — Are there infinitely many primes $p$ such that $p=2^kq+1$ for some prime $q$ and $k\geq 0$? Or $p=2^k3^lq+1$?
+- [#1066](https://erdosproblems.com/1066) — OPEN | graph theory, planar graphs — edited: 02 October 2025 — Let $G$ be a graph given by $n$ points in $\mathbb{R}^2$, where any two distinct points are at least distance $1$ apart, and we draw an e...
+- [#1068](https://erdosproblems.com/1068) — OPEN | graph theory, set theory, chromatic number — edited: 23 January 2026 — Does every graph with chromatic number $\aleph_1$ contain a countable subgraph which is infinitely vertex-connected?
+- [#1070](https://erdosproblems.com/1070) — OPEN | geometry — edited: 22 January 2026 — Let $f(n)$ be maximal such that, given any $n$ points in $\mathbb{R}^2$, there exist $f(n)$ points such that no two are distance $1$ apar...
+- [#1072](https://erdosproblems.com/1072) — OPEN | number theory — edited: 04 October 2025 — For any prime $p$, let $f(p)$ be the least integer such that $f(p)!+1\equiv 0\pmod{p}$. Is it true that there are infinitely many $p$ for...
+- [#1073](https://erdosproblems.com/1073) — OPEN | number theory — edited: 06 October 2025 — Let $A(x)$ count the number of composite $u<x$ such that $n!+1\equiv 0\pmod{u}$ for some $n$. Is it true that $A(x)\leq x^{o(1)}$?
+- [#1074](https://erdosproblems.com/1074) — OPEN | number theory — edited: 04 October 2025 — Let $S$ be the set of all $m\geq 1$ such that there exists a prime $p\not\equiv 1\pmod{m}$ such that $m!+1\equiv 0\pmod{p}$. Does\[\lim \...
+- [#1075](https://erdosproblems.com/1075) — OPEN | hypergraphs — edited: 05 October 2025 — Let $r\geq 3$. There exists $c_r>r^{-r}$ such that, for any $\epsilon>0$, if $n$ is sufficiently large, the following holds. Any $r$-unif...
+- [#1082](https://erdosproblems.com/1082) — FALSIFIABLE | geometry, distances — edited: 20 December 2025 — Let $A\subset \mathbb{R}^2$ be a set of $n$ points with no three on a line. Does $A$ determine at least $\lfloor n/2\rfloor$ distinct dis...
+- [#1083](https://erdosproblems.com/1083) — OPEN | geometry, distances — edited: 16 October 2025 — Let $d\geq 3$, and let $f_d(n)$ be the minimal $m$ such that every set of $n$ points in $\mathbb{R}^d$ determines at least $m$ distinct d...
+- [#1084](https://erdosproblems.com/1084) — OPEN | geometry, distances — edited: 08 February 2026 — Let $f_d(n)$ be minimal such that in any collection of $n$ points in $\mathbb{R}^d$, all of distance at least $1$ apart, there are at mos...
+- [#1085](https://erdosproblems.com/1085) — OPEN | geometry, distances — edited: 17 October 2025 — Let $f_d(n)$ be minimal such that, in any set of $n$ points in $\mathbb{R}^d$, there exist at most $f_d(n)$ pairs of points which distanc...
+- [#1086](https://erdosproblems.com/1086) — OPEN | geometry, distances — edited: 16 October 2025 — Let $g(n)$ be minimal such that any set of $n$ points in $\mathbb{R}^2$ contains the vertices of at most $g(n)$ many triangles with the s...
+- [#1087](https://erdosproblems.com/1087) — OPEN | geometry, distances — Let $f(n)$ be minimal such that every set of $n$ points in $\mathbb{R}^2$ contains at most $f(n)$ many sets of four points which are 'deg...
+- [#1088](https://erdosproblems.com/1088) — OPEN | geometry — edited: 16 October 2025 — Let $f_d(n)$ be the minimal $m$ such that any set of $m$ points in $\mathbb{R}^d$ contains a set of $n$ points such that any two determin...
+- [#1091](https://erdosproblems.com/1091) — OPEN | graph theory, chromatic number — edited: 06 December 2025 — Let $G$ be a $K_4$-free graph with chromatic number $4$. Must $G$ contain an odd cycle with at least two diagonals? More generally, is th...
+- [#1092](https://erdosproblems.com/1092) — OPEN | graph theory, chromatic number — edited: 06 December 2025 — Let $f_r(n)$ be maximal such that, if a graph $G$ has the property that every subgraph $H$ on $m$ vertices is the union of a graph with c...
+- [#1093](https://erdosproblems.com/1093) — OPEN | number theory, binomial coefficients — edited: 27 December 2025 — For $n\geq 2k$ we define the deficiency of $\binom{n}{k}$ as follows. If $\binom{n}{k}$ is divisible by a prime $p\leq k$ then the defici...
+- [#1094](https://erdosproblems.com/1094) — OPEN | number theory, binomial coefficients — edited: 24 October 2025 — For all $n\geq 2k$ the least prime factor of $\binom{n}{k}$ is $\leq \max(n/k,k)$, with only finitely many exceptions.
+- [#1095](https://erdosproblems.com/1095) — OPEN | number theory, binomial coefficients — edited: 12 January 2026 — Let $g(k)>k+1$ be the smallest $n$ such that all prime factors of $\binom{n}{k}$ are $>k$. Estimate $g(k)$.
+- [#1096](https://erdosproblems.com/1096) — OPEN | number theory — edited: 19 October 2025 — Let $1<q<1+\epsilon$ and consider the set of numbers of the shape $\sum_{i\in S}q^i$ (for all finite $S$), ordered by size as $0=x_1<x_2<...
+- [#1097](https://erdosproblems.com/1097) — OPEN | number theory, additive combinatorics — edited: 03 December 2025 — Let $A$ be a set of $n$ integers. How many distinct $d$ can occur as the common difference of a three-term arithmetic progression in $A$?...
+- [#1100](https://erdosproblems.com/1100) — OPEN | number theory, divisors — edited: 19 October 2025 — If $1=d_1<\cdots<d_{\tau(n)}=n$ are the divisors of $n$, then let $\tau_\perp(n)$ count the number of $i$ for which $(d_i,d_{i+1})=1$. Is...
+- [#1101](https://erdosproblems.com/1101) — OPEN | number theory — edited: 19 October 2025 — If $u=\{u_1<u_2<\cdots\}$ is a sequence of integers such that $(u_i,u_j)=1$ for all $i\neq j$ and $\sum \frac{1}{u_i}<\infty$ then let $\...
+- [#1103](https://erdosproblems.com/1103) — OPEN | number theory — edited: 03 December 2025 — Let $A$ be an infinite sequence of integers such that every $n\in A+A$ is squarefree. How fast must $A$ grow?
+- [#1104](https://erdosproblems.com/1104) — OPEN | graph theory, chromatic number — edited: 21 January 2026 — Let $f(n)$ be the maximum possible chromatic number of a triangle-free graph on $n$ vertices. Estimate $f(n)$.
+- [#1106](https://erdosproblems.com/1106) — OPEN | number theory — edited: 16 November 2025 — Let $p(n)$ denote the partition function of $n$ and let $F(n)$ count the number of distinct prime factors of\[\prod_{1\leq k\leq n}p(k).\...
+- [#1107](https://erdosproblems.com/1107) — OPEN | number theory, powerful — edited: 18 November 2025 — Let $r\geq 2$. A number $n$ is $r$-powerful if for every prime $p$ which divides $n$ we have $p^r\mid n$. Is every large integer the sum...
+- [#1108](https://erdosproblems.com/1108) — OPEN | number theory, factorials — edited: 04 November 2025 — Let\[A = \left\{ \sum_{n\in S}n! : S\subset \mathbb{N}\textrm{ finite}\right\}.\]If $k\geq 2$, then does $A$ contain only finitely many $...
+- [#1109](https://erdosproblems.com/1109) — OPEN | number theory — edited: 03 December 2025 — Let $f(N)$ be the size of the largest subset $A\subseteq \{1,\ldots,N\}$ such that every $n\in A+A$ is squarefree. Estimate $f(N)$. In pa...
+- [#1110](https://erdosproblems.com/1110) — OPEN | number theory — edited: 22 January 2026 — Let $p>q\geq 2$ be two coprime integers. We call $n$ representable if it is the sum of integers of the form $p^kq^l$, none of which divid...
+- [#1111](https://erdosproblems.com/1111) — OPEN | graph theory — edited: 07 December 2025 — If $G$ is a finite graph and $A,B$ are disjoint sets of vertices then we call $A,B$ anticomplete if there are no edges between $A$ and $B...
+- [#1112](https://erdosproblems.com/1112) — OPEN | additive combinatorics — edited: 28 December 2025 — Let $1\leq d_1<d_2$ and $k\geq 3$. Does there exist an integer $r$ such that if $B=\{b_1<\cdots\}$ is a lacunary sequence of positive int...
+- [#1113](https://erdosproblems.com/1113) — OPEN | number theory, covering systems — edited: 29 December 2025 — A positive odd integer $m$ such that none of $2^km+1$ are prime for $k\geq 0$ is called a Sierpinski number . We say that a set of primes...
+- [#1117](https://erdosproblems.com/1117) — OPEN | analysis — edited: 29 December 2025 — Let $f(z)$ be an entire function which is not a monomial. Let $\nu(r)$ count the number of $z$ with $\lvert z\rvert=r$ such that $\lvert...
+- [#1120](https://erdosproblems.com/1120) — OPEN | analysis — edited: 30 December 2025 — Let $f\in \mathbb{C}[z]$ be a monic polynomial of degree $n$, all of whose roots satisfy $\lvert z\rvert\leq 1$. Let\[E= \{ z : \lvert f(...
+- [#1122](https://erdosproblems.com/1122) — OPEN | number theory — edited: 30 December 2025 — Let $f:\mathbb{N}\to \mathbb{R}$ be an additive function (i.e. $f(ab)=f(a)+f(b)$ whenever $(a,b)=1$). Let\[A=\{ n \geq 1: f(n+1)< f(n)\}....
+- [#1131](https://erdosproblems.com/1131) — OPEN | analysis, polynomials — edited: 23 January 2026 — For $x_1,\ldots,x_n\in [-1,1]$ let\[l_k(x)=\frac{\prod_{i\neq k}(x-x_i)}{\prod_{i\neq k}(x_k-x_i)},\]which are such that $l_k(x_k)=1$ and...
+- [#1132](https://erdosproblems.com/1132) — OPEN | analysis, polynomials — edited: 23 January 2026 — For $x_1,\ldots,x_n\in [-1,1]$ let\[l_k(x)=\frac{\prod_{i\neq k}(x-x_i)}{\prod_{i\neq k}(x_k-x_i)},\]which are such that $l_k(x_k)=1$ and...
+- [#1133](https://erdosproblems.com/1133) — OPEN | analysis, polynomials — edited: 31 December 2025 — Let $C>0$. There exists $\epsilon>0$ such that if $n$ is sufficiently large the following holds. For any $x_1,\ldots,x_n\in [-1,1]$ there...
+- [#1135](https://erdosproblems.com/1135) — OPEN | $500 | number theory, iterated functions — edited: 12 January 2026 — Define $f:\mathbb{N}\to \mathbb{N}$ by $f(n)=n/2$ if $n$ is even and $f(n)=\frac{3n+1}{2}$ if $n$ is odd. Given any integer $m\geq 1$ doe...
+- [#1137](https://erdosproblems.com/1137) — OPEN | number theory, primes — edited: 23 January 2026 — Let $d_n=p_{n+1}-p_n$, where $p_n$ denotes the $n$th prime. Is it true that\[\frac{\max_{n<x}d_{n}d_{n-1}}{(\max_{n<x}d_n)^2}\to 0\]as $x...
+- [#1138](https://erdosproblems.com/1138) — OPEN | number theory, primes — edited: 23 January 2026 — Let $x/2<y<x$ and $C>1$. If $d=\max_{p_n<x} (p_{n+1}-p_n)$, where $p_n$ denotes the $n$th prime, then is it true that\[\pi(y+Cd)-\pi(y)\s...
+- [#1139](https://erdosproblems.com/1139) — OPEN | number theory, primes — edited: 23 January 2026 — Let $1\leq u_1<u_2<\cdots$ be the sequence of integers with at most $2$ prime factors. Is it true that\[\limsup \frac{u_{k+1}-u_k}{\log k...
+- [#1141](https://erdosproblems.com/1141) — OPEN | number theory, primes — edited: 26 January 2026 — Are there infinitely many $n$ such that $n-k^2$ is prime for all $k$ with $(n,k)=1$ and $k^2<n$?
+- [#1142](https://erdosproblems.com/1142) — OPEN | number theory, primes — edited: 23 January 2026 — Are there infinitely many $n$ (or any $n>105$) such that $n-2^k$ is prime for all $1<2^k<n$?
+- [#1143](https://erdosproblems.com/1143) — OPEN | number theory, primes — edited: 23 January 2026 — Let $p_1<\cdots<p_u$ be primes and let $k\geq 1$. Let $F_k(p_1,\ldots,p_u)$ be such that every interval of $k$ positive integers contains...
+- [#1144](https://erdosproblems.com/1144) — OPEN | number theory, probability — edited: 26 January 2026 — Let $f$ be a random completely multiplicative function, where for each prime $p$ we independently choose $f(p)\in \{-1,1\}$ uniformly at...
+- [#1145](https://erdosproblems.com/1145) — OPEN | additive combinatorics, additive basis — edited: 08 February 2026 — Let $A=\{1\leq a_1<a_2<\cdots\}$ and $B=\{1\leq b_1<b_2<\cdots\}$ be sets of integers with $a_n/b_n\to 1$. If $A+B$ contains all sufficie...
+- [#1146](https://erdosproblems.com/1146) — OPEN | number theory — edited: 23 January 2026 — We say that $A\subset \mathbb{N}$ is an essential component if $d_s(A+B)>d_s(B)$ for every $B\subset \mathbb{N}$ with $0<d_s(B)<1$ where...
+- [#1148](https://erdosproblems.com/1148) — OPEN | number theory — edited: 26 January 2026 — Can every large integer $n$ be written as $n=x^2+y^2-z^2$ with $\max(x^2,y^2,z^2)\leq n$?
+- [#1150](https://erdosproblems.com/1150) — OPEN | analysis, polynomials — edited: 23 January 2026 — Does there exist a constant $c>0$ such that, for all large $n$ and all polynomials $P$ of degree $n$ with coefficients $\pm 1$,\[\max_{\l...
+- [#1151](https://erdosproblems.com/1151) — OPEN | analysis, polynomials — edited: 23 January 2026 — Given $a_1,\ldots,a_n\in [-1,1]$ let\[\mathcal{L}^nf(x) = \sum_{1\leq i\leq n}f(a_i)\ell_i(x)\]be the unique polynomial of degree $n-1$ w...
+- [#1152](https://erdosproblems.com/1152) — OPEN | analysis, polynomials — edited: 23 January 2026 — For $n\geq 1$ fix some sequence of $n$ distinct numbers $x_{1n},\ldots,x_{nn}\in [-1,1]$. Let $\epsilon=\epsilon(n)\to 0$. Does there alw...
+- [#1153](https://erdosproblems.com/1153) — PROVED | analysis, polynomials — edited: 01 February 2026 — For $x_1,\ldots,x_n\in [-1,1]$ let\[l_k(x)=\frac{\prod_{i\neq k}(x-x_i)}{\prod_{i\neq k}(x_k-x_i)},\]which are such that $l_k(x_k)=1$ and...
+- [#1154](https://erdosproblems.com/1154) — NOT DISPROVABLE | analysis — edited: 25 January 2026 — Does there exist, for every $\alpha \in [0,1]$, a ring or field in $\mathbb{R}$ with Hausdorff dimension $\alpha$?
+- [#1155](https://erdosproblems.com/1155) — OPEN | graph theory — edited: 25 January 2026 — Construct a random graph on $n$ vertices in the following way: begin with the complete graph $K_n$. At each stage, choose uniformly a ran...
+- [#1156](https://erdosproblems.com/1156) — OPEN | graph theory, chromatic number — edited: 27 January 2026 — Let $G$ be a random graph on $n$ vertices, in which every edge is included independently with probability $1/2$. Is there some constant $...
+- [#1157](https://erdosproblems.com/1157) — OPEN | hypergraphs, turan number — edited: 24 January 2026 — Let $t,k,r\geq 2$. Let $\mathcal{F}$ be the family of all $r$-uniform hypergraphs with $k$ vertices and $s$ edges. Determine\[\mathrm{ex}...
+- [#1158](https://erdosproblems.com/1158) — OPEN | hypergraphs, turan number — edited: 23 January 2026 — Let $K_{t}(r)$ be the complete $t$-partite $t$-uniform hypergraph with $r$ vertices in each class. Is it true that\[\mathrm{ex}_t(n,K_t(r...
+- [#1159](https://erdosproblems.com/1159) — OPEN | combinatorics — edited: 23 January 2026 — Determine whether there exists a constant $C>1$ such that the following holds. Let $P$ be a finite projective plane . Must there exist a...
+- [#1160](https://erdosproblems.com/1160) — OPEN | group theory — edited: 26 January 2026 — Let $g(n)$ denote the number of groups of order $n$. If $n\leq 2^m$ then $g(n)\leq g(2^m)$.
+- [#1162](https://erdosproblems.com/1162) — OPEN | group theory — edited: 23 January 2026 — Give an asymptotic formula for the number of subgroups of $S_n$. Is there a statistical theorem on their order?
+- [#1163](https://erdosproblems.com/1163) — OPEN | group theory — Describe (by statistical means) the arithmetic structure of the orders of subgroups of $S_n$.
+- [#1167](https://erdosproblems.com/1167) — OPEN | set theory, ramsey theory — edited: 23 January 2026 — Let $r\geq 2$ be finite and $\lambda$ be an infinite cardinal. Let $\kappa_\alpha$ be cardinals for all $\alpha<\gamma$. Is it true that\...
+- [#1168](https://erdosproblems.com/1168) — OPEN | set theory, ramsey theory — edited: 23 January 2026 — Prove that\[\aleph_{\omega+1}\not\to (\aleph_{\omega+1}, 3,\ldots,3)_{\aleph_0}^2\]without assuming the generalised continuum hypothesis.
+- [#1169](https://erdosproblems.com/1169) — NOT DISPROVABLE | set theory, ramsey theory — edited: 25 January 2026 — Is it true that, for all finite $k<\omega$,\[\omega_1^2 \not\to (\omega_1^2, 3)^2?\]
+- [#1170](https://erdosproblems.com/1170) — OPEN | set theory, ramsey theory — edited: 23 January 2026 — Is it consistent that\[\omega_2\to (\alpha)_2^2\]for every $\alpha <\omega_2$?
+- [#1171](https://erdosproblems.com/1171) — OPEN | set theory, ramsey theory — edited: 26 January 2026 — Is it true that, for all finite $k<\omega$,\[\omega_1^2\to (\omega_1\omega, 3,\ldots,3)_{k+1}^2?\]
+- [#1172](https://erdosproblems.com/1172) — OPEN | set theory, ramsey theory — edited: 23 January 2026 — Establish whether the following are true assuming the generalised continuum hypothesis:\[\omega_3 \to (\omega_2,\omega_1+2)^2,\]\[\omega_...
+- [#1173](https://erdosproblems.com/1173) — OPEN | set theory, combinatorics — edited: 25 January 2026 — Assume the generalised continuum hypothesis. Let\[f: \omega_{\omega+1}\to [\omega_{\omega+1}]^{\leq \aleph_\omega}\]be a set mapping such...
+- [#1174](https://erdosproblems.com/1174) — OPEN | set theory, ramsey theory — Does there exist a graph $G$ with no $K_4$ such that every edge colouring of $G$ with countably many colours contains a monochromatic $K_...
+- [#1175](https://erdosproblems.com/1175) — OPEN | set theory, chromatic number — Let $\kappa$ be an uncountable cardinal. Must there exist a cardinal $\lambda$ such that every graph with chromatic number $\lambda$ cont...
+- [#1176](https://erdosproblems.com/1176) — OPEN | set theory, ramsey theory — edited: 24 January 2026 — Let $G$ be a graph with chromatic number $\aleph_1$. Is it true that there is a colouring of the edges with $\aleph_1$ many colours such...
+- [#1177](https://erdosproblems.com/1177) — OPEN | set theory, chromatic number, hypergraphs — edited: 23 January 2026 — Let $G$ be a finite $3$-uniform hypergraph, and let $F_G(\kappa)$ denote the collection of $3$-uniform hypergraphs with chromatic number...
+- [#1178](https://erdosproblems.com/1178) — OPEN | graph theory, hypergraphs — edited: 26 January 2026 — For $r\geq 3$ let $d_r(e)$ be the minimal $d$ such that\[\mathrm{ex}_r(n,\mathcal{F})=o(n^2),\]where $\mathcal{F}$ is the family of $r$-u...