I like your naming scheem

I tried avoiding reccurcivity and therefore solving for n, but a lot of the solutions ar just force-bruting it like trying until it maches or excedes...

I would've added a test with a n an order of magnitude greater, like m = 2↑↑10 (n = 2.5*10^45) or smthg, exciding the 12'000ms timer for reccurcive methodes

Nonetheless, it was a great kata, fun to solve