ExtendedEuclideanAlgorithm #7172
Merged
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
This pull request adds an implementation of the Extended Euclidean Algorithm to the maths package.
The algorithm computes the greatest common divisor (gcd) of two integers and also returns the coefficients x and y satisfying Bézout’s identity:
a·x + b·y = gcd(a, b)
What’s included:
A new ExtendedEuclideanAlgorithm class with a recursive implementation.
Comprehensive JUnit tests validating:
General cases
Co-prime numbers
Base case (b = 0)
Multiples
Tests verify both the correct gcd and Bézout’s identity.
clang-format -i --style=file path/to/your/file.java