(One intermediate revision by one other user not shown)
Line 5:
Line 5:
|bx = 440
|bx = 440
|by = 294
|by = 294
|symmetry = C1
|discoverer = Dean Hickerson
|discoverer = Dean Hickerson
|discoveryear = 1991
|discoveryear = 1991
Line 18:
Line 19:
'''Primer''' is a [[pattern]] that was constructed by [[Dean Hickerson]] on November 1, {{year|1991}} that produces a stream of [[lightweight spaceship]]s representing [[Prime number|prime numbers]]. N is prime if and only if a lightweight spaceship escapes to the left of the [[pentadecathlon]] at the bottom-left corner of the pattern at [[generation]] {{nowrap|120 N + 100}}.<ref>{{filename|PRIMES.LIF}} from [[Alan Hensel]]'s [http://www.ibiblio.org/lifepatterns/ {{filename|lifep.zip}} pattern collection]. Accessed on July 28, 2009.</ref><ref>{{CiteGollyPatternCollection|four-primers.rle.gz|accessdate=July 28, 2009}}</ref> It was the first known pattern created that computes prime numbers, though others have since been constructed based on the same ideas.<ref name="post6330" />
'''Primer''' is a [[pattern]] that was constructed by [[Dean Hickerson]] on November 1, {{year|1991}} that produces a stream of [[lightweight spaceship]]s representing [[Prime number|prime numbers]]. N is prime if and only if a lightweight spaceship escapes to the left of the [[pentadecathlon]] at the bottom-left corner of the pattern at [[generation]] {{nowrap|120 N + 100}}.<ref>{{filename|PRIMES.LIF}} from [[Alan Hensel]]'s [http://www.ibiblio.org/lifepatterns/ {{filename|lifep.zip}} pattern collection]. Accessed on July 28, 2009.</ref><ref>{{CiteGollyPatternCollection|four-primers.rle.gz|accessdate=July 28, 2009}}</ref> It was the first known pattern created that computes prime numbers, though others have since been constructed based on the same ideas.<ref name="post6330" />
It works by using [[glider]]s to emulate a prime number sieve<ref>{{LinkWikipedia|Sieve_of_Eratosthenes|name=Sieve of Eratosthenes|nobullet=nobullet}}</ref>. Lightweight spaceships that move westward are deleted by gliders that represent positive integers if the lightweight spaceship represents a multiple of that number.
It works by using [[glider]]s to emulate a prime number sieve<ref>{{LinkWikipedia|Sieve_of_Eratosthenes|name=Sieve of Eratosthenes|nobullet=nobullet}}</ref>. Lightweight spaceships that move westward are deleted by gliders that represent positive odd integers if the lightweight spaceship represents a multiple of that number.
{{EmbedViewer
{{EmbedViewer
Line 28:
Line 29:
}}
}}
==Image gallery==
== Gallery ==
{|
{|
|-
|[[File:Primer stream.png|thumb|The stream of spaceships representing prime numbers]]
|[[Image:Primer_stream.png|thumb|The stream of spaceships representing prime numbers]]
|}
|}
==Videos==
== Videos ==
{|
{|
|-
|{{#ev:youtube|68nEX5CEmZE|300|left|Primer outputting the prime numbers from 2 through 37}}
|{{#ev:youtube|68nEX5CEmZE|300|left|Primer outputting the prime numbers from 2 through 37}}
|}
|}
==See also==
== See also ==
* [[Fermat prime calculator]]
* [[Fermat prime calculator]]
* [[tlog(t) growth]]
* [[tlog(t) growth]]
* [[Twin prime calculator]]
* [[Twin prime calculator]]
==References==
== References ==
<references>
<references>
<ref name="post6330">{{LinkForumThread
<ref name="post6330">{{LinkForumThread
Line 56:
Line 55:
</references>
</references>
==External links==
== External links ==
* {{LinkLexicon|lex_p.htm#primer}}
* {{LinkLexicon|lex_p.htm#primer}}
* {{LinkGoLNews|2007/12/prime_number_calculators.html|title=Prime Number Calculators|date=December 15, 2007|author=Dave Greene}}
* {{LinkGoLNews|2007/12/prime_number_calculators.html|title=Prime Number Calculators|date=December 15, 2007|author=Dave Greene}}
Primer is a pattern that was constructed by Dean Hickerson on November 1, 1991 that produces a stream of lightweight spaceships representing prime numbers. N is prime if and only if a lightweight spaceship escapes to the left of the pentadecathlon at the bottom-left corner of the pattern at generation120 N + 100.[1][2] It was the first known pattern created that computes prime numbers, though others have since been constructed based on the same ideas.[3]
It works by using gliders to emulate a prime number sieve[4]. Lightweight spaceships that move westward are deleted by gliders that represent positive odd integers if the lightweight spaceship represents a multiple of that number.
