Conjectures.io

ProveArtin Primitive Roots Conjecture - part iNumber theory$5,089

a

DisproveArtin Primitive Roots Conjecture - part iNumber theory$5,089

a

ProveBorsuk Conjecture - fourConvex and discrete geometry$5,089

4

DisproveBorsuk Conjecture - fourConvex and discrete geometry$5,089

4

ProveBrocard ConjectureNumber theory$5,089

**Brocard's Conjecture** For every n \geq 2, between the squares of the n -th and (n+1) -th primes, there are at least four\dots

DisproveBrocard ConjectureNumber theory$5,089

**Brocard's Conjecture** For every n \geq 2, between the squares of the n -th and (n+1) -th primes, there are at least four\dots

ProveBunyakovskyNumber theory$5,089

f

DisproveBunyakovskyNumber theory$5,089

f

ProveCarmichael Totient - charmichael TotientNumber theory$5,089

n

DisproveCarmichael Totient - charmichael TotientNumber theory$5,089

n

ProveClass Number ProblemNumber theory$5,089

There are infinitely many real quadratic fields ℚ(\sqrtd) with class number one, where d > 1 is a squarefree integer.

DisproveClass Number ProblemNumber theory$5,089

There are infinitely many real quadratic fields ℚ(\sqrtd) with class number one, where d > 1 is a squarefree integer.

ProveDicksonNumber theory$5,089

f_i(n) = a_i n+b_i

DisproveDicksonNumber theory$5,089

f_i(n) = a_i n+b_i

ProveErdős problem 10Combinatorics$5,089

k

DisproveErdős problem 10Combinatorics$5,089

k

ProveErdős problem 100Convex and discrete geometry$5,089

A

DisproveErdős problem 100Convex and discrete geometry$5,089

A

ProveErdős problem 1003Number theory$5,089

\phi(n) = \phi(n+1)

DisproveErdős problem 1003Number theory$5,089

\phi(n) = \phi(n+1)

ProveErdős problem 1049Number theory$5,089

t>1

DisproveErdős problem 1049Number theory$5,089

t>1

ProveErdős problem 1056Number theory$5,089

k ≥ 2

DisproveErdős problem 1056Number theory$5,089

k ≥ 2

ProveErdős problem 1057Number theory$5,089

C(x)=x^{1-o(1)}

DisproveErdős problem 1057Number theory$5,089

C(x)=x^{1-o(1)}

ProveErdős problem 1060 - part iiNumber theory$5,089

k \le n

DisproveErdős problem 1060 - part iiNumber theory$5,089

k \le n

ProveErdős problem 1068Combinatorics$5,089

\aleph_1

DisproveErdős problem 1068Combinatorics$5,089

\aleph_1

ProveErdős problem 107Convex and discrete geometry$5,089

f(n)

DisproveErdős problem 107Convex and discrete geometry$5,089

f(n)

ProveErdős problem 1072 - part iNumber theory$5,089

p

DisproveErdős problem 1072 - part iNumber theory$5,089

p

ProveErdős problem 1072 - part iiNumber theory$5,089

f(p)/p \to 0

DisproveErdős problem 1072 - part iiNumber theory$5,089

f(p)/p \to 0

ProveErdős problem 1073Number theory$5,089

A(x) \le x^{o(1)}

DisproveErdős problem 1073Number theory$5,089

A(x) \le x^{o(1)}

ProveErdős problem 1082 - part iGeometry$5,089

A\subset \mathbb{R}^2

DisproveErdős problem 1082 - part iGeometry$5,089

A\subset \mathbb{R}^2

ProveErdős problem 1085 - upper d 3Convex and discrete geometry$5,089

n^{4/3}\log\log n

DisproveErdős problem 1085 - upper d 3Convex and discrete geometry$5,089

n^{4/3}\log\log n

ProveErdős problem 1094Number theory$5,089

n\ge 2k

DisproveErdős problem 1094Number theory$5,089

n\ge 2k

ProveErdős problem 1095 - log is ThetaNumber theory$5,089

\log g(k) \asymp \frac{k}{\log k}

DisproveErdős problem 1095 - log is ThetaNumber theory$5,089

\log g(k) \asymp \frac{k}{\log k}

ProveErdős problem 1095 - lower conjectureNumber theory$5,089

g(k)\geq\exp(c\frac{k}{\log k})

DisproveErdős problem 1095 - lower conjectureNumber theory$5,089

g(k)\geq\exp(c\frac{k}{\log k})

ProveErdős problem 11Number theory$5,089

n > 1

DisproveErdős problem 11Number theory$5,089

n > 1

ProveErdős problem 1101 - part iNumber theory$5,089

1. Is there a good sequence with polynomial growth?

DisproveErdős problem 1101 - part iNumber theory$5,089

1. Is there a good sequence with polynomial growth?

ProveErdős problem 1106 - part iiNumber theory$5,089

p(n)

DisproveErdős problem 1106 - part iiNumber theory$5,089

p(n)

ProveErdős problem 1107Number theory$5,089

r \ge 2

DisproveErdős problem 1107Number theory$5,089

r \ge 2

ProveErdős problem 1108 - part iNumber theory$5,089

k \geq 2

DisproveErdős problem 1108 - part iNumber theory$5,089

k \geq 2

ProveErdős problem 1113 - filaseta finch kozekNumber theory$5,089

**Filaseta-Finch-Kozek conjecture (2008).** Every Sierpiński number is either a perfect power or possesses a finite covering set\dots

DisproveErdős problem 1113 - filaseta finch kozekNumber theory$5,089

**Filaseta-Finch-Kozek conjecture (2008).** Every Sierpiński number is either a perfect power or possesses a finite covering set\dots

ProveErdős problem 1135Number theory$5,089

n

DisproveErdős problem 1135Number theory$5,089

n

ProveErdős problem 1137Number theory$5,089

d_n=p_{n+1}-p_n

DisproveErdős problem 1137Number theory$5,089

d_n=p_{n+1}-p_n

ProveErdős problem 1142Number theory$5,089

n > 2

DisproveErdős problem 1142Number theory$5,089

n > 2

ProveErdős problem 1175Combinatorics$5,089

\kappa

DisproveErdős problem 1175Combinatorics$5,089

\kappa

ProveErdős problem 1192Combinatorics$5,089

r\geq 2

DisproveErdős problem 1192Combinatorics$5,089

r\geq 2

ProveErdős problem 120Combinatorics$5,089

A \subseteq \mathbb{R}

DisproveErdős problem 120Combinatorics$5,089

A \subseteq \mathbb{R}

ProveErdős problem 1203Number theory$5,089

F(n)\to \infty

DisproveErdős problem 1203Number theory$5,089

F(n)\to \infty

ProveErdős problem 1209 - part iii dNumber theory$5,089

n

DisproveErdős problem 1209 - part iii dNumber theory$5,089

n

ProveErdős problem 124 - ne zeroNumber theory$5,089

k \ne 0

DisproveErdős problem 124 - ne zeroNumber theory$5,089

k \ne 0

ProveErdős problem 126 - is Little ONumber theory$5,089

