AMBIGUOUS CLASSES IN QUADRATIC FIELDS


 Esther Whitehead
 2 years ago
 Views:
Transcription
1 MATHEMATICS OF COMPUTATION VOLUME, NUMBER 0 JULY 99, PAGES 0 AMBIGUOUS CLASSES IN QUADRATIC FIELDS R. A. MOLLIN Dedicated to the memory ofd. H. Lehmer Abstract. We provide sufficient conditions for the class group of a quadratic field (with positive or negative discriminant) to be generated by ambiguous ideals. This investigation was motivated by a recent result of F. HalterKoch, which we show is false.. Introduction The principal result is the provision of sufficient conditions for the class group of quadratic fields to be generated by certain prescribed ambiguous ideals in terms of certain canonical quadratic polynomials. We were motivated by the principal result of [], which contains a serious error. We therefore provide a counterexample to Theorem. of [], which motivates the discussion. Although the aforementioned result is false, we provide a list (which we conjecture to be complete) of all the polynomials which satisfy the prime producing hypothesis (but not necessarily the conclusion) of []. We maintain that this is of interest in its own right.. Notation and preliminaries Let Q(Vd) be a quadratic field, where d is a (positive or negative) squarefree integer, and let A = 4d/a be its discriminant, where a = if d = (mod 4) and a = otherwise. Thus the radicand d is the squarefree kernel of A. Let [a, ß] = az ßZ ; then the maximal order cfa of Q(Vd) is [, coa], where coa = (a  + \fd)/a. It is well known that / is a nonzero ideal in cfa if and only if I = [a, b + ccoa], where a, b, c e Z with c\b, c\a and ac\n(b+ccoa), where N is the norm, i.e., N(a) = aä, where a. is the algebraic conjugate of a. The ideal / is called primitive if c = and a > 0. In this case, a is the smallest positive integer in / and a = N(I) = (rfa: I). Let CA denote the class group of cfa. Equivalence in CA is denoted by / ~ J (by which we mean that there are nonzero elements ai and a of cfa with axi = aj). We denote the order of CA by ha, the class number of cfa. Principal ideals (generated by a single element a) are denoted by (a). The following is well known. Received by the editor May 9, 99 and, in revised form, September 0, Mathematics Subject Classification. Primary R, R9, Y40. Key words and phrases. Ambiguous ideal, quadratic field, class number, exponent. 99 American Mathematical Society 008/9 $.00 + $. per page
2 R. A. MOLLIN Theorem.. Every class of CA contains a primitive ideal I with N(I) < MA, where MA = < \ ypm ifa<0,,_ \y/äß if A>0. Based upon the above, the following improves upon Theorem. of []. Theorem.. The class group CA is generated by the primitive prime ideals a with N(>) < MA. Proof. By Theorem. there is an ideal / in each class with N(I) < MA. Each such ideal is divisible by a primitive prime ideal, and N(9 ) < N(I) < MA. The result now follows. D Throughout the paper, if q is a positive squarefree divisor of A, then f? denotes the unique cfaprime ideal above q, or simply if no confusion with other divisors of A arises.. Prime quadratics As mentioned above, we begin with a counterexample to Theorem. of [], which motivates the discussion leading to criteria for CA to be generated by ambiguous ideals (given in terms of certain local primality conditions for the polynomials which we now define). Definition.. Let q be a positive squarefree divisor of a discriminant A; then fn,,w = ax + (a \)qx + ((« )<  A), where a = if 4q divides A and a = otherwise. Also, set AA = li(mal)]. Example.. The claim of [, Theorem., p. ] is that if, under the assumption of Definition., we have that \FA<q(x)\ is or prime for all integers x with 0 < x < AA, then Ck = {, <S} The following example contradicts this assertion. Let A = 8 = 9 =  4 and q = ; then FA_q(x) = x+ *. Here, [MA\ = and AA =, so \FA,q(x)\ =, 9, 89 and 9 for x = 0,,, and, respectively. However, CA ^ {, ^}. In fact f) ~ and CA = (é'i) = (áf), where (x) denotes the cyclic group generated by x. Remark.. For the interested reader the error in the proof of [, Theorem., p. ] lies in the assumption that (in HalterKoch's notation) J^ is primitive. (For instance, in Example., fq = &xi and Ss = ß; whence, J^f' = f^ds is definitely not primitive.) We have compiled in Table. a list of all positive radicands for which \FA,q(x)\ is or prime for all integers x with 0 < x < AA. Therein, the radicands 08, 9 and 08 are also counterexamples to [, Theorem.]. Now we prove a result which gives sufficient conditions for CA to be generated by ambiguous ideals. First we need a preliminary result which generalizes [, Lemma., p. ].
3 ambiguous classes in quadratic fields Lemma.. Let q > be a squarefree divisor of a discriminant A. If p is a prime, then FAq(x) = 0 (mod p) for some integer x > 0 if and only if (A/p) /  and p does not divide q. Proof. If (A/p) t  and p = does not divide q, then choose x = 0 if (q(a  )  A)4q is even, and x = otherwise. Now assume p >. Thus, there is an integer y such that A/q = qy (mod p). By replacing y by p  y if necessary, we may assume that y = a  (mod ). Setting y = x + a , we get that A/q = q(x + a  I) (mod p), i.e., ., Fa,<i(x) = qxl + qx(a l) + j((a l)q  A) = 0 (mod p). Conversely, if FA>q(x) = 0 (mod p), then A = [q(x + a  l)] (mod p), whence (A/p) # . Moreover, if p divides q, then p divides A, whence p =. Therefore, A = 0 (mod 4). If A = 8 (mod ), then qx  A/4q is odd for all x > 0, a contradiction. Therefore, A = (mod ), in which case (q A)/4q must be even (since a = and q is even in this case). Therefore, q = A (mod ), whence (q/) = (mod 4), which is absurd. D Theorem.. Let q > for < i < n be pairwise relatively prime, squarefree divisors of a discriminant A. If, for each prime p < MA with (A/p) ^  and p ^ q, for any positive i < n there exists a q = Ylie,? Qi for some S? ç {,,...,«} such that \FA<q(x)\  p for some nonnegative integer x, then CA = n}. Proof. By Theorem., CA is generated by the primitive prime ideals P with N( P) = p < MA and (A/p) / . If p / q for any positive i < n, then by hypothesis, IFa.^MI =P for some integer x > 0 (with q as above). Therefore, \(q(x + a I) A/q) =p. Thus, \[(q(x + a  l))a]=pq. Now set {qx if a =, qx + (ql)/ if a and q is odd, q(x+l)/ if a = and q is even. Hence, M  [pq, b + coa] is primitive with N(b + coa) = pq, i.e., ^f ~ (since, in fact, W (b + coa)), whence P and the result follows. D Remark.. The case where n = in Theorem. provides a correct version of Theorem. of []. We note that the radicand 8 in Example. does not allow us to choose q  because neither \FAX(x)\ nor FA,q(x)\ yields the value or for any nonnegative integer x < AA =. However, if we choose q = or q =, then the hypothesis of Theorem. is satisfied, since IFa,() = and Fa,() =, with the observation that and are the only noninert primes less than MA. Therefore, we arrive at the correct conclusion, i.e., C8 = m = (S,). Remark.. Theorem. of [] becomes correct under the assumption q = or q prime, < >0, Q \ f Now we give a sequence of examples to illustrate Theorem.. Example.. Let A = = 89 = 4 + and set q =. Since [MA\ = and the only noninert prime p < MA with p ^ is p , then
4 8 R. A. MOLLIN the fact that FA xi(l) = implies that the hypothesis of Theorem. holds. Thus, CA = i<sù). Example.. Let A = 4 9 = 4 ; then [MA\ = and AA =. Let <?i = and # =. Since FA^X(l) =, which is the only prime p < MA, p j= with p noninert, then by Theorem. ca = m x i&). Example.4. Let A = 4 = 4 ; then [MA\ = 0 and AA = 4. If qx =, q  and qi =, then the only noninert primes p < MA with p t q for i =,, are,, and 9. Since FA,i(l) =, FAX0(0) =, ^a,is()= and Fa,() = 9, then by Theorem. CA = ( f> x (Ss) x (<f). The following consequences of Theorem. show its high degree of applicability to results in the literature. Corollary. [, Theorem, p. ]. If A = 4(4l ± ) > 8 and FA>(.x) = \x  d/\ is or prime for all integers x with 0 < x < \fd/, then ha\. Proof. By Theorem. and Lemma., CA = {, (S). ~, since V((/ ± + VK)/)\ =. D Corollary. [, Theorem, p. ]. If A = 4((l + l) ± ) with I > 0 and IFa^MI = x + x + (  A)/ is or prime for all integers x with 0<x< (VÄ+ l)/, then ha=l. Proof. By Theorem. and Lemma., CA However, <S ~, since \N(l+ +^) =. D The following is [, Conjecture, p. 8]. Corollary.. Let A = I  q = (mod 8), where q is an odd prime dividing I U \Fis,q(x)\ = \qx + qx + (q  A)/4q\ is or prime for all integers x with 0 < jc < y/d  /4  \, then ha =. Proof. By Theorem. and Lemma., CA = {, Sq}. ~, since N(l + \/Ä) = q. D The following is [, Conjecture 4, p. 9]. Corollary.4. Let A I ± 4q, where q is an odd prime dividing I. If \qx + qx + (q  A)/4<? is or prime for all integers x with 0 < x < (>/A~=T+l)/, then ha=\. Proof. Since \N((l + \/Ä)/)\ = q, then the result follows as above. Remark.4. The types of forms in Corollaries..4 are called extended RichaudDegert (ERD)types, i.e., those of the form d = A/< = I + r, where r divides 4/. In [, 4] we found all such A's with ha = under the assumption of a suitable Riemann hypothesis, and in [] we were able to eliminate the Riemann hypothesis and show that our list is complete (with one possible exceptional value of A, whose existence would be a counterexample to that Riemann hypothesis). The following answers a question about ERD types posed in [, Remark, p. ]. D
5 AMBIGUOUS CLASSES IN QUADRATIC FIELDS 9 Table.. This table lists all radicands 0 < d < 0 such that Fa,9(x) is or prime for all nonnegative integers x < AA, where q is a positive squarefree divisor of the discriminant A. G Example.. Let A = 9 = ; then [MA\ =, AA =. The only noninert prime p <, p ^, is p = and FA () , so by Theorem., CA = (Si). We note that 9 is not an ERDtype. The only other nonerd type appearing in Table. is A = 4. (Note that since Fr4), n(0) =, the only noninert prime p < M^x (with p ^ ), then C4 = (<SXX)). Although the principal result of [] has been shown to be false herein, it is still of interest in its own right to determine all those positive A's and q's such that FAq(x) is or prime for 0 < x < AA. Some serious computational evidence leads us to pose: Conjecture.. Table. is complete, i.e., if d > 44, then \FA,q(x)\ is composite for some nonnegative x < AA. Remark.. It is interesting to note that the only ERD types d, with class number, that do not appear in Table. are d,, 4, 8, 0,, 9, and. Moreover, the only nonerd types which are in Table. are 4 and 9. Also, the values which have class number bigger than are 0,,, 0,, 4,, 8, 8, 0, 0,, 8,, 8,, 0, 8, 8, 8,,,, 40, 4, 8, 9, 9, 08, 4, 8, 9, 08,, 9 and 44, all of which have class number. We note that if FA,q(x) is or prime for all integers x with 0 < x < AA, we cannot even guarantee that ha <. Given Remark.4 and Conjecture. above, we must turn to negative discriminants.
6 0 R. A. MOLLIN Example.. Let A = 0 =  and set q = 0, whence \_MA\ =, and so AA =. Also, Fa,,(jc) = 0x + =,,, 0,, and for x = 0,,,, 4, and, respectively. However, ha = 4. In fact, then CA ^ {, So}. If in Theorem. we take qx = and <? =, then FA(0) =, which is the only noninert prime less than MA (other than and ), so the hypothesis of Theorem. is satisfied and we have that CA = (if) x ( f). We observe that both FA (0) and FA (0) are composite. This illustrates that the generation of Ca by ambiguous ideals dividing q, in general, has less to do with the primeproducing capacity of FA>q(x) for an initial string of x values, as asserted in [], than it does with its local capacity to "hit" certain primes. We have made significant progress with negative discriminants and quadratic polynomials, which will be published at a later date. Acknowledgment The author's research is supported by NSERC Canada grant #A8484. Moreover, the author welcomes the opportunity to thank Mike Jacobson, a student of Hugh Williams, for doing the computations which led to Table.. Bibliography. F. HalterKoch, Primeproducing quadratic polynomials and class numbers of quadratic orders, Computational Number Theory (A. Pethö, M. Pohst, H. C. Williams, and H. Zimmer, eds.), de Gruyter, Berlin, 99, pp S. Louboutin, R. A. Mollin, and H. C. Williams, Class numbers of real quadratic fields, continued fractions, reduced ideals, primeproducing quadratic polynomials and quadratic residue covers, Cañad. J. Math. 44 (99), 9.. R. A. Mollin and H. C. Williams, Prime producing quadratic polynomials and real quadratic fields of class number one, Number Theory (J M. De Koninck and C Levesque, eds.), de Gruyter, Berlin, 989, pp _, On prime valued polynomials and class numbers of real quadratic fields, Nagoya Math. J. (988), 4.. _, Solution of the class number one problem for real quadratic fields of extended Richaud Degert type (with one possible exception), Number Theory (R. A. Mollin, ed.), de Gruyter, Berlin, 990, pp Department of Mathematics, University of Calgary, Calgary, Alberta, Canada TN N4 address :
CONTINUED FRACTIONS AND PELL S EQUATION. Contents 1. Continued Fractions 1 2. Solution to Pell s Equation 9 References 12
CONTINUED FRACTIONS AND PELL S EQUATION SEUNG HYUN YANG Abstract. In this REU paper, I will use some important characteristics of continued fractions to give the complete set of solutions to Pell s equation.
More informationPRIME FACTORS OF CONSECUTIVE INTEGERS
PRIME FACTORS OF CONSECUTIVE INTEGERS MARK BAUER AND MICHAEL A. BENNETT Abstract. This note contains a new algorithm for computing a function f(k) introduced by Erdős to measure the minimal gap size in
More information2 Primality and Compositeness Tests
Int. J. Contemp. Math. Sciences, Vol. 3, 2008, no. 33, 16351642 On Factoring R. A. Mollin Department of Mathematics and Statistics University of Calgary, Calgary, Alberta, Canada, T2N 1N4 http://www.math.ucalgary.ca/
More informationMATH 289 PROBLEM SET 4: NUMBER THEORY
MATH 289 PROBLEM SET 4: NUMBER THEORY 1. The greatest common divisor If d and n are integers, then we say that d divides n if and only if there exists an integer q such that n = qd. Notice that if d divides
More informationEven Number: An integer n is said to be even if it has the form n = 2k for some integer k. That is, n is even if and only if n divisible by 2.
MATH 337 Proofs Dr. Neal, WKU This entire course requires you to write proper mathematical proofs. All proofs should be written elegantly in a formal mathematical style. Complete sentences of explanation
More information11 Ideals. 11.1 Revisiting Z
11 Ideals The presentation here is somewhat different than the text. In particular, the sections do not match up. We have seen issues with the failure of unique factorization already, e.g., Z[ 5] = O Q(
More information3.1 The Definition and Some Basic Properties. We identify the natural class of integral domains in which unique factorization of ideals is possible.
Chapter 3 Dedekind Domains 3.1 The Definition and Some Basic Properties We identify the natural class of integral domains in which unique factorization of ideals is possible. 3.1.1 Definition A Dedekind
More informationIntroduction to finite fields
Introduction to finite fields Topics in Finite Fields (Fall 2013) Rutgers University Swastik Kopparty Last modified: Monday 16 th September, 2013 Welcome to the course on finite fields! This is aimed at
More informationElementary Number Theory and Methods of Proof. CSE 215, Foundations of Computer Science Stony Brook University http://www.cs.stonybrook.
Elementary Number Theory and Methods of Proof CSE 215, Foundations of Computer Science Stony Brook University http://www.cs.stonybrook.edu/~cse215 1 Number theory Properties: 2 Properties of integers (whole
More informationOn the largest prime factor of x 2 1
On the largest prime factor of x 2 1 Florian Luca and Filip Najman Abstract In this paper, we find all integers x such that x 2 1 has only prime factors smaller than 100. This gives some interesting numerical
More informationEULER S THEOREM. 1. Introduction Fermat s little theorem is an important property of integers to a prime modulus. a p 1 1 mod p.
EULER S THEOREM KEITH CONRAD. Introduction Fermat s little theorem is an important property of integers to a prime modulus. Theorem. (Fermat). For prime p and any a Z such that a 0 mod p, a p mod p. If
More informationk, then n = p2α 1 1 pα k
Powers of Integers An integer n is a perfect square if n = m for some integer m. Taking into account the prime factorization, if m = p α 1 1 pα k k, then n = pα 1 1 p α k k. That is, n is a perfect square
More informationPrimality  Factorization
Primality  Factorization Christophe Ritzenthaler November 9, 2009 1 Prime and factorization Definition 1.1. An integer p > 1 is called a prime number (nombre premier) if it has only 1 and p as divisors.
More informationMATH10040 Chapter 2: Prime and relatively prime numbers
MATH10040 Chapter 2: Prime and relatively prime numbers Recall the basic definition: 1. Prime numbers Definition 1.1. Recall that a positive integer is said to be prime if it has precisely two positive
More information3.7 Complex Zeros; Fundamental Theorem of Algebra
SECTION.7 Complex Zeros; Fundamental Theorem of Algebra 2.7 Complex Zeros; Fundamental Theorem of Algebra PREPARING FOR THIS SECTION Before getting started, review the following: Complex Numbers (Appendix,
More informationPYTHAGOREAN TRIPLES KEITH CONRAD
PYTHAGOREAN TRIPLES KEITH CONRAD 1. Introduction A Pythagorean triple is a triple of positive integers (a, b, c) where a + b = c. Examples include (3, 4, 5), (5, 1, 13), and (8, 15, 17). Below is an ancient
More informationU.C. Berkeley CS276: Cryptography Handout 0.1 Luca Trevisan January, 2009. Notes on Algebra
U.C. Berkeley CS276: Cryptography Handout 0.1 Luca Trevisan January, 2009 Notes on Algebra These notes contain as little theory as possible, and most results are stated without proof. Any introductory
More informationFACTORING POLYNOMIALS IN THE RING OF FORMAL POWER SERIES OVER Z
FACTORING POLYNOMIALS IN THE RING OF FORMAL POWER SERIES OVER Z DANIEL BIRMAJER, JUAN B GIL, AND MICHAEL WEINER Abstract We consider polynomials with integer coefficients and discuss their factorization
More informationI. GROUPS: BASIC DEFINITIONS AND EXAMPLES
I GROUPS: BASIC DEFINITIONS AND EXAMPLES Definition 1: An operation on a set G is a function : G G G Definition 2: A group is a set G which is equipped with an operation and a special element e G, called
More informationContinued Fractions and the Euclidean Algorithm
Continued Fractions and the Euclidean Algorithm Lecture notes prepared for MATH 326, Spring 997 Department of Mathematics and Statistics University at Albany William F Hammond Table of Contents Introduction
More informationFACTORING IN QUADRATIC FIELDS. 1. Introduction. This is called a quadratic field and it has degree 2 over Q. Similarly, set
FACTORING IN QUADRATIC FIELDS KEITH CONRAD For a squarefree integer d other than 1, let 1. Introduction K = Q[ d] = {x + y d : x, y Q}. This is called a quadratic field and it has degree 2 over Q. Similarly,
More informationThe Dirichlet Unit Theorem
Chapter 6 The Dirichlet Unit Theorem As usual, we will be working in the ring B of algebraic integers of a number field L. Two factorizations of an element of B are regarded as essentially the same if
More information8 Primes and Modular Arithmetic
8 Primes and Modular Arithmetic 8.1 Primes and Factors Over two millennia ago already, people all over the world were considering the properties of numbers. One of the simplest concepts is prime numbers.
More informationAPPLICATIONS OF THE ORDER FUNCTION
APPLICATIONS OF THE ORDER FUNCTION LECTURE NOTES: MATH 432, CSUSM, SPRING 2009. PROF. WAYNE AITKEN In this lecture we will explore several applications of order functions including formulas for GCDs and
More informationSolutions to Homework Set 3 (Solutions to Homework Problems from Chapter 2)
Solutions to Homework Set 3 (Solutions to Homework Problems from Chapter 2) Problems from 21 211 Prove that a b (mod n) if and only if a and b leave the same remainder when divided by n Proof Suppose a
More informationCS 103X: Discrete Structures Homework Assignment 3 Solutions
CS 103X: Discrete Structures Homework Assignment 3 s Exercise 1 (20 points). On wellordering and induction: (a) Prove the induction principle from the wellordering principle. (b) Prove the wellordering
More informationFACTORING AFTER DEDEKIND
FACTORING AFTER DEDEKIND KEITH CONRAD Let K be a number field and p be a prime number. When we factor (p) = po K into prime ideals, say (p) = p e 1 1 peg g, we refer to the data of the e i s, the exponents
More informationOn Generalized Fermat Numbers 3 2n +1
Applied Mathematics & Information Sciences 4(3) (010), 307 313 An International Journal c 010 Dixie W Publishing Corporation, U. S. A. On Generalized Fermat Numbers 3 n +1 Amin Witno Department of Basic
More informationPYTHAGOREAN NUMBERS. Bowling Green State University, Bowling Green, OH (Submitted February 1988)
S u p r i y a Mohanty a n d S. P. Mohanty Bowling Green State University, Bowling Green, OH 434030221 (Submitted February 1988) Let M be a right angled triangle with legs x and y and hypotenuse z. Then
More informationNumber Theory Hungarian Style. Cameron Byerley s interpretation of Csaba Szabó s lectures
Number Theory Hungarian Style Cameron Byerley s interpretation of Csaba Szabó s lectures August 20, 2005 2 0.1 introduction Number theory is a beautiful subject and even cooler when you learn about it
More informationHomework until Test #2
MATH31: Number Theory Homework until Test # Philipp BRAUN Section 3.1 page 43, 1. It has been conjectured that there are infinitely many primes of the form n. Exhibit five such primes. Solution. Five such
More informationInstructor: Bobby Kleinberg Lecture Notes, 5 May The MillerRabin Randomized Primality Test
Introduction to Algorithms (CS 482) Cornell University Instructor: Bobby Kleinberg Lecture Notes, 5 May 2010 The MillerRabin Randomized Primality Test 1 Introduction Primality testing is an important
More informationINTRODUCTION TO PROOFS: HOMEWORK SOLUTIONS
INTRODUCTION TO PROOFS: HOMEWORK SOLUTIONS STEVEN HEILMAN Contents 1. Homework 1 1 2. Homework 2 6 3. Homework 3 10 4. Homework 4 16 5. Homework 5 19 6. Homework 6 21 7. Homework 7 25 8. Homework 8 28
More informationThe squarefree kernel of x 2n a 2n
ACTA ARITHMETICA 101.2 (2002) The squarefree kernel of x 2n a 2n by Paulo Ribenboim (Kingston, Ont.) Dedicated to my longtime friend and collaborator Wayne McDaniel, at the occasion of his retirement
More informationInternational Journal of Information Technology, Modeling and Computing (IJITMC) Vol.1, No.3,August 2013
FACTORING CRYPTOSYSTEM MODULI WHEN THE COFACTORS DIFFERENCE IS BOUNDED Omar Akchiche 1 and Omar Khadir 2 1,2 Laboratory of Mathematics, Cryptography and Mechanics, Fstm, University of Hassan II MohammediaCasablanca,
More informationIs this number prime? Berkeley Math Circle Kiran Kedlaya
Is this number prime? Berkeley Math Circle 2002 2003 Kiran Kedlaya Given a positive integer, how do you check whether it is prime (has itself and 1 as its only two positive divisors) or composite (not
More information3. Applications of Number Theory
3. APPLICATIONS OF NUMBER THEORY 163 3. Applications of Number Theory 3.1. Representation of Integers. Theorem 3.1.1. Given an integer b > 1, every positive integer n can be expresses uniquely as n = a
More informationPrimitive Prime Divisors of FirstOrder Polynomial Recurrence Sequences
Primitive Prime Divisors of FirstOrder Polynomial Recurrence Sequences Brian Rice brice@hmc.edu July 19, 2006 Abstract The question of which terms of a recurrence sequence fail to have primitive prime
More informationOn the Exponential Diophantine Equation (12m 2 + 1) x + (13m 2 1) y = (5m) z
International Journal of Algebra, Vol. 9, 2015, no. 6, 261272 HIKARI Ltd, www.mhikari.com http://dx.doi.org/10.12988/ija.2015.5529 On the Exponential Diophantine Equation (12m 2 + 1) x + (13m 2 1) y
More information36 Fields of Rational Functions
36 Fields of Rational Functions The reader might have missed the familiar quotient rule (\f(f,g)) = f g fg in Lemma 35.5. It was missing because f is not a polynomial. g We now introduce these quotients
More informationCyclotomic Extensions
Chapter 7 Cyclotomic Extensions A cyclotomic extension Q(ζ n ) of the rationals is formed by adjoining a primitive n th root of unity ζ n. In this chapter, we will find an integral basis and calculate
More information12 Greatest Common Divisors. The Euclidean Algorithm
Arkansas Tech University MATH 4033: Elementary Modern Algebra Dr. Marcel B. Finan 12 Greatest Common Divisors. The Euclidean Algorithm As mentioned at the end of the previous section, we would like to
More informationSUBGROUPS OF CYCLIC GROUPS. 1. Introduction In a group G, we denote the (cyclic) group of powers of some g G by
SUBGROUPS OF CYCLIC GROUPS KEITH CONRAD 1. Introduction In a group G, we denote the (cyclic) group of powers of some g G by g = {g k : k Z}. If G = g, then G itself is cyclic, with g as a generator. Examples
More informationInteger roots of quadratic and cubic polynomials with integer coefficients
Integer roots of quadratic and cubic polynomials with integer coefficients Konstantine Zelator Mathematics, Computer Science and Statistics 212 Ben Franklin Hall Bloomsburg University 400 East Second Street
More informationON GALOIS REALIZATIONS OF THE 2COVERABLE SYMMETRIC AND ALTERNATING GROUPS
ON GALOIS REALIZATIONS OF THE 2COVERABLE SYMMETRIC AND ALTERNATING GROUPS DANIEL RABAYEV AND JACK SONN Abstract. Let f(x) be a monic polynomial in Z[x] with no rational roots but with roots in Q p for
More informationNotes on Factoring. MA 206 Kurt Bryan
The General Approach Notes on Factoring MA 26 Kurt Bryan Suppose I hand you n, a 2 digit integer and tell you that n is composite, with smallest prime factor around 5 digits. Finding a nontrivial factor
More informationThe cyclotomic polynomials
The cyclotomic polynomials Notes by G.J.O. Jameson 1. The definition and general results We use the notation e(t) = e 2πit. Note that e(n) = 1 for integers n, e(s + t) = e(s)e(t) for all s, t. e( 1 ) =
More information*.I Zolotareff s Proof of Quadratic Reciprocity
*.I. ZOLOTAREFF S PROOF OF QUADRATIC RECIPROCITY 1 *.I Zolotareff s Proof of Quadratic Reciprocity This proof requires a fair amount of preparations on permutations and their signs. Most of the material
More informationMath 34560 Abstract Algebra I Questions for Section 23: Factoring Polynomials over a Field
Math 34560 Abstract Algebra I Questions for Section 23: Factoring Polynomials over a Field 1. Throughout this section, F is a field and F [x] is the ring of polynomials with coefficients in F. We will
More information(x + a) n = x n + a Z n [x]. Proof. If n is prime then the map
22. A quick primality test Prime numbers are one of the most basic objects in mathematics and one of the most basic questions is to decide which numbers are prime (a clearly related problem is to find
More informationFactoring Dickson polynomials over finite fields
Factoring Dickson polynomials over finite fiels Manjul Bhargava Department of Mathematics, Princeton University. Princeton NJ 08544 manjul@math.princeton.eu Michael Zieve Department of Mathematics, University
More informationOn the numbertheoretic functions ν(n) and Ω(n)
ACTA ARITHMETICA LXXVIII.1 (1996) On the numbertheoretic functions ν(n) and Ω(n) by Jiahai Kan (Nanjing) 1. Introduction. Let d(n) denote the divisor function, ν(n) the number of distinct prime factors,
More informationPOLYNOMIAL RINGS AND UNIQUE FACTORIZATION DOMAINS
POLYNOMIAL RINGS AND UNIQUE FACTORIZATION DOMAINS RUSS WOODROOFE 1. Unique Factorization Domains Throughout the following, we think of R as sitting inside R[x] as the constant polynomials (of degree 0).
More informationCycles in a Graph Whose Lengths Differ by One or Two
Cycles in a Graph Whose Lengths Differ by One or Two J. A. Bondy 1 and A. Vince 2 1 LABORATOIRE DE MATHÉMATIQUES DISCRÉTES UNIVERSITÉ CLAUDEBERNARD LYON 1 69622 VILLEURBANNE, FRANCE 2 DEPARTMENT OF MATHEMATICS
More informationON SEQUENTIAL CONTINUITY OF COMPOSITION MAPPING. 0. Introduction
ON SEQUENTIAL CONTINUITY OF COMPOSITION MAPPING Abstract. In [1] there was proved a theorem concerning the continuity of the composition mapping, and there was announced a theorem on sequential continuity
More informationFactoring of Prime Ideals in Extensions
Chapter 4 Factoring of Prime Ideals in Extensions 4. Lifting of Prime Ideals Recall the basic AKLB setup: A is a Dedekind domain with fraction field K, L is a finite, separable extension of K of degree
More informationSolutions to Practice Problems
Solutions to Practice Problems March 205. Given n = pq and φ(n = (p (q, we find p and q as the roots of the quadratic equation (x p(x q = x 2 (n φ(n + x + n = 0. The roots are p, q = 2[ n φ(n+ ± (n φ(n+2
More informationWILLIAMS NUMBERS OTHMAN ECHI
WILLIAMS NUMBERS OTHMAN ECHI Abstract. Let N be a composite squarefree number; N is said to be a Carmichael number if p 1 divides N 1 for each prime divisor p of N. In [On numbers analogous to the Carmichael
More informationHandout #1: Mathematical Reasoning
Math 101 Rumbos Spring 2010 1 Handout #1: Mathematical Reasoning 1 Propositional Logic A proposition is a mathematical statement that it is either true or false; that is, a statement whose certainty or
More information8 Divisibility and prime numbers
8 Divisibility and prime numbers 8.1 Divisibility In this short section we extend the concept of a multiple from the natural numbers to the integers. We also summarize several other terms that express
More information7. Some irreducible polynomials
7. Some irreducible polynomials 7.1 Irreducibles over a finite field 7.2 Worked examples Linear factors x α of a polynomial P (x) with coefficients in a field k correspond precisely to roots α k [1] of
More informationInteger Factorization using the Quadratic Sieve
Integer Factorization using the Quadratic Sieve Chad Seibert* Division of Science and Mathematics University of Minnesota, Morris Morris, MN 56567 seib0060@morris.umn.edu March 16, 2011 Abstract We give
More informationMODULAR ARITHMETIC. a smallest member. It is equivalent to the Principle of Mathematical Induction.
MODULAR ARITHMETIC 1 Working With Integers The usual arithmetic operations of addition, subtraction and multiplication can be performed on integers, and the result is always another integer Division, on
More informationMATHEMATICAL INDUCTION. Mathematical Induction. This is a powerful method to prove properties of positive integers.
MATHEMATICAL INDUCTION MIGUEL A LERMA (Last updated: February 8, 003) Mathematical Induction This is a powerful method to prove properties of positive integers Principle of Mathematical Induction Let P
More informationGiuga s conjecture on primality
Giuga s conjecture on primality D. Borwein, J. M. Borwein, P. B. Borwein, R. Girgensohn Abstract. G. Giuga conjectured that if an integer n satisfies n 1 k=1 k n 1 1 mod n, then n must be a prime. We survey
More informationLectures on Number Theory. LarsÅke Lindahl
Lectures on Number Theory LarsÅke Lindahl 2002 Contents 1 Divisibility 1 2 Prime Numbers 7 3 The Linear Diophantine Equation ax+by=c 12 4 Congruences 15 5 Linear Congruences 19 6 The Chinese Remainder
More informationOn the greatest and least prime factors of n! + 1, II
Publ. Math. Debrecen Manuscript May 7, 004 On the greatest and least prime factors of n! + 1, II By C.L. Stewart In memory of Béla Brindza Abstract. Let ε be a positive real number. We prove that 145 1
More informationA simple criterion on degree sequences of graphs
Discrete Applied Mathematics 156 (2008) 3513 3517 Contents lists available at ScienceDirect Discrete Applied Mathematics journal homepage: www.elsevier.com/locate/dam Note A simple criterion on degree
More informationDiscrete Mathematics Lecture 3 Elementary Number Theory and Methods of Proof. Harper Langston New York University
Discrete Mathematics Lecture 3 Elementary Number Theory and Methods of Proof Harper Langston New York University Proof and Counterexample Discovery and proof Even and odd numbers number n from Z is called
More informationTHE UNIVERSITY OF TORONTO UNDERGRADUATE MATHEMATICS COMPETITION. In Memory of Robert Barrington Leigh. Saturday, March 5, 2016
THE UNIVERSITY OF TORONTO UNDERGRADUATE MATHEMATICS COMPETITION In Memory of Robert Barrington Leigh Saturday, March 5, 2016 Time: 3 1 2 hours No aids or calculators permitted. The grading is designed
More informationReal Roots of Univariate Polynomials with Real Coefficients
Real Roots of Univariate Polynomials with Real Coefficients mostly written by Christina Hewitt March 22, 2012 1 Introduction Polynomial equations are used throughout mathematics. When solving polynomials
More informationJUST THE MATHS UNIT NUMBER 1.8. ALGEBRA 8 (Polynomials) A.J.Hobson
JUST THE MATHS UNIT NUMBER 1.8 ALGEBRA 8 (Polynomials) by A.J.Hobson 1.8.1 The factor theorem 1.8.2 Application to quadratic and cubic expressions 1.8.3 Cubic equations 1.8.4 Long division of polynomials
More informationit is easy to see that α = a
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 UF. Therefore
More informationSolutions for Practice problems on proofs
Solutions for Practice problems on proofs Definition: (even) An integer n Z is even if and only if n = 2m for some number m Z. Definition: (odd) An integer n Z is odd if and only if n = 2m + 1 for some
More informationPrime Numbers and Irreducible Polynomials
Prime Numbers and Irreducible Polynomials M. Ram Murty The similarity between prime numbers and irreducible polynomials has been a dominant theme in the development of number theory and algebraic geometry.
More informationSUM OF TWO SQUARES JAHNAVI BHASKAR
SUM OF TWO SQUARES JAHNAVI BHASKAR Abstract. I will investigate which numbers can be written as the sum of two squares and in how many ways, providing enough basic number theory so even the unacquainted
More informationAlgebraic and Transcendental Numbers
Pondicherry University July 2000 Algebraic and Transcendental Numbers Stéphane Fischler This text is meant to be an introduction to algebraic and transcendental numbers. For a detailed (though elementary)
More informationIntroduction to Finite Fields (cont.)
Chapter 6 Introduction to Finite Fields (cont.) 6.1 Recall Theorem. Z m is a field m is a prime number. Theorem (Subfield Isomorphic to Z p ). Every finite field has the order of a power of a prime number
More informationDiscrete Mathematics
Slides for Part IA CST 2014/15 Discrete Mathematics Prof Marcelo Fiore Marcelo.Fiore@cl.cam.ac.uk What are we up to? Learn to read and write, and also work with, mathematical
More informationSYSTEMS OF PYTHAGOREAN TRIPLES. Acknowledgements. I would like to thank Professor Laura Schueller for advising and guiding me
SYSTEMS OF PYTHAGOREAN TRIPLES CHRISTOPHER TOBINCAMPBELL Abstract. This paper explores systems of Pythagorean triples. It describes the generating formulas for primitive Pythagorean triples, determines
More informationToday s Topics. Primes & Greatest Common Divisors
Today s Topics Primes & Greatest Common Divisors Prime representations Important theorems about primality Greatest Common Divisors Least Common Multiples Euclid s algorithm Once and for all, what are prime
More informationALGEBRAIC APPROACH TO COMPOSITE INTEGER FACTORIZATION
ALGEBRAIC APPROACH TO COMPOSITE INTEGER FACTORIZATION Aldrin W. Wanambisi 1* School of Pure and Applied Science, Mount Kenya University, P.O box 55350100, Kakamega, Kenya. Shem Aywa 2 Department of Mathematics,
More informationConsequently, for the remainder of this discussion we will assume that a is a quadratic residue mod p.
Computing square roots mod p We now have very effective ways to determine whether the quadratic congruence x a (mod p), p an odd prime, is solvable. What we need to complete this discussion is an effective
More informationPYTHAGOREAN TRIPLES PETE L. CLARK
PYTHAGOREAN TRIPLES PETE L. CLARK 1. Parameterization of Pythagorean Triples 1.1. Introduction to Pythagorean triples. By a Pythagorean triple we mean an ordered triple (x, y, z) Z 3 such that x + y =
More informationElementary Number Theory We begin with a bit of elementary number theory, which is concerned
CONSTRUCTION OF THE FINITE FIELDS Z p S. R. DOTY Elementary Number Theory We begin with a bit of elementary number theory, which is concerned solely with questions about the set of integers Z = {0, ±1,
More informationChapter 1 Basic Number Concepts
Draft of September 2014 Chapter 1 Basic Number Concepts 1.1. Introduction No problems in this section. 1.2. Factors and Multiples 1. Determine whether the following numbers are divisible by 3, 9, and 11:
More informationSign changes of Hecke eigenvalues of Siegel cusp forms of degree 2
Sign changes of Hecke eigenvalues of Siegel cusp forms of degree 2 Ameya Pitale, Ralf Schmidt 2 Abstract Let µ(n), n > 0, be the sequence of Hecke eigenvalues of a cuspidal Siegel eigenform F of degree
More informationNUMBER THEORY. Theorem 1. A number is a square if and only if it has an odd number of factors.
NUMBER THEORY BY THE SPMPS 2013 NUMBER THEORY CLASS Abstract. This paper presents theorems proven by the Number Theory class of the 2013 Summer Program in Mathematical Problem Solving. An appendix is included
More informationCOMPOSITES THAT REMAIN COMPOSITE AFTER CHANGING A DIGIT
COMPOSITES THAT REMAIN COMPOSITE AFTER CHANGING A DIGIT Michael Filaseta Mathematics Department University of South Carolina Columbia, SC 22080001 Mark Kozek Department of Mathematics Whittier College
More informationFactoring Polynomials
Factoring Polynomials Sue Geller June 19, 2006 Factoring polynomials over the rational numbers, real numbers, and complex numbers has long been a standard topic of high school algebra. With the advent
More informationRow Ideals and Fibers of Morphisms
Michigan Math. J. 57 (2008) Row Ideals and Fibers of Morphisms David Eisenbud & Bernd Ulrich Affectionately dedicated to Mel Hochster, who has been an inspiration to us for many years, on the occasion
More informationCONTINUED FRACTIONS, PELL S EQUATION, AND TRANSCENDENTAL NUMBERS
CONTINUED FRACTIONS, PELL S EQUATION, AND TRANSCENDENTAL NUMBERS JEREMY BOOHER Continued fractions usually get shortchanged at PROMYS, but they are interesting in their own right and useful in other areas
More informationCOMMUTATIVE RINGS. Definition: A domain is a commutative ring R that satisfies the cancellation law for multiplication:
COMMUTATIVE RINGS Definition: A commutative ring R is a set with two operations, addition and multiplication, such that: (i) R is an abelian group under addition; (ii) ab = ba for all a, b R (commutative
More informationMonoid Domain Constructions of Antimatter Domains
Monoid Domain Constructions of Antimatter Domains D. D. Anderson, J. Coykendall, L. Hill, and M. Zafrullah Abstract. An integral domain without irreducible elements is called an antimatter domain. We give
More informationSOME EXAMPLES OF INTEGRAL DEFINITE QUATERNARY QUADRATIC FORMS WITH PRIME DISCRIMINANT KIICHIRO HASHIMOTO
K. Hashimoto Nagoya Math. J. Vol. 77 (1980), 167175 SOME EXAMPLES OF INTEGRAL DEFINITE QUATERNARY QUADRATIC FORMS WITH PRIME DISCRIMINANT KIICHIRO HASHIMOTO Introduction In the theory of integral quadratic
More informationTopics in Number Theory
Chapter 8 Topics in Number Theory 8.1 The Greatest Common Divisor Preview Activity 1 (The Greatest Common Divisor) 1. Explain what it means to say that a nonzero integer m divides an integer n. Recall
More informationCHAPTER 5: MODULAR ARITHMETIC
CHAPTER 5: MODULAR ARITHMETIC LECTURE NOTES FOR MATH 378 (CSUSM, SPRING 2009). WAYNE AITKEN 1. Introduction In this chapter we will consider congruence modulo m, and explore the associated arithmetic called
More informationLOWDEGREE PLANAR MONOMIALS IN CHARACTERISTIC TWO
LOWDEGREE PLANAR MONOMIALS IN CHARACTERISTIC TWO PETER MÜLLER AND MICHAEL E. ZIEVE Abstract. Planar functions over finite fields give rise to finite projective planes and other combinatorial objects.
More informationIt is time to prove some theorems. There are various strategies for doing
CHAPTER 4 Direct Proof It is time to prove some theorems. There are various strategies for doing this; we now examine the most straightforward approach, a technique called direct proof. As we begin, it
More informationKevin James. MTHSC 412 Section 2.4 Prime Factors and Greatest Comm
MTHSC 412 Section 2.4 Prime Factors and Greatest Common Divisor Greatest Common Divisor Definition Suppose that a, b Z. Then we say that d Z is a greatest common divisor (gcd) of a and b if the following
More information