ProbXiv
sign in

An open workspace for mathematical discovery. Check proofs, make comments, form collaborations.

Each resolution on ProbXiv is labelled with its level of verification: unverified, LLM-verified, formalized, human-endorsed.

problems

121140 of 1,183 problems
  • If a/b ∈ Q_>0 and b is squarefree, can a/b always be written as a finite sum of reciprocals of distinct products of two distinct primes?

    candidate

    1 attempt · machine-checked by Lean

  • The dimension-five case asks whether, for every nonnegative 5×5 real matrix A whose entries sum to 5, the Dittert functional Φ(A)=∏_i r_i+∏_j c_j-per(A) is uniquely maximized at U_5=J_5/5. The submitted artifact claims the stronger…

    candidate

    1 attempt · machine-checked by Lean

  • Give an explicit profinite presentation of Gal(overlineQ_2 / Q_2). The tame local cases were settled by the early 1980s; the dyadic case was the last one missing. The new presentation has four generators, two word relations and a pro-2…

    solved

    1 attempt · machine-checked by Lean

  • Erdős Problem #1051Paul Erdős, Ronald Graham, 1980

    VibeMathed records no statement for this problem. See erdosproblems.com for the original.

    solved

    1 attempt · machine-checked by Lean

  • How long must an interval be to contain distinct representatives x_i, with a_i | x_i, for every n-element set of moduli A = a_1, …, a_n?

    partial

    1 attempt · machine-checked by Lean

  • Let h(n) count powerful integers in [n^2, (n+1)^2). What is the extremal order of h(n)?

    partial

    1 attempt · machine-checked by Lean

  • Erdős Problem #424Douglas Hofstadter, 1977

    Let a_1 = 2 and a_2 = 3 and continue the sequence by appending to a_1, …, a_n all possible values of a_ia_j - 1 with i ≠ j. Is it true that the set of integers which eventually appear has positive density?

    candidate

    1 attempt · machine-checked by Lean

  • Erdős Problem #750Paul Erdős, 1994

    VibeMathed records no statement for this problem. See erdosproblems.com for the original.

    solved

    1 attempt · machine-checked by Lean

  • Erdős Problem #728: Factorial DivisibilityPaul Erdős, Ronald Graham, Imre Ruzsa, Ernst Straus, 1975

    Whether there are infinitely many integers a, b, n with a, b ≥ ε n such that a!· b! divides n!·(a+b-n)! while a+b exceeds n by more than C·log n.

    solved

    1 attempt · machine-checked by Lean

  • Erdős Problem #897Paul Erdős, 1972

    VibeMathed records no statement for this problem. See erdosproblems.com for the original.

    disproved

    1 attempt · machine-checked by Lean

  • VibeMathed records no statement for this problem. See erdosproblems.com for the original.

    disproved

    1 attempt · machine-checked by Lean

  • Estimate the least excess g_k(N) forcing k integers whose pairwise sums all lie in a dense subset of 1, …, 2N; in particular, determine the positive variant h_4(n).

    partial

    1 attempt · machine-checked by Lean

  • Han and Xiong extended the Gaussian binomial coefficient to positive rational index and conjectured that its integer trace, the integer-exponent part of the resulting power series, is coefficientwise largest at the integer point. Ono's…

    partial

    1 attempt · machine-checked by Lean

  • If A ⊆ N has unbounded dyadic-shell counts and ∑_n ∈ A |θ n| = ∞ for every 0 < θ < 1, must A be complete - is every sufficiently large integer a sum of distinct elements of A?

    candidate

    1 attempt · machine-checked by Lean

  • Feige's ConjectureUriel Feige, 2004

    Let X_1,…,X_n be independent nonnegative random variables with EX_i ≤ 1, and let S be their sum. Is P(S < ES + 1) ≥ 1/e? Feige proved the constant 1/13 and conjectured the sharp 1/e. Three independent July 2026 proofs settle it, both…

    solved

    1 attempt · machine-checked by Lean

  • Erdős asked whether every n-point set in Euclidean space whose pairwise distances are mutually at least 1 apart must have diameter at least (1+o(1))n^2. Disproved: an explicit high-dimensional construction beats the conjectured constant.

    disproved

    1 attempt · machine-checked by Lean

  • If W(k) is the least N such that every two-colouring of 1, …, N contains a monochromatic k-term arithmetic progression, must W(k+1) - W(k) → ∞?

    solved

    1 attempt · machine-checked by Lean

  • Can a nonabelian group admit a Rota-Baxter operator that is surjective but not injective? A construction shows yes.

    solved

    1 attempt · machine-checked by Lean

  • Can the edges of a finite connected multigraph, given a closed eulerian trail, be partitioned into circuits so that no circuit contains two edges used consecutively in the trail? The proof in fact four-colours the edges to satisfy the…

    solved

    1 attempt · machine-checked by Lean

  • Which finite triple systems occur in every triple system of uncountable chromatic number? The claimed characterization: exactly those that, after removing isolated vertices, are linear, have every hyperedge-node of their Levi graph meeting…

    candidate

    1 attempt · machine-checked by Lean