Alex, I will take congruent numbers for one million dollars please

Save this PDF as:

Size: px
Start display at page:

Transcription

1 Alex, I will take congruent numbers for one million dollars please Jim L. Brown The Ohio State University Columbus, OH 4310 One of the most alluring aspectives of number theory is the relative ease with which some of the deepest and most difficult problems can be stated. For example, the twin prime conjecture states that there are infinitely many primes p so that p+ is also a prime. While anyone who is familiar with basic arithmetic can understand the statement of the conjecture, as of yet there is not a single person who knows how to prove it! It is often the case that studying such seemingly simple problems leads to very deep mathematics that at first is hard to imagine is related. The problem of interest here is of finding an efficient method of determining if a positive integer is the area of a right triangle with rational side lengths. The number 6 is an example of such a number given by the triangle. Less obvious is the fact that 5 is also an example given by the triangle with side lengths 3/, 0/3, 41/6. We say a positive integer N is a congruent number if it is the area of a right triangle with rational side lengths. Thus, 5 and 6 are examples of congruent numbers. We will shortly see how the study of such numbers leads into the fascinating world of elliptic curves. Of course the natural starting place with which to study areas of right triangles is in studying right triangles! We say positive integers X, Y and Z form a Pythagorean triple if X, Y and Z are the sides of a right triangle. If gcd(x, Y, Z) = 1 we say they are a primitive Pythagorean triple. As a starting point in our study of congruent numbers we have the following theorem classifying all primitive Pythagorean triples. 1

