py_prime_number Calculates all prime numbers from 2 to n using Sieve of Eratosthenes with time complexity: O(sqrt(n)loglog(n))