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,

55? i think maybe

step-by-step explanation:

step-by-step explanation:

if u want da anser kill your teeser ifu hav wun