(A) If d=gcd(a,b) and m=lcm(a,b), prove that dm=|ab|. (B) Show that lcm(a,b)=ab if and only if gcd(a,b)=1 (C) Prove that gcd(a,c)=gcd(b,c)=1 if and only if gcd(ab,c)=1 for integers a, b, and c. (Abstract Algebra)
Prove all non-zero integers a and b, if gcd(a, b) = d then for all non-zero integers x if a|x and b|x then ab|dx.
Let 1 ≤ m ∈ Z and let a,b ∈ Z be such that gcd(a,b) = m. Prove that gcd(a2,b2) = m2.
5. Let Zli_ {a + bi l a,b E Z. i2--1} be the Gaussian integers. Define a function for all a bi E Zi]. We call N the norm (a) Prove that N is multiplicative. This is, prove that for all a bi, c+di E Z[i] (b) Prove that if a + r є z[i] is a unit of Zli], then Ma + bi)-1. (c) Find all of the units in Zli 5. Let Zli_ {a + bi l a,b...
(a) If a | bc, show that a | b*gcd(a,c). (b) If a, b are coprime integers and c | at and c | bt, show that c | t. (c) If a, b, c are integers with a, c coprime, prove that gcd(ab, c) = gcd(b, c).
16. (8 points) Let Z be the integers and let A - Zx Z. Define the relation R on A by (a, b) R(c, d) if and only if a c and b 3 d for all (a, b), (c, d)E A. Prove that R is a partial ordering on A that is not a total ordering. 16. (8 points) Let Z be the integers and let A - Zx Z. Define the relation R on A by (a, b)...
1. Let a, b,cE Z be positive integers. Prove or disprove each of the following (a) If b | c, then gcd(a, b) gcd(a, c). (b) If b c, then ged(a., b) < gcd(a, c)
1. Prove that there are no Let m, n E Z with m, n > 3 and gcd(m, n) of mn. primitive roots 1. Prove that there are no Let m, n E Z with m, n > 3 and gcd(m, n) of mn. primitive roots
(i) For every nonzero integers a, b, prove that gcd(a, b) = gcd(−a, b). (ii) Show that for every nonzero integers a, b, a, b are relatively prime if and only if a and −b are relatively prime.
Prove that if a and b are odd then 2gcd(a,b)=gcd(a+b,a−b)”