SPT: Difference between revisions

Line 111:

== Known Solutions ==

[[File:Sieve of Eratosthenes animation.gif|thumb|296x296px|The [[wikipedia:Sieve of Eratosthenes|Sieve of Eratosthenes]], the classical prime-finding algorithm underlying the modern primesieve library used by SPT.]]

The table below summarises the best known solutions for various values of <math>k</math>, as published on the project's reference page.<ref>{{cite web |url=http://www.primepuzzles.net/problems/prob_062.htm |title=Problem 62. Symmetric k-tuples of consecutive primes |publisher=primepuzzles.net |access-date=2026-05-23}}</ref> Solutions marked "not minimal" indicate that a smaller starting prime <math>p</math> or smaller diameter may still exist. Results were discovered across Stop@Home, TBEG, manual computation by contributors such as J. Wroblewski and two anonymous Russian contributors, and the ongoing SPT project.

@@ Line 111: / Line 111: @@
 == Known Solutions ==
-[[File:Sieve of Eratosthenes animation.gif|thumb|right|220px|The [[wikipedia:Sieve of Eratosthenes|Sieve of Eratosthenes]], the classical prime-finding algorithm underlying the modern primesieve library used by SPT.]]
+[[File:Sieve of Eratosthenes animation.gif|thumb|296x296px|The [[wikipedia:Sieve of Eratosthenes|Sieve of Eratosthenes]], the classical prime-finding algorithm underlying the modern primesieve library used by SPT.]]
 The table below summarises the best known solutions for various values of <math>k</math>, as published on the project's reference page.<ref>{{cite web |url=http://www.primepuzzles.net/problems/prob_062.htm |title=Problem 62. Symmetric k-tuples of consecutive primes |publisher=primepuzzles.net |access-date=2026-05-23}}</ref> Solutions marked "not minimal" indicate that a smaller starting prime <math>p</math> or smaller diameter may still exist. Results were discovered across Stop@Home, TBEG, manual computation by contributors such as J. Wroblewski and two anonymous Russian contributors, and the ongoing SPT project.