I see! Thank you!

Though now I still need to think how to proceed this function :)

Combinations of itertools always did a timeout error for me. I'm curious how other solutions with this method have passed the tests.

Thank you:)!

Funny kata :D

it doesnt matter what it returnes. It only matters how long the function takes to execute:D its more fun than actually useful. Does this help you?

I don't quite get what beep() should return. I understand this should be a "signal" of a particular "length" but what is implied by it is unclear...

Okay I've tried this kata again with the solutions from the Solutions section. And these solutions also don't pass the tests. I am wondering how in the world can one solve this task...

Wow I definitely can't get how you can check number 8855 with only first 22 prime numbers (the 22nd is number 79). Isn't the point of the kata to add the prime number only if it is not present in the list and it is not the divisor of the N?

"Testing primes length after check for 8855
It should work with random inputs too: expected a result close to 22, instead got 525: False should equal True"

The funny thing is that a lot of tests print the same error (doesn't matter if it's a large or small number):

"Testing primes length after check for 119873
It should work with random inputs too: expected a result close to 22, instead got 525: False should equal True"

"Testing primes length after check for 1025
It should work with random inputs too: expected a result close to 22, instead got 525: False should equal True"

I can't understand it in any way.. why does this even work