A search for primes from lesser primes

Autor:	Jean-François Palierne, Jean Dayantis
Rok vydání:	2007
Předmět:	Discrete mathematics Algebra and Number Theory Mathematics::Number Theory Applied Mathematics Prime number Safe prime symbols.namesake ComputingMethodologies_SYMBOLICANDALGEBRAICMANIPULATION Prime quadruplet Prime triplet Unique prime symbols Emirp Idoneal number Analysis Cousin prime Mathematics
Zdroj:	Journal of Discrete Mathematical Sciences and Cryptography. 10:581-602
ISSN:	2169-0065 0972-0529
Popis:	The purpose of this paper is to show that there is an algorithm which permits to define new primes from lesser already known primes. The method is based on the definition of “compact” sets of primes, and on the fundamental property, i.e., the fact that the sum or difference of two mutually prime integers have no common decomposition factors with these two mutually prime integers.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::35db5c1a2985da2042db9a968fa6c60b https://doi.org/10.1080/09720529.2007.10698141 Zobrazit plný text záznamu