Let n, x be positive integers. Prove that x has a multiplicative inverse modulo n if and only if gcd(n, x) = 1. (Hint: Remember an iff needs to be proven both directions. The gcd cannot be 0 or negative.)

eve and marks ratios are equivalent

step-by-step explanation:

the answer for this question is : 360°

step-by-step explanation:

we have been given a triangle   we need to tell which one of these is a triangle below to map onto itself.

360° rotation is the complete rotation which eventually leads to the same figure which is given.

the correct will be, that is 360° that will cause the triangle below to map onto itself.

step-by-step explanation:

for volume, add base x height x width