> This PR implements nth root computation for `BigInteger`s using Newton method > and optimizes `BigInteger.pow(int)` method. > [Here is a proof of convergence of the recurrence > used.](https://github.com/user-attachments/files/19785045/nth_root_newton_proof_integers.pdf)
fabioromano1 has updated the pull request incrementally with one additional commit since the last revision: Optimized computation of nth root's remainder ------------- Changes: - all: https://git.openjdk.org/jdk/pull/24690/files - new: https://git.openjdk.org/jdk/pull/24690/files/0e1a99e8..9cd136cc Webrevs: - full: https://webrevs.openjdk.org/?repo=jdk&pr=24690&range=24 - incr: https://webrevs.openjdk.org/?repo=jdk&pr=24690&range=23-24 Stats: 47 lines in 2 files changed: 15 ins; 12 del; 20 mod Patch: https://git.openjdk.org/jdk/pull/24690.diff Fetch: git fetch https://git.openjdk.org/jdk.git pull/24690/head:pull/24690 PR: https://git.openjdk.org/jdk/pull/24690
