defprime_lower(n):

assertn>=1andn<=SIEVE_LIMIT,"input value is not valid"

ifn<1orn>SIEVE_LIMIT:

return []

prime=sieve(n)

ans= []

foriinrange(n+1):

Using prime numbers is common in many problems. We implement various algorithms using them.

from allalgorithms.numericimport prime_lower

print(prime_lower(18))

print(prime_lower(-1))

print(prime_lower(1000001))

-`query`: superior limit for the array of prime number

fromallalgorithms.numericimportfind_max

fromallalgorithms.numericimport (

find_max,

)

classTestMax(unittest.TestCase):

deftest_find_max_value(self):

test_list= [3,1,8,7,4]

self.assertEqual(8,find_max(test_list))

classTestPrimeLower(unittest.TestCase):

deftest_prime_lower_value(self):

test_list=[2,3,5,7,11,13,17]

self.assertEqual(prime_lower(18),test_list)

if__name__=="__main__":

unittest.main()