f(n) = o(\frac{n}{\log n})

DisproveErdős problem 126 - is Little ONumber theory$5,089

f(n) = o(\frac{n}{\log n})

ProveErdős problem 128Combinatorics$5,089

n/2

DisproveErdős problem 128Combinatorics$5,089

n/2

ProveErdős problem 137 - multiple powerful factorsNumber theory$5,089

k

DisproveErdős problem 137 - multiple powerful factorsNumber theory$5,089

k

ProveErdős problem 141 - elevenCombinatorics$5,089

11

DisproveErdős problem 141 - elevenCombinatorics$5,089

11

ProveErdős problem 143 - part iiNumber theory$5,089

\sum_{x \in A} \frac{1}{x \log x} < \infty,

DisproveErdős problem 143 - part iiNumber theory$5,089

\sum_{x \in A} \frac{1}{x \log x} < \infty,

ProveErdős problem 145Number theory$5,089

s_1 < s_2 < \cdots

DisproveErdős problem 145Number theory$5,089

s_1 < s_2 < \cdots

ProveErdős problem 153Combinatorics$5,089

A

DisproveErdős problem 153Combinatorics$5,089

A

ProveErdős problem 155Combinatorics$5,089

k \geq 1

DisproveErdős problem 155Combinatorics$5,089

k \geq 1

ProveErdős problem 156Combinatorics$5,089

A\subset \{1,\ldots,N\}

DisproveErdős problem 156Combinatorics$5,089

A\subset \{1,\ldots,N\}

ProveErdős problem 158Combinatorics$5,089

Let A be an infinite B₂[2] set. Must liminf |A ∩ {1, ..., N}| * N ^ (- 1 / 2) = 0?

DisproveErdős problem 158Combinatorics$5,089

Let A be an infinite B₂[2] set. Must liminf |A ∩ {1, ..., N}| * N ^ (- 1 / 2) = 0?

ProveErdős problem 168 - part iiCombinatorics$5,089

F(N)/N

DisproveErdős problem 168 - part iiCombinatorics$5,089

F(N)/N

ProveErdős problem 17Number theory$5,089

**Erdős Problem 17.** Are there infinitely many cluster primes?

DisproveErdős problem 17Number theory$5,089

**Erdős Problem 17.** Are there infinitely many cluster primes?

ProveErdős problem 200Combinatorics$5,089

\{1,\ldots,N\}

DisproveErdős problem 200Combinatorics$5,089

\{1,\ldots,N\}

ProveErdős problem 208 - log boundNumber theory$5,089

s_{n+1} - s_n \ll \log s_n

DisproveErdős problem 208 - log boundNumber theory$5,089

s_{n+1} - s_n \ll \log s_n

ProveErdős problem 212Convex and discrete geometry$5,089

Is there a dense subset of ℝ^2 such that all pairwise distances are rational?

DisproveErdős problem 212Convex and discrete geometry$5,089

Is there a dense subset of ℝ^2 such that all pairwise distances are rational?

ProveErdős problem 213Convex and discrete geometry$5,089

n \geq 4

DisproveErdős problem 213Convex and discrete geometry$5,089

n \geq 4

ProveErdős problem 218 - geNumber theory$5,089

n

DisproveErdős problem 218 - geNumber theory$5,089

n

ProveErdős problem 218 - infinite equal prime gapNumber theory$5,089

n

DisproveErdős problem 218 - infinite equal prime gapNumber theory$5,089

n

ProveErdős problem 218 - leNumber theory$5,089

n

DisproveErdős problem 218 - leNumber theory$5,089

n

ProveErdős problem 23Combinatorics$5,089

5n

DisproveErdős problem 23Combinatorics$5,089

5n

ProveErdős problem 233Number theory$5,089

N

DisproveErdős problem 233Number theory$5,089

N

ProveErdős problem 234Number theory$5,089

Is it true that for all c \geq 0, the density f c of integers for which (p (n + 1) - p n) / log n < c exists and is a\dots

DisproveErdős problem 234Number theory$5,089

Is it true that for all c \geq 0, the density f c of integers for which (p (n + 1) - p n) / log n < c exists and is a\dots

ProveErdős problem 236Combinatorics$5,089

f(n)

DisproveErdős problem 236Combinatorics$5,089

f(n)

ProveErdős problem 238Number theory$5,089

Let c₁, c₂ > 0 . Is it true that for any sufficiently large x, there exists more than c₁ * log x many consecutive primes\dots

DisproveErdős problem 238Number theory$5,089

Let c₁, c₂ > 0 . Is it true that for any sufficiently large x, there exists more than c₁ * log x many consecutive primes\dots

ProveErdős problem 241 - generalizationCombinatorics$5,089

A\subseteq \{1,\ldots,N\}

DisproveErdős problem 241 - generalizationCombinatorics$5,089

A\subseteq \{1,\ldots,N\}

ProveErdős problem 242 - schinzel generalizationNumber theory$5,089

a

DisproveErdős problem 242 - schinzel generalizationNumber theory$5,089

a

ProveErdős problem 243Sequences and series$5,089

a_1 < a_2 < \dots

DisproveErdős problem 243Sequences and series$5,089

a_1 < a_2 < \dots

ProveErdős problem 244Number theory$5,089

C > 1

DisproveErdős problem 244Number theory$5,089

C > 1

ProveErdős problem 247Number theory$5,089

n_1 < n_2 < \cdots

DisproveErdős problem 247Number theory$5,089

n_1 < n_2 < \cdots

ProveErdős problem 249Number theory$5,089

\sum_{n} \frac{\phi(n)}{2^n}

DisproveErdős problem 249Number theory$5,089

\sum_{n} \frac{\phi(n)}{2^n}

ProveErdős problem 25Number theory$5,089

n_1 < n_2 < \dots

DisproveErdős problem 25Number theory$5,089

n_1 < n_2 < \dots

ProveErdős problem 251Number theory$5,089

\sum_{n=1}^\infty \frac{p_n}{2^n}

DisproveErdős problem 251Number theory$5,089

\sum_{n=1}^\infty \frac{p_n}{2^n}

ProveErdős problem 257Number theory$5,089

A\subseteq\mathbb{N}

DisproveErdős problem 257Number theory$5,089

A\subseteq\mathbb{N}

ProveErdős problem 263 - part iNumber theory$5,089

a_n = 2^{2^n}

DisproveErdős problem 263 - part iNumber theory$5,089

a_n = 2^{2^n}

ProveErdős problem 264 - part iiNumber theory$5,089

n!

DisproveErdős problem 264 - part iiNumber theory$5,089

n!

ProveErdős problem 269 - irrationalNumber theory$5,089

P

DisproveErdős problem 269 - irrationalNumber theory$5,089

P

ProveErdős problem 274 - herzog schonheimGroup theory$5,089

G

DisproveErdős problem 274 - herzog schonheimGroup theory$5,089

G

ProveErdős problem 28Number theory$5,089

A ⊆ \mathbb{N}

DisproveErdős problem 28Number theory$5,089

A ⊆ \mathbb{N}

