If R is a unique factorization domain and if a and b in R are relatively prime (i.e.,(a,b) = 1), whenever a divides bc, then a divides c. That is, if R is a unique factorization domain and if a and b in R are relatively prime (i.e., (a,b) = 1), whenever a divides bc then a divides c.

Related BrainMass Solutions

• Ring proofs

  Prove that (x-a)^2 divides f(x) if and only if (x-a) divides f prime in R[x]. 1. It is routine to check that (R, +, .) is a commutative ring with unity.

• Congruences : Primes, Inverse Modulo, GCD and Wilson's theorem

  Then ax = b + kn for some integer k ax - kn = b As above, let r = gcd (a,n) so a = rs and n = rt for some integers s and t. with gcd (s,t) = 1 Substituting rsx - krt = b (note that if a and n are relatively prime, r = 1 and this is all still true

• unique factorization domain

  Since R is an unique factorization domain (UFD), then we have unique factorizations for both a and b a = p_1 * p_2 * ... * p_k b = q_1 * q_2 * ... * q_t where p_1, ..., p_k are prime factors of a, q_1, ..., q_t are prime factors of b Then ab = p1

• Unique Factorization Prime/Co-Prime

  527365 Unique Factorization Prime/Co-Prime 1. Prove that a and b are coprime if and only if no prime numbers divides both a and b 2. Show that [a,m] = m if and only if a divides m For question 1.

• Commutative ring proof

  224687 Commutative Ring Proof Let R be a commutative ring with 1. Prove that if (a,b)=1 and a divides bc, then a divides c. More generally, show that if a divides bc with nonzero a,b then a/(a,b) divides c.

• Discrete Mathematics Definitions : Algorithm, Searching algorithm, Greedy algorithm, Composite, Prime, Relatively prime integers, Matrix, Matrix addition, Symmetric, Fundamental Theorem of Arithmetic

  Relatively prime integers: Integers a and b are relatively prime is gcd(a,b)=1, the greatest common divisor of a and b is 1. For instance, 2 and 5 are relatively prime. 7.

• division algorithm

  Now is an integral domain if and only if M is a prime ideal of R. Suppose and such that If then either 5 does not divide a or 5 does not divide b or 5 does not divide both a and b. Case 1. 5 does not divide a and 5 divides b.

• Jacobi Symbols and Proofs

  37827 Jacobi and Legendre Symbols and Proofs 1. Prove that if b and c are odd, then (a/bc)=(a/b)(a/c) 2. Prove that if a==b (mod c), where c is odd, then (a/c)=(b/c) For odd number P=p_1*p_2*...

• Abstract Algebra : Prime Factors and Greatest Common Divisor

  149225 Abstract Algebra : Prime Factors and Greatest Common Divisor Prove the following problems. 1-If b>0 and a = bq + r , prove that (a , b) = (b , r). 2- Prove that (ab,c) = 1 if and only if (a,c) = 1 and (b,c)=1.