```python
def gcd(p, q):
    """
    Checks if two numbers p and q are co-prime.

    Two numbers are co-prime if their greatest common divisor (GCD) is 1.
    This function calculates the GCD using the Euclidean algorithm and
    returns True if the GCD is 1, and False otherwise.
    It correctly handles positive, negative, and zero inputs.
    """
    # The Euclidean algorithm to find the GCD of p and q.
    while q:
        p, q = q, p % q
    
    # The GCD is the absolute value of the final non-zero remainder (p).
    # Two numbers are co-prime if their GCD is 1.
    return abs(p) == 1

```