ProveErdős problem 287Number theory$5,089

k\geq2

DisproveErdős problem 287Number theory$5,089

k\geq2

ProveErdős problem 291 - part iNumber theory$5,089

n\geq 1

DisproveErdős problem 291 - part iNumber theory$5,089

n\geq 1

ProveErdős problem 291 - shiu heuristic density zeroNumber theory$5,089

n

DisproveErdős problem 291 - shiu heuristic density zeroNumber theory$5,089

n

ProveErdős problem 30Number theory$5,089

\varepsilon > 0

DisproveErdős problem 30Number theory$5,089

\varepsilon > 0

ProveErdős problem 307Number theory$5,089

P

DisproveErdős problem 307Number theory$5,089

P

ProveErdős problem 313 - primary pseudoperfect are infiniteNumber theory$5,089

It is conjectured that the set of primary pseudoperfect numbers is infinite.

DisproveErdős problem 313 - primary pseudoperfect are infiniteNumber theory$5,089

It is conjectured that the set of primary pseudoperfect numbers is infinite.

ProveErdős problem 317 - claim 2Number theory$5,089

n

DisproveErdős problem 317 - claim 2Number theory$5,089

n

ProveErdős problem 32Number theory$5,089

A \subseteq \mathbb{N}

DisproveErdős problem 32Number theory$5,089

A \subseteq \mathbb{N}

ProveErdős problem 323 - part iNumber theory$5,089

f_{k,k}(x) \gg_\epsilon x^{1-\epsilon}

DisproveErdős problem 323 - part iNumber theory$5,089

f_{k,k}(x) \gg_\epsilon x^{1-\epsilon}

ProveErdős problem 323 - part iiNumber theory$5,089

m < k

DisproveErdős problem 323 - part iiNumber theory$5,089

m < k

ProveErdős problem 323 - k gt 2Number theory$5,089

k>2

DisproveErdős problem 323 - k gt 2Number theory$5,089

k>2

ProveErdős problem 324 - quinticNumber theory$5,089

f(x) = x^5

DisproveErdős problem 324 - quinticNumber theory$5,089

f(x) = x^5

ProveErdős problem 325Number theory$5,089

f_{k, 3}(x)

DisproveErdős problem 325Number theory$5,089

f_{k, 3}(x)

ProveErdős problem 340Combinatorics$5,089

A = \{1, 2, 4, 8, 13, 21, 31, 45, 66, 81, 97, \ldots\}

DisproveErdős problem 340Combinatorics$5,089

A = \{1, 2, 4, 8, 13, 21, 31, 45, 66, 81, 97, \ldots\}

ProveErdős problem 340 - sub has Pos DensityCombinatorics$5,089

A - A

DisproveErdős problem 340 - sub has Pos DensityCombinatorics$5,089

A - A

ProveErdős problem 357 - part iNumber theory$5,089

f(n)

DisproveErdős problem 357 - part iNumber theory$5,089

f(n)

ProveErdős problem 357 - infinite set densityNumber theory$5,089

A

DisproveErdős problem 357 - infinite set densityNumber theory$5,089

A

ProveErdős problem 357 - infinite set sumNumber theory$5,089

A

DisproveErdős problem 357 - infinite set sumNumber theory$5,089

A

ProveErdős problem 357 - monotone, part iNumber theory$5,089

h(n)

DisproveErdős problem 357 - monotone, part iNumber theory$5,089

h(n)

ProveErdős problem 359 - part iNumber theory$5,089

a_1< a_2 < ⋯

DisproveErdős problem 359 - part iNumber theory$5,089

a_1< a_2 < ⋯

ProveErdős problem 359 - part iiNumber theory$5,089

a_1< a_2 < ⋯

DisproveErdős problem 359 - part iiNumber theory$5,089

a_1< a_2 < ⋯

ProveErdős problem 359 - is Good For 1 asymptoticNumber theory$5,089

A

DisproveErdős problem 359 - is Good For 1 asymptoticNumber theory$5,089

A

ProveErdős problem 364Number theory$5,089

There is no consecutive triple of powerful numbers.

DisproveErdős problem 364Number theory$5,089

There is no consecutive triple of powerful numbers.

ProveErdős problem 364 - strongNumber theory$5,089

n_k

DisproveErdős problem 364 - strongNumber theory$5,089

n_k

ProveErdős problem 366Number theory$5,089

2

DisproveErdős problem 366Number theory$5,089

2

ProveErdős problem 373Number theory$5,089

Show that the equation n!=a_1!a_2!\cdot\cdot\cdota_k!, with n-1 > a_1 \geq a_2 \geq \cdot\cdot\cdot \geq a_k, has only finitely many solutions.

DisproveErdős problem 373Number theory$5,089

Show that the equation n!=a_1!a_2!\cdot\cdot\cdota_k!, with n-1 > a_1 \geq a_2 \geq \cdot\cdot\cdot \geq a_k, has only finitely many solutions.

ProveErdős problem 373 - maximal solutionNumber theory$5,089

Hickerson conjectured the largest solution the equation n!=a_1!a_2!\cdot\cdot\cdota_k!, with n-1 > a_1 \geq a_2 \geq \cdot\cdot\cdot \geq a_k, is 16!=14!5!2! \dots

DisproveErdős problem 373 - maximal solutionNumber theory$5,089

Hickerson conjectured the largest solution the equation n!=a_1!a_2!\cdot\cdot\cdota_k!, with n-1 > a_1 \geq a_2 \geq \cdot\cdot\cdot \geq a_k, is 16!=14!5!2! \dots

ProveErdős problem 373 - suranyiNumber theory$5,089

Surányi was the first to conjecture that the only non-trivial solution to a!b!=n! is 6!7!=10! .

DisproveErdős problem 373 - suranyiNumber theory$5,089

Surányi was the first to conjecture that the only non-trivial solution to a!b!=n! is 6!7!=10! .

ProveErdős problem 375Number theory$5,089

Is Erdos375Prop true?

DisproveErdős problem 375Number theory$5,089

Is Erdos375Prop true?

ProveErdős problem 376Number theory$5,089

n

DisproveErdős problem 376Number theory$5,089

n

ProveErdős problem 383Number theory$5,089

k

DisproveErdős problem 383Number theory$5,089

k

ProveErdős problem 385 - part iNumber theory$5,089

F(n) := \max\{m + p(m) \mid \textrm{$m < n$ composite}\}\}

DisproveErdős problem 385 - part iNumber theory$5,089

F(n) := \max\{m + p(m) \mid \textrm{$m < n$ composite}\}\}

ProveErdős problem 386 - twoNumber theory$5,089

\binom{n}{2}

DisproveErdős problem 386 - twoNumber theory$5,089

\binom{n}{2}

ProveErdős problem 39Number theory$5,089

A\subset \mathbb{N}

DisproveErdős problem 39Number theory$5,089

A\subset \mathbb{N}

ProveErdős problem 396Number theory$5,089

k

DisproveErdős problem 396Number theory$5,089

k

ProveErdős problem 398Number theory$5,089

n = 4, 5, 7

