updated to Python 3.11

We will write a function step with parameters:

g (integer >= 2) which indicates the step we are looking for,

m (integer >= 2) which gives the start of the search (m inclusive),

n (integer >= m) which gives the end of the search (n inclusive)

i think this has the first two conditions, but the upper limit may need to be added

Rejected, see comments under the translation for details. Feel free to fork the translation, fix the issues, and republish.

Don't worry, glad you learned something new.

Go to Solutions, see how you can use regular expressions to solve this kata. In some languages you'll find more than in others.

Why? You can use regular expressions if you want, you're not forced to do it tho.

Added __bool__(self) to Number class with the same definition as __nonzero__.

Removed deepcopies... divided by 2 the time needed... x) Only pretty inefficient solutions wouldn't pass, now.

I updated the default version to 3.6 at the same time.

confirmed (about python)

note: changing all the copy.deepcopy in the test suite to handmade functions should resolve the problem (this module is f..king slow)

Ths sounds language-specific. It would help if you specified which language has this problem.

( Let me guess: it's Python. Python seems to have incurred a slowdown somewhere during a platform "upgrade". )

The input never overflows, and while running 1k tests (just to be sure) not a single negative number was generated. Your code is the source of the problem.