Consider the possible addition of a method for calculating nth-root by binary search.

[TheSquidCombatant]

It is possible to calculate the nth-root of a natural number using binary search because the nth-root function is monotonic and continuous.

I remember getting a tiny advantage when calculating the nth-root with binary search. This was in a certain small range of values in the vicinity of the inflection point of the functions of digit-by-digit nth-root extraction and well-known Newton`s method.

It is necessary to check, perhaps on a certain range of input parameters it may be more profitable to calculate the nth-root using a binary search.

P.S.: can only be processed after #10.

[TheSquidCombatant]

Remember that the number of N digits when raised to the M power cannot give a result greater than N*M digits. A number of N+1 digits when raised to the m power cannot give a result of more than (N+1)*M digits. And so on. This will help greatly reduce the search range for the value.