Thank you!

According to the condition of the problem, the length of the array is guaranteed to be > 1, in the examples it can be seen that the first element in the incoming array is "thrown out", this is logical, because checking for i % 0 will not make sense. That's why we start the sequence with 1

Fixed.

Good solution too!

This was super fun. Admittedly I had to dig around on stack overflow to work on getting my algorithm to work within the time constraints (perhaps the challenge may be a bit on the difficult side for 6 kata without any bounds), but it's a great learning experience in the difference between solving a problem and solving a problem efficiently.

Missing edge case tests in all languages: 9 and 99.

The upper bound is inclusive in _.random(1,100000000000) in JS.

Try now please.

fixed that too!

Should be OK now, thanks to you. Please check.

It looks like the upper bound is 1e11, not 10e11.
Also the random tests in JS include the upper bound in the range.

Thanks. Fixing...

Fixed.