celeries.prime.gcd# celeries.prime.gcd(l)# Greatest common divisor. Parameters: llistIntegers for which to compute the gcd. Returns: gcdintGreatest common divisor.