Review for Exam 2/Solutions
|
|
- Clifton Stevenson
- 5 years ago
- Views:
Transcription
1 MTH Astract Algera I and Numer Theory S18 Review for Eam 2/Solutions 1. Let n e an integer. (a) For 0 n 10, verify that n 2 n + 11 is a prime. () If n 0, 1 and n 0, 1 (mod 11), show that n 2 n + 11 is not a prime. (c) Prove or disprove: If n / 0, 1 (mod 11), then n 2 n + 11 is a prime. (a) Define f(n) n 2 n + 11 and oserve that (1) f(n) n(n 1) + 11 Hence f(n + 1) (n + 1)n + 11 n 2 + n + 11 (n 2 n + 11) + 2n f(n) + 2n So f(n + 1) f(n) + 2n. Using this formula we can easily compute f(n) for 0 n 10. n n n 2 n All the numers in the last row are primes and so (a) holds. () Assume that n 0, 1 (mod 11) and n 0, 1. We need to show that n 2 n + 11 is not a prime. We will first show that 11 divides n 2 n Since n 0, 1 (mod 11) we have [n] 11 [0] 11 or [n] 11 [1] 11 y Theorem In Z 11 we have n 0 or n 1, and Thus [n 2 n + 11] 11 [0] 11 and so shows that 11 divides (n 2 n + 11) 0. So (1) 11 (n 2 n + 11). Since n 0, 1, we have n < 0 or n > 1. If n < 0, then n 2 n n 2 > 0 and if n > 1, then n 2 n n(n 1) > 0. So in either case n 2 n > 0 and so n 2 n + 11 > 11. Thus 11 ±(n 2 n + 11). From (1) we know that 11 divides n 2 n + 11 and so n 2 n + 11 is not a prime. (c) This is false. Indeed 15 / 0, 1 (mod 11) and f(15) So f(15) is not a prime. 2. Let R e an integral domain and a, R. Show that the following statements are equivalent: (a) a and a. () a is an associate of in R. (a) (): Suppose that a and a. Then y definition of divide a u and av for some u, v R. Case 1: a 0 R. Then 0 R and so 0 R y (1.4.3)(). By is an equivalence relation and so is refleive. It follows that 0 R 0 R. As a 0 R and 0 R t we conclude that a in this case. Case 2: a 0 R. Sustituting av into a u gives a (av)u. Hence y Aiom 2, a a(vu). By definition of identity (A 10), a a1 R. Thus a1 R a(vu). By assumption of Case 2, a 0 R. Since R is an integral domain we can apply the Multiplicative Cancellation Law and conclude that 1 R uv. Thus y u is a unit. Since a u this shows that a is associate to. Thus (a) implies () () (a): If a then shows that a and a.
2 3. Let n and m e a positive integer and suppose f Z n Z m is a surjective homomorphism. (a) Show that f([k] n ) [k] m for all k N. (Hints: What is f([1] n )? Use induction on k.) () Show that m n in Z.(Hint: Consider f([n] n )). (a) For k N let P (k) e the statement P (k) f([k] n ) [k] m By (1.11.7)(a), f([0] n ) [0] m and so P (0) holds. Since f is a surjective homomorphism (1.11.7)(a) implies that f([1] n ) [1] m. Thus also P (1) holds. Suppose now that P (k) is true. We compute: f([k + 1] n ) f([k] n + [1] n ) Definition of Addition in Z n f([k] n ) + f([1] n ) since f is a homomorphism [k] m + [1] m P (k) and P (1) [k + 1] m Definition of Addition in Z, Thus P (k + 1) holds. So y the principal of induction, P (k) holds for all k N. () Since n (n 0) we have [n] n [0] n y Thus also f([n] n ]) f([0] n ) and (a) implies that [n] m [0] m. Hence shows that m (n 0) and so m n. 4. Which of the following functions are homomorphisms? (a) f Z Z, n 2n. () g R Z, a, where R a Z. a 0 a 0 (c) h Z 2 [] Z 2 [], f f 2. (a) We have f(1 1) f(1) and f(1) f(1) 2 2. Thus f(1 1) f(1) f(1). Hence f does not respect multiplication and so f is not a homomorphism. () Thus g g 0 and g g g g g. So g is not a homomorphism. (c) We will show that h is a homomorphism. Let d Z 2 []. Since Z 2 is a commutative ring with identity 1, shows that Z 2 [] is a commutative ring with identity 1. So 1d d. Also in Z 2. We compute We proved (1) d + d 0 for all d Z 2 []. Now let a, Z 2 []. Then d + d 1d + 1d A 8 (1 + 1)d 0d (1.2.9)(c) 0. h(a + ) (a + ) 2 (a + )(a + ) A 8 a(a + ) + (a + ) A 8 (a 2 + a) + (a + 2 ) GAL (a 2 + (a + a)) + 2 (1) (a 2 + 0) + 2 A 4 a h(a) + h()
3 and so (2) h(a + ) h(a) + h(). Also h(a) (a) 2 (a)(a) GCL (aa)() a 2 2 h(a)h(). and so (3) h(a) h(a)h() By (2) and (3), h is a homomorphism. 5. Let F a a + a, Z 2. Given that F is a suring of M 2 (Z 2 ). Show that F is a field. By Theorem Z 2 {0, 1} and so y definition of F : F,,, Put 1 F. Since 1 F is an identity in M 2 (Z 2 ), 1 F is also an identity in F. In particular, 1 F is a unit. Moreover, and so oth and are units in F. Thus all non-zero elements in F are units. It remains to show that F is commutative. For a, Z 2 define M(a, ) a a +. Let, y F. Then y definition of F, M(a, ) and y M(c, d) for some some a,, c, d Z 2. We compute y M(a, )M(c, d) a a + c d d c + d ac + d ad + (c + d) c + (a + )d d + (a + )(c + d) ac + d ad + (c + d) c + (ad + d) d + ((ac + c) + (ad + d)) ac + d ad + (c + d) ad + (c + d) (ac + d) + (ad + (c + d)) M(ac + d, ad + c + d) Thus y M(ac + d, ad + c + d). This formula yields a formula for y y interchanging a and c and also interchanging and d. So
4 Since Z 2 is commutative and associative y M(ca + d, c + da + d) ac + d ca + d and ad + c + d c + da + d Thus So F is commutative. y M(ac + d, ad + c + d) M(ca + d, c + da + d) y. 6. Let f R S e a homomorphism of rings. Let A e a suring of R and put B {f(a) a A}. Show that B is a suring of S. We need to verify the four conditions of the Suring Theorem hold for the suset B of S. Let s S. Then y definition of B: ( ) s B s f(r) for some r A Let, y B. Then y (*) ( ) f(u) and y f(v) for some u, v A. Since A is a suring of R, the suring theorem implies that ( ) 0 R, u + v, uv and u all are in A (I) 0 S (1.11.7)(a) f(0 R ). By (***), 0 R A and so y (*), 0 S B. (II) + y f(u) + f(v) f hom f(u + v). By (***), u + v A and so y (*), + y B. (III) y f(u)f(v) f hom f(uv). By (***), uv A and so y (*), y B. (IV) f(u) (1.11.7)() f( u). By (***), u A and so y (*), B. Thus the four conditions of the Suring Theorem hold for B and so B is a suring of S. 7. Let p e a prime integer. Show that Z p is a field. By Z p is a commutative ring with identity [1] p. Since p is a prime, we have p ±1 and so p 1. Thus [1] p [0] p y It remains to show that any nonzero element of Z p is a unit in Z p. So let a Z p with a [0] p. Then shows a [k] p for some k Z with 0 < k < p. Suppose that p k. Then implies that p k. But k > 0 and so k k < p, a contradiction. Thus p k. As p is a prime we can apply (1.10.2)().. Thus either ( p k and p gcd(a, p) ) or ( p k and 1 gcd(k, p) ) Since p k this shows that 1 gcd(k, p). Hence shows that [k] p is a unit in Z p. As a [k] p this shows that a is a unit in Z p. We proved that Z p is a commutative ring with non-zero identity and that every non-zero elements of Z p is a unit in Z p. Thus Z p is a field (y definition of a field). 8. Show that the function f C C, a + i a i, is an isomorphism. Let, y C, then a + i and y c + di for some a, R. Suppose that f() f(y). Then a i c id and so a c and d. Thus a + i c + id y. Hence f is injective. Note that f(a i) f(a + i( )) a + i( ( )) a + i and so f surjective. As f is injective and surjective, f is ijective.
5 Also f( + y) f((a + i) + (c + di)) f((a + c) + ( + d)i) (a + c) ( + d)i (a i) + (c di) f(a + i) + f(c + di) f( + y). and f(y) f((a + i)(c + di)) f((ac d) + (ad + c)i) (ac d) (ad + c)i (ac ( )( d)) + (a( d) + ( )c)i (a i)(c di) f(a + i)f(c + di). So f respects addition and multiplication and so f is a homomorphism. Since f is ijective, f is an isomorphism. 9. Consider the ring R M 2 (R) and the polynomials f 2 + and g in R[]. Compute fg and deg(fg). fg (2.1.5)(c) The highest non-zero coefficient is the coefficient of 3, so deg fg Consider the polynomials f and g in Z 5 []. Find polynomials q and r in Z 5 [] such that f gq + r and deg r < deg g. Note first that (in Z 5 []) we have g So q and r Consider the polynomials f and g in Z 7 []. Find polynomials u and v in Z 5 [] such that fu + gv gcd(f, g).
6 E f 1 + g 0 F f 0 + g 1 E f 0 + g 2 F G 1 f 0 + g ( 2 4) E 0 ( + 2) F f 1 + g (2 + 4) E 1 G 1 E f 3 + g ( + 2) F 1 ( 2) 1 3 G 2 f ( 3) + g ( 2 + 2) E 1 F 2 2 f ( 3) + g ( 2 2 2) E 0 G 2 E f 3 + g ( ) F 2 ( 1) 1 1 Hence f 3 + g ( ) gcd(f, g) 12. Find all monic reducile polynomials of degree 2 in Z 5 []. We will first determine all the monic reducile polynomials of degree 2 on Z 5 []. For this let f e a monic polynomial in Z 5 [] of degree 2. By Theorem 2 on the Solutions of Homework 9, f is reducile if and only if f is a product of two non-constant monic polynomial of lower degree in Z 5 []. Hence, since deg f 2, f is reducile if and only if f is the product of two monic polynomials of degree 1. By Theorem 1.5.6, Z 5 {0, 1, 2, 3, 4} {0, 1, 2, 1, 2}. Thus the monic polynomials of degree 1 in Z 3 [] are, + 1, + 2, 2. So the reducile monic polynomials of degree 2 in Z 5 [] are Note here that Z 5 [] is commutative, so fg gf and the entries left lank in lower half of the tale appear in the upper half. The monic polynomials of degree 2 in Z 5 [] are 2, 2 +1, 2 + 2, 2 2, 2 1, 2 +, , , 2 + 2, 2 + 1, 2 + 2, , , , , 2 2, , , 2 2 2, 2 2 1, 2, 2 + 1, 2 + 2, 2 2, 2 1, So the irreducile monic polynomials of degree 2 in Z 5 [] are , , 2 + 2, 2 2, , , 2 2 1, , 2 2, Let f e a polynomial of degree 2 in Z 5 [] which is not monic. Then f has leading coefficient 1. It follows that ˇf f ( 1) f and f ˇf. By Theorem 2 on the Solutions of Homework 2. f is reducile
7 if and only if ˇf is reducile. Hence f is irreducile if and only if ˇf is irreducile. Hence we can otain a complete list of all irreducile polynomial of degree 2 y multiplying the aove list of 10 monic irreducile polynomials with the four units 1, 2, 2, 1 in Z 5. This will give a list of 40 irreducile polynomials of degree 2 in Z 5 [].
Math 581 Problem Set 9
Math 581 Prolem Set 9 1. Let m and n e relatively prime positive integers. (a) Prove that Z/mnZ = Z/mZ Z/nZ as RINGS. (Hint: First Isomorphism Theorem) Proof: Define ϕz Z/mZ Z/nZ y ϕ(x) = ([x] m, [x] n
More informationRED. Name: Math 290 Fall 2016 Sample Exam 3
RED Name: Math 290 Fall 2016 Sample Exam 3 Note that the first 10 questions are true false. Mark A for true, B for false. Questions 11 through 20 are multiple choice. Mark the correct answer on your ule
More informationMath 3450 Homework Solutions
Math 3450 Homework Solutions I have decided to write up all the solutions to prolems NOT assigned from the textook first. There are three more sets to write up and I am doing those now. Once I get the
More informationMTH Abstract Algebra I and Number Theory S17. Homework 6/Solutions
MTH 310-3 Abstract Algebra I and Number Theory S17 Homework 6/Solutions Exercise 1. Let a, b and e be integers. Suppose a and b are not both zero and that e is a positive common divisor of a and b. Put
More informationAlgebraic structures I
MTH5100 Assignment 1-10 Algebraic structures I For handing in on various dates January March 2011 1 FUNCTIONS. Say which of the following rules successfully define functions, giving reasons. For each one
More informationHonors Algebra 4, MATH 371 Winter 2010 Assignment 4 Due Wednesday, February 17 at 08:35
Honors Algebra 4, MATH 371 Winter 2010 Assignment 4 Due Wednesday, February 17 at 08:35 1. Let R be a commutative ring with 1 0. (a) Prove that the nilradical of R is equal to the intersection of the prime
More informationCHAPTER I. Rings. Definition A ring R is a set with two binary operations, addition + and
CHAPTER I Rings 1.1 Definitions and Examples Definition 1.1.1. A ring R is a set with two binary operations, addition + and multiplication satisfying the following conditions for all a, b, c in R : (i)
More informationALGEBRA QUALIFYING EXAM, FALL 2017: SOLUTIONS
ALGEBRA QUALIFYING EXAM, FALL 2017: SOLUTIONS Your Name: Conventions: all rings and algebras are assumed to be unital. Part I. True or false? If true provide a brief explanation, if false provide a counterexample
More information12 16 = (12)(16) = 0.
Homework Assignment 5 Homework 5. Due day: 11/6/06 (5A) Do each of the following. (i) Compute the multiplication: (12)(16) in Z 24. (ii) Determine the set of units in Z 5. Can we extend our conclusion
More informationFactorization in Polynomial Rings
Factorization in Polynomial Rings Throughout these notes, F denotes a field. 1 Long division with remainder We begin with some basic definitions. Definition 1.1. Let f, g F [x]. We say that f divides g,
More informationAbstract Algebra: Chapters 16 and 17
Study polynomials, their factorization, and the construction of fields. Chapter 16 Polynomial Rings Notation Let R be a commutative ring. The ring of polynomials over R in the indeterminate x is the set
More informationTotal 100
Math 542 Midterm Exam, Spring 2016 Prof: Paul Terwilliger Your Name (please print) SOLUTIONS NO CALCULATORS/ELECTRONIC DEVICES ALLOWED. MAKE SURE YOUR CELL PHONE IS OFF. Problem Value 1 10 2 10 3 10 4
More informationAlgebra Homework, Edition 2 9 September 2010
Algebra Homework, Edition 2 9 September 2010 Problem 6. (1) Let I and J be ideals of a commutative ring R with I + J = R. Prove that IJ = I J. (2) Let I, J, and K be ideals of a principal ideal domain.
More informationHomework 12; Due Monday, 4/9/2018
Homework 2; Due Monday, 4/9/28 Answer-Only Questions Credit based solely on the answer Question For each of the following relations, determine whether each one is symmetric, transitive, or refleive If
More informationWritten Homework # 2 Solution
Math 517 Spring 2007 Radford Written Homework # 2 Solution 02/23/07 Throughout R and S are rings with unity; Z denotes the ring of integers and Q, R, and C denote the rings of rational, real, and complex
More informationModern Computer Algebra
Modern Computer Algebra Exercises to Chapter 25: Fundamental concepts 11 May 1999 JOACHIM VON ZUR GATHEN and JÜRGEN GERHARD Universität Paderborn 25.1 Show that any subgroup of a group G contains the neutral
More informationName: Solutions Final Exam
Instructions. Answer each of the questions on your own paper. Be sure to show your work so that partial credit can be adequately assessed. Put your name on each page of your paper. 1. [10 Points] All of
More informationPolynomial Rings : Linear Algebra Notes
Polynomial Rings : Linear Algebra Notes Satya Mandal September 27, 2005 1 Section 1: Basics Definition 1.1 A nonempty set R is said to be a ring if the following are satisfied: 1. R has two binary operations,
More informationReview Problems for Midterm Exam II MTH 299 Spring n(n + 1) 2. = 1. So assume there is some k 1 for which
Review Problems for Midterm Exam II MTH 99 Spring 014 1. Use induction to prove that for all n N. 1 + 3 + + + n(n + 1) = n(n + 1)(n + ) Solution: This statement is obviously true for n = 1 since 1()(3)
More information3.1 Do the following problem together with those of Section 3.2:
Chapter 3 3.1 5. First check if the subset S is really a subring. The checklist for that is spelled out in Theorem 3.2. If S is a subring, try to find an element 1 S in S that acts as a multiplicative
More informationMath 120 HW 9 Solutions
Math 120 HW 9 Solutions June 8, 2018 Question 1 Write down a ring homomorphism (no proof required) f from R = Z[ 11] = {a + b 11 a, b Z} to S = Z/35Z. The main difficulty is to find an element x Z/35Z
More informationFinal Exam Review. 2. Let A = {, { }}. What is the cardinality of A? Is
1. Describe the elements of the set (Z Q) R N. Is this set countable or uncountable? Solution: The set is equal to {(x, y) x Z, y N} = Z N. Since the Cartesian product of two denumerable sets is denumerable,
More informationMODEL ANSWERS TO HWK #10
MODEL ANSWERS TO HWK #10 1. (i) As x + 4 has degree one, either it divides x 3 6x + 7 or these two polynomials are coprime. But if x + 4 divides x 3 6x + 7 then x = 4 is a root of x 3 6x + 7, which it
More informationGRE Subject test preparation Spring 2016 Topic: Abstract Algebra, Linear Algebra, Number Theory.
GRE Subject test preparation Spring 2016 Topic: Abstract Algebra, Linear Algebra, Number Theory. Linear Algebra Standard matrix manipulation to compute the kernel, intersection of subspaces, column spaces,
More information0 Sets and Induction. Sets
0 Sets and Induction Sets A set is an unordered collection of objects, called elements or members of the set. A set is said to contain its elements. We write a A to denote that a is an element of the set
More informationMath 762 Spring h Y (Z 1 ) (1) h X (Z 2 ) h X (Z 1 ) Φ Z 1. h Y (Z 2 )
Math 762 Spring 2016 Homework 3 Drew Armstrong Problem 1. Yoneda s Lemma. We have seen that the bifunctor Hom C (, ) : C C Set is analogous to a bilinear form on a K-vector space, : V V K. Recall that
More informationMath 210B:Algebra, Homework 2
Math 210B:Algebra, Homework 2 Ian Coley January 21, 2014 Problem 1. Is f = 2X 5 6X + 6 irreducible in Z[X], (S 1 Z)[X], for S = {2 n, n 0}, Q[X], R[X], C[X]? To begin, note that 2 divides all coefficients
More informationComputations/Applications
Computations/Applications 1. Find the inverse of x + 1 in the ring F 5 [x]/(x 3 1). Solution: We use the Euclidean Algorithm: x 3 1 (x + 1)(x + 4x + 1) + 3 (x + 1) 3(x + ) + 0. Thus 3 (x 3 1) + (x + 1)(4x
More informationGEOMETRY FINAL CLAY SHONKWILER
GEOMETRY FINAL CLAY SHONKWILER 1 a: If M is non-orientale and p M, is M {p} orientale? Answer: No. Suppose M {p} is orientale, and let U α, x α e an atlas that gives an orientation on M {p}. Now, let V,
More informationExtension theorems for homomorphisms
Algebraic Geometry Fall 2009 Extension theorems for homomorphisms In this note, we prove some extension theorems for homomorphisms from rings to algebraically closed fields. The prototype is the following
More informationSection 18 Rings and fields
Section 18 Rings and fields Instructor: Yifan Yang Spring 2007 Motivation Many sets in mathematics have two binary operations (and thus two algebraic structures) For example, the sets Z, Q, R, M n (R)
More informationCongruences and Residue Class Rings
Congruences and Residue Class Rings (Chapter 2 of J. A. Buchmann, Introduction to Cryptography, 2nd Ed., 2004) Shoichi Hirose Faculty of Engineering, University of Fukui S. Hirose (U. Fukui) Congruences
More informationHomework problems from Chapters IV-VI: answers and solutions
Homework problems from Chapters IV-VI: answers and solutions IV.21.1. In this problem we have to describe the field F of quotients of the domain D. Note that by definition, F is the set of equivalence
More informationISOMORPHISMS KEITH CONRAD
ISOMORPHISMS KEITH CONRAD 1. Introduction Groups that are not literally the same may be structurally the same. An example of this idea from high school math is the relation between multiplication and addition
More informationABSTRACT ALGEBRA MODULUS SPRING 2006 by Jutta Hausen, University of Houston
ABSTRACT ALGEBRA MODULUS SPRING 2006 by Jutta Hausen, University of Houston Undergraduate abstract algebra is usually focused on three topics: Group Theory, Ring Theory, and Field Theory. Of the myriad
More information2a 2 4ac), provided there is an element r in our
MTH 310002 Test II Review Spring 2012 Absractions versus examples The purpose of abstraction is to reduce ideas to their essentials, uncluttered by the details of a specific situation Our lectures built
More informationIDEAL CLASSES AND RELATIVE INTEGERS
IDEAL CLASSES AND RELATIVE INTEGERS KEITH CONRAD The ring of integers of a number field is free as a Z-module. It is a module not just over Z, but also over any intermediate ring of integers. That is,
More informationMath 4400, Spring 08, Sample problems Final Exam.
Math 4400, Spring 08, Sample problems Final Exam. 1. Groups (1) (a) Let a be an element of a group G. Define the notions of exponent of a and period of a. (b) Suppose a has a finite period. Prove that
More informationMODEL ANSWERS TO THE FIRST HOMEWORK
MODEL ANSWERS TO THE FIRST HOMEWORK 1. Chapter 4, 1: 2. Suppose that F is a field and that a and b are in F. Suppose that a b = 0, and that b 0. Let c be the inverse of b. Multiplying the equation above
More information13 More on free abelian groups
13 More on free abelian groups Recall. G is a free abelian group if G = i I Z for some set I. 13.1 Definition. Let G be an abelian group. A set B G is a basis of G if B generates G if for some x 1,...x
More informationg(x) = 1 1 x = 1 + x + x2 + x 3 + is not a polynomial, since it doesn t have finite degree. g(x) is an example of a power series.
6 Polynomial Rings We introduce a class of rings called the polynomial rings, describing computation, factorization and divisibility in such rings For the case where the coefficients come from an integral
More informationWritten Homework # 4 Solution
Math 516 Fall 2006 Radford Written Homework # 4 Solution 12/10/06 You may use results form the book in Chapters 1 6 of the text, from notes found on our course web page, and results of the previous homework.
More information1 Take-home exam and final exam study guide
Math 215 - Introduction to Advanced Mathematics Fall 2013 1 Take-home exam and final exam study guide 1.1 Problems The following are some problems, some of which will appear on the final exam. 1.1.1 Number
More informationTHE MINIMAL POLYNOMIAL AND SOME APPLICATIONS
THE MINIMAL POLYNOMIAL AND SOME APPLICATIONS KEITH CONRAD. Introduction The easiest matrices to compute with are the diagonal ones. The sum and product of diagonal matrices can be computed componentwise
More informationMATH 403 MIDTERM ANSWERS WINTER 2007
MAH 403 MIDERM ANSWERS WINER 2007 COMMON ERRORS (1) A subset S of a ring R is a subring provided that x±y and xy belong to S whenever x and y do. A lot of people only said that x + y and xy must belong
More informationExercises MAT2200 spring 2014 Ark 5 Rings and fields and factorization of polynomials
Exercises MAT2200 spring 2014 Ark 5 Rings and fields and factorization of polynomials This Ark concerns the weeks No. (Mar ) andno. (Mar ). Status for this week: On Monday Mar : Finished section 23(Factorization
More informationPart II Galois Theory
Part II Galois Theory Theorems Based on lectures by C. Birkar Notes taken by Dexter Chua Michaelmas 2015 These notes are not endorsed by the lecturers, and I have modified them (often significantly) after
More informationRINGS: SUMMARY OF MATERIAL
RINGS: SUMMARY OF MATERIAL BRIAN OSSERMAN This is a summary of terms used and main results proved in the subject of rings, from Chapters 11-13 of Artin. Definitions not included here may be considered
More informationClass Notes; Week 7, 2/26/2016
Class Notes; Week 7, 2/26/2016 Day 18 This Time Section 3.3 Isomorphism and Homomorphism [0], [2], [4] in Z 6 + 0 4 2 0 0 4 2 4 4 2 0 2 2 0 4 * 0 4 2 0 0 0 0 4 0 4 2 2 0 2 4 So {[0], [2], [4]} is a subring.
More informationADVANCED COMMUTATIVE ALGEBRA: PROBLEM SETS
ADVANCED COMMUTATIVE ALGEBRA: PROBLEM SETS UZI VISHNE The 11 problem sets below were composed by Michael Schein, according to his course. Take into account that we are covering slightly different material.
More informationName: Solutions Final Exam
Instructions. Answer each of the questions on your own paper, and be sure to show your work so that partial credit can be adequately assessed. Put your name on each page of your paper. 1. [10 Points] For
More informationTherefore, A and B have the same characteristic polynomial and hence, the same eigenvalues.
Similar Matrices and Diagonalization Page 1 Theorem If A and B are n n matrices, which are similar, then they have the same characteristic equation and hence the same eigenvalues. Proof Let A and B be
More information1 2 3 style total. Circle the correct answer; no explanation is required. Each problem in this section counts 5 points.
1 2 3 style total Math 415 Examination 3 Please print your name: Answer Key 1 True/false Circle the correct answer; no explanation is required. Each problem in this section counts 5 points. 1. The rings
More informationMath 547, Exam 2 Information.
Math 547, Exam 2 Information. 3/19/10, LC 303B, 10:10-11:00. Exam 2 will be based on: Homework and textbook sections covered by lectures 2/3-3/5. (see http://www.math.sc.edu/ boylan/sccourses/547sp10/547.html)
More informationSection 19 Integral domains
Section 19 Integral domains Instructor: Yifan Yang Spring 2007 Observation and motivation There are rings in which ab = 0 implies a = 0 or b = 0 For examples, Z, Q, R, C, and Z[x] are all such rings There
More information12x + 18y = 50. 2x + v = 12. (x, v) = (6 + k, 2k), k Z.
Math 3, Fall 010 Assignment 3 Solutions Exercise 1. Find all the integral solutions of the following linear diophantine equations. Be sure to justify your answers. (i) 3x + y = 7. (ii) 1x + 18y = 50. (iii)
More informationProblem 1. Let I and J be ideals in a ring commutative ring R with 1 R. Recall
I. Take-Home Portion: Math 350 Final Exam Due by 5:00pm on Tues. 5/12/15 No resources/devices other than our class textbook and class notes/handouts may be used. You must work alone. Choose any 5 problems
More informationPROBLEM SET 1 SOLUTIONS 1287 = , 403 = , 78 = 13 6.
Math 7 Spring 06 PROBLEM SET SOLUTIONS. (a) ( pts) Use the Euclidean algorithm to find gcd(87, 0). Solution. The Euclidean algorithm is performed as follows: 87 = 0 + 78, 0 = 78 +, 78 = 6. Hence we have
More information2 ALGEBRA II. Contents
ALGEBRA II 1 2 ALGEBRA II Contents 1. Results from elementary number theory 3 2. Groups 4 2.1. Denition, Subgroup, Order of an element 4 2.2. Equivalence relation, Lagrange's theorem, Cyclic group 9 2.3.
More informationMath 2070BC Term 2 Weeks 1 13 Lecture Notes
Math 2070BC 2017 18 Term 2 Weeks 1 13 Lecture Notes Keywords: group operation multiplication associative identity element inverse commutative abelian group Special Linear Group order infinite order cyclic
More informationφ(xy) = (xy) n = x n y n = φ(x)φ(y)
Groups 1. (Algebra Comp S03) Let A, B and C be normal subgroups of a group G with A B. If A C = B C and AC = BC then prove that A = B. Let b B. Since b = b1 BC = AC, there are a A and c C such that b =
More informationMath 4310 Solutions to homework 7 Due 10/27/16
Math 4310 Solutions to homework 7 Due 10/27/16 1. Find the gcd of x 3 + x 2 + x + 1 and x 5 + 2x 3 + x 2 + x + 1 in Rx. Use the Euclidean algorithm: x 5 + 2x 3 + x 2 + x + 1 = (x 3 + x 2 + x + 1)(x 2 x
More informationHomework 5 M 373K Mark Lindberg and Travis Schedler
Homework 5 M 373K Mark Lindberg and Travis Schedler 1. Artin, Chapter 3, Exercise.1. Prove that the numbers of the form a + b, where a and b are rational numbers, form a subfield of C. Let F be the numbers
More informationResultants. Chapter Elimination Theory. Resultants
Chapter 9 Resultants 9.1 Elimination Theory We know that a line and a curve of degree n intersect in exactly n points if we work in the projective plane over some algebraically closed field K. Using the
More informationHomework Problems, Math 200, Fall 2011 (Robert Boltje)
Homework Problems, Math 200, Fall 2011 (Robert Boltje) Due Friday, September 30: ( ) 0 a 1. Let S be the set of all matrices with entries a, b Z. Show 0 b that S is a semigroup under matrix multiplication
More informationHomework 11/Solutions. (Section 6.8 Exercise 3). Which pairs of the following vector spaces are isomorphic?
MTH 9-4 Linear Algebra I F Section Exercises 6.8,4,5 7.,b 7.,, Homework /Solutions (Section 6.8 Exercise ). Which pairs of the following vector spaces are isomorphic? R 7, R, M(, ), M(, 4), M(4, ), P 6,
More information1. Algebra 1.5. Polynomial Rings
1. ALGEBRA 19 1. Algebra 1.5. Polynomial Rings Lemma 1.5.1 Let R and S be rings with identity element. If R > 1 and S > 1, then R S contains zero divisors. Proof. The two elements (1, 0) and (0, 1) are
More informationIntegral Extensions. Chapter Integral Elements Definitions and Comments Lemma
Chapter 2 Integral Extensions 2.1 Integral Elements 2.1.1 Definitions and Comments Let R be a subring of the ring S, and let α S. We say that α is integral over R if α isarootofamonic polynomial with coefficients
More informationALGEBRA QUALIFYING EXAM, WINTER SOLUTIONS
ALGEBRA QUALIFYING EXAM, WINTER 2017. SOLUTIONS Your Name: Conventions: all rings and algebras are assumed to be unital. Part I. True or false? If true provide a brief explanation, if false provide a counterexample
More informationIUPUI Qualifying Exam Abstract Algebra
IUPUI Qualifying Exam Abstract Algebra January 2017 Daniel Ramras (1) a) Prove that if G is a group of order 2 2 5 2 11, then G contains either a normal subgroup of order 11, or a normal subgroup of order
More informationHonors Algebra 4, MATH 371 Winter 2010 Assignment 3 Due Friday, February 5 at 08:35
Honors Algebra 4, MATH 371 Winter 2010 Assignment 3 Due Friday, February 5 at 08:35 1. Let R 0 be a commutative ring with 1 and let S R be the subset of nonzero elements which are not zero divisors. (a)
More informationNOTES ON FINITE FIELDS
NOTES ON FINITE FIELDS AARON LANDESMAN CONTENTS 1. Introduction to finite fields 2 2. Definition and constructions of fields 3 2.1. The definition of a field 3 2.2. Constructing field extensions by adjoining
More informationMATH 205 HOMEWORK #3 OFFICIAL SOLUTION. Problem 1: Find all eigenvalues and eigenvectors of the following linear transformations. (a) F = R, V = R 3,
MATH 205 HOMEWORK #3 OFFICIAL SOLUTION Problem 1: Find all eigenvalues and eigenvectors of the following linear transformations. a F = R, V = R 3, b F = R or C, V = F 2, T = T = 9 4 4 8 3 4 16 8 7 0 1
More informationChapter 5.1: Induction
Chapter.1: Induction Monday, July 1 Fermat s Little Theorem Evaluate the following: 1. 1 (mod ) 1 ( ) 1 1 (mod ). (mod 7) ( ) 8 ) 1 8 1 (mod ). 77 (mod 19). 18 (mod 1) 77 ( 18 ) 1 1 (mod 19) 18 1 (mod
More informationMath 547, Exam 1 Information.
Math 547, Exam 1 Information. 2/10/10, LC 303B, 10:10-11:00. Exam 1 will be based on: Sections 5.1, 5.2, 5.3, 9.1; The corresponding assigned homework problems (see http://www.math.sc.edu/ boylan/sccourses/547sp10/547.html)
More informationDirection: You are required to complete this test by Monday (April 24, 2006). In order to
Test 4 April 20, 2006 Name Math 522 Student Number Direction: You are required to complete this test by Monday (April 24, 2006). In order to receive full credit, answer each problem completely and must
More informationRing Theory Problems. A σ
Ring Theory Problems 1. Given the commutative diagram α A σ B β A σ B show that α: ker σ ker σ and that β : coker σ coker σ. Here coker σ = B/σ(A). 2. Let K be a field, let V be an infinite dimensional
More information8 Appendix: Polynomial Rings
8 Appendix: Polynomial Rings Throughout we suppose, unless otherwise specified, that R is a commutative ring. 8.1 (Largely) a reminder about polynomials A polynomial in the indeterminate X with coefficients
More informationU + V = (U V ) (V U), UV = U V.
Solution of Some Homework Problems (3.1) Prove that a commutative ring R has a unique 1. Proof: Let 1 R and 1 R be two multiplicative identities of R. Then since 1 R is an identity, 1 R = 1 R 1 R. Since
More informationLecture 7: Polynomial rings
Lecture 7: Polynomial rings Rajat Mittal IIT Kanpur You have seen polynomials many a times till now. The purpose of this lecture is to give a formal treatment to constructing polynomials and the rules
More informationMATH FINAL EXAM REVIEW HINTS
MATH 109 - FINAL EXAM REVIEW HINTS Answer: Answer: 1. Cardinality (1) Let a < b be two real numbers and define f : (0, 1) (a, b) by f(t) = (1 t)a + tb. (a) Prove that f is a bijection. (b) Prove that any
More informationNOTES ON DIOPHANTINE APPROXIMATION
NOTES ON DIOPHANTINE APPROXIMATION Jan-Hendrik Evertse January 29, 200 9 p-adic Numbers Literature: N. Koblitz, p-adic Numbers, p-adic Analysis, and Zeta-Functions, 2nd edition, Graduate Texts in Mathematics
More informationHomework 3, solutions
Homework 3, solutions Problem 1. Read the proof of Proposition 1.22 (page 32) in the book. Using simialr method prove that there are infinitely many prime numbers of the form 3n 2. Solution. Note that
More informationDefinition For a set F, a polynomial over F with variable x is of the form
*6. Polynomials Definition For a set F, a polynomial over F with variable x is of the form a n x n + a n 1 x n 1 + a n 2 x n 2 +... + a 1 x + a 0, where a n, a n 1,..., a 1, a 0 F. The a i, 0 i n are the
More informationMath 210B: Algebra, Homework 1
Math 210B: Algebra, Homework 1 Ian Coley January 15, 201 Problem 1. Show that over any field there exist infinitely many non-associate irreducible polynomials. Recall that by Homework 9, Exercise 8 of
More information7. Let K = 15 be the subgroup of G = Z generated by 15. (a) List the elements of K = 15. Answer: K = 15 = {15k k Z} (b) Prove that K is normal subgroup of G. Proof: (Z +) is Abelian group and any subgroup
More informationContribution of Problems
Exam topics 1. Basic structures: sets, lists, functions (a) Sets { }: write all elements, or define by condition (b) Set operations: A B, A B, A\B, A c (c) Lists ( ): Cartesian product A B (d) Functions
More informationMATH 361: NUMBER THEORY FOURTH LECTURE
MATH 361: NUMBER THEORY FOURTH LECTURE 1. Introduction Everybody knows that three hours after 10:00, the time is 1:00. That is, everybody is familiar with modular arithmetic, the usual arithmetic of the
More informationSPRING 2006 PRELIMINARY EXAMINATION SOLUTIONS
SPRING 006 PRELIMINARY EXAMINATION SOLUTIONS 1A. Let G be the subgroup of the free abelian group Z 4 consisting of all integer vectors (x, y, z, w) such that x + 3y + 5z + 7w = 0. (a) Determine a linearly
More informationHomework 8 Solutions to Selected Problems
Homework 8 Solutions to Selected Problems June 7, 01 1 Chapter 17, Problem Let f(x D[x] and suppose f(x is reducible in D[x]. That is, there exist polynomials g(x and h(x in D[x] such that g(x and h(x
More informationUMASS AMHERST MATH 411 SECTION 2, FALL 2009, F. HAJIR
UMASS AMHERST MATH 411 SECTION 2, FALL 2009, F. HAJIR HOMEWORK 2: DUE TH. OCT. 1 READINGS: These notes are intended as a supplement to the textbook, not a replacement for it. 1. Elements of a group, their
More informationGALOIS THEORY I (Supplement to Chapter 4)
GALOIS THEORY I (Supplement to Chapter 4) 1 Automorphisms of Fields Lemma 1 Let F be a eld. The set of automorphisms of F; Aut (F ) ; forms a group (under composition of functions). De nition 2 Let F be
More informationHomework Problems, Math 134, Spring 2007 (Robert Boltje)
Homework Problems, Math 134, Spring 2007 (Robert Boltje) 1. Write a computer program that uses the Euclidean Algorithm to compute the greatest common divisor d of two natural numbers a and b and also integers
More informationMath 121 Homework 2 Solutions
Math 121 Homework 2 Solutions Problem 13.2 #16. Let K/F be an algebraic extension and let R be a ring contained in K that contains F. Prove that R is a subfield of K containing F. We will give two proofs.
More informationSolutions Quiz 9 Nov. 8, Prove: If a, b, m are integers such that 2a + 3b 12m + 1, then a 3m + 1 or b 2m + 1.
Solutions Quiz 9 Nov. 8, 2010 1. Prove: If a, b, m are integers such that 2a + 3b 12m + 1, then a 3m + 1 or b 2m + 1. Answer. We prove the contrapositive. Suppose a, b, m are integers such that a < 3m
More informationFunctions as Relations
Functions as Relations Definition Recall that if A and B are sets, then a relation from A to B is a subset of A B. A function from A to B is a relation f from A to B with the following properties (i) The
More informationMTH Abstract Algebra II S17. Review for the Final Exam. Part I
MTH 411-1 Abstract Algebra II S17 Review for the Final Exam Part I You will be allowed to use the textbook (Hungerford) and a print-out of my online lecture notes during the exam. Nevertheless, I recommend
More informationSolutions for November. f(x + f(y)) = f(x) + y
Solutions for November 647. Find all continuous functions f : R R such that for every x, y R. f(x + f(y)) = f(x) + y Solution 1. Setting (x, y) = (t, 0) yields f(t + f(0)) = f(t) for all real t. Setting
More informationMTH 411 Lecture Notes Based on Hungerford, Abstract Algebra
MTH 411 Lecture Notes Based on Hungerford, Abstract Algebra Ulrich Meierfrankenfeld Department of Mathematics Michigan State University East Lansing MI 48824 meier@math.msu.edu August 28, 2014 2 Contents
More informationContribution of Problems
Exam topics 1. Basic structures: sets, lists, functions (a) Sets { }: write all elements, or define by condition (b) Set operations: A B, A B, A\B, A c (c) Lists ( ): Cartesian product A B (d) Functions
More information