A, b,c, d are integers and gcd(a, b)=1. if c divides a and d divides b, prove that gcd(c, d) = 1.

One proof can be as follows:

Step-by-step explanation:

We have that and for some integers , since divides and divides .  By the Bezout identity two numbers are relatively primes if and only if there exists integers such that

Then, we can write

Then and are relatively primes, that is to say,

y = - 6

step-by-step explanation:

given the point (- 2, y) lies on the graph then it is a solution of it's equation.

substitute x = - 2 into the equation for value of y

y = 3(- 2) = 3 × - 2 = - 6

the point on the graph is (- 2, 6)