The absolute KOTY = Kata Of The Year !!

Tkx...
Note if I may - in c++ - (I counted and outputed the values for testing)
fixed_tests : 20
random_tests

• small_primes: 100
• small_composites: 100
• big_composites: 100
• primes_32_bits: 100
• semiprimes_64_bits: 75??

That could be in the description... (especially the fact that some 64 bits semiprimes will be tested IS actually important for the factorization algorithm...)

75 such tests

(C++)
Is it possible to get the number of tests of each category ?? Timing out @semiprimes_64_bits tests.
Note: I already think that it's an absolutely excellent kata, BTW.
Still not solved but ... keep trying :-)

dfhwze's comment exhaustingly answers this question.

• There is no essential factorisation technique required. Several different techniques have been used to solve this kata.
• Factorisation definately isn't the only bottleneck to solve this kata ;-)

Can anyone tell me if implementing specific factorization algorithm like Quadratic sieve is essential for this kata? I have a feeling that factorization is the bottleneck, but maybe I'm mistaken.

(I'm not sure if this question is a spoiler, as it's not that far from what is written in the article linked in the kata's description :)

It's probably side effect from library blocker. Maybe fractions lib depends on blocked libraries.

Yes :)

I don't think this module was meant to be excluded. Author, what do you think?

why can't we use the fraction library in python?

I would gladly disable gmp library for python but from previous experience this provokes a lot of nagging.

I may agree it is 7 kyu for Python,
but for JS, you need to write a prime check and search how to handle BigInt,
this still demands some work...

Thanks ! I was suprised it wasn't on OEIS yet. I'm glad that such autistic idea came to someone else too.

Just link the video that completely coincidentally was released at the same time as the kata https://www.youtube.com/watch?v=c066hLi78B0