Cool kata!
I liked the combination of different topics (Graph theory and Number Theory).
The description makes it funny, although as a non-native English speaker, I had to slow down a bit while reading, as I'm not that familiar with Old English (I've seen a bit of it before, though). It was a nice detail, anyway.

Will be cool to see translations to other programming languages over time.

Nice kata, Konstantin!

Took me longer than I originally thought, but was quite interesting and led to think about different approaches to tackle it.
Hope to see a few translations. For the record, I didn't have any issues with the description or implementation, with the exception of using BigInt all along.

Nice kata!
Hope it gets approved soon.

https://www.codewars.com/kumite/645eae46d3560e0013c3c01e?sel=645eae46d3560e0013c3c01e

Here is a translation to update the assertSimilar calls to assertDeepEquals, in order to remove warnings when running the code.

Please feel free to review and approve.
Thanks.

Thanks for the updates!
I took a quick glance at it and approved it.

Thank you so much!.
I just approved it.

I'm glad to hear that you find it useful.
BTW, if you want to push things further, there are two other (harder) katas that can be solved with a similar approach:

• Regular expression for binary numbers divisible by 5
• Regular Expression - Check if divisible by 0b111 (7)

There's even a more general one, but that one is out of my league for now.

@aschattney, I managed to get the Kotlin translation approved; finally :).

Thanks for creating it (and for your patience).

Also, sorry if the description changes I made caused any additional issue. This kata has been getting more activity recently, and I noticed that the description was not clear enough in some parts, so I decided to revamp it and address some the common problems people were having with the description.

Weirdly, even though I hit the 'Approve' button and the HTTP request is made, your translation is not getting accepted. I don't know if it's a temporary issue with Codewars. I'll have to try again later; if that doesn't work, we'll have to try again with a new translation from scratch.

Approved.

Approved. Thanks for the translation.

Hi,
I cannot see your solution, so I cannot comment on that. Without more specific details or a solution already submitted, there's not so much I can tell you.

That said, if you're sure that the array of possible combinations you are creating is right (that is, the values pass the tests), then you are in the right track already; I'd suggest you stop using the array, and instead, just use a counter, a variable where you keep the count of the solutions you find. You don't need to keep the combinations themselves, just the number of them.

However, as mentioned at the beginning, as I don't see your solution and don't know what approach you are taking or how your array is generated, so I don't know how useful my suggestion will be.

Approved.
Thanks for the translations.Although I am not familiar enough with the languages and just gave a quick glance to this translations, they look good to me, as they seem to be based off one of the existing solutions. I see that the approach you took for this was using pre-calculated values, which is different from the one I took when I created the kata, but it's fine.
It's interesting to see the different approaches people take to solve the problem.