Method for operating a computer for generating a comprehensive and exclusive list of prime numbers
作者： Henry Lepe
DOI:
关键词: Mathematics 、 Row 、 Nearest integer function 、 Sieve of Eratosthenes 、 Prime number 、 Combinatorics 、 Prime (order theory) 、 Integer 、 Prime factor 、 Discrete mathematics 、 Trial division
摘要: A method for operating a computer generating comprehensive and exclusive list of prime numbers which are less than or equal to selected large integer M, the including steps establish row head series R, an value A, L, rows based on R cyclicly generate regenerate upon redefined values perform non-prime labeling members very finally generated in manner Sieve Eratosthenes.
google.co.uk 参考文章(7)
Neeraj Kayal, Manindra Agrawal, Nitin Saxena, Polynomial time deterministic method for testing primality of numbers ,(2003)
Gilles Van Assche, Joan Daemen, Frank Cuypers, Pierre-Yvan Liardet, Protection of a prime number generation for an rsa algorithm ,(2010)
F.J. Barros, Dynamic structure modeling and simulation of the Eratosthenes Sieve for prime numbers annual simulation symposium. pp. 184- 189 ,(1997) , 10.1109/SIMSYM.1997.586547
H.A. Wake, D.A. Buell, Congruential sieves on reconfigurable computer field-programmable custom computing machines. pp. 11- 18 ,(2003) , 10.1109/FPGA.2003.1227237
Richard Crandall, Sam Noble, Prime indexing and/or other related operations ,(2009)
Colin Andrew Low, Method of producing a transit graph ,(2005)
Tamas Visegrady, Nicholas Wu, Joseph Harfouch, Accelerated prime sieving using architecture-optimized partial prime product table ,(2008)