Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Johann Christian Stumpenhusen, On the Gaussian Moat Problem, arXiv:2401.08441 (v1 16 January 2024, 3 pages; v2 17 January 2024). This page rests on the arXiv record, accessed as the problem page records, not on the paper itself.
The claim. The answer to Problem 952 is no. The abstract states the problem as whether one can walk from the origin to infinity in the complex plane using only Gaussian primes as stepping stones and steps of bounded length, and says that the paper proves this impossible. The question's sequence may start anywhere, while this formulation starts at the origin; for an unspecified step bound the two are equivalent, since finitely many steps join the origin to any Gaussian prime.
Depends on. Nothing in this wiki.
Standing. Withdrawn by its author: version 2 of the arXiv record carries the comment "The width of the moat was not correctly computed". The claim was never accepted: the site's page, thread and label never mentioned it, and the search dated 2026-09-18 found no acceptance. The problem's standing is unaffected; the negative answer is proved by the accepted 2026 claim.