DisproveErdős problem 398Number theory$5,089

n = 4, 5, 7

ProveErdős problem 400 - part iNumber theory$5,089

\sum_{n\leq x}g_k(n) \sim c_k x\log x

DisproveErdős problem 400 - part iNumber theory$5,089

\sum_{n\leq x}g_k(n) \sim c_k x\log x

ProveErdős problem 406 - one twoNumber theory$5,089

1

DisproveErdős problem 406 - one twoNumber theory$5,089

1

ProveErdős problem 409 - sigma terminationNumber theory$5,089

n > 1

DisproveErdős problem 409 - sigma terminationNumber theory$5,089

n > 1

ProveErdős problem 41Number theory$5,089

A \subset \mathbb{N}

DisproveErdős problem 41Number theory$5,089

A \subset \mathbb{N}

ProveErdős problem 410Number theory$5,089

σ_1(n) = σ(n)

DisproveErdős problem 410Number theory$5,089

σ_1(n) = σ(n)

ProveErdős problem 412Number theory$5,089

σ_1(n)=σ(n)

DisproveErdős problem 412Number theory$5,089

σ_1(n)=σ(n)

ProveErdős problem 413 - part iNumber theory$5,089

Are there infinitely many barriers for ω ?

DisproveErdős problem 413 - part iNumber theory$5,089

Are there infinitely many barriers for ω ?

ProveErdős problem 414Number theory$5,089

h_1(n) = h(n)

DisproveErdős problem 414Number theory$5,089

h_1(n) = h(n)

ProveErdős problem 428Number theory$5,089

A\subseteq \mathbb{N}

DisproveErdős problem 428Number theory$5,089

A\subseteq \mathbb{N}

ProveErdős problem 44Combinatorics$5,089

**Erdős Problem 44:** Let N \geq 1 and A \subseteq {1,\dots,N} be a Sidon set. Is it true that, for any ε > 0, there exist M = M(ε) and\dots

DisproveErdős problem 44Combinatorics$5,089

**Erdős Problem 44:** Let N \geq 1 and A \subseteq {1,\dots,N} be a Sidon set. Is it true that, for any ε > 0, there exist M = M(ε) and\dots

ProveErdős problem 445Number theory$5,089

c>1/2

DisproveErdős problem 445Number theory$5,089

c>1/2

ProveErdős problem 454Number theory$5,089

Is it true that limsup (fun n => (f n - 2 * n.nth Prime : ℕ\infty)) atTop = ⊤ ?

DisproveErdős problem 454Number theory$5,089

Is it true that limsup (fun n => (f n - 2 * n.nth Prime : ℕ\infty)) atTop = ⊤ ?

ProveErdős problem 455Number theory$5,089

Let q : ℕ \to ℕ be a strictly increasing sequence of primes such that q (n + 2) - q (n + 1) \geq q (n + 1) - q n . Must\dots

DisproveErdős problem 455Number theory$5,089

Let q : ℕ \to ℕ be a strictly increasing sequence of primes such that q (n + 2) - q (n + 1) \geq q (n + 1) - q n . Must\dots

ProveErdős problem 456 - part iiiNumber theory$5,089

p

DisproveErdős problem 456 - part iiiNumber theory$5,089

p

ProveErdős problem 458Number theory$5,089

\operatorname{lcm}(1, \dots, n)

DisproveErdős problem 458Number theory$5,089

\operatorname{lcm}(1, \dots, n)

ProveErdős problem 463Number theory$5,089

f

DisproveErdős problem 463Number theory$5,089

f

ProveErdős problem 479Number theory$5,089

k\neq 1

DisproveErdős problem 479Number theory$5,089

k\neq 1

ProveErdős problem 495Number theory$5,089

\alpha,\beta \in \mathbb{R}

DisproveErdős problem 495Number theory$5,089

\alpha,\beta \in \mathbb{R}

ProveErdős problem 50Number theory$5,089

f

DisproveErdős problem 50Number theory$5,089

f

ProveErdős problem 51Number theory$5,089

A \subset \mathbb{N}

DisproveErdős problem 51Number theory$5,089

A \subset \mathbb{N}

ProveErdős problem 517Complex functions$5,089

If f(z) = \sum aₖzⁿₖ is an entire function (with aₖ \neq 0 for all k) such that nₖ / k \to \infty, is it true that f assumes every\dots

DisproveErdős problem 517Complex functions$5,089

If f(z) = \sum aₖzⁿₖ is an entire function (with aₖ \neq 0 for all k) such that nₖ / k \to \infty, is it true that f assumes every\dots

ProveErdős problem 52Number theory$5,089

A

DisproveErdős problem 52Number theory$5,089

A

ProveErdős problem 535Combinatorics$5,089

r \geq 3

DisproveErdős problem 535Combinatorics$5,089

r \geq 3

ProveErdős problem 535 - first open caseCombinatorics$5,089

r = 3

DisproveErdős problem 535 - first open caseCombinatorics$5,089

r = 3

ProveErdős problem 600 - part iCombinatorics$5,089

r \geq 2

DisproveErdős problem 600 - part iCombinatorics$5,089

r \geq 2

ProveErdős problem 61Combinatorics$5,089

c(H) > 0

DisproveErdős problem 61Combinatorics$5,089

c(H) > 0

ProveErdős problem 617Combinatorics$5,089

r\geq 3

DisproveErdős problem 617Combinatorics$5,089

r\geq 3

ProveErdős problem 624Combinatorics$5,089

X

DisproveErdős problem 624Combinatorics$5,089

X

ProveErdős problem 647Number theory$5,089

\tau(n)

DisproveErdős problem 647Number theory$5,089

\tau(n)

ProveErdős problem 66Number theory$5,089

A \subset \mathbb{N}

DisproveErdős problem 66Number theory$5,089

A \subset \mathbb{N}

ProveErdős problem 672Number theory$5,089

n, n + d, ..., n + (k - 1)d

DisproveErdős problem 672Number theory$5,089

n, n + d, ..., n + (k - 1)d

ProveErdős problem 677Number theory$5,089

M(n, k)

DisproveErdős problem 677Number theory$5,089

M(n, k)

ProveErdős problem 68Number theory$5,089

\sum_{n=2}^\infty \frac{1}{n!-1}

DisproveErdős problem 68Number theory$5,089

\sum_{n=2}^\infty \frac{1}{n!-1}

ProveErdős problem 680 - part iNumber theory$5,089

n

DisproveErdős problem 680 - part iNumber theory$5,089

n

ProveErdős problem 680 - part iiNumber theory$5,089

k^2+1

DisproveErdős problem 680 - part iiNumber theory$5,089

k^2+1

ProveErdős problem 681Number theory$5,089

n

DisproveErdős problem 681Number theory$5,089

n

ProveErdős problem 686 - fourNumber theory$5,089

4

DisproveErdős problem 686 - fourNumber theory$5,089

4

ProveErdős problem 686 - twenty fiveNumber theory$5,089

25

DisproveErdős problem 686 - twenty fiveNumber theory$5,089

25

ProveErdős problem 688 - part iiNumber theory$5,089

