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 = 0.77(x)

step-by-step explanation:

the jacket retains this value after 23% cut or retains 77% of original value. plug original 87 jacket price for x and the remaining value should be y.

hi there!

the answer to this question is d: 35

step-by-step explanation:

5 to the power of 2 is 25

2 multiplied by 5 is 10

then you add the 2 numbers and you get 35