Skip to content

Erdős Problems

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

Add a contributionCollection details
Collection coverage

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
More filters

Coverage is source-observation coverage, not Problem completeness. Inspect coverage

Problems

27 Problems

NumberQuestionOpen
#3If A⊂NA \subset \mathbb{N} has ∑n∈A1n=∞\sum_{n \in A}\frac 1 n = \infty, then must A contain arbitrarily long arithmetic progressions?openFormalized
#139Erdős Problem 139: Let rk(N)r_k(N) be the size of the largest subset of 1,...,N{1,...,N} which does not contain a non-trivial kk-term arithmetic progression. Prove that rk(N)=o(N)r_k(N) = o(N).provedFormalized
#140No statement retained — open to read what the source holdsprovedNo formal declaration
#141Let k≥3k≥3. Are there kk consecutive primes in arithmetic progression?openFormalized
#142Prove an asymptotic formula for rk(N)r_k(N), the largest possible size of a subset of {1,…,N}\{1, \dots, N\} that does not contain any non-trivial kk-term arithmetic progression.openFormalized
#160Estimate h(n)h(n) by finding a better lower bound.openFormalized
#169No statement retained — open to read what the source holdsopenNo formal declaration
#176No statement retained — open to read what the source holdsopenNo formal declaration
#177No statement retained — open to read what the source holdsopenNo formal declaration
#179No statement retained — open to read what the source holdsprovedNo formal declaration
#190No statement retained — open to read what the source holdssolvedNo formal declaration
#192No statement retained — open to read what the source holdssolved (Lean)No formal declaration
#194Let k≥3k\geq 3. Must any ordering of R\mathbb{R} contain a monotone kk-term arithmetic progression, that is, some x1<⋯<xkx_1 <\cdots < x_k which forms an increasing or decreasing kk-term arithmetic progression?disproved (Lean)Formalized
#195What is the largest kk such that in any permutation of Z\mathbb{Z} there must exist a monotone kk-term arithmetic progression x1<⋯<xkx_1 < \cdots < x_k?openFormalized
#196Must every permutation of N\mathbb{N}, contain a monotone 4-term arithmetic progression?openFormalized
#197Can N\mathbb{N} be partitioned into two sets, each of which can be permuted to avoid monotone 3-term arithmetic progressions?openFormalized
#198The statement for which Baumgartner actually writes a proof.disproved (Lean)Formalized
#199If A⊂RA\subset \mathbb{R} does not contain a 3-term arithmetic progression then must R\A\mathbb{R}\backslash A contain an infinite arithmetic progression?disproved (Lean)Formalized
#200Does the longest arithmetic progression of primes in {1,…,N}\{1,\ldots,N\} have length o(log⁡N)o(\log N)?openFormalized
#201No statement retained — open to read what the source holdsopenNo formal declaration
#219Are there arbitrarily long arithmetic progressions of primes? Solution: yes. Ref: Green, Ben and Tao, Terence, _The primes contain arbitrarily long arithmetic progressions_provedFormalized
#271No statement retained — open to read what the source holdsopenNo formal declaration
#272Let N≥1N\geq 1. What is the largest tt such that there are A1,…,At⊆{1,…,N}A_1,\ldots,A_t\subseteq \{1,\ldots,N\} with Ai∩AjA_i\cap A_j a non-empty arithmetic progression for all i≠ji\neq j?openFormalized
#984No statement retained — open to read what the source holdsprovedNo formal declaration
#1185No statement retained — open to read what the source holdssolvedNo formal declaration
#1186No statement retained — open to read what the source holdsopenNo formal declaration
#1187No statement retained — open to read what the source holdssolvedNo formal declaration

Search problems.science

Find a Problem, Result, source, or page