\epsilon_n = o(1)

DisproveErdős problem 688 - part iiNumber theory$5,089

\epsilon_n = o(1)

ProveErdős problem 695Number theory$5,089

q_1 < q_2 < \cdots

DisproveErdős problem 695Number theory$5,089

q_1 < q_2 < \cdots

ProveErdős problem 695 - upper BoundNumber theory$5,089

q_1 < q_2 < \cdots

DisproveErdős problem 695 - upper BoundNumber theory$5,089

q_1 < q_2 < \cdots

ProveErdős problem 699Number theory$5,089

1 \le i < j \le n / 2

DisproveErdős problem 699Number theory$5,089

1 \le i < j \le n / 2

ProveErdős problem 723 - eq 12Combinatorics$5,089

It is open whether there exists a projective plane of order 12.

DisproveErdős problem 723 - eq 12Combinatorics$5,089

It is open whether there exists a projective plane of order 12.

ProveErdős problem 749Number theory$5,089

\epsilon>0

DisproveErdős problem 749Number theory$5,089

\epsilon>0

ProveErdős problem 770 - part iNumber theory$5,089

For every prime p, does the density of integers with h n = p exist?

DisproveErdős problem 770 - part iNumber theory$5,089

For every prime p, does the density of integers with h n = p exist?

ProveErdős problem 770 - threeNumber theory$5,089

It is probably true that h n = 3 for infinitely many n .

DisproveErdős problem 770 - threeNumber theory$5,089

It is probably true that h n = 3 for infinitely many n .

ProveErdős problem 774Combinatorics$5,089

Is every proportionately dissociated (infinite) set the union of a finite number of dissociated sets?

DisproveErdős problem 774Combinatorics$5,089

Is every proportionately dissociated (infinite) set the union of a finite number of dissociated sets?

ProveErdős problem 779Number theory$5,089

A Conjecture of Marian Deaconescu, see p.120 in https://doi.org/10.2307/2975810 [Needed to index shift in order to avoid trivial\dots

DisproveErdős problem 779Number theory$5,089

A Conjecture of Marian Deaconescu, see p.120 in https://doi.org/10.2307/2975810 [Needed to index shift in order to avoid trivial\dots

ProveErdős problem 789 - sqCombinatorics$5,089

h(n)

DisproveErdős problem 789 - sqCombinatorics$5,089

h(n)

ProveErdős problem 812 - part iCombinatorics$5,089

\frac{R(n+1)}{R(n)}\geq 1+c

DisproveErdős problem 812 - part iCombinatorics$5,089

\frac{R(n+1)}{R(n)}\geq 1+c

ProveErdős problem 82Combinatorics$5,089

F(n) / \log n \to \infty as n \to \infty

DisproveErdős problem 82Combinatorics$5,089

F(n) / \log n \to \infty as n \to \infty

ProveErdős problem 828Number theory$5,089

a \in \mathbb{Z}

DisproveErdős problem 828Number theory$5,089

a \in \mathbb{Z}

ProveErdős problem 828 - lehmer conjectureNumber theory$5,089

n > 1

DisproveErdős problem 828 - lehmer conjectureNumber theory$5,089

n > 1

ProveErdős problem 829Number theory$5,089

A \subseteq \mathbb{N}

DisproveErdős problem 829Number theory$5,089

A \subseteq \mathbb{N}

ProveErdős problem 835Combinatorics$5,089

k>2

DisproveErdős problem 835Combinatorics$5,089

k>2

ProveErdős problem 849Number theory$5,089

t\geq1

DisproveErdős problem 849Number theory$5,089

t\geq1

ProveErdős problem 85Combinatorics$5,089

n

DisproveErdős problem 85Combinatorics$5,089

n

ProveErdős problem 853 - part iNumber theory$5,089

d_n = p_{n+1} - p_n

DisproveErdős problem 853 - part iNumber theory$5,089

d_n = p_{n+1} - p_n

ProveErdős problem 853 - part iiNumber theory$5,089

d_n = p_{n+1} - p_n

DisproveErdős problem 853 - part iiNumber theory$5,089

d_n = p_{n+1} - p_n

ProveErdős problem 873Number theory$5,089

A = \{a_1 < a_2 < \dots\} \subseteq \mathbb{N}

DisproveErdős problem 873Number theory$5,089

A = \{a_1 < a_2 < \dots\} \subseteq \mathbb{N}

ProveErdős problem 885Number theory$5,089

k \geq 1

DisproveErdős problem 885Number theory$5,089

k \geq 1

ProveErdős problem 886Number theory$5,089

\epsilon>0

DisproveErdős problem 886Number theory$5,089

\epsilon>0

ProveErdős problem 889Number theory$5,089

v(n,k)

DisproveErdős problem 889Number theory$5,089

v(n,k)

ProveErdős problem 889 - generalNumber theory$5,089

v_l(n) = \max_{k\geq l} v(n,k)

DisproveErdős problem 889 - generalNumber theory$5,089

v_l(n) = \max_{k\geq l} v(n,k)

ProveErdős problem 89Convex and discrete geometry$5,089

n

DisproveErdős problem 89Convex and discrete geometry$5,089

n

ProveErdős problem 890 - part aNumber theory$5,089

\omega_k(n)

DisproveErdős problem 890 - part aNumber theory$5,089

\omega_k(n)

ProveErdős problem 890 - part bNumber theory$5,089

\limsup_{n\to \infty}\left(\sum_{0\leq i < k}\omega(n+i)\right) \frac{\log\log n}{\log n}=1,

DisproveErdős problem 890 - part bNumber theory$5,089

\limsup_{n\to \infty}\left(\sum_{0\leq i < k}\omega(n+i)\right) \frac{\log\log n}{\log n}=1,

ProveErdős problem 891Number theory$5,089

2=p_1 < p_2 < \cdots

DisproveErdős problem 891Number theory$5,089

2=p_1 < p_2 < \cdots

ProveErdős problem 893Combinatorics$5,089

\lim_{n\to\infty} \frac{f(2n)}{f(n)}

DisproveErdős problem 893Combinatorics$5,089

\lim_{n\to\infty} \frac{f(2n)}{f(n)}

ProveErdős problem 9Combinatorics$5,089

Is the upper density of the set of odd numbers that cannot be expressed as a prime plus two powers of 2 positive?

DisproveErdős problem 9Combinatorics$5,089

Is the upper density of the set of odd numbers that cannot be expressed as a prime plus two powers of 2 positive?

ProveErdős problem 91Convex and discrete geometry$5,089

A\subset \mathbb{R}^2

DisproveErdős problem 91Convex and discrete geometry$5,089

A\subset \mathbb{R}^2

ProveErdős problem 912Number theory$5,089

c>0

DisproveErdős problem 912Number theory$5,089

c>0

ProveErdős problem 912 - taoNumber theory$5,089

c=\sqrt{2\pi}

DisproveErdős problem 912 - taoNumber theory$5,089

c=\sqrt{2\pi}

ProveErdős problem 913 - infinite many 8 p sq sub one primesNumber theory$5,089

p

