Fixed in latest fork

Approved

fixed in OP's fork

python new test framework + random tests + backward compatibility of snake_case. updated in this fork

python:

function name should be snake_case

• Ruby 3.0 should be enabled (Refer this & this for more detail)

Could also use a few more sample tests.

Haskell : https://www.codewars.com/kumite/5b8992545ed7d471f0000130?sel=5b8992545ed7d471f0000130

No random tests in Python.

Ruby translation submitted :)

Thanks. :)

The most surprising thing is surely that the "sum" part is O(n + log n) (so O(n) too, after all) and that this is faster than the simple sum through a loop with a break statment in O(n) ;)

For the prime generation, the memoiazation is the key...

It's very efficient. :)

I will. :)

with bigger values...! ;)