питон либ луна питонлиб солнце progerlib цветок

Change theme

Login Register
Avatar ·

Quick methods of finding all prime numbers less than n

📁 Advanced Python Topics, question, numpy, AI

What are the fastest known algorithms for finding all prime numbers less than n:

and what are the quick implementations in Python, Numpy, etc.)? 

   def   eratosthenes2  ( n ):  multiples =  set  ()   for  i  range  ( 2 , n+ 1 ):   if  i  not   in  multiples:   yield  i multiples.update ( range  (i*i, n+ 1 , i))
0 responses

Similar questions

How to create enums with constant values in Rust? Getters and setters in Kotlin: how to declare and use properties with custom accessors? How to add leading zeros to an Int number in Swift for display? Method in Python that outputs all instances of its class What is the difference between IEnumerable<T> and IQueryable<T> in C# and when to use which?