OTOH, You need not to go from 1 up to n. You should find an optimal stopping point / upper-boundary where you can obtain all the divisors of n.

You don't need all of them.

Wow, this one kicked my butt ... a real challenge for me. In my opinion this is an excellent kata for the challenge and the learning!

To be executed a function needs to be called. And however prime_list doesn't exist for for your main function, it is enclosed inside your sieve function. You should work on easier katas in order to get familiar with some concept of basic Python programming. This is too much debugging at the time.

yes

i am trying to take the returned prime_list from SieveOfEratosthenes(h) in the last for loop but SieveOfEratosthenes(h) is not executing

This code throws an error:

NameError: name 'prime_list' is not defined

Sure. Unfortunately I'm unable to do it in Haskell. But maybe a kind soul will see this ;)

For this kata many translations don't have random tests (written years and years ago) but kind souls can add them:-)

Still not.