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...)

(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 :-)

OK thanks, saw that you authored a lot of katas...
Moves the ref solution to the private section (learnt a thing there), also implemented the other ideas.
Note: I'm not confortable (at all) with range v3 and fmt/... with C++17 clang (therefore pretty comfortable with c++20/23 stuff ) but with clang there is a hell of a lot of shi.. to include...
You #4 is indeed nice !

:-)

C++ translation waiting for comments or ... approval :-)

Can't figure out why the description says and you must verify whether any pairs of primes satisfy the condition. ?
IMHO this should be removed.

Somewhere in the description we may find the concept of unordered pair or pair set , as it is not clear wether you expect ordered or unordered pairs.
See https://en.wikipedia.org/wiki/Ordered_pair or https://en.wikipedia.org/wiki/Unordered_pair

(in C++) Did succeed, but with a kind of brute force solution...
I submit but just for you to see that... it is REALLY basic !!\

IMHO tests are not sufficient and or robust enough, for from times to times (depending on the values of the random tests) the solutions passes or does not pass. Depends of course of the 'factorization' algorithm; roughly passes 90% of the time. Could be an issue but I just mark it as a suggestion :-)

:-)

in C++, there is a warning in the main =>

./tests.cpp:23:25: warning: comparison of integers of different signs: 'std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >::size_type' (aka 'unsigned long') and 'int' [-Wsign-compare]
    if (binary.length() < size) binary = std::string(size - binary.length(), '0') + binary;
        ~~~~~~~~~~~~~~~ ^ ~~~~
1 warning generated.

IMHO you should you fix that ?

😁 Always a pleasure to fork your ✨ solutions, dear...

In C++.
Oups... does it really takes 8secs just to compile ???