9 examples of 'largest subarray with gcd greater than 1' in Python

274
def gcd2(a, b):
275
    """Greatest common divisor using Euclid's algorithm."""
276
    while a:
277
        a, b = b % a, a
278
    return b

34
def gcd_by_iterative(x, y):
35
    """
36
    >>> gcd_by_iterative(24, 40)
37
    8
38
    >>> greatest_common_divisor(24, 40) == gcd_by_iterative(24, 40)
39
    True
40
    """
41
    while y:  # --> when y=0 then loop will terminate and return x as final GCD.
42
        x, y = y, x % y
43
    return x

60
def gcd(a, b):
61
    if a < b:
62
        a, b = b, a
63
64
    while b > 0:
65
        t = b
66
        b = a % t
67
        a = t
68
    return a

13
def _gcd(a,b):
14
    """
15
    Returns greatest common denominator of two numbers.
16
    
17
    Example:
18
    >>> _gcd(4, 6)
19
    2
20
    """
21
    while b:
22
        a,b=b,a%b
23
    return a

43
def gcd(a,b):
44
    """ the euclidean algorithm """
45
    while a:
46
        a, b = b%a, a
47
    return b

18
def gcd(a,b):
19
	while b:
20
		a,b=b,a%b
21
	return a

33
def gcd(a, b):
34
    while b != 0:
35
        a, b = b, a % b
36
    return a

4
def gcd(a, b):
5
    if(a%b == 0):
6
        return b
7
    else:
8
        return gcd(b, a%b)

9
def gcd(x, y):
10
    while y != 0:
11
        (x, y) = (y, x % y)
12
    return x