We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Is there a good very fast implementation for integer root (x^{1/n}) and ln for BigDecimal?
The text was updated successfully, but these errors were encountered:
I wrote an ln implementation that was good enough for my needs, I'm happy to share it, or try to PR it if desired
ln
Sorry, something went wrong.
I did this in a few hours, I'm sure it could be better but I'm still using it and it's working fine:
https://gist.github.com/cbeck88/3553de29d5a530fb5bdce95ef7fc0661
No branches or pull requests
Is there a good very fast implementation for integer root (x^{1/n}) and ln for BigDecimal?
The text was updated successfully, but these errors were encountered: