Re: Relatively prime integers in NumPy

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

make some list or other data structure for divisors of each number
involved and then use standard methods to compare the lists and exact
common divisors.

You don't need to find divisors (factor the numbers) to find the gcd.
Factorization can be very slow.  Gcd on the other hand is very fast,
using the Euclidean GCD algorithm.  You should be able to find info
about this easily.  Factorization would be a terrible way to compute
gcd's.