def euclidean_gcd_recursive(a: int, b: int) -> int:
    """
    Recursive method for euclicedan gcd algorithm

    Examples:
    >>> euclidean_gcd_recursive(3, 5)
    1

    >>> euclidean_gcd_recursive(6, 3)
    3
    """
    return a if b == 0 else euclidean_gcd_recursive(b, a % b)