Ker() = { (a,b) in Z4 ® Z3 : (a,b) = (0,0) }
So, (a,b) = (a mod 2, 0) = (0,0)
So, a (mod 2) = 0
So, 2 divides a
So, a = 0, 2
So, the kernel is,
ker() = { (a,b) in Z4 ® Z3 : a = 0, 2 and b is in Z3 }
= { (0,0), (0,1), (0,2), (2,0), (2,1), (2,2) }
a. Suppose that 9: Z Z , is defined by p(x)= x mod 4. ind the kernel of this mapping and explain why this mapping is NOT a homomorphism. nt. What do we know about the kernel of a homomorphism.
= a (mod n) is a ring homomorphism. (10) Suppose that o Z Z defined by ¢(a) (a) (5 Pts) Prove that o is injective. Answer (b) (5 Pts) Prove that o is surjective onto its image. Answer = a (mod n) is a ring homomorphism. (10) Suppose that o Z Z defined by ¢(a) (a) (5 Pts) Prove that o is injective. Answer (b) (5 Pts) Prove that o is surjective onto its image. Answer
Question 1.0 [10 marks] Evaluate dz a. z4+z3-272, With C: Izl = 1 b. J2 cos230 de 5-4cos20 Hint: You may use the following formula without proof, z = e", cos 0 = (z + z^)/2
Recall that: ged: NN → N gcd(a,0) = a. gcd(a,b) = gcd(b, mod(a,b)), if b > 0. and mod : Nx (N – {0}) ► N mod(a,b) = a if a <b. mod(a,b) = mod(a - b,b), if a > b. and fib: N → N fib(0) = 0 fib(1) = 1 fib(n) | if n >1=fib(n − 1) +fib(n - 2) Prove the following by induction. you cannot use any extra lemmas or existing results. Vn e N, ged(fib(n...
Q3 (Due Wednesday 11 September—Week 7) Let (G, *) and (N,) be groups. Suppose that g Ha, is a homomorphism from from G to Aut(N)—that is, suppose that a, o ah = agh for all g, h E G. Let N a G denote the set N X G, and define a binary operation • on N a G by (m, g) + (a, b) = (m + ag(m), g * h). (1) Prove that (N a G, is a...
Suppose the language L ? {a, b}? is defined recursively as follows: ? L; for every x ? L, both ax and axb are elements of L. Show that L = L0 , where L0 = {aibj | i ? j }. To show that L ? L 0 you can use structural induction, based on the recursive definition of L. In the other direction, use strong induction on the length of a string in L0. 1.60. Suppose the language...
Only need answer from (IV) to (VI) Only need answer from (IV) to (VI) Math 3140 page 1 of 7 1. (30) Let R be the group of real numbers under addition, and let U = {e® : 0 E R} be the group of all complex numbers on the unit circle under multiplication. Let o: R U be the map given by = e is a homomorphism of groups. (i) Prove that (i) Find the kernel of . (Don't...
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)...
Town Hall with Pe CheapOair Cross X Amouncements x Crowdmark X proiecte X + - ssments/homework-7-4c94f Task 32 (10 points) a) Find the homomorphism f: Z → Z defined by setting /(1) = 1. (You do not need to verty that it's a homomorphism.) That is complete the following (remember, it has to be a homomorphism, so it must satisfy the homomorphism property): 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 Also find...
4. (a) For n eZ, define multiplication mod n by ao b-a b (where indicates regular real number multiplication), prove that On is a binary operation on Zn. That is, (Hint your proof will be very similar to the proof for homework 4 problem 7ab) (b) Let n E Z. Is the binary algebraic structure 〈L,On) always a group? Explain. (c) Prove There exists be Zn such that a n I if and only if (a, n)1. (d) It is...