Erdős Problems

1,217 source-owned questions · 604 with a formal statement · searchable by statement, number, topic and source status.

Add a contribution Collection details

Full distribution

Collection coverage

Source status, exact formal material, and reviewed Results are separate signals.

Open per source608
Resolved per source556
Other source status53

Exact formal statement available604 / 1,217

With Repository-reviewed evidence2 / 1,217

1,217 Problems · 2 with reviewed evidence

25/26

Number	Question	Source says	Formal	Result here
#1153	No statement retained — open to read what the source holdsSource says provedNo formal declaration	proved	No formal statement	No Result decision
#1154	No statement retained — open to read what the source holdsSource says not disprovableNo formal declaration	not disprovable	No formal statement	No Result decision
#1155	No statement retained — open to read what the source holdsSource says openNo formal declaration	open	No formal statement	No Result decision
#1156	No statement retained — open to read what the source holdsSource says openNo formal declaration	open	No formal statement	No Result decision
#1157	No statement retained — open to read what the source holdsSource says openNo formal declaration	open	No formal statement	No Result decision
#1158	No statement retained — open to read what the source holdsSource says openNo formal declaration	open	No formal statement	No Result decision
#1159	No statement retained — open to read what the source holdsSource says openNo formal declaration	open	No formal statement	No Result decision
#1160	No statement retained — open to read what the source holdsSource says openNo formal declaration	open	No formal statement	No Result decision
#1161	No statement retained — open to read what the source holdsSource says solvedNo formal declaration	solved	No formal statement	No Result decision
#1162	No statement retained — open to read what the source holdsSource says openNo formal declaration	open	No formal statement	No Result decision
#1163	No statement retained — open to read what the source holdsSource says openNo formal declaration	open	No formal statement	No Result decision
#1164	No statement retained — open to read what the source holdsSource says provedNo formal declaration	proved	No formal statement	No Result decision
#1165	No statement retained — open to read what the source holdsSource says solvedNo formal declaration	solved	No formal statement	No Result decision
#1166	No statement retained — open to read what the source holdsSource says provedNo formal declaration	proved	No formal statement	No Result decision
#1167	The partition relation $\mu \to (\nu)^r_1$ with a single color is equivalent to $\nu \le \mu$ .Source says openFormalized	open	In Lean	No Result decision
#1168	No statement retained — open to read what the source holdsSource says openNo formal declaration	open	No formal statement	No Result decision
#1169	No statement retained — open to read what the source holdsSource says not disprovableNo formal declaration	not disprovable	No formal statement	No Result decision
#1170	No statement retained — open to read what the source holdsSource says openNo formal declaration	open	No formal statement	No Result decision
#1171	No statement retained — open to read what the source holdsSource says openNo formal declaration	open	No formal statement	No Result decision
#1172	No statement retained — open to read what the source holdsSource says openNo formal declaration	open	No formal statement	No Result decision
#1173	No statement retained — open to read what the source holdsSource says openNo formal declaration	open	No formal statement	No Result decision
#1174	No statement retained — open to read what the source holdsSource says not disprovableNo formal declaration	not disprovable	No formal statement	No Result decision
#1175	Let $\kappa$ be an uncountable cardinal. Must there exist a cardinal $\lambda$ such that every graph with chromatic number $\lambda$ contains a triangle-free subgraph with chromatic number $\kappa$ ?Source says openFormalized	open	In Lean	No Result decision
#1176	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 that, in any countable colouring of the vertices, there exists a vertex colour containing all edge colours?Source says not disprovableFormalized	not disprovable	In Lean	No Result decision
#1177	No statement retained — open to read what the source holdsSource says openNo formal declaration	open	No formal statement	No Result decision
#1178	No statement retained — open to read what the source holdsSource says openNo formal declaration	open	No formal statement	No Result decision
#1179	No statement retained — open to read what the source holdsSource says provedNo formal declaration	proved	No formal statement	No Result decision
#1180	No statement retained — open to read what the source holdsSource says provedNo formal declaration	proved	No formal statement	No Result decision
#1181	No statement retained — open to read what the source holdsSource says openNo formal declaration	open	No formal statement	No Result decision
#1182	No statement retained — open to read what the source holdsSource says openNo formal declaration	open	No formal statement	No Result decision
#1183	No statement retained — open to read what the source holdsSource says openNo formal declaration	open	No formal statement	No Result decision
#1184	No statement retained — open to read what the source holdsSource says openNo formal declaration	open	No formal statement	No Result decision
#1185	No statement retained — open to read what the source holdsSource says solvedNo formal declaration	solved	No formal statement	No Result decision
#1186	No statement retained — open to read what the source holdsSource says openNo formal declaration	open	No formal statement	No Result decision
#1187	No statement retained — open to read what the source holdsSource says solvedNo formal declaration	solved	No formal statement	No Result decision
#1188	Call a set of distinct integers $1<n_1<\cdots<n_k$ with associated congruence classes $a_i\pmod{n_i}$ a distinct covering system if every integer satisfies at least one of these congruences. A minimal distinct covering system is one such that no proper subset forms a covering system. Let $F(x)$ count the number of minimal distinct covering systems with all moduli in $[1,x]$ . Estimate $F(x)$ .Source says openFormalized	open	In Lean	No Result decision
#1189	No statement retained — open to read what the source holdsSource says openNo formal declaration	open	No formal statement	No Result decision
#1190	Let $\epsilon_m=\max \sum \frac{1}{n_i}$ where the maximum is taken over all finite sequences $m<n_1<\cdots<n_k$ for which there exist congruences $a_i\pmod{n_i}$ such that no integer satisfies two such congruences.Source says solved (Lean)Formalized	solved (Lean)	In Lean	No Result decision
#1191	No statement retained — open to read what the source holdsSource says openNo formal declaration	open	No formal statement	No Result decision
#1192	Does there exist, for all $r\geq 2$ , a basis $A$ of order $r$ (so that $f_r(n)>0$ for all large $n$ ) such that $\sum_{n\leq x}f_r(n)^2 \ll x$ for all $x$ ?Source says openFormalized	open	In Lean	No Result decision
#1193	Let $A\subset \mathbb{N}$ and let $g(n)$ be a non-decreasing function of $n$ which is always $>0$ .Source says solved (Lean)Formalized	solved (Lean)	In Lean	No Result decision
#1194	No statement retained — open to read what the source holdsSource says openNo formal declaration	open	No formal statement	No Result decision
#1195	No statement retained — open to read what the source holdsSource says solvedNo formal declaration	solved	No formal statement	No Result decision
#1196	Is it true that, for any $x$ , if $A\subset [x,\infty)$ is a primitive set of integers (so that no distinct elements of $A$ divide each other) then`Unparsed notation: \sum_{a\in A}\frac{1}{a\log a}< 1+o(1),`where the $o(1)$ term $\to 0$ as $x\to \infty$ ? -Source says proved (Lean)Formalized	proved (Lean)	In Lean	No Result decision
#1197	No statement retained — open to read what the source holdsSource says disproved (Lean)No formal declaration	disproved (Lean)	No formal statement	No Result decision
#1198	No statement retained — open to read what the source holdsSource says disprovedNo formal declaration	disproved	No formal statement	No Result decision
#1199	Is it true that in any 2-colouring of $\mathbb{N}$ there exists an infinite set $A$ such that all elements of $A+A$ are the same colour?Source says openFormalized	open	In Lean	No Result decision
#1200	No statement retained — open to read what the source holdsSource says openNo formal declaration	open	No formal statement	No Result decision