… and improved boundary estimation

1. Added modular arithmetic checks to quickly eliminate numbers that cannot be perfect cubes:
   · Last digit check: Only digits 0-9 can be cube endings
   · Modulo 7 check: Cubes can only be 0, 1, or 6 mod 7
   · Modulo 9 check: Cubes can only be 0, 1, or 8 mod 9
2. Improved boundary estimation for very large numbers (n > 10^18):
   · Uses logarithmic approximation to calculate a reasonable upper bound
   · Reduces the binary search space significantly for extremely large values
3. Optimized computation in the binary search loop:
   · Added a check to avoid expensive cubic calculations for very large mid values
   · Uses integer division to prevent overflow in comparisons
4. Enhanced test coverage with comprehensive doctests:
   · Added tests for very large numbers (up to 10^300)
   · Included edge cases and error conditions
   · Maintained compatibility with existing tests

for more information, see https://pre-commit.ci

for more information, see https://pre-commit.ci