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

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

576 Problems · 1 with reviewed evidence

5/12

Number	Question	Source says	Formal	Result here
#372	No statement retained — open to read what the source holdsprovedNo formal declaration	proved	No formal statement	No Result decision
#373	Show that the equation `n!=a_1!a_2!···a_k!`, with `n−1 > a_1 ≥ a_2 ≥ ··· ≥ a_k`, has only finitely many solutions.openFormalized	open	In Lean	No Result decision
#374	No statement retained — open to read what the source holdsopenNo formal declaration	open	No formal statement	No Result decision
#375	Is `Erdos375Prop` true?falsifiableFormalized	falsifiable	In Lean	No Result decision
#376	Are there infinitely many $n$ such that ${2n\choose n}$ is coprime to $105$ ?openFormalized	open	In Lean	No Result decision
#377	Is there some absolute constant $C > 0$ such that $\sum_{p \leq n} 1_{p\nmid {2n \choose n}}\frac{1}{p} \leq C$ for all $n$ ?openFormalized	open	In Lean	No Result decision
#378	No statement retained — open to read what the source holdsprovedNo formal declaration	proved	No formal statement	No Result decision
#379	Let $S(n)$ denote the largest integer such that, for all $1 ≤ k < n$ , the binomial coefficient $\binom{n}{k}$ is divisible by $p^S(n)$ for some prime $p$ (depending on $k$ ).Then $\limsup S(n) = \infty$ .proved (Lean)Formalized	proved (Lean)	In Lean	No Result decision
#380	No statement retained — open to read what the source holdsprovedNo formal declaration	proved	No formal statement	No Result decision
#381	No statement retained — open to read what the source holdsdisprovedNo formal declaration	disproved	No formal statement	No Result decision
#382	No statement retained — open to read what the source holdsopenNo formal declaration	open	No formal statement	No Result decision
#383	Is it true that for every $k$ there are infinitely many primes $p$ such that the largest prime divisor of $\prod_{i = 0}^k (p ^ 2 + i)$ is $p$ ?openFormalized	open	In Lean	No Result decision
#384	No statement retained — open to read what the source holdsprovedNo formal declaration	proved	No formal statement	No Result decision
#385	Note that trivially $F(n) \leq n + \sqrt{n}$ .openFormalized	open	In Lean	No Result decision
#386	There is a $k$ , such that $2 \le k \le n - 2$ and $\binom{n}{k}$ can be the product of consecutive primes infinitely often?openFormalized	open	In Lean	No Result decision
#387	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]$ ?solvedFormalized	solved	In Lean	No Result decision
#388	No statement retained — open to read what the source holdsopenNo formal declaration	open	No formal statement	No Result decision
#389	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)?$ openFormalized	open	In Lean	No Result decision
#390	Does there exists a constant `c` such that `f n - 2 * n ~ c * (n / log n)`?openFormalized	open	In Lean	No Result decision
#391	No statement retained — open to read what the source holdsprovedNo formal declaration	proved	No formal statement	No Result decision
#392	Let $A(n)$ denote the least value of $t$ such that $n! = a_1 \cdots a_t$ with $a_1 \leq \cdots \leq a_t\leq n^2$ . Then $A(n) = \frac{n}{2} - \frac{n}{2\log n} + o\left(\frac{n}{\log n}\right).$ proved (Lean)Formalized	proved (Lean)	In Lean	No Result decision
#393	No statement retained — open to read what the source holdsopenNo formal declaration	open	No formal statement	No Result decision
#394	`t k n = v` when `v` works and nothing positive below it does.openFormalized	open	In Lean	No Result decision
#396	Is it true that for every $k$ there exists $n$ such that $\prod_{0\leq i\leq k}(n-i) \mid \binom{2n}{n}?$ openFormalized	open	In Lean	No Result decision
#397	Are there only finitely many solutions to $\prod_i \binom{2m_i}{m_i}=\prod_j \binom{2n_j}{n_j}$ with the $m_i,n_j$ distinct?disproved (Lean)Formalized	disproved (Lean)	In Lean	No Result decision
#398	Brocard's Problem Does $n! + 1 = m^2$ have integer solutions other than $n = 4, 5, 7$ ?falsifiableFormalized	falsifiable	In Lean	No Result decision
#399	Is it true that there are no solutions to `n! = x^k ± y^k` with `x,y,n ∈ ℕ`, `x*y > 1`, and `k > 2`?disproved (Lean)Formalized	disproved (Lean)	In Lean	No Result decision
#400	Can one show that $\sum_{n\leq x}g_k(n) \sim c_k x\log x$ for some constant $c_k$ ?openFormalized	open	In Lean	No Result decision
#401	Is there some function $f(r)$ such that $f(r)\to \infty$ as $r\to\infty$ , such that, for infinitely many $n$ , there exist $a_1,a_2$ with $a_1+a_2> n+f(r)\log n$ such that $a_1!a_2! \mid n!2^n3^n\cdots p_r^n$ ?proved (Lean)Formalized	proved (Lean)	In Lean	No Result decision
#402	Prove that, for any finite set $A\subset\mathbb{N}$ , there exist $a, b\in A$ such that $\gcd(a, b)\leq a/\|A\|.$ provedFormalized	proved	In Lean	No Result decision
#403	Does the equation $2^m=a_1!+\cdots+a_k!$ with $a_1<a_2<\cdots <a_k$ have only finitely many solutions?proved (Lean)Formalized	proved (Lean)	In Lean	No Result decision
#404	No statement retained — open to read what the source holdsopenNo formal declaration	open	No formal statement	No Result decision
#405	No statement retained — open to read what the source holdsprovedNo formal declaration	proved	No formal statement	No Result decision
#406	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$ ?openFormalized	open	In Lean	No Result decision
#407	No statement retained — open to read what the source holdsprovedNo formal declaration	proved	No formal statement	No Result decision
#408	No statement retained — open to read what the source holdsopenNo formal declaration	open	No formal statement	No Result decision
#409	How many iterations of $n\mapsto\phi(n) + 1$ are needed before a prime is reached?openFormalized	open	In Lean	No Result decision
#410	Let $σ_1(n) = σ(n)$ , the sum of divisors function, and $σ_k(n) = σ(σ_{k-1}(n))$ .openFormalized	open	In Lean	No Result decision
#411	No statement retained — open to read what the source holdsopenNo formal declaration	open	No formal statement	No Result decision
#412	Let $σ_1(n)=σ(n)$ , the sum of divisors function, and $σ_k(n) = σ(σ_{k-1}(n))$ . Is it true that, for every $m, n ≥ 2$ , there exist some $i, j$ such that $σ_i(m) = σ_j(n)$ ?openFormalized	open	In Lean	No Result decision
#413	Are there infinitely many barriers for `ω`?openFormalized	open	In Lean	No Result decision
#414	Let $h_1(n) = h(n)$ and $h_k(n) = h(h_{k-1}(n))$ . Is it true, for any $m,n$ , there exist $i$ and $j$ such that $h_i(m) = h_j(n)$ ?openFormalized	open	In Lean	No Result decision
#415	No statement retained — open to read what the source holdsopenNo formal declaration	open	No formal statement	No Result decision
#416	Let `V(x)` count the number of `n≤x` such that `ϕ(m)=n` is solvable. Does `V(2x)/V(x)→2` ?openFormalized	open	In Lean	No Result decision
#417	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?openFormalized	open	In Lean	No Result decision
#418	Are there infinitely many integers not of the form $n - \phi(n)$ ?proved (Lean)Formalized	proved (Lean)	In Lean	No Result decision
#419	If $\tau(n)$ counts the number of divisors of $n$ , then what is the set of limit points of $\frac{\tau((n+1)!)}{\tau(n!)}?$ solved (Lean)Formalized	solved (Lean)	In Lean	No Result decision
#420	No statement retained — open to read what the source holdsopenNo formal declaration	open	No formal statement	No Result decision

Problems

Search problems.science