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

Every line of 'largest subarray with gcd greater than 1' code snippets is scanned for vulnerabilities by our powerful machine learning engine that combs millions of open source libraries, ensuring your Python code is secure.

## All examples are scanned by Snyk Code

By copying the Snyk Code Snippets you agree to
``274def gcd2(a, b):275    """Greatest common divisor using Euclid's algorithm."""276    while a:277        a, b = b % a, a278    return b``
``34def gcd_by_iterative(x, y):35    """36    >>> gcd_by_iterative(24, 40)37    838    >>> greatest_common_divisor(24, 40) == gcd_by_iterative(24, 40)39    True40    """41    while y:  # --> when y=0 then loop will terminate and return x as final GCD.42        x, y = y, x % y43    return x``
``60def gcd(a, b):61    if a < b:62        a, b = b, a6364    while b > 0:65        t = b66        b = a % t67        a = t68    return a``
``13def _gcd(a,b):14    """15    Returns greatest common denominator of two numbers.16    17    Example:18    >>> _gcd(4, 6)19    220    """21    while b:22        a,b=b,a%b23    return a``
``43def gcd(a,b):44    """ the euclidean algorithm """45    while a:46        a, b = b%a, a47    return b``
``18def gcd(a,b):19	while b:20		a,b=b,a%b21	return a``
``33def gcd(a, b):34    while b != 0:35        a, b = b, a % b36    return a``
``4def gcd(a, b):5    if(a%b == 0):6        return b7    else:8        return gcd(b, a%b)``
``9def gcd(x, y):10    while y != 0:11        (x, y) = (y, x % y)12    return x``