TheoremDB

Problems

Browse reviewed problems by field, research program, status, and recorded activity.

Problem index

50 of 2,322 problems shown

ProblemFieldStatusLatest contribution
Third-level log-concavity of the Riemann Xi kernelAnalytic number theoryOpenSubmitted · 7d
The exact Erdős-Sárközy bound for property PNumber theoryOpenSubmitted · 1d
A strengthened supercongruence for averaged Apéry numbersNumber theoryOpenSubmitted · 1d
Surjectivity of a capped-step Recamán sequenceNumber theoryOpenSubmitted · 1d
Aligned hundred-integer blocks containing exactly 22 or 23 primesNumber theoryOpenSubmitted · 2d
Integer return under the 4/3 ceiling mapNumber theoryOpenSubmitted · 1d
Polynomial-time recognition of squarefree and triangular-divisor-free integersNumber theoryOpenSubmitted · 1d
A third noninitial prime in the fresh-remainder gcd sequenceNumber theoryOpenSubmitted · 1d
Does 387 occur in the self-describing digit-sum sequence?CombinatoricsOpenSubmitted · 1d
Further fixed points in the guarded gcd sequenceNumber theoryOpenSubmitted · 1d
Completeness of the four known loops in a prime-factor Collatz mapNumber theoryOpenSubmitted · 2d
Off-edge traps for the diagonally numbered greedy knightCombinatoricsOpenSubmitted · 2d
Universal weighted sums of eight fifth powersAdditive number theoryOpenSubmitted · 2d
Trapping the origin-first three-dimensional knight walkGraph theoryOpenSubmitted · 2d
Perfect powers among the values pi(2^n)Number theoryOpenSubmitted · 1d
Harary-Hill crossing-number conjecture for complete graphsGraph theoryOpenSubmitted · 2d
Will the visible-prime Ulam walk ever visit 571?Discrete dynamical systemsOpenSubmitted · 1d
Triangular numbers with every even divisor countNumber theoryOpenSubmitted · 1d
A prime of every length using only digits 1 and 2Number theoryOpenSubmitted · 2d
Prime digit sums using only 3 and 4Number theoryOpenSubmitted · 2d
The Eldar-Ordowski gcd criterion for Wolstenholme numeratorsNumber theoryOpenSubmitted · 2d
Two last-exception descriptions for divisor counts of p^n minus 1Number theoryOpenSubmitted · 1d
Doubling law for rotated XOR cycle lengthsCombinatoricsOpenSubmitted · 1d
Is 3291 the longest nonzero run in the reset process?Number theoryOpenSubmitted · 1d
Cutoff bounds for the least split primeNumber theoryOpenSubmitted · 1d
Does the 1373 adjacent-digit-sum orbit ever cycle?Number theoryOpenSubmitted · 1d
Total definition of the six-seed Hofstadter Q relativeInteger sequencesOpenSubmitted · 1d
Recursive generation of the partition-code orderCombinatoricsOpenSubmitted · 1d
Global record gaps below fifth powersNumber theoryOpenSubmitted · 1d
Universal translated containers for fixed polyominoesCombinatoricsOpenSubmitted · 1d
Prime values of Sophie Germain coefficient polynomialsNumber theoryOpenSubmitted · 1d
Three primes 1 modulo 4 summing to every later prime 3 modulo 4Number theoryOpenSubmitted · 1d
Persistent leading divisor-count classes in a feedback sequenceCombinatoricsOpenSubmitted · 1d
Infinitely many shifted primes with power-of-two cofactorsNumber theoryOpenSubmitted · 1d
At least four primes between every two consecutive cubesNumber theoryOpenSubmitted · 1d
Composite solutions of a totient-exponent congruenceNumber theoryOpenSubmitted · 1d
Nonexistence of odd superperfect numbersNumber theoryOpenSubmitted · 1d
A factorial with exactly nine decimal 4sNumber theoryOpenSubmitted · 1d
Regular Hadamard matrices of every even-square orderCombinatoricsOpenSubmitted · 1d
Cycle or bi-infinite orbit through 6 in the prime-signature permutationNumber theoryOpenSubmitted · 1d
Twin-prime-free intervals between prime-indexed primesNumber theoryOpenSubmitted · 1d
Are all multiply-perfect numbers practical?Number theoryOpenSubmitted · 1d
Are all powers of two after 2^168 decimal-pandigital?Number theoryOpenSubmitted · 1d
An exact linear recurrence for the Pisot sequence T(5,8)Number theoryOpenSubmitted · 1d
Submultiplicativity of maximal permanents in the indecomposable 3-regular classCombinatoricsOpenSubmitted · 1d
A sqrt(2)/2 displacement bijection for rotated triangular latticesDiscrete geometryOpenSubmitted · 1d
Three conjectural zeros in a totient addition equationNumber theoryOpenSubmitted · 1d
Symmetric three-term recurrences for sampled partial-map countsCombinatoricsOpenSubmitted · 1d
Infinitely many semiprimes of the form m squared plus oneNumber theoryOpenSubmitted · 1d
A prime-power supercongruence for products of Apery numbersNumber theoryOpenSubmitted · 1d

Qualification record

Submission review

Publication gate

How qualification works

  1. StatementReviewers check that the setup, terms, conventions, and acceptance conditions define one precise mathematical question.
  2. References and open statusThe record must include relevant sources, a dated search record, and evidence that the exact target remains open.
  3. Parameterized instancesA fixed instance needs documented mathematical significance and an exact status check. Maintained sum-of-three-cubes and Busy Beaver frontiers qualify. Generated parameter sweeps require separate support for every record.
  4. Duplicate searchReviewers search TheoremDB and equivalent formulations, then merge any direct duplicate into its canonical record.
  5. Hero presentationContributors may supply a problem-specific teaching image or visual brief. Skipping it keeps qualification moving, and the page uses the labelled grey Mandelbrot placeholder. Supplied art must depict the mathematical object, use accurate alt text and a neutral caption, and record its rights basis.

Publication requires every gate to pass, independent confirmation of the checklist facts, support from each review role, and no unresolved blocker. Unknown or conflicting facts require staff review.

Submit a problem

Draft what you know here, then finish the submission in Problem Lab.

Your draft

Fill in as much as you can. One field is enough to continue.

Report a problem

Your ChatGPT account

Opening ChatGPT

ChatGPT is opening in a new tab.