DisproveErdős problem 913 - infinite many 8 p sq sub one primesNumber theory$5,089

p

ProveErdős problem 930Number theory$5,089

r

DisproveErdős problem 930Number theory$5,089

r

ProveErdős problem 931Number theory$5,089

k_1 \geq k_2 \geq 3

DisproveErdős problem 931Number theory$5,089

k_1 \geq k_2 \geq 3

ProveErdős problem 932Number theory$5,089

p_k

DisproveErdős problem 932Number theory$5,089

p_k

ProveErdős problem 933Number theory$5,089

n(n+1)=2^k3^lm

DisproveErdős problem 933Number theory$5,089

n(n+1)=2^k3^lm

ProveErdős problem 936 - factorial add oneNumber theory$5,089

n! + 1

DisproveErdős problem 936 - factorial add oneNumber theory$5,089

n! + 1

ProveErdős problem 936 - factorial sub oneNumber theory$5,089

n! - 1

DisproveErdős problem 936 - factorial sub oneNumber theory$5,089

n! - 1

ProveErdős problem 936 - two pow add oneNumber theory$5,089

2^n + 1

DisproveErdős problem 936 - two pow add oneNumber theory$5,089

2^n + 1

ProveErdős problem 936 - two pow sub oneNumber theory$5,089

2^n - 1

DisproveErdős problem 936 - two pow sub oneNumber theory$5,089

2^n - 1

ProveErdős problem 942Number theory$5,089

c > 0

DisproveErdős problem 942Number theory$5,089

c > 0

ProveErdős problem 943Number theory$5,089

A

DisproveErdős problem 943Number theory$5,089

A

ProveErdős problem 945Number theory$5,089

F(x) \leq (\log x)^{O(1)}

DisproveErdős problem 945Number theory$5,089

F(x) \leq (\log x)^{O(1)}

ProveErdős problem 949Combinatorics$5,089

S \subseteq \mathbb{R}

DisproveErdős problem 949Combinatorics$5,089

S \subseteq \mathbb{R}

ProveErdős problem 950 - part iNumber theory$5,089

\liminf f(n)=1

DisproveErdős problem 950 - part iNumber theory$5,089

\liminf f(n)=1

ProveErdős problem 950 - part iiNumber theory$5,089

\limsup f(n)=\infty

DisproveErdős problem 950 - part iiNumber theory$5,089

\limsup f(n)=\infty

ProveErdős problem 950 - part iiiNumber theory$5,089

f(n)=o(\log\log n)

DisproveErdős problem 950 - part iiiNumber theory$5,089

f(n)=o(\log\log n)

ProveErdős problem 951Number theory$5,089

If 1 < a 0 < ... has property Erdos951Prop, is it true that #{a i \leq x} \leq π x ?

DisproveErdős problem 951Number theory$5,089

If 1 < a 0 < ... has property Erdos951Prop, is it true that #{a i \leq x} \leq π x ?

ProveErdős problem 962Number theory$5,089

\log k(n) \le (\log n)^{(1/2 + o(1))}

DisproveErdős problem 962Number theory$5,089

\log k(n) \le (\log n)^{(1/2 + o(1))}

ProveErdős problem 972Number theory$5,089

\alpha > 1

DisproveErdős problem 972Number theory$5,089

\alpha > 1

ProveErdős problem 975Number theory$5,089

f \in \mathbb{Z}[x]

DisproveErdős problem 975Number theory$5,089

f \in \mathbb{Z}[x]

ProveErdős problem 979Number theory$5,089

k ≥ 2

DisproveErdős problem 979Number theory$5,089

k ≥ 2

ProveErdős problem 98Convex and discrete geometry$5,089

h(n)

DisproveErdős problem 98Convex and discrete geometry$5,089

h(n)

ProveErdős problem 982Convex and discrete geometry$5,089

n

DisproveErdős problem 982Convex and discrete geometry$5,089

n

ProveErdős problem 985Number theory$5,089

p

DisproveErdős problem 985Number theory$5,089

p

ProveErdős problem 99Convex and discrete geometry$5,089

1

DisproveErdős problem 99Convex and discrete geometry$5,089

1

ProveFermat - infinite fermat primesNumber theory$5,089

Are there infinitely many Fermat primes?

DisproveFermat - infinite fermat primesNumber theory$5,089

Are there infinitely many Fermat primes?

ProveGauss Circle Problem - error is Big ONumber theory$5,089

|E(r)| = O\left(r^{1/2 + o(1)}\right)

DisproveGauss Circle Problem - error is Big ONumber theory$5,089

|E(r)| = O\left(r^{1/2 + o(1)}\right)

ProveGoldbach ConjectureNumber theory$5,089

Can every even integer greater than 2 be written as the sum of two primes?

DisproveGoldbach ConjectureNumber theory$5,089

Can every even integer greater than 2 be written as the sum of two primes?

ProveGoormaghtighNumber theory$5,089

31

DisproveGoormaghtighNumber theory$5,089

31

ProveHadamardLinear algebra$5,089

n = 4k

DisproveHadamardLinear algebra$5,089

n = 4k

ProveHardy Littlewood - first hardy littlewood conjectureNumber theory$5,089

P = (m_1, \dots, m_k)

DisproveHardy Littlewood - first hardy littlewood conjectureNumber theory$5,089

P = (m_1, \dots, m_k)

ProveHardy Littlewood - second hardy littlewood conjectureNumber theory$5,089

x, y \geq 2

DisproveHardy Littlewood - second hardy littlewood conjectureNumber theory$5,089

x, y \geq 2

ProveIdoneal Completeness - idoneal numbers completenessNumber theory$5,089

Idoneal numbers completeness conjecture.

DisproveIdoneal Completeness - idoneal numbers completenessNumber theory$5,089

Idoneal numbers completeness conjecture.

ProveInscribed SquareGeometry$5,089

**Inscribed square problem** Does every Jordan curve admit an inscribed square?

DisproveInscribed SquareGeometry$5,089

**Inscribed square problem** Does every Jordan curve admit an inscribed square?

ProveInverse GaloisField theory and polynomials$5,089

The **Inverse Galois Problem**: every finite group is isomorphic to the Galois group of a Galois extension of the rationals.

DisproveInverse GaloisField theory and polynomials$5,089

The **Inverse Galois Problem**: every finite group is isomorphic to the Galois group of a Galois extension of the rationals.

ProveIrrational - euler Mascheroni ConstantSpecial functions$5,089

\gamma

DisproveIrrational - euler Mascheroni ConstantSpecial functions$5,089

\gamma

ProveKummer VandiverNumber theory$5,089

p

DisproveKummer VandiverNumber theory$5,089

p

ProveLegendre ConjectureNumber theory$5,089

Does there always exist at least one prime between consecutive perfect squares?

DisproveLegendre ConjectureNumber theory$5,089

Does there always exist at least one prime between consecutive perfect squares?

ProveLehmer Mahler Measure ProblemNumber theory$5,089

Let M(f) denote the Mahler measure of f . There exists a constant μ>1 such that for any f(x)\inℤ[x], M(f)>1 \to M(f)\geqμ .

