{"title":"一种求素数的新算法","authors":"Daniele Bufalo, Michele Bufalo, Raffaele Tetta","doi":"10.2139/ssrn.3437832","DOIUrl":null,"url":null,"abstract":"In this paper we explore a new approach to find any prime numbers up a fixed n 2 N. The proposed procedure does not run like a sieve and it is easy to implement, since it uses just assignments and subtractions. The algorithm and its extensions proposed give improvements about the memory requirement, with upgradeable runtime performances. Moreover, we note that our approach is very suitable for a parallel computing. These results solve, in our opinion, a lot of issues which many of sieves suffer, especially when large numbers are considered.","PeriodicalId":299310,"journal":{"name":"Econometrics: Mathematical Methods & Programming eJournal","volume":"100 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-08-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"A New Algorithm to Find Prime Numbers\",\"authors\":\"Daniele Bufalo, Michele Bufalo, Raffaele Tetta\",\"doi\":\"10.2139/ssrn.3437832\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper we explore a new approach to find any prime numbers up a fixed n 2 N. The proposed procedure does not run like a sieve and it is easy to implement, since it uses just assignments and subtractions. The algorithm and its extensions proposed give improvements about the memory requirement, with upgradeable runtime performances. Moreover, we note that our approach is very suitable for a parallel computing. These results solve, in our opinion, a lot of issues which many of sieves suffer, especially when large numbers are considered.\",\"PeriodicalId\":299310,\"journal\":{\"name\":\"Econometrics: Mathematical Methods & Programming eJournal\",\"volume\":\"100 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-08-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Econometrics: Mathematical Methods & Programming eJournal\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.2139/ssrn.3437832\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Econometrics: Mathematical Methods & Programming eJournal","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.2139/ssrn.3437832","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
In this paper we explore a new approach to find any prime numbers up a fixed n 2 N. The proposed procedure does not run like a sieve and it is easy to implement, since it uses just assignments and subtractions. The algorithm and its extensions proposed give improvements about the memory requirement, with upgradeable runtime performances. Moreover, we note that our approach is very suitable for a parallel computing. These results solve, in our opinion, a lot of issues which many of sieves suffer, especially when large numbers are considered.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
