SPT: Difference between revisions

Line 6:

== 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),

Line 16:

Line 34:

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:

Line 32:

Line 50:

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:

Line 46:

Line 64:

(See in [2])

'''Definition 4'''

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

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.

'''Questions'''

'''''Questions'''''

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.

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

== Project team ==

Natalia Makarova. Alex Belyshev. Tomáš Brada.

Demis. Natalia Makarova. Alex Belyshev. Tomáš Brada.

== Scientific results ==

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

@@ Line 6: / Line 6: @@
 == 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),
@@ Line 16: / Line 34: @@
 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:
@@ Line 32: / Line 50: @@
 : 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:
@@ Line 46: / Line 64: @@
 (See in [2])
-'''Definition 4'''
+'''''Definition 4'''''
 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.
-'''Questions'''
+'''''Questions'''''
 . Find solutions with a minimal diameter and a minimal value of p for 10 < k < 17, k = 18, 20, 22, 24.
 . 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 ==
-Natalia Makarova. Alex Belyshev. Tomáš Brada.
+Demis. Natalia Makarova. Alex Belyshev. Tomáš Brada.
 == Scientific results ==
 Results of this project are available in the '''''[https://boinc.tbrada.eu/spt/explore.php Prime Tuple Database].'''''