Information for "Gaussian moat"

From HandWiki

Basic information

Display titleGaussian moat
Default sort keyGaussian moat
Page length (in bytes)3,960
Namespace ID0
Page ID206084
Page content languageen - English
Page content modelwikitext
Indexing by robotsAllowed
Number of redirects to this page0
Counted as a content pageYes
Page imageGaussian moat 15x15.svg
HandWiki item IDNone

Page protection

EditAllow all users (infinite)
MoveAllow all users (infinite)
View the protection log for this page.

Edit history

Page creatorimported>Jport
Date of page creation05:43, 9 March 2024
Latest editorimported>Jport
Date of latest edit05:43, 9 March 2024
Total number of edits1
Recent number of edits (within past 90 days)0
Recent number of distinct authors0

Page properties

Transcluded templates (22)

Templates used on this page:

SEO properties

Description

Content

Article description: (description)
This attribute controls the content of the description and og:description elements.
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...
Information from Extension:WikiSEO