(a, b, c)
return a, b, c
Transform `ax^2 + by^2 + cz^2 = 0` into an equivalent equation
    `a'x^2 + b'y^2 + c'z^2 = 0` where `a', b', c'` are pairwise relatively
    prime.

    Returns a tuple containing `a', b', c'`. `\gcd(a, b, c)` should equal `1`
    for this to work. The solutions for `ax^2 + by^2 + cz^2 = 0` can be
    recovered from the solutions of `a'x^2 + b'y^2 + c'z^2 = 0`.

    Examples
    ========

    >>> from sympy.solvers.diophantine import pairwise_prime
    >>> pairwise_prime(6, 15, 10)
    (5, 2, 3)

    See Also
    ========

    make_prime(), reocnstruct()
Transform `ax^2 + by^2 + cz^2 = 0` into an equivalent equation
    `a'x^2 + b'y^2 + c'z^2 = 0` where `a', b', c'` are pairwise relatively
    prime.
Transform ax^2 + by^2 + cz^2 = 0 into an equivalent equation a x^2 + b y^2 + c z^2 = 0 where a b c are pairwise relatively prime .
def pairwise_prime(a, b, c):
    """
    Transform `ax^2 + by^2 + cz^2 = 0` into an equivalent equation
    `a'x^2 + b'y^2 + c'z^2 = 0` where `a', b', c'` are pairwise relatively
    prime.

    Returns a tuple containing `a', b', c'`. `\gcd(a, b, c)` should equal `1`
    for this to work. The solutions for `ax^2 + by^2 + cz^2 = 0` can be
    recovered from the solutions of `a'x^2 + b'y^2 + c'z^2 = 0`.

    Examples
    ========

    >>> from sympy.solvers.diophantine import pairwise_prime
    >>> pairwise_prime(6, 15, 10)
    (5, 2, 3)

    See Also
    ========

    make_prime(), reocnstruct()
    """
    a, b, c = make_prime(a, b, c)
    b, c, a = make_prime(b, c, a)
    c, a, b = make_prime(c, a, b)

    return a, b, c
def pairwise_prime ( a , b , c ) : a , b , c = make_prime ( a , b , c ) b , c , a = make_prime ( b , c , a ) c , a , b = make_prime ( c , a , b ) return a , b , c