DisproveLehmer Mahler Measure ProblemNumber theory$5,089

Let M(f) denote the Mahler measure of f . There exists a constant μ>1 such that for any f(x)\inℤ[x], M(f)>1 \to M(f)\geqμ .

ProveLehmer TotientNumber theory$5,089

n > 1

DisproveLehmer TotientNumber theory$5,089

n > 1

ProveLemoineNumber theory$5,089

n ≥ 7

DisproveLemoineNumber theory$5,089

n ≥ 7

ProveFour-speed amended lonely-runner spectrum$2,351

Incomplete challenge 05: Four-speed amended lonely-runner spectrum. Source\dots

DisproveFour-speed amended lonely-runner spectrum$2,351

Incomplete challenge 05: Four-speed amended lonely-runner spectrum. Source\dots

ProveSix-speed maximum-speed/denominator bound$2,351

Incomplete challenge 06: Six-speed maximum-speed/denominator bound. Source: https://arxiv.org/html/2609.03444v2#S6.SS4

DisproveSix-speed maximum-speed/denominator bound$2,351

Incomplete challenge 06: Six-speed maximum-speed/denominator bound. Source: https://arxiv.org/html/2609.03444v2#S6.SS4

ProveComplex 4x4 exact bilinear multiplication with at most 47 products$2,351

Incomplete challenge 16: Complex 4x4 exact bilinear multiplication with at most 47 products. Source\dots

DisproveComplex 4x4 exact bilinear multiplication with at most 47 products$2,351

Incomplete challenge 16: Complex 4x4 exact bilinear multiplication with at most 47 products. Source\dots

ProveComplex 3x3 border rank at least 18$2,351

Incomplete challenge 18: Complex 3x3 border rank at least 18. Source: https://arxiv.org/abs/1911.07981

DisproveComplex 3x3 border rank at least 18$2,351

Incomplete challenge 18: Complex 3x3 border rank at least 18. Source: https://arxiv.org/abs/1911.07981

ProveUniform subquadratic sensitivity-versus-exact-real-degree upper bound$2,351

Incomplete challenge 20: Uniform subquadratic sensitivity-versus-exact-real-degree upper bound. Source\dots

DisproveUniform subquadratic sensitivity-versus-exact-real-degree upper bound$2,351

Incomplete challenge 20: Uniform subquadratic sensitivity-versus-exact-real-degree upper bound. Source\dots

ProveUniform cubic ordinary-sensitivity upper bound for block sensitivity$2,351

Incomplete challenge 21: Uniform cubic ordinary-sensitivity upper bound for block sensitivity. Source\dots

DisproveUniform cubic ordinary-sensitivity upper bound for block sensitivity$2,351

Incomplete challenge 21: Uniform cubic ordinary-sensitivity upper bound for block sensitivity. Source\dots

ProveWilf inequality for proper numerical semigroups with embedding dimension 4$2,351

Incomplete challenge 22: Wilf inequality for proper numerical semigroups with embedding dimension 4. Source\dots

DisproveWilf inequality for proper numerical semigroups with embedding dimension 4$2,351

Incomplete challenge 22: Wilf inequality for proper numerical semigroups with embedding dimension 4. Source\dots

ProveWilf inequality for proper numerical semigroups with conductor at most four times multiplicity$2,351

Incomplete challenge 23: Wilf inequality for proper numerical semigroups with conductor at most four times multiplicity. Source\dots

DisproveWilf inequality for proper numerical semigroups with conductor at most four times multiplicity$2,351

Incomplete challenge 23: Wilf inequality for proper numerical semigroups with conductor at most four times multiplicity. Source\dots

ProveThird planar Dirichlet Polya inequality, area times lambda3 at least 12pi$2,351

Incomplete challenge 25: Third planar Dirichlet Polya inequality, area times lambda3 at least 12pi. Source\dots

DisproveThird planar Dirichlet Polya inequality, area times lambda3 at least 12pi$2,351

Incomplete challenge 25: Third planar Dirichlet Polya inequality, area times lambda3 at least 12pi. Source\dots

ProveFourth planar Dirichlet Polya inequality, area times lambda4 at least 16pi$2,351

Incomplete challenge 26: Fourth planar Dirichlet Polya inequality, area times lambda4 at least 16pi. Source\dots

DisproveFourth planar Dirichlet Polya inequality, area times lambda4 at least 16pi$2,351

Incomplete challenge 26: Fourth planar Dirichlet Polya inequality, area times lambda4 at least 16pi. Source\dots

ProveAll positive-index Dirichlet Polya inequalities on convex planar domains$2,351

Incomplete challenge 27: All positive-index Dirichlet Polya inequalities on convex planar domains. Source\dots

DisproveAll positive-index Dirichlet Polya inequalities on convex planar domains$2,351

Incomplete challenge 27: All positive-index Dirichlet Polya inequalities on convex planar domains. Source\dots

ProveEvery scalar real polynomial minimal graph in dimension eight is affine$2,351

Incomplete challenge 29: Every scalar real polynomial minimal graph in dimension eight is affine. Source\dots

DisproveEvery scalar real polynomial minimal graph in dimension eight is affine$2,351

Incomplete challenge 29: Every scalar real polynomial minimal graph in dimension eight is affine. Source\dots

ProveFor every dimension n>=8 there is a degree bound uniform over all scalar real polynomial minimal graphs$2,351

Incomplete challenge 30: For every dimension n>=8 there is a degree bound uniform over all scalar real polynomial minimal graphs.\dots

DisproveFor every dimension n>=8 there is a degree bound uniform over all scalar real polynomial minimal graphs$2,351

Incomplete challenge 30: For every dimension n>=8 there is a degree bound uniform over all scalar real polynomial minimal graphs.\dots

ProveMersenne - catalans mersenne conjectureNumber theory$5,089

c_0, \ldots, c_4

DisproveMersenne - catalans mersenne conjectureNumber theory$5,089

c_0, \ldots, c_4

ProveMersenne - infinitely many mersenne primesNumber theory$5,089

Are there infinitely many Mersenne primes?

DisproveMersenne - infinitely many mersenne primesNumber theory$5,089

Are there infinitely many Mersenne primes?

ProveNormality Of Pi - pi normal base tenNumber theory$5,089

\pi

DisproveNormality Of Pi - pi normal base tenNumber theory$5,089

\pi

ProveOppermannNumber theory$5,089

x \ge 2

DisproveOppermannNumber theory$5,089

x \ge 2

ProvePerfect Numbers - odd perfect number conjectureNumber theory$5,089

**Odd Perfect Number Conjecture.** The Odd Perfect Number Conjecture states that all perfect numbers are\dots

DisprovePerfect Numbers - odd perfect number conjectureNumber theory$5,089

**Odd Perfect Number Conjecture.** The Odd Perfect Number Conjecture states that all perfect numbers are\dots

ProvePollocks Conjecture - pollock tetrahedralNumber theory$5,089

5

DisprovePollocks Conjecture - pollock tetrahedralNumber theory$5,089

5

