Ok. All of you are rigth. I sugesst more the one test of this case.

No. Propblem is still valid. I checked a few sek ago.

this:
test.assert_equals(single_digit(5), 5)
should be this:
test.assert_equals(single_digit(5), 2)

One wrong test. I'm afraid.

Test.it("should return None, if n is already taken and no two digit solutions can be found")
Test.assert_equals(generate_number([1,2,3,4,6,9,10,11,15,18,27,29,34,36,38,45,47,54,56,63,65,69,72,74,81,83,92], 9), None)

9 is taken but 90 is not into squade so result should be 90 not None (or rather include 90 into squad).

In Python functionn is supposed to return list of tuples but there is list of list in description.

You have to decide:

1. odd numbers are really not a "Very Eaven", and do not let 875 to be true, or
2. change description and write explicite we must sum digits to the bottom
   Nice idea. Easy exemple for recursion. So I voted for solution 1.

You'r right. Problem exist in Python version. Sorry for not mention this.

1. Swap arguments in basic ceses!
2. Old problems still exist! Odd number of pennies cannot give "0" as last digit.

In Python tests cases chacking usage of filter function show info: "Use filter function: False should equal True", which not true at all and filter function were used.

Test in Python do nothing.
Pseudcode examples are simple coments so there are no simple tests at all.
There are not random tests.

Python translation of : Terminal game combat function.

It stand in descripton: "Return True if you're better, else False!"
But first basic test in Python indicate you mean:
"Return True if you're better or equal, else False!:

I.m afraid it is duplicate:
https://www.codewars.com/kata/find-the-gcf-of-two-numbers/python

exactly :
'make_sentences' in tests (and description)
'make_sentence' in script