AMBIGUOUS CLASSES IN QUADRATIC FIELDS
|
|
- Esther Whitehead
- 8 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. Halter-Koch, 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 00-8/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 cfa-prime 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-(ma-l)]. 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 Halter-Koch'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 = {l,@x,..., 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, I-Fa.^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 + (q-l)/ 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 I-Fa,() = 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 I-Fa^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 Richaud-Degert (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 ERD-type. The only other non-erd 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 non-erd 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 prime-producing 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. Halter-Koch, Prime-producing 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, prime-producing 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 : ramollin@acs.ucalgary.ca
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, 1635-1642 On Factoring R. A. Mollin Department of Mathematics and Statistics University of Calgary, Calgary, Alberta, Canada, T2N 1N4 http://www.math.ucalgary.ca/
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 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 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 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 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 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 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 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 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 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 informationCS 103X: Discrete Structures Homework Assignment 3 Solutions
CS 103X: Discrete Structures Homework Assignment 3 s Exercise 1 (20 points). On well-ordering and induction: (a) Prove the induction principle from the well-ordering principle. (b) Prove the well-ordering
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 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 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 informationHow To Prove The 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 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 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 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 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 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 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 informationInternational Journal of Information Technology, Modeling and Computing (IJITMC) Vol.1, No.3,August 2013
FACTORING CRYPTOSYSTEM MODULI WHEN THE CO-FACTORS DIFFERENCE IS BOUNDED Omar Akchiche 1 and Omar Khadir 2 1,2 Laboratory of Mathematics, Cryptography and Mechanics, Fstm, University of Hassan II Mohammedia-Casablanca,
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 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 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 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 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 553-50100, Kakamega, Kenya. Shem Aywa 2 Department of Mathematics,
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 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 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 informationON GALOIS REALIZATIONS OF THE 2-COVERABLE SYMMETRIC AND ALTERNATING GROUPS
ON GALOIS REALIZATIONS OF THE 2-COVERABLE 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 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 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 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 informationMath 345-60 Abstract Algebra I Questions for Section 23: Factoring Polynomials over a Field
Math 345-60 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 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 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É CLAUDE-BERNARD LYON 1 69622 VILLEURBANNE, FRANCE 2 DEPARTMENT OF MATHEMATICS
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 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 number-theoretic functions ν(n) and Ω(n)
ACTA ARITHMETICA LXXVIII.1 (1996) On the number-theoretic 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 informationCHAPTER 5. Number Theory. 1. Integers and Division. Discussion
CHAPTER 5 Number Theory 1. Integers and Division 1.1. Divisibility. Definition 1.1.1. Given two integers a and b we say a divides b if there is an integer c such that b = ac. If a divides b, we write a
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 informationWinter Camp 2011 Polynomials Alexander Remorov. Polynomials. Alexander Remorov alexanderrem@gmail.com
Polynomials Alexander Remorov alexanderrem@gmail.com Warm-up Problem 1: Let f(x) be a quadratic polynomial. Prove that there exist quadratic polynomials g(x) and h(x) such that f(x)f(x + 1) = g(h(x)).
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 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 informationThe Prime Numbers. Definition. A prime number is a positive integer with exactly two positive divisors.
The Prime Numbers Before starting our study of primes, we record the following important lemma. Recall that integers a, b are said to be relatively prime if gcd(a, b) = 1. Lemma (Euclid s Lemma). If gcd(a,
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 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 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 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 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 informationSYSTEMS OF PYTHAGOREAN TRIPLES. Acknowledgements. I would like to thank Professor Laura Schueller for advising and guiding me
SYSTEMS OF PYTHAGOREAN TRIPLES CHRISTOPHER TOBIN-CAMPBELL Abstract. This paper explores systems of Pythagorean triples. It describes the generating formulas for primitive Pythagorean triples, determines
More informationThe Mean Value Theorem
The Mean Value Theorem THEOREM (The Extreme Value Theorem): If f is continuous on a closed interval [a, b], then f attains an absolute maximum value f(c) and an absolute minimum value f(d) at some numbers
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 informationON FIBONACCI NUMBERS WITH FEW PRIME DIVISORS
ON FIBONACCI NUMBERS WITH FEW PRIME DIVISORS YANN BUGEAUD, FLORIAN LUCA, MAURICE MIGNOTTE, SAMIR SIKSEK Abstract If n is a positive integer, write F n for the nth Fibonacci number, and ω(n) for the number
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 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 informationSOME EXAMPLES OF INTEGRAL DEFINITE QUATERNARY QUADRATIC FORMS WITH PRIME DISCRIMINANT KI-ICHIRO HASHIMOTO
K. Hashimoto Nagoya Math. J. Vol. 77 (1980), 167-175 SOME EXAMPLES OF INTEGRAL DEFINITE QUATERNARY QUADRATIC FORMS WITH PRIME DISCRIMINANT KI-ICHIRO HASHIMOTO Introduction In the theory of integral quadratic
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 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 informationRECURSIVE ENUMERATION OF PYTHAGOREAN TRIPLES
RECURSIVE ENUMERATION OF PYTHAGOREAN TRIPLES DARRYL MCCULLOUGH AND ELIZABETH WADE In [9], P. W. Wade and W. R. Wade (no relation to the second author gave a recursion formula that produces Pythagorean
More informationOn continued fractions of the square root of prime numbers
On continued fractions of the square root of prime numbers Alexandra Ioana Gliga March 17, 2006 Nota Bene: Conjecture 5.2 of the numerical results at the end of this paper was not correctly derived from
More informationLOW-DEGREE PLANAR MONOMIALS IN CHARACTERISTIC TWO
LOW-DEGREE 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 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 informationZeros of a Polynomial Function
Zeros of a Polynomial Function An important consequence of the Factor Theorem is that finding the zeros of a polynomial is really the same thing as factoring it into linear factors. In this section we
More informationminimal polyonomial Example
Minimal Polynomials Definition Let α be an element in GF(p e ). We call the monic polynomial of smallest degree which has coefficients in GF(p) and α as a root, the minimal polyonomial of α. Example: We
More informationGREATEST COMMON DIVISOR
DEFINITION: GREATEST COMMON DIVISOR The greatest common divisor (gcd) of a and b, denoted by (a, b), is the largest common divisor of integers a and b. THEOREM: If a and b are nonzero integers, then their
More informationA number field is a field of finite degree over Q. By the Primitive Element Theorem, any number
Number Fields Introduction A number field is a field of finite degree over Q. By the Primitive Element Theorem, any number field K = Q(α) for some α K. The minimal polynomial Let K be a number field and
More informationTheorem3.1.1 Thedivisionalgorithm;theorem2.2.1insection2.2 If m, n Z and n is a positive
Chapter 3 Number Theory 159 3.1 Prime Numbers Prime numbers serve as the basic building blocs in the multiplicative structure of the integers. As you may recall, an integer n greater than one is prime
More informationModule MA3411: Abstract Algebra Galois Theory Appendix Michaelmas Term 2013
Module MA3411: Abstract Algebra Galois Theory Appendix Michaelmas Term 2013 D. R. Wilkins Copyright c David R. Wilkins 1997 2013 Contents A Cyclotomic Polynomials 79 A.1 Minimum Polynomials of Roots of
More informationDIVISIBILITY AND GREATEST COMMON DIVISORS
DIVISIBILITY AND GREATEST COMMON DIVISORS KEITH CONRAD 1 Introduction We will begin with a review of divisibility among integers, mostly to set some notation and to indicate its properties Then we will
More informationCHAPTER SIX IRREDUCIBILITY AND FACTORIZATION 1. BASIC DIVISIBILITY THEORY
January 10, 2010 CHAPTER SIX IRREDUCIBILITY AND FACTORIZATION 1. BASIC DIVISIBILITY THEORY The set of polynomials over a field F is a ring, whose structure shares with the ring of integers many characteristics.
More information15 Prime and Composite Numbers
15 Prime and Composite Numbers Divides, Divisors, Factors, Multiples In section 13, we considered the division algorithm: If a and b are whole numbers with b 0 then there exist unique numbers q and r such
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 informationAll trees contain a large induced subgraph having all degrees 1 (mod k)
All trees contain a large induced subgraph having all degrees 1 (mod k) David M. Berman, A.J. Radcliffe, A.D. Scott, Hong Wang, and Larry Wargo *Department of Mathematics University of New Orleans New
More informationHOMEWORK 5 SOLUTIONS. n!f n (1) lim. ln x n! + xn x. 1 = G n 1 (x). (2) k + 1 n. (n 1)!
Math 7 Fall 205 HOMEWORK 5 SOLUTIONS Problem. 2008 B2 Let F 0 x = ln x. For n 0 and x > 0, let F n+ x = 0 F ntdt. Evaluate n!f n lim n ln n. By directly computing F n x for small n s, we obtain the following
More informationSuk-Geun Hwang and Jin-Woo Park
Bull. Korean Math. Soc. 43 (2006), No. 3, pp. 471 478 A NOTE ON PARTIAL SIGN-SOLVABILITY Suk-Geun Hwang and Jin-Woo Park Abstract. In this paper we prove that if Ax = b is a partial signsolvable linear
More informationThe sum of digits of polynomial values in arithmetic progressions
The sum of digits of polynomial values in arithmetic progressions Thomas Stoll Institut de Mathématiques de Luminy, Université de la Méditerranée, 13288 Marseille Cedex 9, France E-mail: stoll@iml.univ-mrs.fr
More informationH/wk 13, Solutions to selected problems
H/wk 13, Solutions to selected problems Ch. 4.1, Problem 5 (a) Find the number of roots of x x in Z 4, Z Z, any integral domain, Z 6. (b) Find a commutative ring in which x x has infinitely many roots.
More informationPutnam Notes Polynomials and palindromes
Putnam Notes Polynomials and palindromes Polynomials show up one way or another in just about every area of math. You will hardly ever see any math competition without at least one problem explicitly concerning
More informationEvery Positive Integer is the Sum of Four Squares! (and other exciting problems)
Every Positive Integer is the Sum of Four Squares! (and other exciting problems) Sophex University of Texas at Austin October 18th, 00 Matilde N. Lalín 1. Lagrange s Theorem Theorem 1 Every positive integer
More informationChapter 4, Arithmetic in F [x] Polynomial arithmetic and the division algorithm.
Chapter 4, Arithmetic in F [x] Polynomial arithmetic and the division algorithm. We begin by defining the ring of polynomials with coefficients in a ring R. After some preliminary results, we specialize
More information1 Homework 1. [p 0 q i+j +... + p i 1 q j+1 ] + [p i q j ] + [p i+1 q j 1 +... + p i+j q 0 ]
1 Homework 1 (1) Prove the ideal (3,x) is a maximal ideal in Z[x]. SOLUTION: Suppose we expand this ideal by including another generator polynomial, P / (3, x). Write P = n + x Q with n an integer not
More informationPUTNAM TRAINING POLYNOMIALS. Exercises 1. Find a polynomial with integral coefficients whose zeros include 2 + 5.
PUTNAM TRAINING POLYNOMIALS (Last updated: November 17, 2015) Remark. This is a list of exercises on polynomials. Miguel A. Lerma Exercises 1. Find a polynomial with integral coefficients whose zeros include
More informationPROBLEM SET 6: POLYNOMIALS
PROBLEM SET 6: POLYNOMIALS 1. introduction In this problem set we will consider polynomials with coefficients in K, where K is the real numbers R, the complex numbers C, the rational numbers Q or any other
More informationCONTRIBUTIONS TO ZERO SUM PROBLEMS
CONTRIBUTIONS TO ZERO SUM PROBLEMS S. D. ADHIKARI, Y. G. CHEN, J. B. FRIEDLANDER, S. V. KONYAGIN AND F. PAPPALARDI Abstract. A prototype of zero sum theorems, the well known theorem of Erdős, Ginzburg
More informationIrreducibility criteria for compositions and multiplicative convolutions of polynomials with integer coefficients
DOI: 10.2478/auom-2014-0007 An. Şt. Univ. Ovidius Constanţa Vol. 221),2014, 73 84 Irreducibility criteria for compositions and multiplicative convolutions of polynomials with integer coefficients Anca
More informationA.2. Exponents and Radicals. Integer Exponents. What you should learn. Exponential Notation. Why you should learn it. Properties of Exponents
Appendix A. Exponents and Radicals A11 A. Exponents and Radicals What you should learn Use properties of exponents. Use scientific notation to represent real numbers. Use properties of radicals. Simplify
More informationMath 319 Problem Set #3 Solution 21 February 2002
Math 319 Problem Set #3 Solution 21 February 2002 1. ( 2.1, problem 15) Find integers a 1, a 2, a 3, a 4, a 5 such that every integer x satisfies at least one of the congruences x a 1 (mod 2), x a 2 (mod
More informationDEGREES OF ORDERS ON TORSION-FREE ABELIAN GROUPS
DEGREES OF ORDERS ON TORSION-FREE ABELIAN GROUPS ASHER M. KACH, KAREN LANGE, AND REED SOLOMON Abstract. We construct two computable presentations of computable torsion-free abelian groups, one of isomorphism
More informationQuotient Rings and Field Extensions
Chapter 5 Quotient Rings and Field Extensions In this chapter we describe a method for producing field extension of a given field. If F is a field, then a field extension is a field K that contains F.
More informationNumber Theory. Proof. Suppose otherwise. Then there would be a finite number n of primes, which we may
Number Theory Divisibility and Primes Definition. If a and b are integers and there is some integer c such that a = b c, then we say that b divides a or is a factor or divisor of a and write b a. Definition
More informationRSA and Primality Testing
and Primality Testing Joan Boyar, IMADA, University of Southern Denmark Studieretningsprojekter 2010 1 / 81 Correctness of cryptography cryptography Introduction to number theory Correctness of with 2
More informationA Continued Fraction Approach to the Diophantine Equation ax 2 by 2 = ±1
A Continued Fraction Approach to the Diophantine Equation ax by ±1 R.A. Mollin Abstract We revisit the Diophantine equation of the title, and related equations, from new perspectives that add connections
More informationMath 55: Discrete Mathematics
Math 55: Discrete Mathematics UC Berkeley, Fall 2011 Homework # 5, due Wednesday, February 22 5.1.4 Let P (n) be the statement that 1 3 + 2 3 + + n 3 = (n(n + 1)/2) 2 for the positive integer n. a) What
More information1 if 1 x 0 1 if 0 x 1
Chapter 3 Continuity In this chapter we begin by defining the fundamental notion of continuity for real valued functions of a single real variable. When trying to decide whether a given function is or
More information