MathDBThe conjecture that Rejmer's algorithm never stops
The conjecture that Rejmer's algorithm never stops
A golden seed is a finite sequence of signs satisfying the balance and multiplicativity conditions maintained by Rejmer's greedy construction. Rejmer's algorithm conjecture. Rejmer's algorithm never stops. Computations produced golden seeds through length , but no proof that the algorithm continues indefinitely is known.
Sources & referencesView supporting material
Primary source
Jarosław Grytczuk, “From the 1-2-3 Conjecture to the Riemann Hypothesis”, arXiv:2003.02887 (2020).
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.