Question

OD (2) Show that if m>gedlm,a)>l, then [a] is a zero-divisor in 2/m2 An element [a] in 2/m2 is a zero-divisor if [a] * [O] a
0 0
Add a comment Improve this question Transcribed image text
Answer #1

25 Here god cm, a) > let K be gcd cm, as Then m K and non-zero a K both are a elements of z mz divides a and b both then (: gnz mz non 2 mz 3) we daim that the elements who ma arall which have god cm, c) = 1 ase the elements which have multiplicative

Add a comment
Know the answer?
Add Answer to:
OD (2) Show that if m>gedlm,a)>l, then [a] is a zero-divisor' in 2/m2 An element [a]...
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for? Ask your own homework help question. Our experts will answer your question WITHIN MINUTES for Free.
Similar Homework Help Questions
  • Let R be a commutative ring with no nonzero zero divisor and elements r1,r2,.. . ,Tn where n is a...

    Let R be a commutative ring with no nonzero zero divisor and elements r1,r2,.. . ,Tn where n is a positive integer and n 2. In this problem you will sketch a proof that R is a field (a) We first show that R has a multiplicative identity. Sinee the additive identity of R is, there is a nonzero a E R. Consider the elements ari, ar2, ..., arn. These are distinct. To see O. Since R conelude that0, which...

  • Please show that in any monoid (semigroup with neutral element e) if some element a has...

    Please show that in any monoid (semigroup with neutral element e) if some element a has inverse a^-1, this inverse is unique. This means no element can have more than one inverse. [Hint: Start from writing the definition of the inverse for element a. Consider an element a which has two inverses (a1)^-1 and (a2)^-1. Then think about the value of (a1)^-1a(a2)^-1]. Comment: This is about any monoid which has inverses for some elements, but not necessarily for all elements....

  • nat I &0, then at 0 l c and i c l< b imply c = 0 (5) Show that a set of integers closed under addition need not consist of all multiples of a single fixed element. (6) Show that any two in...

    nat I &0, then at 0 l c and i c l< b imply c = 0 (5) Show that a set of integers closed under addition need not consist of all multiples of a single fixed element. (6) Show that any two integers a and b have a least common multiple m a, b which is a divisor of every common multiple of a and b and which is itself a common multiple of a and b. (Hint: see...

  • Question 2. In this exercise, you will show that Z[V-5] is not a U.F.D. (but it...

    Question 2. In this exercise, you will show that Z[V-5] is not a U.F.D. (but it is an I.D., as you proved last lecture!) You will learn a common trick for reasoning about irreducibility and primality in a ring - with the help of special multiplicative functions to Z>. (i) First, calculate the units in Z[V-5] [Hint: calculate inverses first, assuming you can divide ("work- ing in Q[V-5]", and then see which ones actually lie in Z[V-5]] (ii) Next, we...

  • a) Show that [a,b] | ab. b) Let d be a common divisor of a and...

    a) Show that [a,b] | ab. b) Let d be a common divisor of a and b. Show that . c) Prove that (a,b)*[a,b] = ab. d) Prove that if c is a common multiple of a and b, then such that k[a,b] = c. e) Suppose that c is a common multiple of a and b. Show that ab | (a,b)*c Defn: Let m e Z. We say that m is a common multiple of a and b if...

  • Question 2. Recall that a monoid is a set M together with a binary op- eration...

    Question 2. Recall that a monoid is a set M together with a binary op- eration (r,y) →エ. y from M × M to M, and a unit element e E/, such that: . the operation is associative: for all x, y, z E M we have (z-y): z = the unit element satisfies the left identity axiom: for all r E M we have the unit element satisfies the right identity axiom: for all a EM we Let K...

  • 5. (a) Show that 26 = 1 mod 9. (b) Let m be a positive integer,...

    5. (a) Show that 26 = 1 mod 9. (b) Let m be a positive integer, and let m = 6q+r where q and r are integers with 0 <r < 6. Use (a) and rules of exponents to show that 2" = 2 mod 9 (c) Use (b) to find an s in {0,1,...,8} with 21024 = s mod 9.

  • where M=7 322-M2 4) Find the inverse - transform of F(z) = (2-1)(2-2M)' (15 marks) 0...

    where M=7 322-M2 4) Find the inverse - transform of F(z) = (2-1)(2-2M)' (15 marks) 0 t<-M/2 M <t< - 5) Show that the Fourier transform of function f(t) sin 7 s (10 marks) au 6) Show that u = ln(x2 + xy + y2) satisfies the partial differential equation x x ди +y 2. (7 marks) au 7) Solve the partial differential equation = e-cos(x) where at du x = 0, at =tet ax at and t = 0,...

  • We know that we can reduce the base of an exponent modulo m: a(a mod m)k...

    We know that we can reduce the base of an exponent modulo m: a(a mod m)k (mod m). But the same is not true of the exponent itself! That is, we cannot write aa mod m (mod m). This is easily seen to be false in general. Consider, for instance, that 210 mod 3 1 but 210 mod 3 mod 3 21 mod 3-2. The correct law for the exponent is more subtle. We will prove it in steps (a)...

  • show that a) from the equation that L± cannot create a state in which which means...

    show that a) from the equation that L± cannot create a state in which which means that L± respects the limit | m_ℓ | ≤ ℓ b) using expressions for the operators    and the equation of (a) demonstrate that the matrix elements of the operators Lx and Ly are thanks LÆn, l, me >= C+|n, l, met1 > Imel > lo Î+ = Î, EiĪ, <n, l, me|Î,[n, l, me >=< n, l, me|Î, n, l, me >= 0)

ADVERTISEMENT
Free Homework Help App
Download From Google Play
Scan Your Homework
to Get Instant Free Answers
Need Online Homework Help?
Ask a Question
Get Answers For Free
Most questions answered within 3 hours.
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT