Re: Relatively prime integers in NumPy

<avi.e.gross@gmail.com> writes:

python to make some list or other data structure for divisors of each number
involved

Two numbers a and b are coprime if math.gcd(a,b) == 1, I am pretty sure.
That is true by definition(?) when a and b are both > 0.  Experiment
indicates it seems to work even when one or both of a and b are
negative, but I don't have a proof and haven't examined the
implementation.  I don't know how gcd is mathematically defined in that
situation.