SPT - Revision history

Al Piskun: update and infobox

2026-05-24T03:57:06Z

update and infobox

Show changes

Al Piskun: update and add infobox

2026-05-23T11:21:32Z

update and add infobox

Show changes

Al Piskun: /* Methods */ add links

2024-04-07T12:03:04Z

Methods: add links

← Older revision		Revision as of 12:03, 7 April 2024
Line 24:		Line 24:
	A prime k-tuple is a finite collection of values (p + a1, p + a2, p + a3, …, p + ak),		A prime k-tuple is a finite collection of values (p + a1, p + a2, p + a3, …, p + ak),

	where p, p + a1, p + a2, p + a3, …, p + ak are prime numbers, (a1, a2, a3, …, ak) are pattern. Typically the first value in the pattern is 0 and the rest are distinct positive even numbers. [1]		where p, p + a1, p + a2, p + a3, …, p + ak are prime numbers, (a1, a2, a3, …, ak) are pattern. Typically the first value in the pattern is 0 and the rest are distinct positive even numbers. [https://en.wikipedia.org/wiki/Prime_k-tuple]

	We consider the k-tuple, where p + a1, p + a2, p + a3, ..., p + ak are consecutive primes.		We consider the k-tuple, where p + a1, p + a2, p + a3, ..., p + ak are consecutive primes.
Line 60:		Line 60:
	'''''Definition 4'''''		'''''Definition 4'''''

	The diameter d of k-tuple is the difference of its largest and smallest elements. [1]		The diameter d of k-tuple is the difference of its largest and smallest elements.[http://oeis.org/A055380]

	Example		Example
Line 70:		Line 70:
	It has a diameter d = 26.		It has a diameter d = 26.

	Known solutions with a minimal diameter and a minimal value of p for k = 2, 4, 6, 8 see in [1]		Known solutions with a minimal diameter and a minimal value of p for k = 2, 4, 6, 8 see in [http://oeis.org/A081235]

	Further,		Further,

Al Piskun: /* Methods */ wording

2024-04-07T11:39:33Z

Methods: wording

← Older revision		Revision as of 11:39, 7 April 2024
Line 16:		Line 16:
	The search code itself (in SPT), according to the constructed matrix, takes up only 5-6MB in memory. And it doesn't increase.		The search code itself (in SPT), according to the constructed matrix, takes up only 5-6MB in memory. And it doesn't increase.

	When the project started, the memory size for the matrix of one task was approximately 620MB. The memory size is now 1.3 GB and will slowly increase. The longer the numbers, the more memory they require in the primesieve matrix. One ~~of our tasks~~ takes, on average, from 45 minutes to 1.5 hours, although there are exceptions to this rule. There are cruncher computers that ~~count~~ in 20 minutes and also computers that ~~count~~ in 240 minutes.[https://boinc.termit.me/adsl/faq-en.php]		When the project started, the memory size for the matrix of one task was approximately 620MB. The memory size is now 1.3 GB and will slowly increase. The longer the numbers, the more memory they require in the primesieve matrix. One task takes, on average, from 45 minutes to 1.5 hours, although there are exceptions to this rule. There are cruncher computers that complete a work unit in 20 minutes and also computers that complete in 240 minutes.[https://boinc.termit.me/adsl/faq-en.php]

	The SPT application is based on '''''[http://www.primepuzzles.net/problems/prob_062.htm Problem 62. Symmetric k-tuples of consecutive primes]''''' presented by Natalia Makarova.		The SPT application is based on '''''[http://www.primepuzzles.net/problems/prob_062.htm Problem 62. Symmetric k-tuples of consecutive primes]''''' presented by Natalia Makarova.

Al Piskun: /* Methods */remove whitespace

2024-04-07T11:36:55Z

Methods: remove whitespace

← Older revision		Revision as of 11:36, 7 April 2024
Line 16:		Line 16:
	The search code itself (in SPT), according to the constructed matrix, takes up only 5-6MB in memory. And it doesn't increase.		The search code itself (in SPT), according to the constructed matrix, takes up only 5-6MB in memory. And it doesn't increase.

	When the project started, the memory size for the matrix of one task was approximately 620MB. The memory size is now 1.3 GB and will slowly increase.		When the project started, the memory size for the matrix of one task was approximately 620MB. The memory size is now 1.3 GB and will slowly increase. The longer the numbers, the more memory they require in the primesieve matrix. One of our tasks takes, on average, from 45 minutes to 1.5 hours, although there are exceptions to this rule. There are cruncher computers that count in 20 minutes and also computers that count in 240 minutes.[https://boinc.termit.me/adsl/faq-en.php]

	The longer the numbers, the more memory they require in the primesieve matrix.

	One of our tasks takes, on average, from 45 minutes to 1.5 hours, although there are exceptions to this rule.

	There are cruncher computers that count in 20 minutes and also computers that count in 240 minutes.[https://boinc.termit.me/adsl/faq-en.php]

	The SPT application is based on '''''[http://www.primepuzzles.net/problems/prob_062.htm Problem 62. Symmetric k-tuples of consecutive primes]''''' presented by Natalia Makarova.		The SPT application is based on '''''[http://www.primepuzzles.net/problems/prob_062.htm Problem 62. Symmetric k-tuples of consecutive primes]''''' presented by Natalia Makarova.

Al Piskun: /* Methods */ update

2024-04-07T11:20:45Z

Methods: update

← Older revision		Revision as of 11:20, 7 April 2024
Line 6:		Line 6:

	== Methods ==		== Methods ==
	~~The~~ SPT ~~code~~ is ~~published here: '''''https://github~~.~~com/DemIS-1/spt'''''~~		Currently the SPT application takes up about 1.3 GB of RAM in the computer memory. 99% of this 1.3 GB is taken up by constructing a matrix of prime numbers.

	'''Definition 1'''		The matrix of prime numbers is made by the code primesieve. Specific code snippet: '''''https://github.com/kimwalisch/primesieve/tree/2b2c4a5c62f0cd9dfd9f56cca580ea47fa84dc2d'''''

			Original sources from Tomash Brada: '''''https://github.com/tomasbrod/tbboinc/tree/primes/symprtu'''''

			Adapted by Demis for SPT project: '''''https://github.com/DemIS-1/spt'''''

			The search code itself (in SPT), according to the constructed matrix, takes up only 5-6MB in memory. And it doesn't increase.

			When the project started, the memory size for the matrix of one task was approximately 620MB. The memory size is now 1.3 GB and will slowly increase.

			The longer the numbers, the more memory they require in the primesieve matrix.

			One of our tasks takes, on average, from 45 minutes to 1.5 hours, although there are exceptions to this rule.

			There are cruncher computers that count in 20 minutes and also computers that count in 240 minutes.[https://boinc.termit.me/adsl/faq-en.php]

			The SPT application is based on '''''[http://www.primepuzzles.net/problems/prob_062.htm Problem 62. Symmetric k-tuples of consecutive primes]''''' presented by Natalia Makarova.

			'''''Definition 1'''''

	A prime k-tuple is a finite collection of values (p + a1, p + a2, p + a3, …, p + ak),		A prime k-tuple is a finite collection of values (p + a1, p + a2, p + a3, …, p + ak),
Line 16:		Line 34:
	We consider the k-tuple, where p + a1, p + a2, p + a3, ..., p + ak are consecutive primes.		We consider the k-tuple, where p + a1, p + a2, p + a3, ..., p + ak are consecutive primes.

	'''Definition 2'''		'''''Definition 2'''''

	k-tuple (p + a1, p + a2, p + a3, ..., p + a [k / 2], p + a [k / 2+1], ..., p + a [k-2], p + a [k-1], p + ak) for k even, is called symmetric, if the following condition is satisfied:		k-tuple (p + a1, p + a2, p + a3, ..., p + a [k / 2], p + a [k / 2+1], ..., p + a [k-2], p + a [k-1], p + ak) for k even, is called symmetric, if the following condition is satisfied:
Line 32:		Line 50:
	17: 0, 2, 6, 12, 14, 20, 24, 26		17: 0, 2, 6, 12, 14, 20, 24, 26

	'''Definition 3'''		'''''Definition 3'''''

	k-tuple (p + a1, p + a2, p + a3, ..., p + a [(k-1) / 2], p + a [(k-1) / 2 + 1], p + a [(k-1) / 2 + 2], ..., p + a [k-2], p + a [k-1], p + ak) for k odd called symmetric, if the following condition is satisfied:		k-tuple (p + a1, p + a2, p + a3, ..., p + a [(k-1) / 2], p + a [(k-1) / 2 + 1], p + a [(k-1) / 2 + 2], ..., p + a [k-2], p + a [k-1], p + ak) for k odd called symmetric, if the following condition is satisfied:
Line 46:		Line 64:
	(See in [2])		(See in [2])

	'''Definition 4'''		'''''Definition 4'''''

	The diameter d of k-tuple is the difference of its largest and smallest elements. [1]		The diameter d of k-tuple is the difference of its largest and smallest elements. [1]
Line 122:		Line 140:
	For k = 17, 19, 21, 23 solutions no found.		For k = 17, 19, 21, 23 solutions no found.

	'''Questions'''		'''''Questions'''''

	1. Find solutions with a minimal diameter and a minimal value of p for 10 < k < 17, k = 18, 20, 22, 24.		1. Find solutions with a minimal diameter and a minimal value of p for 10 < k < 17, k = 18, 20, 22, 24.

	2. Find solutions for the remaining k, minimal or not minimal.		2. Find solutions for the remaining k, minimal or not minimal.

	~~'''''[http://www.primepuzzles.net/problems/prob_062.htm Problem 62. Symmetric k-tuples of consecutive primes].'''''~~

	== Project team ==		== Project team ==
	Natalia Makarova. Alex Belyshev. Tomáš Brada.		Demis. Natalia Makarova. Alex Belyshev. Tomáš Brada.

	== Scientific results ==		== Scientific results ==
	Results of this project are available in the '''''[https://boinc.tbrada.eu/spt/explore.php Prime Tuple Database].'''''		Results of this project are available in the '''''[https://boinc.tbrada.eu/spt/explore.php Prime Tuple Database].'''''

Al Piskun at 18:28, 2 April 2024

2024-04-02T18:28:37Z

← Older revision		Revision as of 18:28, 2 April 2024
Line 6:		Line 6:

	== Methods ==		== Methods ==
			The SPT code is published here: '''''https://github.com/DemIS-1/spt'''''

	'''Definition 1'''		'''Definition 1'''

Al Piskun: Methods/ details

2024-03-17T20:16:51Z

Methods/ details

Show changes

Al Piskun: team

2024-03-17T19:30:35Z

team

← Older revision		Revision as of 19:30, 17 March 2024
Line 15:		Line 15:
	* impactful final statement		* impactful final statement

	== Project team ~~/ Sponsors~~ ==		== Project team ==
			Natalia Makarova. Alex Belyshev. Tomáš Brada.
	*list here

	== Scientific results ==		== Scientific results ==

Al Piskun: logo

2024-03-17T19:28:10Z

logo

← Older revision		Revision as of 19:28, 17 March 2024
Line 1:		Line 1:
	<div style="background-color: #D4E2FC; border-top: 1px solid #5F92F2; font-size: bigger; padding-left: 15px; margin: 12px -5px -5px -5px;">'''BOINC project page template'''</div>		<div style="background-color: #D4E2FC; border-top: 1px solid #5F92F2; font-size: bigger; padding-left: 15px; margin: 12px -5px -5px -5px;">'''BOINC project page template'''</div>

	~~(Optional) Insert This_project logo (example image):~~[[File:{{#setmainimage:~~Boinc logo 3d~~.~~png\|109x48px~~}}\|alt=logo image\|center\|frameless]]~~[[File:Example of a GUI.png\|alt=example mediawiki image\|thumb\|<small>(Optional) insert MediaWiki image or Upload file</small>]]~~[https://~~boincsynergy~~.ca/ '''''~~This_project~~'''''] is a BOINC based '''''[[wikipedia:Volunteer computing\|volunteer computing]]''''' project that ~~uses and~~ needs your help to ...		[[File:{{#setmainimage:Spt.jpg}}\|alt=logo image\|center\|frameless]]
			[https://boinc.termit.me/adsl/ '''''SPT'''''] is a BOINC based '''''[[wikipedia:Volunteer computing\|volunteer computing]]''''' project that needs your help to continue the work of the '''''[https://boinc.tbrada.eu/ T. Brada Experimental Grid project].'''''

	== Why This_project? ==		== Why This_project? ==