ProvePrimes And Perfect Squares - infinite prime sq add oneNumber theory$5,089

p

DisprovePrimes And Perfect Squares - infinite prime sq add oneNumber theory$5,089

p

ProveRegular Primes - regularprime conjectureNumber theory$5,089

Conjecture: The set of regular primes is infinite.

DisproveRegular Primes - regularprime conjectureNumber theory$5,089

Conjecture: The set of regular primes is infinite.

ProveRiemann HypothesisNumber theory$5,089

\frac{1}{2}

DisproveRiemann HypothesisNumber theory$5,089

\frac{1}{2}

ProveTwin PrimesNumber theory$5,089

Are there infinitely many primes p such that p + 2 is prime?

DisproveTwin PrimesNumber theory$5,089

Are there infinitely many primes p such that p + 2 is prime?

ProveErdős problem 1062 - part iiNumber theorySolved-

Erdős asked whether the limiting density f n / n exists and, if so, whether it is irrational.

DisproveErdős problem 1062 - part iiNumber theorySolved-

Erdős asked whether the limiting density f n / n exists and, if so, whether it is irrational.

ProveErdős problem 108CombinatoricsSolved-

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 subgraph of\dots

DisproveErdős problem 108CombinatoricsSolved-

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 subgraph of\dots

ProveErdős problem 14 - part iNumber theorySolved-

A ⊆ \mathbb{N}

DisproveErdős problem 14 - part iNumber theorySolved-

A ⊆ \mathbb{N}

ProveErdős problem 14 - part iiNumber theorySolved-

|\{1,\ldots,N\} \setminus B| = o(N^\frac{1}{2})

DisproveErdős problem 14 - part iiNumber theorySolved-

|\{1,\ldots,N\} \setminus B| = o(N^\frac{1}{2})

ProveErdős problem 18 - bNumber theorySolved-

h(n!) < n^{o(1)}

DisproveErdős problem 18 - bNumber theorySolved-

h(n!) < n^{o(1)}

ProveErdős problem 196CombinatoricsSolved-

\mathbb{N}

DisproveErdős problem 196CombinatoricsSolved-

\mathbb{N}

ProveErdős problem 272 - szabo strongCombinatoricsSolved-

t

DisproveErdős problem 272 - szabo strongCombinatoricsSolved-

t

ProveErdős problem 354 - part iNumber theorySolved-

\alpha,\beta\in \mathbb{R}_{>0}

DisproveErdős problem 354 - part iNumber theorySolved-

\alpha,\beta\in \mathbb{R}_{>0}

ProveErdős problem 416 - part iNumber theorySolved-

Let V(x) count the number of n\leqx such that ϕ(m)=n is solvable. Does V(2x)/V(x)\to2 ?

DisproveErdős problem 416 - part iNumber theorySolved-

Let V(x) count the number of n\leqx such that ϕ(m)=n is solvable. Does V(2x)/V(x)\to2 ?

ProveErdős problem 579CombinatoricsSolved-

\delta > 0

DisproveErdős problem 579CombinatoricsSolved-

\delta > 0

ProveErdős problem 653CombinatoricsSolved-

x_1,\ldots,x_n\in \mathbb{R}^2

DisproveErdős problem 653CombinatoricsSolved-

x_1,\ldots,x_n\in \mathbb{R}^2

ProveErdős problem 726Number theorySolved-

n\to \infty

DisproveErdős problem 726Number theorySolved-

n\to \infty

ProveErdős problem 859Number theorySolved-

c_1 / \log(t)^{c_2}

DisproveErdős problem 859Number theorySolved-

c_1 / \log(t)^{c_2}

ProveErdős problem 944Number theorySolved-

k \ge 4

DisproveErdős problem 944Number theorySolved-

k \ge 4

ProveErdős problem 96Convex and discrete geometrySolved-

n

DisproveErdős problem 96Convex and discrete geometrySolved-

n

ProveGreen's open problem 15CombinatoricsSolved-

f : \mathbb{N} \to \mathbb{Z}

DisproveGreen's open problem 15CombinatoricsSolved-

f : \mathbb{N} \to \mathbb{Z}

ProveGreen's open problem 24 - conjectureCombinatoricsSolved-

\left(\frac{1}{3} + o(1)\right) n^2

DisproveGreen's open problem 24 - conjectureCombinatoricsSolved-

\left(\frac{1}{3} + o(1)\right) n^2

ProveGreen's open problem 39CombinatoricsSolved-

A \subset \mathbb{Z}/p\mathbb{Z}

DisproveGreen's open problem 39CombinatoricsSolved-

A \subset \mathbb{Z}/p\mathbb{Z}

ProveGreen's open problem 40 - f two eq oneCombinatoricsSolved-

It is not known whether f(2) = 1 [Gr24]

DisproveGreen's open problem 40 - f two eq oneCombinatoricsSolved-

It is not known whether f(2) = 1 [Gr24]

ProveGreen's open problem 47Number theorySolved-

Suppose that a large sieve process leaves a set of quadratic size. Is that set quadratic? The following very particular instance\dots

DisproveGreen's open problem 47Number theorySolved-

Suppose that a large sieve process leaves a set of quadratic size. Is that set quadratic? The following very particular instance\dots

ProveGreen's open problem 51 - one halfCombinatoricsSolved-

A \subset \mathbb{F}_2^n

DisproveGreen's open problem 51 - one halfCombinatoricsSolved-

A \subset \mathbb{F}_2^n

ProveTwo-entry tight lonely-runner classificationSolved-

Incomplete challenge 04: Two-entry tight lonely-runner classification. Source: https://arxiv.org/html/2608.13599v2#S9

DisproveTwo-entry tight lonely-runner classificationSolved-

Incomplete challenge 04: Two-entry tight lonely-runner classification. Source: https://arxiv.org/html/2608.13599v2#S9

ProveGraceful degree-4-degree-3 treesSolved-

Incomplete challenge 10: Graceful degree-4-degree-3 trees. Source: https://onlinelibrary.wiley.com/doi/10.1155/jama/5826777

DisproveGraceful degree-4-degree-3 treesSolved-

Incomplete challenge 10: Graceful degree-4-degree-3 trees. Source: https://onlinelibrary.wiley.com/doi/10.1155/jama/5826777

ProveGraceful three-degree-3 treesSolved-

Incomplete challenge 11: Graceful three-degree-3 trees. Source: https://onlinelibrary.wiley.com/doi/10.1155/jama/5826777

DisproveGraceful three-degree-3 treesSolved-

Incomplete challenge 11: Graceful three-degree-3 trees. Source: https://onlinelibrary.wiley.com/doi/10.1155/jama/5826777

ProveEvery degree-at-most-four scalar real polynomial minimal graph is affine, in every dimensionSolved-

Incomplete challenge 28: Every degree-at-most-four scalar real polynomial minimal graph is affine, in every dimension. Source\dots

DisproveEvery degree-at-most-four scalar real polynomial minimal graph is affine, in every dimensionSolved-

Incomplete challenge 28: Every degree-at-most-four scalar real polynomial minimal graph is affine, in every dimension. Source\dots