Difference between revisions of "Algorithm for Representation of Prime Numbers - Determinants of a Special Kind"
Jump to navigation
Jump to search
(Imported from text file) |
(Imported from text file) |
||
| Line 15: | Line 15: | ||
==Abstract== | ==Abstract== | ||
| − | This paper derives recursive relationships that can be considered as one of the variants of a big screen, with the essential difference that here, instead of prime numbers, mutual simplicity is used.[[Category:Scientific Paper]] | + | This paper derives recursive relationships that can be considered as one of the variants of a big screen, with the essential difference that here, instead of prime numbers, mutual simplicity is used. |
| + | |||
| + | [[Category:Scientific Paper|algorithm representation prime numbers - determinants special kind]] | ||
Latest revision as of 09:56, 1 January 2017
| Scientific Paper | |
|---|---|
| Title | Algorithm for Representation of Prime Numbers - Determinants of a Special Kind |
| Read in full | Link to paper |
| Author(s) | Aleksandr M Tsybin |
| Keywords | {{{keywords}}} |
| Published | 2010 |
| Journal | Proceedings of the NPA |
| Volume | 7 |
| Number | 2 |
| No. of pages | 10 |
| Pages | 781-790 |
Read the full paper here
Abstract
This paper derives recursive relationships that can be considered as one of the variants of a big screen, with the essential difference that here, instead of prime numbers, mutual simplicity is used.
