Ju-Si Lee 1. INTRODUCTION
|
|
- Tobias Paul
- 6 years ago
- Views:
Transcription
1 TAIWANESE JOURNAL OF MATHEMATICS Vol. 1, No. 5, pp , August 008 This paper is available online at THE RESTRICTED SOLUTIONS OF ax + by =gcd(a, b) Ju-Si Lee Abstract. Let D denote a principle ideal domain with identity element 1. Fix three elements a, b, d in D with gcd(a, b) = d. We show there exist two elements x, y in D with either gcd(a, y) =1or gcd(b, x) =1such that ax+by = d. Moreover we show there exist x, y in D such that gcd(a, y) = 1, gcd(b, x) =1and ax + by = d if and only if for each prime divisor p of d with a complete set of residues modulo p containing exactly elements, the power of p appearing in the factorization of a is different to that of b. We apply our results to the study of double-loop networks. 1. INTRODUCTION Let D denote a principle ideal domain (PID) with identity element 1. A special example is when D = Z, the set of integers. Fix three elements a, b, d in D with gcd(a, b)=d. It is well known that there exist x, y D such that (1.1) ax + by = d. For the converse, if ax + by = d for some elements x,y,d D, then d is a divisor of d. Observe each of gcd(a, y), gcd(b, x) and gcd(x, y) is a divisor of d. In fact gcd(x, y) =1otherwise we can divide each of x, y and d in (1.1) by gcd(x, y) to obtain that gcd(a, b) is a divisor of d/gcd(x, y) for a contradiction. Now it is natural to ask if gcd(a, y)=1or gcd(b, x)=1? Our first theorem will show. Theorem A. ax + by = d. There exist two elements x, y in D with gcd(b, x) =1and Moreover our second theorem will show Received July 18, 006, accepted December 15, 006. Communicated by Xuding Zhu. 000 Mathematics Subject Classification: 11A05. Key words and phrases: Principal ideal domain, Double-loop network. 1191
2 119 Ju-Si Lee Theorem B. There exist x, y in D such that gcd(a, y)=1, gcd(b, x)=1and ax + by = d if and only if for each prime divisor p of d with a complete set of residues modulo p containing exactly elements, the power of p appearing in the factorization of a is different to that of b. See Theorem 3.3 for more detailed description of Theorem B. Note that if D is a unique factorization domain (UFD), Theorem A fails. For example, with D = Z[x], a=and b = x, we have gcd(a, b)=1, but af(x)+bg(x) 1for all f(x),g(x) Z[x]. The necessary condition appearing in our Theorem B can not be omitted. For example for D = Z, a =and b =6, we have x +6y =, where x = +3k and y =1 k for some integer k. Since x and y always have different parity, it can not have gcd(a, y)=1and gcd(b, x)=1. Double-loop networks on integers were introduced by Wang and Coppersmith for the purpose of giving efficient and secure communication [3]. We will generalize the concept of double-loop network on integers to on arbitrary principle ideal domain D with identity element. We apply the above mentioned results to the double-loop network on Z N. The paper is organized as follows. In section we review a few definitions and properties on the principle ideal domain D. The main theorems are proved in section 3. In section 4, we give a few examples of principle ideal domains, and show how our main results are applied to these examples. The double-loop network on D was introduced in section 5.. PRELIMINARIES Let D be a UFD with identity element 1. Fix a nonzero nonunit element n D. For a, b D, we say a and b are congruent modulo n, or in the notation a b (mod n), ifn (a b). Obviously, the congruent is an equivalent relation on D. A nonempty subset S of D is said to be a set of residues modulo n if any two elements of S are not congruent modulo n. A maximum set R of residues modulo n is called a complete set of residues modulo n. In fact, a complete set of residues modulo n is made by choosing one representative from each congruent class. We set r n the number of elements of a complete set R of residues modulo n, that is, r n = R. Note that ar + b := {ar + b r R} is also a complete set of residues modulo n, where a, b are elements in D with gcd(a, n) =1. The following two basic theorems will be used in our proofs. See [1] (p. 355 and 363) for reference. Theorem.1. Let D denote a PID with identity element 1 and fix a, b D, not both zero. If gcd(a, b)=d then there exist x, y D such that ax + by = d.
3 The Restricted Solutions of ax + by = gcd(a, b) 1193 Corollary.. Let D denote a PID with identity element 1 and fix a, b D, not both zero. Then gcd(a, b) =1if and only if there exist x, y D such that ax + by =1; in particular, gcd(a, y) =1and gcd(b, x)=1. Note that Theorem B is a generalization of Corollary.. 3. PROOFS OF MAIN THEOREMS Throughout this section, let D denote a PID with identity element 1 and let a, b D, not both zero. The following theorem proves Theorem A in the introduction. Theorem 3.1. There exist x, y D such that gcd(b, x) =1and ax + by = gcd(a, b). Proof. Suppose a = a 1 d and b = b 1 d, where a 1,b 1,d D and gcd(a, b)=d. Note that gcd(a 1,b 1 )=1. By Theorem.1, there exist x 0,y 0 D such that a 1 x 0 + b 1 y 0 =1. Note that gcd(b 1,x 0 )=1by Corollary.. Set c := p, where p the product is over all primes p d and p b 1. In particular, gcd(b 1,c)=1. Let R be a complete set of residues modulo c. Hence b 1 R + x 0 is also a complete set of residues modulo c. Pick an element x b 1 R + x 0 which is congruent to 1 modulo c. Say x = rb 1 + x 0 1(modc) for some r R. Then gcd(c, x) =1 and gcd(b 1,x)=1. Hence gcd(b, x) =1. By setting y = ra 1 + y 0, we have ax + by = d. To prove Theorem B we need a lemma first. Lemma 3.. Suppose r p 3 for each common prime divisor p of a and b. Then there exist x, y D such that gcd(a, y) =1, gcd(b, x) =1and ax + by = gcd(a, b). Proof. Set d := gcd(a, b) and suppose d = p t 1 1 p t p tn n, where p i are distinct primes in D and t i are positive integers. Set d 1 = p t 1 1 p t p t n 1 n 1. We prove the lemma by induction on n. For n =0, we have d =1, and the lemma holds by Corollary.. Suppose n 1. Without loss of generality, suppose a = p tn+s n a 1 and b = p tn n b 1 where p n a 1, p n b 1, t n is a positive integer and s is a nonnegative integer. Then gcd(p s na 1,b 1 )= p t 1 1 p t p t n 1 n 1 = d 1. By induction assumption, there exist x 1,y 1 D such that gcd(p s na 1,y 1 )=1, gcd(b 1,x 1 )=1and p s na 1 x 1 + b 1 y 1 = d 1. Hence gcd(p i,y 1 )= 1, gcd(p i,x 1 )=1for i =1,,,n 1, p n y 1 for s>0, and ax 1 + by 1 = d. Let R be a complete set of residues modulo p n. Since p n a 1 and p n b 1, b 1 R+x 1 and ( a 1 )R+y 1 are complete sets of residues modulo p n, each containing
4 1194 Ju-Si Lee at least three elements. Hence there exists r R such that both b 1 r + x 1 0 (mod p n ) and a 1 r +y 1 0(modp n ). Set x = b 1 r +x 1 and y = p n s a 1 r +y 1. Hence gcd(a, y) =1, gcd(b, x)=1and ax+by = a(b 1 r+x 1 )+b( p n s a 1 r+y 1 )= ax 1 + by 1 = d. By Lemma 3., to prove Theorem B, we consider only each prime divisor p of gcd(a, b) with r p =. In fact, {0, 1} is a complete set of residues modulo p for each prime divisor p of gcd(a, b) with r p =. Let S = {p p is a prime factor of gcd(a, b) withr p =}. Observe that if p S and c D, then p is not a factor of c if and only if c 1 (mod p). The following theorem proves Theorem B. Theorem 3.3. There exist x, y D such that gcd(a, y) =1, gcd(b, x) =1, and ax + by =gcd(a, b) if and only if either S =0, or there exists an integer i such that gcd(a, p i ) gcd(b, p i ) for each p S. Proof. (= ) We suppose that S > 0 and there exists a p S such that gcd(a, p i )=gcd(b, p i ) for each positive integer i. Note that gcd(a, p) = gcd(b, p)=p. To get the contrary let m denote the positive integer such that p m a, p m b, p m+1 a, p m+1 b, and suppose ax + by =gcd(a, b) for some x, y D with gcd(a, y)=1and gcd(b, x)=1. Since p is a divisor of gcd(a, b), x y 1 (mod p). Observe a p m x + b gcd(a, b) y = pm p m, where a p m b gcd(a, b) pm p m 1 (mod p). This implies either x 0 or y 0(modp), a contradiction. ( =) We prove by induction on S. It follows from Lemma 3. if S =0. Suppose S > 0. Pick p S. Let m denote the least positive integer such that gcd(a, p m+1 ) gcd(b, p m+1 ). Set a := a/p m, and b := b/p m and S = {p p is a prime factor of gcd(a,b )withr p =}. Observe S = S {p}, gcd(a, b) =gcd(a,b )p m, and exactly one of a 1 (mod p) and b 1(modp). Without loss of generality, say a 1(modp) and b 0(modp). By induction there exists x,y D such that gcd(a,y )= 1, gcd(b,x )=1, and a x + b y =gcd(a,b ). Hence x 1(modp) and ax + by =gcd(a, b). Set { 0, if y 1 (mod p), c := 1, if y 0 (mod p);
5 The Restricted Solutions of ax + by = gcd(a, b) 1195 x := x + cb and y := y ca. Then x 1(modp), y 1(modp). Hence we have gcd(a, y)=1, gcd(b, x)=1, and ax + by = ax + by =gcd(a, b). Note that Theorem 3.3 still holds if D is a UFD and assume that there exist x, y D such that ax + by =gcd(a, b). A tittle modification in each of the proofs of Theorem 3.1, Lemma 3. and Theorem 3.3 will do this. 4. EXAMPLES We apply Theorem 3.3 in each of the cases D = Z, D = F [x], and the imaginary quadratic fields D = O( di) where d =1,, 3, 7, 11, 19, 43, 67, 163. I. D = Z. By Theorem 3.1, we have the following theorem. Theorem 4.1. Given two integers a and b, not both zero, there exist integers x and y such that gcd(x, b)=1and ax + by =gcd(a, b). Observe that r p =in Z if and only if p =. By Theorem 3.3, we have the following theorem. Theorem 4.. Given two positive integers a and b. Let a = r a 1 and b = s b 1 where r and s are nonnegative integers and a 1,b 1 are odd. Then there exist integers x and y such that gcd(a, y) =1, gcd(b, x) =1and ax + by = d if and only if either r = s =0or r s. II. D = F [x]. Let D be an integral domain, then D[x] is a PID if and only if D is a field [1] (p. 345). Hence we consider F [x] where F is a field. Obviously, if F has at least three elements, then r p(x) > for each irreducible polynomial p(x) in F [x]. And in Z [x], r p(x) =if and only if either p(x) =x or p(x) =1+x. By Lemma 3. and Theorem 3.3, we have the following two theorems. Theorem 4.3. Let F be a field which has at least three elements. If f(x) and g(x) are polynomials of F [x], not both zero, then there exist polynomials h(x) and k(x) of F [x] such that gcd(f(x),k(x)) = 1, gcd(g(x),h(x)) = 1 and f(x)h(x)+g(x)k(x)=gcd(f(x),g(x)). Theorem 4.4. Suppose f(x), g(x) are two polynomials of Z [x], not both zero, gcd(f(x),g(x)) = d(x). Let f(x) =x r 1 (1 + x) r f 1 (x) and g(x) =x s 1 (1 +
6 1196 Ju-Si Lee x) s g 1 (x) where r 1,r,s 1,s are nonnegative integers and x and 1+x are not prime divisors of both f 1 (x) and g 1 (x). Then there exist polynomials h(x) and k(x) of Z [x] such that gcd(f(x),k(x)) = 1, gcd(g(x),h(x)) = 1 and f(x)h(x)+ g(x)k(x) =d(x) if and only if either (1) r 1 = r = s 1 = s =0, or () r 1 s 1 and r s. III. In an imaginary quadratic fields with class number 1 (UFD). Let O( D) denote the set of all algebraic integers of Q( D) where D is square-free, then (1) O( D)={l + m D l, m Z} = Z[ D], ifd or 3(mod4). () O( D)={ l + m D l, m Z,l m (mod )}, ifd 1(mod4). There are exactly nine imaginary quadratic fields with class number 1 : d = 1,, 3, 7, 11, 19, 43, 67 and 163 [] where D = d. In the following we discuss the nine imaginary quadratic fields. In this paper, an algebraic integer will be denoted by the form a + b D if D or 3(mod4), α = a + b D if D 1(mod4) where a, b Z. Define the norm of α by a Db if D or 3(mod4), N(α) = a Db if D 1(mod4). 4 Every complete set of residues modulo α has N(α) elements. Hence r p =if and only if N(p)=. The following lemma is clear. Lemma 4.5. (1) p = ±1 ± i in Z(i). () p = ± i in Z( i). r p =in O( di) if and only if (3) ±1 ± 7i in O( 7i). By Lemma 4.5, Lemma 3., and Theorem 3.3, we have 1. d =1.
7 The Restricted Solutions of ax + by = gcd(a, b) 1197 Theorem 4.6. Given α, β Z[i],not both zero, let α = (1 + i) r α 1 and β =(1+i) s β 1 where r and s are nonnegative integers and 1+i is not a divisor of both α 1 and β 1. Then there exist integers x and y of Z[i] such that gcd(α, y) =1, gcd(β, x)=1and αx + βy =gcd(α, β) if and only if r = s =0or r s.. d =. Theorem 4.7. Given α, β Z[ i],not both zero, let α =( i) r α 1 and β = ( i) s β 1 where r and s are nonnegative integers and i is not a divisor of both α 1 and β 1. Then there exist integers x and y of Z[ i] such that gcd(α, y) =1, gcd(β, x)=1and αx + βy) =gcd(α, β) if and only if r = s =0or r s. 3. d =7. Theorem 4.8. Given α, β O( 7i), not both zero, let α = γ r 1 δ r α 1 and β = γ s 1δ s β 1 where γ = 1+ 7i, δ = 1 7i, r 1,r,s 1,s are nonnegative integers, and N(α 1 ), N(β 1 ) are odd. Then there exist integers x and y of O( 7i) such that gcd(α, y) =1, gcd(β, x) =1and αx + βy =gcd(α, β) if and only if either (1) r 1 = r = s 1 = s =0, or () r 1 s 1 and r s. 4. d =3, 11, 19, 43, 67 and 163. Theorem 4.9. Given α, β O( di), not both zero, then there exist integers x and y of O( di) such that gcd(α, y) =1, gcd(β, x) =1and αx + βy = gcd(α, β). 5. AN APPLICATION Let D be a principle ideal dommain with identity 1. Fix elements a, b, N D and a complete set D N of residues modulo N. Definition 5.1. Let DL(D N,a,b) be a digraph with vertex set D N and directed edge set {xy y x + a (mod N) ory x + b (mod N), x,y D N }. DL(D N,a,b) is called a double-loop network on D N modulo N. Wong and Coppersmith [3] introduced the network DL(N;1,h) (DL( Z N ;1,h)), where N, h are positive integers. Fiol et al. [4] extended it to DL(N; a, b) for nonnegative integers a, b, N with 0 a<b<n. They proved that DL(N; a, b) is strongly connected if and only if gcd(n, a, b)=1.
8 1198 Ju-Si Lee The minimum-distance diagram of a double-loop network DL(N; a, b) gives a shortest path from node u to node v for any u, v. Since a double-loop network is node-symmetric, it suffices to give a shortest path from node 0 to any other node. Let 0 occupy cell (0,0). Then, v occupies cell (i, j) if and only if ia + jb v(modn) and i + j is the minimum among all satisfying the congruence. Wong and Coppersmith [3] proved that the diagram is always an L-shape. Let d(k) denote the number of cells (i, j) in a L-shape such that i + j = k. Hwang and Xu [5] defined two double-loop networks,or two L-shapes, to be equivalent if they have the same d(k) for all k. Hwang and Li [6] defined two double-loop networks DL(N; a, b) and DL(N; a,b ) to be isomorphic if there exists a z prime to N such that a az, b bz (mod N). It can be easily seen that two isomorphic double-loop networks are equivalent, but the reverse is not true. Given a strongly connected double-loop network DL(N; a, b), gcd(n, a, b) =1. Theorem 5.. Suppose gcd(n, a) =d and gcd(d, b) =1. Then DL(N; a, b) is isomorphic to DL(N; d, s) for some s with gcd(d, s)=1. Proof. By Theorem 4.1, there exists z such that gcd(n, z) =1and az d (mod N). Let s bz (mod N) and 0 s N 1. Since gcd(n, a, b)=1,we have gcd(d, s)=1and DL(N; a, b) is isomorphic to DL(N; d, s). Hence, when double-loop networks DL(N; a, b) are discussed, it suffices to consider only those DL(N; a, b) with properties that a N, and gcd(a, b)=1. ACKNOWLEDGMENT The author wishes to thank Professor Chih-Wen Weng for providing comments to the paper. REFERENCES 1. D. S. Malik, John N. Mordeson and M. K. Sen, Fundamentals of Abstract Algebra, The McGraw-Hill Companies, Inc. 1997, Chapter 15.. H. M. Stark, A complete determination of the complex quadratic fields of classnumber one, Michigan Math. J., 14 (1967), C. K. Wong and D. Coppersmith, A combinatorial Problem Related to Multimodule Organizations, J. ACM, 1 (1974), M. A. Fiol, M. Valero, J. L. A. Yebra and T. Lang, Optimization of Double-Loop equivalent Structures for Local Networks, Proc. 19th int l Symp. MIMI 8, 198, pp
9 The Restricted Solutions of ax + by = gcd(a, b) F. K. Hwang and Y. H. Xu, Ddouble-loop networks with minimum delay, Discr Math., 66 (1987), F. K. Hwang and W.-C. W. Li, Reliabilities of double-loop networks, Prob Eng Inf Sci., 5 (1991), Ju-Si Lee Department of Mathematics, National Kaohshiung Normal University, Kaoshiung 80, Taiwan jusilee@nknucc.nknu.edu.tw
1. Factorization Divisibility in Z.
8 J. E. CREMONA 1.1. Divisibility in Z. 1. Factorization Definition 1.1.1. Let a, b Z. Then we say that a divides b and write a b if b = ac for some c Z: a b c Z : b = ac. Alternatively, we may say that
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 informationGroups, Rings, and Finite Fields. Andreas Klappenecker. September 12, 2002
Background on Groups, Rings, and Finite Fields Andreas Klappenecker September 12, 2002 A thorough understanding of the Agrawal, Kayal, and Saxena primality test requires some tools from algebra and elementary
More informationPrime and irreducible elements of the ring of integers modulo n
Prime and irreducible elements of the ring of integers modulo n M. H. Jafari and A. R. Madadi Department of Pure Mathematics, Faculty of Mathematical Sciences University of Tabriz, Tabriz, Iran Abstract
More informationHomework 6 Solution. Math 113 Summer 2016.
Homework 6 Solution. Math 113 Summer 2016. 1. For each of the following ideals, say whether they are prime, maximal (hence also prime), or neither (a) (x 4 + 2x 2 + 1) C[x] (b) (x 5 + 24x 3 54x 2 + 6x
More informationPart IX. Factorization
IX.45. Unique Factorization Domains 1 Part IX. Factorization Section IX.45. Unique Factorization Domains Note. In this section we return to integral domains and concern ourselves with factoring (with respect
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 informationLecture Notes Math 371: Algebra (Fall 2006) by Nathanael Leedom Ackerman
Lecture Notes Math 371: Algebra (Fall 2006) by Nathanael Leedom Ackerman October 17, 2006 TALK SLOWLY AND WRITE NEATLY!! 1 0.1 Factorization 0.1.1 Factorization of Integers and Polynomials Now we are going
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 informationATOMIC AND AP SEMIGROUP RINGS F [X; M], WHERE M IS A SUBMONOID OF THE ADDITIVE MONOID OF NONNEGATIVE RATIONAL NUMBERS. Ryan Gipson and Hamid Kulosman
International Electronic Journal of Algebra Volume 22 (2017) 133-146 DOI: 10.24330/ieja.325939 ATOMIC AND AP SEMIGROUP RINGS F [X; M], WHERE M IS A SUBMONOID OF THE ADDITIVE MONOID OF NONNEGATIVE RATIONAL
More informationTHUE S LEMMA AND IDONEAL QUADRATIC FORMS
THUE S LEMMA AND IDONEAL QUADRATIC FORMS PETE L. CLARK Abstract. The representation of integers by binary quadratic forms is one of the oldest problems in number theory, going back at least to Fermat s
More informationPRACTICE PROBLEMS: SET 1
PRACTICE PROBLEMS: SET MATH 437/537: PROF. DRAGOS GHIOCA. Problems Problem. Let a, b N. Show that if gcd(a, b) = lcm[a, b], then a = b. Problem. Let n, k N with n. Prove that (n ) (n k ) if and only if
More informationMATH 433 Applied Algebra Lecture 4: Modular arithmetic (continued). Linear congruences.
MATH 433 Applied Algebra Lecture 4: Modular arithmetic (continued). Linear congruences. Congruences Let n be a postive integer. The integers a and b are called congruent modulo n if they have the same
More informationTHUE S LEMMA AND IDONEAL QUADRATIC FORMS
THUE S LEMMA AND IDONEAL QUADRATIC FORMS PETE L. CLARK Introduction Recently I learned about Thue s Lemma, an elementary result on congruences due to the Norwegian mathematician Axel Thue (1863-1922).
More informationFinite Fields. Mike Reiter
1 Finite Fields Mike Reiter reiter@cs.unc.edu Based on Chapter 4 of: W. Stallings. Cryptography and Network Security, Principles and Practices. 3 rd Edition, 2003. Groups 2 A group G, is a set G of elements
More informationDiscrete valuation rings. Suppose F is a field. A discrete valuation on F is a function v : F {0} Z such that:
Discrete valuation rings Suppose F is a field. A discrete valuation on F is a function v : F {0} Z such that: 1. v is surjective. 2. v(ab) = v(a) + v(b). 3. v(a + b) min(v(a), v(b)) if a + b 0. Proposition:
More information36 Rings of fractions
36 Rings of fractions Recall. If R is a PID then R is a UFD. In particular Z is a UFD if F is a field then F[x] is a UFD. Goal. If R is a UFD then so is R[x]. Idea of proof. 1) Find an embedding R F where
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 informationFERMAT S LAST THEOREM FOR n = 3, NOTES FOR MATH In these notes, we prove Fermat s Last Theorem for n = 3.
FERMAT S LAST THEOREM FOR n = 3, NOTES FOR MATH 40520 SAM EVENS In these notes, we prove Fermat s Last Theorem for n = 3. 1 Recall that Z[ω] = {a+bω : a, b Z} has a Euclidean algorithm and is norm integral.
More informationCHAPTER 14. Ideals and Factor Rings
CHAPTER 14 Ideals and Factor Rings Ideals Definition (Ideal). A subring A of a ring R is called a (two-sided) ideal of R if for every r 2 R and every a 2 A, ra 2 A and ar 2 A. Note. (1) A absorbs elements
More informationMINKOWSKI THEORY AND THE CLASS NUMBER
MINKOWSKI THEORY AND THE CLASS NUMBER BROOKE ULLERY Abstract. This paper gives a basic introduction to Minkowski Theory and the class group, leading up to a proof that the class number (the order of the
More informationA few exercises. 1. Show that f(x) = x 4 x 2 +1 is irreducible in Q[x]. Find its irreducible factorization in
A few exercises 1. Show that f(x) = x 4 x 2 +1 is irreducible in Q[x]. Find its irreducible factorization in F 2 [x]. solution. Since f(x) is a primitive polynomial in Z[x], by Gauss lemma it is enough
More informationPolynomial Rings. (Last Updated: December 8, 2017)
Polynomial Rings (Last Updated: December 8, 2017) These notes are derived primarily from Abstract Algebra, Theory and Applications by Thomas Judson (16ed). Most of this material is drawn from Chapters
More informationALGEBRA HANDOUT 2.3: FACTORIZATION IN INTEGRAL DOMAINS. In this handout we wish to describe some aspects of the theory of factorization.
ALGEBRA HANDOUT 2.3: FACTORIZATION IN INTEGRAL DOMAINS PETE L. CLARK In this handout we wish to describe some aspects of the theory of factorization. The first goal is to state what it means for an arbitrary
More informationChapter 14: Divisibility and factorization
Chapter 14: Divisibility and factorization Matthew Macauley Department of Mathematical Sciences Clemson University http://www.math.clemson.edu/~macaule/ Math 4120, Summer I 2014 M. Macauley (Clemson) Chapter
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 informationFactorization in Polynomial Rings
Factorization in Polynomial Rings These notes are a summary of some of the important points on divisibility in polynomial rings from 17 and 18. PIDs Definition 1 A principal ideal domain (PID) is an integral
More informationPolynomial Rings. i=0. i=0. n+m. i=0. k=0
Polynomial Rings 1. Definitions and Basic Properties For convenience, the ring will always be a commutative ring with identity. Basic Properties The polynomial ring R[x] in the indeterminate x with coefficients
More informationContents. 4 Arithmetic and Unique Factorization in Integral Domains. 4.1 Euclidean Domains and Principal Ideal Domains
Ring Theory (part 4): Arithmetic and Unique Factorization in Integral Domains (by Evan Dummit, 018, v. 1.00) Contents 4 Arithmetic and Unique Factorization in Integral Domains 1 4.1 Euclidean Domains and
More informationM381 Number Theory 2004 Page 1
M81 Number Theory 2004 Page 1 [[ Comments are written like this. Please send me (dave@wildd.freeserve.co.uk) details of any errors you find or suggestions for improvements. ]] Question 1 20 = 2 * 10 +
More informationHomework 7 solutions M328K by Mark Lindberg/Marie-Amelie Lawn
Homework 7 solutions M328K by Mark Lindberg/Marie-Amelie Lawn Problem 1: 4.4 # 2:x 3 + 8x 2 x 1 0 (mod 1331). a) x 3 + 8x 2 x 1 0 (mod 11). This does not break down, so trial and error gives: x = 0 : f(0)
More informationINFINITE RINGS WITH PLANAR ZERO-DIVISOR GRAPHS
INFINITE RINGS WITH PLANAR ZERO-DIVISOR GRAPHS YONGWEI YAO Abstract. For any commutative ring R that is not a domain, there is a zerodivisor graph, denoted Γ(R), in which the vertices are the nonzero zero-divisors
More information6]. (10) (i) Determine the units in the rings Z[i] and Z[ 10]. If n is a squarefree
Quadratic extensions Definition: Let R, S be commutative rings, R S. An extension of rings R S is said to be quadratic there is α S \R and monic polynomial f(x) R[x] of degree such that f(α) = 0 and S
More informationHomework 10 M 373K by Mark Lindberg (mal4549)
Homework 10 M 373K by Mark Lindberg (mal4549) 1. Artin, Chapter 11, Exercise 1.1. Prove that 7 + 3 2 and 3 + 5 are algebraic numbers. To do this, we must provide a polynomial with integer coefficients
More informationbe any ring homomorphism and let s S be any element of S. Then there is a unique ring homomorphism
21. Polynomial rings Let us now turn out attention to determining the prime elements of a polynomial ring, where the coefficient ring is a field. We already know that such a polynomial ring is a UFD. Therefore
More informationChapter 4. Remember: F will always stand for a field.
Chapter 4 Remember: F will always stand for a field. 4.1 10. Take f(x) = x F [x]. Could there be a polynomial g(x) F [x] such that f(x)g(x) = 1 F? Could f(x) be a unit? 19. Compare with Problem #21(c).
More informationCOMP239: Mathematics for Computer Science II. Prof. Chadi Assi EV7.635
COMP239: Mathematics for Computer Science II Prof. Chadi Assi assi@ciise.concordia.ca EV7.635 The Euclidean Algorithm The Euclidean Algorithm Finding the GCD of two numbers using prime factorization is
More informationLecture 7.5: Euclidean domains and algebraic integers
Lecture 7.5: Euclidean domains and algebraic integers Matthew Macauley Department of Mathematical Sciences Clemson University http://www.math.clemson.edu/~macaule/ Math 4120, Modern Algebra M. Macauley
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 informationExample: This theorem is the easiest way to test an ideal (or an element) is prime. Z[x] (x)
Math 4010/5530 Factorization Theory January 2016 Let R be an integral domain. Recall that s, t R are called associates if they differ by a unit (i.e. there is some c R such that s = ct). Let R be a commutative
More information2. THE EUCLIDEAN ALGORITHM More ring essentials
2. THE EUCLIDEAN ALGORITHM More ring essentials In this chapter: rings R commutative with 1. An element b R divides a R, or b is a divisor of a, or a is divisible by b, or a is a multiple of b, if there
More informationNumber theory lectures
Number theory lectures By Dr. Mohammed M. AL-Ashker Associated professor Mathematics Department E.mail:mashker @ mail.iugaza.edu Islamic University of Gaza P.O.Box 108, Gaza, Palestine 1 Contents 1 Divisibility
More informationSolving Diophantine Equations With Unique Factorization
Solving Diophantine Equations With Unique Factorization February 17, 2016 1 Introduction In this note we should how unique factorization in rings like Z[i] and Z[ 2] can be used to find integer solutions
More informationSome examples of two-dimensional regular rings
Bull. Math. Soc. Sci. Math. Roumanie Tome 57(105) No. 3, 2014, 271 277 Some examples of two-dimensional regular rings by 1 Tiberiu Dumitrescu and 2 Cristodor Ionescu Abstract Let B be a ring and A = B[X,
More informationSection IV.23. Factorizations of Polynomials over a Field
IV.23 Factorizations of Polynomials 1 Section IV.23. Factorizations of Polynomials over a Field Note. Our experience with classical algebra tells us that finding the zeros of a polynomial is equivalent
More informationFactorization in Integral Domains II
Factorization in Integral Domains II 1 Statement of the main theorem Throughout these notes, unless otherwise specified, R is a UFD with field of quotients F. The main examples will be R = Z, F = Q, and
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 informationOn non-hamiltonian circulant digraphs of outdegree three
On non-hamiltonian circulant digraphs of outdegree three Stephen C. Locke DEPARTMENT OF MATHEMATICAL SCIENCES, FLORIDA ATLANTIC UNIVERSITY, BOCA RATON, FL 33431 Dave Witte DEPARTMENT OF MATHEMATICS, OKLAHOMA
More informationElementary Number Theory MARUCO. Summer, 2018
Elementary Number Theory MARUCO Summer, 2018 Problem Set #0 axiom, theorem, proof, Z, N. Axioms Make a list of axioms for the integers. Does your list adequately describe them? Can you make this list as
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 informationSection III.6. Factorization in Polynomial Rings
III.6. Factorization in Polynomial Rings 1 Section III.6. Factorization in Polynomial Rings Note. We push several of the results in Section III.3 (such as divisibility, irreducibility, and unique factorization)
More informationTHE HALF-FACTORIAL PROPERTY IN INTEGRAL EXTENSIONS. Jim Coykendall Department of Mathematics North Dakota State University Fargo, ND.
THE HALF-FACTORIAL PROPERTY IN INTEGRAL EXTENSIONS Jim Coykendall Department of Mathematics North Dakota State University Fargo, ND. 58105-5075 ABSTRACT. In this paper, the integral closure of a half-factorial
More informationAlgebra Review 2. 1 Fields. A field is an extension of the concept of a group.
Algebra Review 2 1 Fields A field is an extension of the concept of a group. Definition 1. A field (F, +,, 0 F, 1 F ) is a set F together with two binary operations (+, ) on F such that the following conditions
More informationExplicit Methods in Algebraic Number Theory
Explicit Methods in Algebraic Number Theory Amalia Pizarro Madariaga Instituto de Matemáticas Universidad de Valparaíso, Chile amaliapizarro@uvcl 1 Lecture 1 11 Number fields and ring of integers Algebraic
More informationAnother Proof of Nathanson s Theorems
1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 14 (2011), Article 11.8.4 Another Proof of Nathanson s Theorems Quan-Hui Yang School of Mathematical Sciences Nanjing Normal University Nanjing 210046
More informationInformal Notes on Algebra
Informal Notes on Algebra R. Boyer Contents 1 Rings 2 1.1 Examples and Definitions................................. 2 1.2 Integral Domains...................................... 3 1.3 Fields............................................
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 informationPart IX ( 45-47) Factorization
Part IX ( 45-47) Factorization Satya Mandal University of Kansas, Lawrence KS 66045 USA January 22 45 Unique Factorization Domain (UFD) Abstract We prove evey PID is an UFD. We also prove if D is a UFD,
More informationAnalysis I (Math 121) First Midterm Correction
Analysis I (Math 11) First Midterm Correction Fall 00 Ali Nesin November 9, 00 1. Which of the following are not vector spaces over R (with the componentwise addition and scalar multiplication) and why?
More informationMATH 3030, Abstract Algebra FALL 2012 Toby Kenney Midyear Examination Friday 7th December: 7:00-10:00 PM
MATH 3030, Abstract Algebra FALL 2012 Toby Kenney Midyear Examination Friday 7th December: 7:00-10:00 PM Basic Questions 1. Compute the factor group Z 3 Z 9 / (1, 6). The subgroup generated by (1, 6) is
More informationSeries of Integers in Arithmetic Progression with a Common Property of Two Parts of Equal Sums
IOSR Journal of Mathematics (IOSR-JM) e-issn: 78-578, p-issn: 39-765X. Volume, Issue Ver. III (Mar. - Apr. 06), PP 37-4 www.iosrjournals.org Series of Integers in Arithmetic Progression with a Common Property
More informationALG 4.0 Number Theory Algorithms:
Algorithms Professor John Reif ALG 4.0 Number Theory Algorithms: (a) GCD (b) Multiplicative Inverse (c) Fermat & Euler's Theorems (d) Public Key Cryptographic Systems (e) Primality Testing Greatest Common
More informationLECTURE NOTES IN CRYPTOGRAPHY
1 LECTURE NOTES IN CRYPTOGRAPHY Thomas Johansson 2005/2006 c Thomas Johansson 2006 2 Chapter 1 Abstract algebra and Number theory Before we start the treatment of cryptography we need to review some basic
More informationRSA Cryptosystem and Factorization
RSA Cryptosystem and Factorization D. J. Guan Department of Computer Science National Sun Yat Sen University Kaoshiung, Taiwan 80424 R. O. C. guan@cse.nsysu.edu.tw August 25, 2003 RSA Cryptosystem was
More informationNumber Theory Marathon. Mario Ynocente Castro, National University of Engineering, Peru
Number Theory Marathon Mario Ynocente Castro, National University of Engineering, Peru 1 2 Chapter 1 Problems 1. (IMO 1975) Let f(n) denote the sum of the digits of n. Find f(f(f(4444 4444 ))). 2. Prove
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 informationTHE JOHNS HOPKINS UNIVERSITY Faculty of Arts and Sciences FINAL EXAM - FALL SESSION ADVANCED ALGEBRA I.
THE JOHNS HOPKINS UNIVERSITY Faculty of Arts and Sciences FINAL EXAM - FALL SESSION 2006 110.401 - ADVANCED ALGEBRA I. Examiner: Professor C. Consani Duration: take home final. No calculators allowed.
More informationSydney University Mathematical Society Problems Competition Solutions.
Sydney University Mathematical Society Problems Competition 005 Solutions 1 Suppose that we look at the set X n of strings of 0 s and 1 s of length n Given a string ɛ = (ɛ 1,, ɛ n ) X n, we are allowed
More information1. multiplication is commutative and associative;
Chapter 4 The Arithmetic of Z In this chapter, we start by introducing the concept of congruences; these are used in our proof (going back to Gauss 1 ) that every integer has a unique prime factorization.
More informationLecture 7.4: Divisibility and factorization
Lecture 7.4: Divisibility and factorization Matthew Macauley Department of Mathematical Sciences Clemson University http://www.math.clemson.edu/~macaule/ Math 4120, Modern Algebra M. Macauley (Clemson)
More informationM2P4. Rings and Fields. Mathematics Imperial College London
M2P4 Rings and Fields Mathematics Imperial College London ii As lectured by Professor Alexei Skorobogatov and humbly typed by as1005@ic.ac.uk. CONTENTS iii Contents 1 Basic Properties Of Rings 1 2 Factorizing
More informationMATH 145 Algebra, Solutions to Assignment 4
MATH 145 Algebra, Solutions to Assignment 4 1: a) Find the inverse of 178 in Z 365. Solution: We find s and t so that 178s + 365t = 1, and then 178 1 = s. The Euclidean Algorithm gives 365 = 178 + 9 178
More informationOn the indecomposability of polynomials
On the indecomposability of polynomials Andrej Dujella, Ivica Gusić and Robert F. Tichy Abstract Applying a combinatorial lemma a new sufficient condition for the indecomposability of integer polynomials
More informationQuizzes for Math 401
Quizzes for Math 401 QUIZ 1. a) Let a,b be integers such that λa+µb = 1 for some inetegrs λ,µ. Prove that gcd(a,b) = 1. b) Use Euclid s algorithm to compute gcd(803, 154) and find integers λ,µ such that
More informationOur Number Theory Textbook
Our Number Theory Textbook Math 311: Fall 2015 December, 2015 Contents 1 Divisibility 2 M. Gonsalves, L. Lewis.......................... 2 1.1 Introduction.............................. 2 1.2 Glossary
More informationPROBLEMS ON CONGRUENCES AND DIVISIBILITY
PROBLEMS ON CONGRUENCES AND DIVISIBILITY 1. Do there exist 1,000,000 consecutive integers each of which contains a repeated prime factor? 2. A positive integer n is powerful if for every prime p dividing
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 informationNumber Theory. Final Exam from Spring Solutions
Number Theory. Final Exam from Spring 2013. Solutions 1. (a) (5 pts) Let d be a positive integer which is not a perfect square. Prove that Pell s equation x 2 dy 2 = 1 has a solution (x, y) with x > 0,
More informationNOTES ON SIMPLE NUMBER THEORY
NOTES ON SIMPLE NUMBER THEORY DAMIEN PITMAN 1. Definitions & Theorems Definition: We say d divides m iff d is positive integer and m is an integer and there is an integer q such that m = dq. In this case,
More informationQUADRATIC RINGS PETE L. CLARK
QUADRATIC RINGS PETE L. CLARK 1. Quadratic fields and quadratic rings Let D be a squarefree integer not equal to 0 or 1. Then D is irrational, and Q[ D], the subring of C obtained by adjoining D to Q,
More informationNotes on Systems of Linear Congruences
MATH 324 Summer 2012 Elementary Number Theory Notes on Systems of Linear Congruences In this note we will discuss systems of linear congruences where the moduli are all different. Definition. Given the
More informationARITHMETIC PROGRESSIONS IN CYCLES OF QUADRATIC POLYNOMIALS
ARITHMETIC PROGRESSIONS IN CYCLES OF QUADRATIC POLYNOMIALS TIMO ERKAMA It is an open question whether n-cycles of complex quadratic polynomials can be contained in the field Q(i) of complex rational numbers
More informationMathematics for Cryptography
Mathematics for Cryptography Douglas R. Stinson David R. Cheriton School of Computer Science University of Waterloo Waterloo, Ontario, N2L 3G1, Canada March 15, 2016 1 Groups and Modular Arithmetic 1.1
More informationIntroduction Non-uniqueness of factorization in A[x]... 66
Abstract In this work, we study the factorization in A[x], where A is an Artinian local principal ideal ring (briefly SPIR), whose maximal ideal, (t), has nilpotency h: this is not a Unique Factorization
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 informationEighth Homework Solutions
Math 4124 Wednesday, April 20 Eighth Homework Solutions 1. Exercise 5.2.1(e). Determine the number of nonisomorphic abelian groups of order 2704. First we write 2704 as a product of prime powers, namely
More informationChapter 5. Modular arithmetic. 5.1 The modular ring
Chapter 5 Modular arithmetic 5.1 The modular ring Definition 5.1. Suppose n N and x, y Z. Then we say that x, y are equivalent modulo n, and we write x y mod n if n x y. It is evident that equivalence
More informationAlgebraic Systems, Fall 2012, Skeleton notes as of 11/16/12
Algebraic Systems, Fall 2012, Skeleton notes as of 11/16/12 1. Algebraic Properties of the Integers Definition 1.1. A statement is a sentence that can be assigned a truth value. (In general there is a
More informationTHE NUMBERS THAT CAN BE REPRESENTED BY A SPECIAL CUBIC POLYNOMIAL
Commun. Korean Math. Soc. 25 (2010), No. 2, pp. 167 171 DOI 10.4134/CKMS.2010.25.2.167 THE NUMBERS THAT CAN BE REPRESENTED BY A SPECIAL CUBIC POLYNOMIAL Doo Sung Park, Seung Jin Bang, and Jung Oh Choi
More informationFACTOR GRAPH OF NON-COMMUTATIVE RING
International Journal of Advanced Research in Engineering and Technology (IJARET) Volume 9, Issue 6, November - December 2018, pp. 178 183, Article ID: IJARET_09_06_019 Available online at http://www.iaeme.com/ijaret/issues.asp?jtype=ijaret&vtype=9&itype=6
More informationGaussian integers. 1 = a 2 + b 2 = c 2 + d 2.
Gaussian integers 1 Units in Z[i] An element x = a + bi Z[i], a, b Z is a unit if there exists y = c + di Z[i] such that xy = 1. This implies 1 = x 2 y 2 = (a 2 + b 2 )(c 2 + d 2 ) But a 2, b 2, c 2, d
More informationSelected Math 553 Homework Solutions
Selected Math 553 Homework Solutions HW6, 1. Let α and β be rational numbers, with α 1/2, and let m > 0 be an integer such that α 2 mβ 2 = 1 δ where 0 δ < 1. Set ǫ:= 1 if α 0 and 1 if α < 0. Show that
More informationMATH 431 PART 2: POLYNOMIAL RINGS AND FACTORIZATION
MATH 431 PART 2: POLYNOMIAL RINGS AND FACTORIZATION 1. Polynomial rings (review) Definition 1. A polynomial f(x) with coefficients in a ring R is n f(x) = a i x i = a 0 + a 1 x + a 2 x 2 + + a n x n i=0
More informationChapter 9, Additional topics for integral domains
Chapter 9, Additional topics for integral domains Many times we have mentioned that theorems we proved could be done much more generally they only required some special property like unique factorization,
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 informationNew algebraic decoding method for the (41, 21,9) quadratic residue code
New algebraic decoding method for the (41, 21,9) quadratic residue code Mohammed M. Al-Ashker a, Ramez Al.Shorbassi b a Department of Mathematics Islamic University of Gaza, Palestine b Ministry of education,
More informationHomework 9 Solutions to Selected Problems
Homework 9 Solutions to Selected Problems June 11, 2012 1 Chapter 17, Problem 12 Since x 2 + x + 4 has degree 2 and Z 11 is a eld, we may use Theorem 17.1 and show that f(x) is irreducible because it has
More informationRepeated-Root Self-Dual Negacyclic Codes over Finite Fields
Journal of Mathematical Research with Applications May, 2016, Vol. 36, No. 3, pp. 275 284 DOI:10.3770/j.issn:2095-2651.2016.03.004 Http://jmre.dlut.edu.cn Repeated-Root Self-Dual Negacyclic Codes over
More informationOSTROWSKI S THEOREM FOR Q(i)
OSTROWSKI S THEOREM FOR Q(i) KEITH CONRAD We will extend Ostrowki s theorem from Q to the quadratic field Q(i). On Q, every nonarchimedean absolute value is equivalent to the p-adic absolute value for
More informationFactorization in Domains
Last Time Chain Conditions and s Uniqueness of s The Division Algorithm Revisited in Domains Ryan C. Trinity University Modern Algebra II Last Time Chain Conditions and s Uniqueness of s The Division Algorithm
More information