2 Theorem 1: Let X, Y, and Z be a primitive Pythagorean triple. Then there exist positive integers m and n (m > n) so that X = m n, Y = mn, and Z = m + n. Conversely, any positive integers m and n with m > n define a right triangle using the given formulas. Proof: It is not hard to see that given m and n we obtain a right triangle with integer sides using the given formulas. We need to show that given a primitive Pythagorean triple X, Y, and Z that we can find such an m and n. Observe that we have X + Y = Z by the Pythagorean theorem. Suppose X and Y are both odd. This implies that Z (mod 4). However, the squares modulo 4 are 0 and 1. Thus it must be that X or Y is even. Assume without loss of generality that Y is even so that Y is an integer. Write ( ) ( ) ( ) ( ) ( ) Y Z X Z X Z + X = =. If p is a prime that divides Y, then p ( ) Y. Since p is prime, we have that p ( ) ( Z X or p Z+X ). Note that p cannot divide both for if it did ) + ( Z+X )) = Z and p (( Z+X ) ( Z X )) = X we would have p (( Z X which would contradict gcd(x, Y, Z) = 1. Thus we obtain that p ( Z X or p ( Z+X we can write ( Y ( Z+X ). Running through all the primes that divide Y, we see that ) = m n where m is composed of those primes that divide ) ( and n is composed of those primes that divide Z X X = m n, Y = mn and Z = m + n, as desired. ) ). This gives that This theorem allows us to generate all congruent numbers that arise from integer sided right triangles. Some examples are given in Table 1. Of course, we want to deal with triangles with rational sides as well. Suppose we have a right triangle with sides X, Y, Z Q and area N. It is easy to see that we can clear denominators and obtain a right triangle with integers sides and area a N where a is the least common multiple of the denominators of X and Y. Thus, we can go from a right triangle with rational sides to a right triangle with integer sides and a new congruent number that

3 Table 1: Congruent numbers from Pythagorean triples m n X Y Z N is divisible by a square. Conversely, given a right triangle with integer sides X, Y, and Z and area N = a N 0, we can form a right triangle with rational sides and area N 0 by merely dividing X and Y by a. Thus, it is enough to study positive integers N that are square-free when studying congruent numbers. For example, consider the triangle with area 60 = 3 5. From the previous discussion we see that 15 is a congruent number given by the triangle with sides 4, 15/, 17/. Some further examples are given in Table. This method allows us to use the Pythagorean triples given in Theorem 1 to produce congruent numbers arising from triangles with rational sides. The difficulty is not in producing lots and lots of congruent numbers, the difficulty is determining if a given integer N is a congruent number. Using the method described thus far, if we cannot find a triangle with area N, it does not mean N is not congruent. It may just be that we have not looked hard enough to find the triangle! For example, the integer 157 is a congruent number. However, the simplest triangle giving area 157 has sides given by X = , Y = Clearly we are going to need a new method to solve this problem. 3

4 Table : Congruent numbers from rational right triangles X Y Z N 3/ 0/3 41/6 5 4/9 7/4 65/ / 17/ 15 7/ 1 5/ /36 145/ /9 5 53/9 70 Before we embark on a new method of attack, we note that we have yet to see why such an N is called a congruent number. The following theorem answers this question. It says that if N is a congruent number we obtain three squares of rational numbers that are congruent modulo N. The proof is left as an exercise to the curious reader. Theorem: Let N be a square-free positive integer. Let X, Y, Z be positive rational numbers with X < Y < Z. There is a 1-1 correspondence between right triangles with sides X, Y, Z and area N and numbers x Q so that x, x + N, x N are all squares of rational numbers. Elliptic curves? Are you sure? An elliptic curve, as the name suggests, is a special type of plane curve. What we mean by a plane curve C is the solution set of an equation f(x, y) = 0 where f(x, y) is a polynomial in variables x and y. We say a point (x 0, y 0 ) is a point on the curve C if f(x 0, y 0 ) = 0. We say the point (x 0, y 0 ) is a rational point on the curve if (x 0, y 0 ) is a point on the curve and x 0, y 0 Q. We will denote the set of rational points of the curve C by C(Q). We say the curve is smooth if the partial derivatives of f(x, y) with respect to x and y do not simultaneously vanish at any point on the curve. For example the circle of 4

5 radius 1 is a smooth plane curve given by the polynomial f(x, y) = x +y 1. An elliptic curve defined over a field K (you can take K = Q here if you like) is a smooth plane curve E defined by the polynomial f(x, y) = y + a 1 xy + a 3 y x 3 a x a 4 x a 5 where the a i all lie in K. We will also want to include a point at infinity, but we will come back to this later. The only elliptic curves we are interested in are the ones defined by the polynomial f(x, y) = y x 3 + N x for N a positive square-free integer. We will often denote this elliptic curve by E N and write E N : y = x 3 N x. This is all fine, but what does it have to do with congruent numbers? Define the set A N by A N = {(X, Y, Z) Q 3 : 1 } XY = N, X + Y = Z. It is easy to see that N is a congruent number if and only if A N is not the empty set. The important point is that there is a bijection between A N and the set B N = { (x, y) Q : y = x 3 N x, y 0 } given by functions f(x, Y, Z) = ( NY ) X + Z, N X + Z and ( N x g(x, y) =, xn y y, N ) + x. y This shows that if we can find a point P = (x(p ), y(p )) E N (Q) with y(p ) 0, then we have that N is a congruent number! Thus, it might actually be worth our time to study rational points on the elliptic curves E N. 5

6 So what makes us think that studying rational points on E N will lead to any new information? It turns out that elliptic curves are very special types of curves. We can define an operation so that if P, Q E N (Q) then P Q E N (Q). In fact is not any old operation, it makes the set E N (Q) into an abelian group! Before we can define the addition on E N (Q), we need to introduce the point at infinity. For the reader familiar with stereographic projection, the point at infinity can be taken to be the north pole of the sphere. Even better, if you are familiar with projective geometry it is the point (0 : 1 : 0). If both of those notions are foreign, you can think of the point at infinity as the point off of the page if you go in the y-direction forever. For an introduction to projective geometry geared to this setting consult [1]. Figure 1: Graphical representation that on E 6 one has P Q = (1, 36) for P = ( 3, 9) and Q = (0, 0). The fact that the equation defining E N is a cubic implies that any line 6

7 that intersects the curve must intersect it at exactly three points if we include the point at infinity as well and count a tangent as a double intersection point. This would lead one to guess that defining the point P Q is as simple as setting it equal to the third intersection point of the line through P and Q. Unfortunately, defining addition in this way would miss the important property of associativity! You should check by drawing pictures that this definition of addition, call it, is not associative. See Figure 1 for an illustration of the operation. What turns out to be the correct definition of P Q is to take the third point of intersection R of the line through P and Q and the elliptic curve and reflect it over the x-axis as pictured in Figure. Figure : Graphical representation that on E 6 one has P Q = (1, 36) for P = ( 3, 9) and Q = (0, 0). Note that what we are really doing is finding the point R and then taking another line through R and the point at infinity and taking the third inter- 7

8 section point with E N as P Q. This makes it easy to see that the point at infinity acts as the identity element of the group. In the future we will often write 0 EN for the point at infinity to reflect this fact. You should convince yourself with pictures that P Q = Q P, P 0 EN = P, and if P = (x, y), then P = (x, y), i.e, P ( P ) = 0 EN. If you are really brave try to prove that the addition is associative as well. (Hint: colored pencils are very helpful!) This method shows that given two points P and Q on E N we get a third point P Q on E N. What we have not shown yet is given P, Q E N (Q) that P Q E N (Q), i.e., that the coordinates of P Q are rational numbers. In order to show this we compute the coordinates of P Q in terms of those of P and Q. Write P = (x(p ), y(p )) and similarly for Q and P Q. Note that if we define R as above being the third intersection point of the line through P and Q with E N, then x(r) = x(p Q) and y(r) = y(p Q), so it is enough to determine x(r) and y(r) in terms of x(p ), x(q), y(p ) and y(q). We deal with the case P Q and leave the case of P = Q as an exercise. Let l be the line through P and Q, i.e., l is the equation y y(p ) = m(x x(p )) y(p ) y(q) where m =. Define x(p ) x(q) f(x) = x 3 N x (m(x x(p )) + y(p )). From the definition of l we see that f(x(p )) = f(x(q)) = f(x(r)) = 0. Since f(x) is a degree three polynomial in x and we have three roots of f(x) these are necessarily all the roots. Recall the following basic result from algebra. Theorem: Let g(x) = x n + a n 1 x n 1 + a 1 x + a 0. Let α 1,..., α n be the roots of g(x). Then n a n 1 = α i. i=1 This theorem allows us to conclude that x(p ) + x(q) + x(r) = m. 8

9 Thus, x(r) = m x(p ) x(q). The fact that P, Q E N (Q) shows that m, x(p ), x(q) Q and so x(p Q) = x(r) Q as well. It remains to calculate y(r). For this, we merely plug y(r) in for y in the equation of l giving y(r) = m(x(r) x(p )) + y(p ). Since everything on the right hand side of this equation is in Q, so is y(r) and hence y(p Q) = y(r) Q. This, combined with the properties mentioned earlier makes E N (Q) into an abelian group under the operation with identity the point at infinity. Example: Consider the elliptic curve E 6. It is easy to see that the points (0, 0) and (±6, 0) are rational points on this curve. We can use SAGE ([6]) to find other nontrivial points. Define the elliptic curve E 6 in SAGE with the command: sage: E6 = EllipticCurve([-36,0]) To find points one uses the command: sage: E6.point search(10) The 10 in this command is telling it how many points to search; essentially it is checking all points up to a certain height. The only thing we need to remember is that the bigger the number we put in, the longer the process takes. Staying under 0 is generally a good idea. Upon executing this command we receive a large amount of information. At this point all we are interested in are the points it gives us. These points will be in projective coordinates so some care is needed. The points in the xy-plane correspond to the points (x : y : z) with z 0. To convert them into xy-coordinates we merely divide each term by z. The first two entries are then our (x, y) point. Some points it gives us are ( : 8 : 1), (1 : 36 : 1), and (50 : 35 : 8). Upon normalizing so z = 1 we get the (x, y) points (, 8), (1, 36), and (5/4, 35/8). The point with z = 0 is the point at infinity, i.e., our identity element 0 E6. We can now use SAGE to add any of these points for us. 9

10 sage: P 1 = E6([, 8]); P = E6([1, 36]); P 3 = E6([ 6, 0]) sage: P 1 + P ( 6 : 0 : 1) sage: 5 P 1 ( : : 1) sage: P 3 (0 : 1 : 0) The notation 5P 1 is shorthand for the sum P 1 P 1 with five copies of P 1. Note that P 3 P 3 = 0 EN as this will be important. You should compute a couple of these by hand to make sure you are comfortable working with the formulas derived above! One million dollars... It now remains to find a way to find rational points on E N with y-coordinate non-zero or to at least ensure that such a point exists even if we cannot find it. This leads us to study the structure of the group E N (Q). A point P E N (Q) is called a torsion point if there exists a nonzero integer m so that mp = 0 EN. For example, the point P 3 in the above example is a torsion point with m =. The set of all such points forms a subgroup of E N (Q) called the torsion subgroup and denoted by E N (Q) tors. It turns out by work of Mazur ([4], [5]) that the torsion group of a general elliptic curve is not so hard to understand. In our case, it is even easier as we have the following theorem. Theorem : The torsion subgroup of E N (Q) is given by E N (Q) tors = {0 EN, (0, 0), (±N, 0)}. The proof of this theorem is not difficult, but it is too long to include here. The interested reader is urged to consult [1] or [3] for an elementary proof. A simple calculation shows that the only points in E N (Q) with y-coordinate 10

11 equal to 0 are in E N (Q) tors, so if we can simply find a point that is not a torsion point we will be able to use the bijection between A N and B N to produce a triangle with rational sides and area N. Example: We use the results obtained thus far to show that 137 is a congruent number and find a triangle with area 137. Using SAGE as above we find that ( 3136, ) E137 (Q). Theorem gives that this point is not in E 137 (Q) tors so 137 is indeed a congruent number. We apply the bijection between A 137 and B 137 to obtain a triangle with sides , , and area 137. The definition of torsion point implies that if P E N (Q) is not a torsion point, then we have P = {np : n Z} is isomorphic to Z as an abelian group. We say two non-torsion points P and Q in E N (Q) are independent if Q mp T for any m Z and any T E N (Q) tors, i.e., if Q is not in the group generated by P and the torsion points. The number of independent points is the rank of the elliptic curve. Theorem (Mordell-Weil): E N (Q) = E N (Q) tors Z r where here denotes a direct sum of abelian groups and r is the rank of the curve E N. Thus, we have turned the question of determining if N is a congruent number into the question of determining if the rank of E N is positive. This is where the million dollars comes into play! First we need to define the L-function of the curve E N. We denote the finite field with p elements by F p and reduction of an element a modulo p by a where p is a prime. If you are unfamiliar with finite fields, the element a is just the remainder of a upon division by p. If we avoid the primes p where p N, then the equation E N : y = x N x defines an elliptic curve over F p. Since there are only finitely many pos- 11

12 sibilities for points (x 0, y 0 ) in E N (F p ), we can easily just check each possibility! Thus, it is not computationally difficult to determine the integers a(p, E N ) = p + 1 #E N (F p ). In fact, it can be shown that a(p, E N ) = 0 for all primes p with p 3(mod 4). For s C with the real part of s larger then 3/ we define the L-function associated to E N by L(s, E N ) = p N(1 a(p, E N )p s + p 1 s ) 1. Note that this function is not defined on all of C. However, it can be analytically continued to the entire complex plane so we say no more about convergence here. Our interest in this function is the conjectural connection it has to the rank of the elliptic curve. Conjecture (Birch and Swinnerton-Dyer): The order of vanishing of L(s, E N ) at s = 1 is precisely the rank of the elliptic curve E N. Thus, if we can show that L(1, E N ) = 0, then the rank of E N must be positive and so we will have that there is a non-torsion point in E N (Q) and so N must be a congruent number! Unfortunately (or fortunately if you prove it!) this conjecture is one of the Clay Mathematics Institute s Millenium problems. This means if you prove or disprove this conjecture you will be awarded a million bucks! As you may suspect, this also means it is a very difficult problem. Even though the function L(s, E N ) seems to be a very complicated function, we can expand it out into a summation and then take finite approximations to it and obtain estimates as to whether it is zero or not at s = 1. This is built into SAGE as the command E.Lseries(1). So we can, at least for small N, just work with the computer program SAGE to determine if N is a congruent number or not. However, the larger N gets the more difficult it becomes to work computationally with the elliptic curve E N. Fortunately, there is a result (depending on the validity of the Birch and Swinnerton-Dyer conjecture) that reduces the problem to counting cardinality of relatively small 1

13 finite sets. Theorem 3: ([8]) If N is square-free and odd (respectively even) and N is the area of a rational right triangle, then #{x, y, z Z N = x +y +3z } = 1 #{x, y, z Z N = x +y +8z } (respectively #{x, y, z Z N/ = 4x +y +3z } = 1 #{x, y, z Z N/ = 4x +y +8z }). If the conjecture of Birch and Swinnerton-Dyer is true for E N, then the equality implies N is a congruent number. Thus, we have come full circle in our discussion of congruent numbers. We began with an innocent looking problem about areas of right triangles with rational side lengths. We then saw how elliptic curves arise naturally in the study of congruent numbers. From here we saw that a million dollar open conjecture actually arises in the study of congruent numbers. Finally, we see that if this million dollar conjecture is true, determining if a number is a congruent number comes down to determining the cardinality of a finite set, a simple counting problem. Thus, granting that someone will eventually prove the Birch and Swinnerton-Dyer conjecture we have found an efficient way to determine if N is a congruent number or not. Of course, Theorem 3 still leaves us in the position of being able to prove that N is the area of a right triangle with rational side lengths but having no idea what those side lengths are! Thus, even granting the validity of a million dollar conjecture there is still work to be done to give a satisfactory conclusion to the study of congruent numbers. References [1] J. Brown, Congruent numbers and elliptic curves, jimlb/congruentnumberslong.pdf 13

14 (007) 1 6. [] J. Chahal, Congruent numbers and elliptic curves, Amer. Math. Monthly 113 Vol 4 (006), [3] N. Koblitz, Introduction to Elliptic Curves and Modular Forms, Springer GTM 97, [4] B. Mazur, Modular curves and the Eisenstein ideal, IHES Publ. Math. 47 (1978), [5] B. Mazur, Rational isogenies of prime degree, Ivent. Math. 44 (1978), [6] W. Stein, SAGE: Software for Algebra and Geometry Exploration, [7] W. Stein, The congruent number problem: A thousand year old unsolved problem, [8] J. Tunnell, A classial Diophantine problem and modular forms of weights 3/, Invent. Math. 7 (1983),

Congruent Number Problem

University of Waterloo October 28th, 2015 Number Theory Number theory, can be described as the mathematics of discovering and explaining patterns in numbers. There is nothing in the world which pleases

THE CONGRUENT NUMBER PROBLEM

THE CONGRUENT NUMBER PROBLEM KEITH CONRAD 1. Introduction A right triangle is called rational when its legs and hypotenuse are all rational numbers. Examples of rational right triangles include Pythagorean

Congruent Numbers, the Rank of Elliptic Curves and the Birch and Swinnerton-Dyer Conjecture. Brad Groff

Congruent Numbers, the Rank of Elliptic Curves and the Birch and Swinnerton-Dyer Conjecture Brad Groff Contents 1 Congruent Numbers... 1.1 Basic Facts............................... and Elliptic Curves.1

On the generation of elliptic curves with 16 rational torsion points by Pythagorean triples

On the generation of elliptic curves with 16 rational torsion points by Pythagorean triples Brian Hilley Boston College MT695 Honors Seminar March 3, 2006 1 Introduction 1.1 Mazur s Theorem Let C be a

MOP 2007 Black Group Integer Polynomials Yufei Zhao. Integer Polynomials. June 29, 2007 Yufei Zhao yufeiz@mit.edu

Integer Polynomials June 9, 007 Yufei Zhao yufeiz@mit.edu We will use Z[x] to denote the ring of polynomials with integer coefficients. We begin by summarizing some of the common approaches used in dealing

3 1. Note that all cubes solve it; therefore, there are no more

Math 13 Problem set 5 Artin 11.4.7 Factor the following polynomials into irreducible factors in Q[x]: (a) x 3 3x (b) x 3 3x + (c) x 9 6x 6 + 9x 3 3 Solution: The first two polynomials are cubics, so if

Pythagorean Triples. Chapter 2. a 2 + b 2 = c 2

Chapter Pythagorean Triples The Pythagorean Theorem, that beloved formula of all high school geometry students, says that the sum of the squares of the sides of a right triangle equals the square of the

Copyrighted Material. Chapter 1 DEGREE OF A CURVE

Chapter 1 DEGREE OF A CURVE Road Map The idea of degree is a fundamental concept, which will take us several chapters to explore in depth. We begin by explaining what an algebraic curve is, and offer two

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

Multiplicity. Chapter 6

Chapter 6 Multiplicity The fundamental theorem of algebra says that any polynomial of degree n 0 has exactly n roots in the complex numbers if we count with multiplicity. The zeros of a polynomial are

MATH 361: NUMBER THEORY FIRST LECTURE

MATH 361: NUMBER THEORY FIRST LECTURE 1. Introduction As a provisional definition, view number theory as the study of the properties of the positive integers, Z + = {1, 2, 3, }. Of particular interest,

MA257: INTRODUCTION TO NUMBER THEORY LECTURE NOTES

MA257: INTRODUCTION TO NUMBER THEORY LECTURE NOTES 2016 47 4. Diophantine Equations A Diophantine Equation is simply an equation in one or more variables for which integer (or sometimes rational) solutions

PYTHAGOREAN 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 =

ELLIPTIC CURVES AND LENSTRA S FACTORIZATION ALGORITHM

ELLIPTIC CURVES AND LENSTRA S FACTORIZATION ALGORITHM DANIEL PARKER Abstract. This paper provides a foundation for understanding Lenstra s Elliptic Curve Algorithm for factoring large numbers. We give

7. 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

Revised Version of Chapter 23. We learned long ago how to solve linear congruences. ax c (mod m)

Chapter 23 Squares Modulo p Revised Version of Chapter 23 We learned long ago how to solve linear congruences ax c (mod m) (see Chapter 8). It s now time to take the plunge and move on to quadratic equations.

Research Article On the Rank of Elliptic Curves in Elementary Cubic Extensions

Numbers Volume 2015, Article ID 501629, 4 pages http://dx.doi.org/10.1155/2015/501629 Research Article On the Rank of Elliptic Curves in Elementary Cubic Extensions Rintaro Kozuma College of International

Integer 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

Mathematics Course 111: Algebra I Part IV: Vector Spaces

Mathematics Course 111: Algebra I Part IV: Vector Spaces D. R. Wilkins Academic Year 1996-7 9 Vector Spaces A vector space over some field K is an algebraic structure consisting of a set V on which are

Die ganzen zahlen hat Gott gemacht

Die ganzen zahlen hat Gott gemacht Polynomials with integer values B.Sury A quote attributed to the famous mathematician L.Kronecker is Die Ganzen Zahlen hat Gott gemacht, alles andere ist Menschenwerk.

FOUNDATIONS OF ALGEBRAIC GEOMETRY CLASS 22

FOUNDATIONS OF ALGEBRAIC GEOMETRY CLASS 22 RAVI VAKIL CONTENTS 1. Discrete valuation rings: Dimension 1 Noetherian regular local rings 1 Last day, we discussed the Zariski tangent space, and saw that it

U.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

PROOFS BY DESCENT KEITH CONRAD As ordinary methods, such as are found in the books, are inadequate to proving such difficult propositions, I discovered at last a most singular method... that I called the

6 EXTENDING ALGEBRA. 6.0 Introduction. 6.1 The cubic equation. Objectives

6 EXTENDING ALGEBRA Chapter 6 Extending Algebra Objectives After studying this chapter you should understand techniques whereby equations of cubic degree and higher can be solved; be able to factorise

Chapter 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

Math Review. for the Quantitative Reasoning Measure of the GRE revised General Test

Math Review for the Quantitative Reasoning Measure of the GRE revised General Test www.ets.org Overview This Math Review will familiarize you with the mathematical skills and concepts that are important

11 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(

it 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

Notes 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

Problem Set 7 - Fall 2008 Due Tuesday, Oct. 28 at 1:00

18.781 Problem Set 7 - Fall 2008 Due Tuesday, Oct. 28 at 1:00 Throughout this assignment, f(x) always denotes a polynomial with integer coefficients. 1. (a) Show that e 32 (3) = 8, and write down a list

CHAPTER 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.

WHAT ARE MATHEMATICAL PROOFS AND WHY THEY ARE IMPORTANT?

WHAT ARE MATHEMATICAL PROOFS AND WHY THEY ARE IMPORTANT? introduction Many students seem to have trouble with the notion of a mathematical proof. People that come to a course like Math 216, who certainly

Settling a Question about Pythagorean Triples

Settling a Question about Pythagorean Triples TOM VERHOEFF Department of Mathematics and Computing Science Eindhoven University of Technology P.O. Box 513, 5600 MB Eindhoven, The Netherlands E-Mail address:

9.2 Summation Notation

9. Summation Notation 66 9. Summation Notation In the previous section, we introduced sequences and now we shall present notation and theorems concerning the sum of terms of a sequence. We begin with a

Unique Factorization

Unique Factorization Waffle Mathcamp 2010 Throughout these notes, all rings will be assumed to be commutative. 1 Factorization in domains: definitions and examples In this class, we will study the phenomenon

FACTORING 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

EMBEDDING DEGREE OF HYPERELLIPTIC CURVES WITH COMPLEX MULTIPLICATION

EMBEDDING DEGREE OF HYPERELLIPTIC CURVES WITH COMPLEX MULTIPLICATION CHRISTIAN ROBENHAGEN RAVNSHØJ Abstract. Consider the Jacobian of a genus two curve defined over a finite field and with complex multiplication.

9. POLYNOMIALS. Example 1: The expression a(x) = x 3 4x 2 + 7x 11 is a polynomial in x. The coefficients of a(x) are the numbers 1, 4, 7, 11.

9. POLYNOMIALS 9.1. Definition of a Polynomial A polynomial is an expression of the form: a(x) = a n x n + a n-1 x n-1 +... + a 1 x + a 0. The symbol x is called an indeterminate and simply plays the role

Prime 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.

FACTORING 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

Math Workshop October 2010 Fractions and Repeating Decimals

Math Workshop October 2010 Fractions and Repeating Decimals This evening we will investigate the patterns that arise when converting fractions to decimals. As an example of what we will be looking at,

Introduction 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

Math Circle Beginners Group October 18, 2015

Math Circle Beginners Group October 18, 2015 Warm-up problem 1. Let n be a (positive) integer. Prove that if n 2 is odd, then n is also odd. (Hint: Use a proof by contradiction.) Suppose that n 2 is odd

Section 1.1. Introduction to R n

The Calculus of Functions of Several Variables Section. Introduction to R n Calculus is the study of functional relationships and how related quantities change with each other. In your first exposure to

In a triangle with a right angle, there are 2 legs and the hypotenuse of a triangle.

PROBLEM STATEMENT In a triangle with a right angle, there are legs and the hypotenuse of a triangle. The hypotenuse of a triangle is the side of a right triangle that is opposite the 90 angle. The legs

k, 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

SUBGROUPS 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

FACTORING 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,

THE BIRCH AND SWINNERTON-DYER CONJECTURE

THE BIRCH AND SWINNERTON-DYER CONJECTURE ANDREW WILES A polynomial relation f(x, y) = 0 in two variables defines a curve C 0. If the coefficients of the polynomial are rational numbers, then one can ask

Introduction to Algebraic Geometry. Bézout s Theorem and Inflection Points

Introduction to Algebraic Geometry Bézout s Theorem and Inflection Points 1. The resultant. Let K be a field. Then the polynomial ring K[x] is a unique factorisation domain (UFD). Another example of a

8 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.

The degree of a polynomial function is equal to the highest exponent found on the independent variables.

DETAILED SOLUTIONS AND CONCEPTS - POLYNOMIAL FUNCTIONS Prepared by Ingrid Stewart, Ph.D., College of Southern Nevada Please Send Questions and Comments to ingrid.stewart@csn.edu. Thank you! PLEASE NOTE

Characterizing the Sum of Two Cubes

1 3 47 6 3 11 Journal of Integer Sequences, Vol. 6 (003), Article 03.4.6 Characterizing the Sum of Two Cubes Kevin A. Broughan University of Waikato Hamilton 001 New Zealand kab@waikato.ac.nz Abstract

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

The Method of Partial Fractions Math 121 Calculus II Spring 2015

Rational functions. as The Method of Partial Fractions Math 11 Calculus II Spring 015 Recall that a rational function is a quotient of two polynomials such f(x) g(x) = 3x5 + x 3 + 16x x 60. The method

A Second Course in Mathematics Concepts for Elementary Teachers: Theory, Problems, and Solutions

A Second Course in Mathematics Concepts for Elementary Teachers: Theory, Problems, and Solutions Marcel B. Finan Arkansas Tech University c All Rights Reserved First Draft February 8, 2006 1 Contents 25

some algebra prelim solutions

some algebra prelim solutions David Morawski August 19, 2012 Problem (Spring 2008, #5). Show that f(x) = x p x + a is irreducible over F p whenever a F p is not zero. Proof. First, note that f(x) has no

a 1 x + a 0 =0. (3) ax 2 + bx + c =0. (4)

ROOTS OF POLYNOMIAL EQUATIONS In this unit we discuss polynomial equations. A polynomial in x of degree n, where n 0 is an integer, is an expression of the form P n (x) =a n x n + a n 1 x n 1 + + a 1 x

3. Equivalence Relations. Discussion

3. EQUIVALENCE RELATIONS 33 3. Equivalence Relations 3.1. Definition of an Equivalence Relations. Definition 3.1.1. A relation R on a set A is an equivalence relation if and only if R is reflexive, symmetric,

OSTROWSKI FOR NUMBER FIELDS

OSTROWSKI FOR NUMBER FIELDS KEITH CONRAD Ostrowski classified the nontrivial absolute values on Q: up to equivalence, they are the usual (archimedean) absolute value and the p-adic absolute values for

Taylor Polynomials and Taylor Series Math 126

Taylor Polynomials and Taylor Series Math 26 In many problems in science and engineering we have a function f(x) which is too complicated to answer the questions we d like to ask. In this chapter, we will

We now explore a third method of proof: proof by contradiction.

CHAPTER 6 Proof by Contradiction We now explore a third method of proof: proof by contradiction. This method is not limited to proving just conditional statements it can be used to prove any kind of statement

Elliptic Curves and Elliptic Curve Cryptography

Undergraduate Colloquium Series Elliptic Curves and Elliptic Curve Cryptography Amiee O Maley Amiee O Maley graduated Summa Cum Laude from Ball State in May 00 with a major in Mathematics. She is currently

Monogenic Fields and Power Bases Michael Decker 12/07/07

Monogenic Fields and Power Bases Michael Decker 12/07/07 1 Introduction Let K be a number field of degree k and O K its ring of integers Then considering O K as a Z-module, the nicest possible case is

Breaking The Code. Ryan Lowe. Ryan Lowe is currently a Ball State senior with a double major in Computer Science and Mathematics and

Breaking The Code Ryan Lowe Ryan Lowe is currently a Ball State senior with a double major in Computer Science and Mathematics and a minor in Applied Physics. As a sophomore, he took an independent study

Factoring Patterns in the Gaussian Plane

Factoring Patterns in the Gaussian Plane Steve Phelps Introduction This paper describes discoveries made at the Park City Mathematics Institute, 00, as well as some proofs. Before the summer I understood

ABSTRACT ALGEBRA: A STUDY GUIDE FOR BEGINNERS

ABSTRACT ALGEBRA: A STUDY GUIDE FOR BEGINNERS John A. Beachy Northern Illinois University 2014 ii J.A.Beachy This is a supplement to Abstract Algebra, Third Edition by John A. Beachy and William D. Blair

An Innocent Investigation

An Innocent Investigation D. Joyce, Clark University January 2006 The beginning. Have you ever wondered why every number is either even or odd? I don t mean to ask if you ever wondered whether every number

a 11 x 1 + a 12 x 2 + + a 1n x n = b 1 a 21 x 1 + a 22 x 2 + + a 2n x n = b 2.

Chapter 1 LINEAR EQUATIONS 1.1 Introduction to linear equations A linear equation in n unknowns x 1, x,, x n is an equation of the form a 1 x 1 + a x + + a n x n = b, where a 1, a,..., a n, b are given

Polynomials. Dr. philippe B. laval Kennesaw State University. April 3, 2005

Polynomials Dr. philippe B. laval Kennesaw State University April 3, 2005 Abstract Handout on polynomials. The following topics are covered: Polynomial Functions End behavior Extrema Polynomial Division

EXERCISES FOR THE COURSE MATH 570, FALL 2010

EXERCISES FOR THE COURSE MATH 570, FALL 2010 EYAL Z. GOREN (1) Let G be a group and H Z(G) a subgroup such that G/H is cyclic. Prove that G is abelian. Conclude that every group of order p 2 (p a prime

A 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

2010 Solutions. a + b. a + b 1. (a + b)2 + (b a) 2. (b2 + a 2 ) 2 (a 2 b 2 ) 2

00 Problem If a and b are nonzero real numbers such that a b, compute the value of the expression ( ) ( b a + a a + b b b a + b a ) ( + ) a b b a + b a +. b a a b Answer: 8. Solution: Let s simplify the

The van Hoeij Algorithm for Factoring Polynomials

The van Hoeij Algorithm for Factoring Polynomials Jürgen Klüners Abstract In this survey we report about a new algorithm for factoring polynomials due to Mark van Hoeij. The main idea is that the combinatorial

Factoring 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

APPLICATIONS 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

Absolute Value of Reasoning

About Illustrations: Illustrations of the Standards for Mathematical Practice (SMP) consist of several pieces, including a mathematics task, student dialogue, mathematical overview, teacher reflection

Pythagorean Triples Pythagorean triple similar primitive

Pythagorean Triples One of the most far-reaching problems to appear in Diophantus Arithmetica was his Problem II-8: To divide a given square into two squares. Namely, find integers x, y, z, so that x 2

Finite Sets. Theorem 5.1. Two non-empty finite sets have the same cardinality if and only if they are equivalent.

MATH 337 Cardinality Dr. Neal, WKU We now shall prove that the rational numbers are a countable set while R is uncountable. This result shows that there are two different magnitudes of infinity. But we

Elementary 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,

INTRODUCTION TO ALGEBRAIC GEOMETRY, CLASS 16

INTRODUCTION TO ALGEBRAIC GEOMETRY, CLASS 16 RAVI VAKIL Contents 1. Valuation rings (and non-singular points of curves) 1 1.1. Completions 2 1.2. A big result from commutative algebra 3 Problem sets back.

SECTION 10-2 Mathematical Induction

73 0 Sequences and Series 6. Approximate e 0. using the first five terms of the series. Compare this approximation with your calculator evaluation of e 0.. 6. Approximate e 0.5 using the first five terms

The 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 ) =

Lecture 13 - Basic Number Theory.

Lecture 13 - Basic Number Theory. Boaz Barak March 22, 2010 Divisibility and primes Unless mentioned otherwise throughout this lecture all numbers are non-negative integers. We say that A divides B, denoted

Understanding Basic Calculus

Understanding Basic Calculus S.K. Chung Dedicated to all the people who have helped me in my life. i Preface This book is a revised and expanded version of the lecture notes for Basic Calculus and other

(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

Elliptic Curve Cryptography

Elliptic Curve Cryptography Elaine Brow, December 2010 Math 189A: Algebraic Geometry 1. Introduction to Public Key Cryptography To understand the motivation for elliptic curve cryptography, we must first

Fractions and Decimals

Fractions and Decimals Tom Davis tomrdavis@earthlink.net http://www.geometer.org/mathcircles December 1, 2005 1 Introduction If you divide 1 by 81, you will find that 1/81 =.012345679012345679... The first

The Chebotarev Density Theorem

The Chebotarev Density Theorem Hendrik Lenstra 1. Introduction Consider the polynomial f(x) = X 4 X 2 1 Z[X]. Suppose that we want to show that this polynomial is irreducible. We reduce f modulo a prime

Introduction Proof by unique factorization in Z Proof with Gaussian integers Proof by geometry Applications. Pythagorean Triples

Pythagorean Triples Keith Conrad University of Connecticut August 4, 008 Introduction We seek positive integers a, b, and c such that a + b = c. Plimpton 3 Babylonian table of Pythagorean triples (1800

Winter 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)).

CORRELATED TO THE SOUTH CAROLINA COLLEGE AND CAREER-READY FOUNDATIONS IN ALGEBRA

We Can Early Learning Curriculum PreK Grades 8 12 INSIDE ALGEBRA, GRADES 8 12 CORRELATED TO THE SOUTH CAROLINA COLLEGE AND CAREER-READY FOUNDATIONS IN ALGEBRA April 2016 www.voyagersopris.com Mathematical

THE FUNDAMENTAL THEOREM OF ALGEBRA VIA PROPER MAPS

THE FUNDAMENTAL THEOREM OF ALGEBRA VIA PROPER MAPS KEITH CONRAD 1. Introduction The Fundamental Theorem of Algebra says every nonconstant polynomial with complex coefficients can be factored into linear

Primality - 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.

2.2. Instantaneous Velocity

2.2. Instantaneous Velocity toc Assuming that your are not familiar with the technical aspects of this section, when you think about it, your knowledge of velocity is limited. In terms of your own mathematical

QUADRATIC RECIPROCITY IN CHARACTERISTIC 2 KEITH CONRAD 1. Introduction Let F be a finite field. When F has odd characteristic, the quadratic reciprocity law in F[T ] (see [4, Section 3.2.2] or [5]) lets

Some applications of LLL

Some applications of LLL a. Factorization of polynomials As the title Factoring polynomials with rational coefficients of the original paper in which the LLL algorithm was first published (Mathematische