Gaussian moat
id:
gaussian-moat-287-12786926
title:
Gaussian moat
text:
In number theory, the Gaussian moat problem asks whether it is possible to find an infinite sequence of distinct Gaussian prime numbers such that the difference between consecutive numbers in the sequence is bounded. More colorfully, if one imagines the Gaussian primes to be stepping stones in a sea of complex numbers, the question is whether one can walk from the origin to infinity with steps of bounded size, without getting wet. The problem was first posed in 1962 by Basil Gordon and it remain
brand slug:
wiki
category slug:
encyclopedia
description:
Mathematical problem in number Theory
original url:
https://en.wikipedia.org/wiki/Gaussian_moat
date created:
date modified:
2024-03-18T04:24:33Z
main entity:
{"identifier":"Q5527841","url":"https://www.wikidata.org/entity/Q5527841"}
image:
{"content_url":"https://upload.wikimedia.org/wikipedia/commons/0/0f/Gaussian_moat_15x15.svg","width":414,"height":414}
fields total:
13
integrity:
15