[
https://issues.apache.org/jira/browse/NUMBERS-194?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=17742871#comment-17742871
]
Gilles Sadowski commented on NUMBERS-194:
-----------------------------------------
[~aherbert] has already commented.
IMHO, the problem is not so much the bloat brought by a dependency on "core"
(where the naming implies that any other module could eventually depend on it)
as the creation of many "syntactic sugar" methods with a very tiny benefit to
users when compared to a direct call to {{ArithmeticUtils.gcd(a, b) == 1}}.
bq. [...] not every dev knows that checking for coprimes requires a GCD
calculation, but they do know that coprimes require some kind of primes utility
since coprime has "primes" in its name. [...]
A (code) library is not a dictionary. ;-)
The second section of the [Wikipedia
article|https://en.wikipedia.org/wiki/Coprime_integers] starts with
{noformat}
When the integers a and b are coprime, the standard way of expressing this fact
in mathematical notation is to indicate that their greatest common divisor is
one, by the formula gcd(a, b) = 1
{noformat}
> New function - are relatively prime
> -----------------------------------
>
> Key: NUMBERS-194
> URL: https://issues.apache.org/jira/browse/NUMBERS-194
> Project: Commons Numbers
> Issue Type: New Feature
> Components: primes
> Reporter: Dimitrios Efthymiou
> Priority: Minor
> Labels: features
> Original Estimate: 1h
> Remaining Estimate: 1h
>
> I am proposing a new function to be implemented in the primes module that
> takes 2 integers and checks if they are coprime.
--
This message was sent by Atlassian Jira
(v8.20.10#820010)
