Grade 11/12 Math Circles Rational Points on an Elliptic Curves Dr. Carmen Bruni November 11, Lest We Forget
|
|
- Barnard Ball
- 5 years ago
- Views:
Transcription
1 Faculty of Mathematics Waterloo, Ontario N2L 3G1 Centre for Education in Mathematics and Computing Grade 11/12 Math Circles Rational Points on an Elliptic Curves Dr. Carmen Bruni November 11, Lest We Forget Revisit the Congruent Number Problem Congruent Number Problem Determine which positive integers N can be expressed as the area of a right angled triangle with side lengths all rational. For example 6 is a congruent number since it is the area of the right triangle. Enter Elliptic Curves The associated equations with the congruent number problem, namely x 2 + y 2 = z 2 xy = 2N can be converted to an elliptic curve of the form Y 2 = X 3 N 2 X. We also saw that we can reduce our problem to considering only squarefree numbers N. Going Backwards The belief now is that solving problems related to elliptic curves might be easier than the originally stated problem. The question now that occurs is can we go from an elliptic curve of the form to a rational right triangle with area N? Key Theorems y 2 = x 3 N 2 x Theorem 1. Let (x, y) be a point with rational coordinates on the elliptic curve y 2 = x 3 N 2 x where N is a positive squarefree integer. Suppose that x satisfies three conditions: 1. x is the square of a rational number 2. x has an even denominator 1
2 3. x has a numerator that shares no common factor with N Then there exists a right angle triangle with rational sides and area N, that is, N is congruent. Theorem 2. A number N is congruent if and only if the elliptic curve y 2 = x 3 N 2 x has a rational point P = (x, y) distinct from (0, 0) and (±N, 0). Thus, determining congruent numbers can be reduced to finding rational points on elliptic curves! Proof of Theorem 1 Let (x, y) be a point with rational coordinates on the elliptic curve y 2 = x 3 N 2 x where N is a positive squarefree integer where x is a rational square, has even denominator (in lowest terms) and has a numerator that shares no common factor with N. Our goal is to trace backwards the proof from last week. Let u = x which is given to be rational. Set v = y u giving v 2 = y2 u = x3 N 2 x 2 x = x 2 N 2. Let d be the smallest integer such that du Z (namely the denominator of u in lowest terms). Note that d is even by assumption and that d 4 is the denominator for u 2 = x. Since v 2 = x 2 N 2 and N 2 is an integer, then d 4 is also the denominator of v 2. Multiplying everything by d 4 gives (d 2 v) 2 = (d 2 x) 2 (d 2 N) 2. Since (d 2 v) 2 = (d 2 x) 2 (d 2 N) 2, the triple (d 2 v, d 2 x, d 2 N) forms a Pythagorean triple. Since the numerator of x shares no common factor with N, we have that this is a primitive triple and thus, by problem set 1, there exist integers a and b of opposite parity such that d 2 N = 2ab d 2 v = a 2 b 2 d 2 x = a 2 + b 2 Create the triangle with sides 2a/d, 2b/d and 2u. This satisfies the Pythagorean Theorem since (2a/d) 2 + (2b/d) 2 = 4a 2 /d 2 + 4b 2 /d 2 = 4/d 2 (a 2 + b 2 ) = 4/d 2 (d 2 x) = 4x = (2u) 2 and it has area N since A = 1 2 2a d 2b d = 2ab d 2 = N. Summary of Theorem 1 From the triple, d 2 N = 2ab d 2 v = a 2 b 2 d 2 x = a 2 + b 2, we can add and subtract twice the first to the last equation to get d 2 (x + N) = a 2 + 2ab + b 2 = (a + b) 2 d 2 (x N) = a 2 2ab + b 2 = (a b) 2 2
3 Taking square roots yields d x + N = a + b d x N = a b (where above we ve assumed that 0 < b < a). Adding and subtracting and dividing by 2. gives expressions for a and b, namely a = d/2( x + N + x N) b = d/2( x + N x N) Example of Theorem 1 Let s find the triangle for N = 7. On the elliptic curve y 2 = x x, we close our eyes and pray we can find a triple that consists of integers. After some trying we see that (x, y) = (25, 120) gives a solution. Adding the point to itself gives 2P = (x 2P, y 2P ) where (using the formulas from last time) m = 3x2 7 2 = 913 ( ) 913 b = = y x 2P = m 2 2x = ( ) = 120 y 2P = mx 2P + b = Hence 2P = (113569/14400, / ). Now, d is the denominator of x 2P = 337/120 and so d = 120. Finding the a and b values gives... and This gives the triangle a = d/2( x + N + x N) = 120/2( / /14400, 7) = 288 b = d/2( x + N x N) = 120/2( / /14400, 7) = 175 2a d = = b d = = x = which indeed has area 7 and is a right angle triangle (the side lengths satisfy the Pythagorean Identity) Proof of Theorem 2 Theorem 2. A number N is congruent if and only if the elliptic curve y 2 = x 3 N 2 x has a rational point P = (x, y) distinct from (0, 0) and (±N, 0). We have already seen that if N is congruent, then we can find a rational point on the elliptic curve. 3
4 Now, suppose our elliptic curve has a rational point P = (x, y) where P is not one of (0, 0) and (±N, 0). Our goal will be to show that 2P satisfies the conditions of the previous theorem. Using the results of adding a point to itself from last time, we see that the x-coordinate of P + P on the elliptic curve y 2 = x 3 + Ax + B is given by ( 3x 2 ) 2 + A 2x = 9x4 + 6Ax 2 + A 2 2y 4y 2 2x = 9x4 + 6Ax 2 + A 2 2x = 9x4 + 6Ax 2 + A 2 + 2x 4(x3 + Ax + B) = 9x4 + 6Ax 2 + A 2 + 8x4 8Ax 2 8Bx = x4 2Ax 2 8Bx + A 2 Using the results of adding a point to itself from last time, we see that the x-coordinate of P + P on the elliptic curve y 2 = x 3 + Ax + B is given by ( 3x 2 ) 2 + A 2x = x4 2Ax 2 8Bx + A 2 2y Specializing to when A = N 2 and B = 0 (that is, on the elliptic curve y 2 = x 3 N 2 x) gives us the formula for the x-coordinate of P + P as Notice that by our restriction on the rational point P, the denominator is nonzero and the numerator is nonzero. satisfies that it is the square of a rational number. It is also true that the numerator shares no common factor with N. Suppose p divides x 2 + N 2 and p divides N for some prime p. Then p x and hence p 3 divides x 3 N 2 x = y 2. Hence p 3 divides y 2. Thus, in the x-coordinate above, we can factor out a p 2 in the numerator and cancel it with a p 2 in the denominator. By repeating this, the numerator can be reduced so that it shares no common factor with N. So it suffices to show that the number has an even denominator. immediately appears to have an even denominator but we need to be careful. What happens if the factor of 4 in the denominator cancels with the numerator? In what cases is this possible? 4
5 Case 1: x and N are even. Then 2 divides both x and N which means that the numerator and N share a common factor. Applying the previous argument shows that we can reduce the fraction. Case 2: x and N are odd. In this case, write x = 2a+1 and N = 2b+1. Plugging in and simplifying gives (x 2 + N 2 ) 2 = 16(a 2 + a + b 2 + b) (a 2 + a + b 2 + b) + 4 Hence 4 exactly divides the numerator. Since y 2 = x 3 N 2 x, we have that y is even and so at least 16 divides the denominator. Hence the denominator is even. Thus, this point P satisfies the conditions of the previous theorem and so the number N is congruent. Don Zagier To compute a rational point on the elliptic curve y 2 = x x, Zagier noted that if N 5 is divisible by 8 for a prime N, then each of the factors x and x ± N in y 2 = x 3 N 2 x must be of the form ±s 2, ±2s 2, ±ns 2 or ±2ns 2 where s is a rational number. Then, as an example, if x = A 2, x + n = B 2 and x n = C 2, simplifying gives us that we must solve C 2 B 2 = 2A 2 C 2 A 2 = n Similarly to the techniques we used to find Pythagorean triples, it must hold that A = 2RS M, B = R2 2S 2 M and C = R2 +2S 2 M for suitable integers R, S, M. In this way the problem is reduced to the solvability of M 2 N = R 4 + 4S 4. For N = 5 this has a clear solution but for N = 157, we need to apply this idea a few more times to the equation N = U 2 + 4V 2 and find a solution with UV a rational square. Then take U = R 2 /M and V = S 2 /M. The ideas here are difficult to flesh out but can be done which is what Zagier did. (Thanks to Carlos Beenakker!) Given the previous discussion, we have become interested in the following problem: How can we find a rational point on an elliptic curve of the form y 2 = x 3 + Ax + B? This is a complex problem! Points on Elliptic Curves over Z p Given a complex problem, sometimes we try to simplify it! In some sense the problem is that the rational numbers are too big. What we ll consider is dealing with points over a finite field, in this case, Z p. 5
6 We define the field Z p for a prime number p to be the set of integers and we state that two integers are equal in Z p provided they differ by a multiple of p. It will turn out over Z p that the group law will still hold. So for example, in Z 7, 1 and 15 are the same number because they differ by 14 which is divisible by 7. We denote this by 1 15 mod 7 and in general by a b mod p. Exercise 1 Which of the following numbers are equivalent to 1 in Z 5? Solutions to Exercise 1 Which of the following numbers are equivalent to 1 in Z 5? 1. 1 Equivalent since 5 divides 1 1 = Not equivalent since 5 does not divide 2 1 = Equivalent since 5 divides 6 1 = Not equivalent since 5 does not divide 17 1 = Equivalent since 5 divides 4 1 = Equivalent since 5 divides = (3 4 ) 50 1 = = (81 1)( ) (Think: x 1 is a factor of x 50 1 so 81 1 = 80 is a factor of and 5 divides 80 so 5 divides ). Working in Z p When we think about numbers in Z p for a prime p, we can restrict ourselves to just looking at numbers between 0 and p 1 inclusive since every number is equivalent to one of these numbers (this actually follows quickly from long division with remainders!) Hence, we sometimes write Z p = {0, 1, 2,..., p 1}. Points on Elliptic Curves over Finite Fields Now we can start to look at elliptic curves over different finite fields. Let s look at the elliptic curve y 2 = x 3 x. 6
7 In order to reduce this elliptic curve over a finite field, we need to avoid primes dividing the discriminant of the elliptic curve (see the problem sheet). In this case, the discriminant is 64 so we can look for points on finite fields over all Z p for odd primes. Over Z 3, we can look at all the possible x values, namely x = 0, 1, 2. These give the equations y 2 = mod 3 y 2 = = 0 mod 3 y 2 = = 6 0 mod 3 Hence, this elliptic curve when considered over Z 3 has three points (0, 0), (1, 0), (2, 0) and one more point for the point at infinity. What about the elliptic curve y 2 = x 3 x over Z 5? Again we can look at all the possible x values, namely x = 0, 1, 2, 3, 4. These give the equations y 2 = = 0 y 2 = = 0 y 2 = = 6 1 mod 5 y 2 = = 24 4 mod 5 y 2 = = 60 0 mod 5 Thus, we want to know what solutions we have for y 2 0 mod 5, y 2 1 mod 5 and y 2 4 mod 5. We can compute the squares modulo 5 via x x 2 mod Hence, this elliptic curve when considered over Z 5 has seven points (0, 0), (1, 0), (2, 1), (2, 4), (3, 2), (3, 3), (4, 0) and one more point for the point at infinity. What about the elliptic curve y 2 = x 3 4x over Z 5 (If you re quick, change 5 to 7 and 11 and see what happens)? Again we can look at all the possible x values, namely x = 0, 1, 2, 3, 4. These give the equations y 2 = 0 3 4(0) = 0 y 2 = 1 3 4(1) = 3 2 mod 5 y 2 = 2 3 4(2) = 0 y 2 = 3 3 4(3) = 15 0 mod 5 y 2 = 4 3 4(4) = 48 3 mod 5 From the table before, we see that 2 and 3 are not squares in Z 5. Hence the only points here are (0, 0), (2, 0), (3, 0) and the point at infinity. What can we do with these ideas? By taking the information at many primes, we can gain a lot of information about our elliptic curve. Elliptic curves can be used to help factor numbers (Lenstra s Algorithm). Elliptic Curves over finite fields form the basis for a cryptosystem in use today called Elliptic Curve Cryptography. They form a correspondence with certain types of modular forms which are another beautiful mathematical object with many applications. You now have a good foundation to pick up an introductory book on elliptic curves and start to study these objects more deeply. 7
Grade 11/12 Math Circles Elliptic Curves Dr. Carmen Bruni November 4, 2015
Faculty of Mathematics Waterloo, Ontario N2L 3G1 Centre for Education in Mathematics and Computing Grade 11/12 Math Circles Elliptic Curves Dr. Carmen Bruni November 4, 2015 Revisit the Congruent Number
More informationGrade 11/12 Math Circles Congruent Number Problem Dr. Carmen Bruni October 28, 2015
Faculty of Mathematics Waterloo, Ontario N2L 3G1 Number Theory Grade 11/12 Math Circles Congruent Number Problem Dr. Carmen Bruni October 28, 2015 Centre for Education in Mathematics and Computing Number
More informationElliptic Curves. Dr. Carmen Bruni. November 4th, University of Waterloo
University of Waterloo November 4th, 2015 Revisit the Congruent Number Problem Congruent Number Problem Determine which positive integers N can be expressed as the area of a right angled triangle with
More informationModular Arithmetic Instructor: Marizza Bailey Name:
Modular Arithmetic Instructor: Marizza Bailey Name: 1. Introduction to Modular Arithmetic If someone asks you what day it is 145 days from now, what would you answer? Would you count 145 days, or find
More informationTwitter: @Owen134866 www.mathsfreeresourcelibrary.com Prior Knowledge Check 1) Simplify: a) 3x 2 5x 5 b) 5x3 y 2 15x 7 2) Factorise: a) x 2 2x 24 b) 3x 2 17x + 20 15x 2 y 3 3) Use long division to calculate:
More informationCONGRUENT NUMBERS AND ELLIPTIC CURVES
CONGRUENT NUMBERS AND ELLIPTIC CURVES JIM BROWN Abstract. In this short paper we consider congruent numbers and how they give rise to elliptic curves. We will begin with very basic notions before moving
More informationTable of Contents. 2013, Pearson Education, Inc.
Table of Contents Chapter 1 What is Number Theory? 1 Chapter Pythagorean Triples 5 Chapter 3 Pythagorean Triples and the Unit Circle 11 Chapter 4 Sums of Higher Powers and Fermat s Last Theorem 16 Chapter
More informationDiscrete Mathematics and Probability Theory Fall 2013 Vazirani Note 3
CS 70 Discrete Mathematics and Probability Theory Fall 2013 Vazirani Note 3 Modular Arithmetic In several settings, such as error-correcting codes and cryptography, we sometimes wish to work over a smaller
More informationQ 2.0.2: If it s 5:30pm now, what time will it be in 4753 hours? Q 2.0.3: Today is Wednesday. What day of the week will it be in one year from today?
2 Mod math Modular arithmetic is the math you do when you talk about time on a clock. For example, if it s 9 o clock right now, then it ll be 1 o clock in 4 hours. Clearly, 9 + 4 1 in general. But on a
More informationCool Results on Primes
Cool Results on Primes LA Math Circle (Advanced) January 24, 2016 Recall that last week we learned an algorithm that seemed to magically spit out greatest common divisors, but we weren t quite sure why
More informationSome Highlights along a Path to Elliptic Curves
11/8/016 Some Highlights along a Path to Elliptic Curves Part : Conic Sections and Rational Points Steven J Wilson, Fall 016 Outline of the Series 1 The World of Algebraic Curves Conic Sections and Rational
More informationA-2. Polynomials and Factoring. Section A-2 1
A- Polynomials and Factoring Section A- 1 What you ll learn about Adding, Subtracting, and Multiplying Polynomials Special Products Factoring Polynomials Using Special Products Factoring Trinomials Factoring
More informationMATH 115, SUMMER 2012 LECTURE 4 THURSDAY, JUNE 21ST
MATH 115, SUMMER 2012 LECTURE 4 THURSDAY, JUNE 21ST JAMES MCIVOR Today we enter Chapter 2, which is the heart of this subject. Before starting, recall that last time we saw the integers have unique factorization
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 informationThe next sequence of lectures in on the topic of Arithmetic Algorithms. We shall build up to an understanding of the RSA public-key cryptosystem.
CS 70 Discrete Mathematics for CS Fall 2003 Wagner Lecture 10 The next sequence of lectures in on the topic of Arithmetic Algorithms. We shall build up to an understanding of the RSA public-key cryptosystem.
More informationARITHMETIC PROGRESSIONS OF THREE SQUARES
ARITHMETIC PROGRESSIONS OF THREE SQUARES KEITH CONRAD 1 Introduction Here are the first 10 perfect squares (ignoring 0): 1, 4, 9, 16, 25, 36, 49, 64, 81, 100 In this list there is an arithmetic progression:
More informationProofs. 29th January 2014
Proofs 29th January 2014 Housekeeping Your solutions to Problem Sheet 2 are due today at the start of class. Please make sure you have your name on them and that you put them in the correct pile! Don t
More informationPythagoras = $1 million problem. Ken Ono Emory University
Pythagoras = $1 million problem Ken Ono Emory University Pythagoras The Pythagorean Theorem Theorem (Pythagoras) If (a, b, c) is a right triangle, then a 2 + b 2 = c 2. Pythagoras The Pythagorean Theorem
More informationTHE 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
More informationMath101, Sections 2 and 3, Spring 2008 Review Sheet for Exam #2:
Math101, Sections 2 and 3, Spring 2008 Review Sheet for Exam #2: 03 17 08 3 All about lines 3.1 The Rectangular Coordinate System Know how to plot points in the rectangular coordinate system. Know the
More informationCongruent Number Problem and Elliptic curves
Congruent Number Problem and Elliptic curves December 12, 2010 Contents 1 Congruent Number problem 2 1.1 1 is not a congruent number.................................. 2 2 Certain Elliptic Curves 4 3 Using
More informationthat if a b (mod m) and c d (mod m), then ac bd (mod m) soyou aren't allowed to use this fact!) A5. (a) Show that a perfect square must leave a remain
PUTNAM PROBLEM SOLVING SEMINAR WEEK 2 The Rules. You are not allowed to try a problem that you already know how to solve. These are way too many problems to consider. Just pick a few problems in one of
More informationNotes: Pythagorean Triples
Math 5330 Spring 2018 Notes: Pythagorean Triples Many people know that 3 2 + 4 2 = 5 2. Less commonly known are 5 2 + 12 2 = 13 2 and 7 2 + 24 2 = 25 2. Such a set of integers is called a Pythagorean Triple.
More informationMath 109 HW 9 Solutions
Math 109 HW 9 Solutions Problems IV 18. Solve the linear diophantine equation 6m + 10n + 15p = 1 Solution: Let y = 10n + 15p. Since (10, 15) is 5, we must have that y = 5x for some integer x, and (as we
More informationMath Lecture 18 Notes
Math 1010 - Lecture 18 Notes Dylan Zwick Fall 2009 In our last lecture we talked about how we can add, subtract, and multiply polynomials, and we figured out that, basically, if you can add, subtract,
More information2. Two binary operations (addition, denoted + and multiplication, denoted
Chapter 2 The Structure of R The purpose of this chapter is to explain to the reader why the set of real numbers is so special. By the end of this chapter, the reader should understand the difference between
More informationMath Review. for the Quantitative Reasoning measure of the GRE General Test
Math Review for the Quantitative Reasoning measure of the GRE General Test www.ets.org Overview This Math Review will familiarize you with the mathematical skills and concepts that are important for solving
More informationSolutions to Assignment 1
Solutions to Assignment 1 Question 1. [Exercises 1.1, # 6] Use the division algorithm to prove that every odd integer is either of the form 4k + 1 or of the form 4k + 3 for some integer k. For each positive
More information, p 1 < p 2 < < p l primes.
Solutions Math 347 Homework 1 9/6/17 Exercise 1. When we take a composite number n and factor it into primes, that means we write it as a product of prime numbers, usually in increasing order, using exponents
More information2 Arithmetic. 2.1 Greatest common divisors. This chapter is about properties of the integers Z = {..., 2, 1, 0, 1, 2,...}.
2 Arithmetic This chapter is about properties of the integers Z = {..., 2, 1, 0, 1, 2,...}. (See [Houston, Chapters 27 & 28]) 2.1 Greatest common divisors Definition 2.16. If a, b are integers, we say
More informationMath 101 Study Session Spring 2016 Test 4 Chapter 10, Chapter 11 Chapter 12 Section 1, and Chapter 12 Section 2
Math 101 Study Session Spring 2016 Test 4 Chapter 10, Chapter 11 Chapter 12 Section 1, and Chapter 12 Section 2 April 11, 2016 Chapter 10 Section 1: Addition and Subtraction of Polynomials A monomial is
More informationIntermediate Math Circles February 26, 2014 Diophantine Equations I
Intermediate Math Circles February 26, 2014 Diophantine Equations I 1. An introduction to Diophantine equations A Diophantine equation is a polynomial equation that is intended to be solved over the integers.
More informationStudy Guide for Math 095
Study Guide for Math 095 David G. Radcliffe November 7, 1994 1 The Real Number System Writing a fraction in lowest terms. 1. Find the largest number that will divide into both the numerator and the denominator.
More informationHMMT February 2018 February 10, 2018
HMMT February 018 February 10, 018 Algebra and Number Theory 1. For some real number c, the graphs of the equation y = x 0 + x + 18 and the line y = x + c intersect at exactly one point. What is c? 18
More informationMath 101 Review of SOME Topics
Math 101 Review of SOME Topics Spring 007 Mehmet Haluk Şengün May 16, 007 1 BASICS 1.1 Fractions I know you all learned all this years ago, but I will still go over it... Take a fraction, say 7. You can
More informationDiscrete Mathematics and Probability Theory Summer 2014 James Cook Note 5
CS 70 Discrete Mathematics and Probability Theory Summer 2014 James Cook Note 5 Modular Arithmetic In several settings, such as error-correcting codes and cryptography, we sometimes wish to work over a
More informationARITHMETIC PROGRESSIONS OF THREE SQUARES
ARITHMETIC PROGRESSIONS OF THREE SQUARES KEITH CONRAD 1. Introduction Here are the first 10 perfect squares (ignoring 0): 1, 4, 9, 16, 25, 36, 49, 64, 81, 100. In this list there is an arithmetic progression:
More informationPELL S EQUATION, II KEITH CONRAD
PELL S EQUATION, II KEITH CONRAD 1. Introduction In Part I we met Pell s equation x dy = 1 for nonsquare positive integers d. We stated Lagrange s theorem that every Pell equation has a nontrivial solution
More informationSection September 6, If n = 3, 4, 5,..., the polynomial is called a cubic, quartic, quintic, etc.
Section 2.1-2.2 September 6, 2017 1 Polynomials Definition. A polynomial is an expression of the form a n x n + a n 1 x n 1 + + a 1 x + a 0 where each a 0, a 1,, a n are real numbers, a n 0, and n is a
More informationMATH 433 Applied Algebra Lecture 4: Modular arithmetic (continued). Linear congruences.
MATH 433 Applied Algebra Lecture 4: Modular arithmetic (continued). Linear congruences. Congruences Let n be a postive integer. The integers a and b are called congruent modulo n if they have the same
More informationx = x y and y = x + y.
8. Conic sections We can use Legendre s theorem, (7.1), to characterise all rational solutions of the general quadratic equation in two variables ax 2 + bxy + cy 2 + dx + ey + ef 0, where a, b, c, d, e
More informationCHMC: Finite Fields 9/23/17
CHMC: Finite Fields 9/23/17 1 Introduction This worksheet is an introduction to the fascinating subject of finite fields. Finite fields have many important applications in coding theory and cryptography,
More information2x 1 7. A linear congruence in modular arithmetic is an equation of the form. Why is the solution a set of integers rather than a unique integer?
Chapter 3: Theory of Modular Arithmetic 25 SECTION C Solving Linear Congruences By the end of this section you will be able to solve congruence equations determine the number of solutions find the multiplicative
More informationMath Theory of Number Homework 1
Math 4050 Theory of Number Homework 1 Due Wednesday, 015-09-09, in class Do 5 of the following 7 problems. Please only attempt 5 because I will only grade 5. 1. Find all rational numbers and y satisfying
More informationRational Expressions & Equations
Chapter 9 Rational Epressions & Equations Sec. 1 Simplifying Rational Epressions We simply rational epressions the same way we simplified fractions. When we first began to simplify fractions, we factored
More informationChapter P. Prerequisites. Slide P- 1. Copyright 2007 Pearson Education, Inc. Publishing as Pearson Addison-Wesley
Slide P- 1 Chapter P Prerequisites 1 P.1 Real Numbers Quick Review 1. List the positive integers between -4 and 4.. List all negative integers greater than -4. 3. Use a calculator to evaluate the expression
More information1 Introduction. 2 Solving Linear Equations
1 Introduction This essay introduces some new sets of numbers. Up to now, the only sets of numbers (algebraic systems) we know is the set Z of integers with the two operations + and and the system R of
More information2005 Pascal Contest (Grade 9)
Canadian Mathematics Competition An activity of the Centre for Education in Mathematics and Computing, University of Waterloo, Waterloo, Ontario 005 Pascal Contest (Grade 9) Wednesday, February 3, 005
More informationFACULTY FEATURE ARTICLE 6 The Congruent Number Problem
FACULTY FEATURE ARTICLE 6 The Congruent Number Problem Abstract Keith Conrad University of Connecticut Storrs, CT 06269 kconrad@math.uconn.edu We discuss a famous problem about right triangles with rational
More informationClock Arithmetic and Euclid s Algorithm
Clock Arithmetic and Euclid s Algorithm Lecture notes for Access 2008 by Erin Chamberlain. Earlier we discussed Caesar Shifts and other substitution ciphers, and we saw how easy it was to break these ciphers
More informationMATH 115, SUMMER 2012 LECTURE 12
MATH 115, SUMMER 2012 LECTURE 12 JAMES MCIVOR - last time - we used hensel s lemma to go from roots of polynomial equations mod p to roots mod p 2, mod p 3, etc. - from there we can use CRT to construct
More informationSection 2.4: Add and Subtract Rational Expressions
CHAPTER Section.: Add and Subtract Rational Expressions Section.: Add and Subtract Rational Expressions Objective: Add and subtract rational expressions with like and different denominators. You will recall
More informationMATH CSE20 Homework 5 Due Monday November 4
MATH CSE20 Homework 5 Due Monday November 4 Assigned reading: NT Section 1 (1) Prove the statement if true, otherwise find a counterexample. (a) For all natural numbers x and y, x + y is odd if one of
More informationSECTION 7.4: PARTIAL FRACTIONS. These Examples deal with rational expressions in x, but the methods here extend to rational expressions in y, t, etc.
SECTION 7.4: PARTIAL FRACTIONS (Section 7.4: Partial Fractions) 7.14 PART A: INTRO A, B, C, etc. represent unknown real constants. Assume that our polynomials have real coefficients. These Examples deal
More informationSolutions to Problem Set 4 - Fall 2008 Due Tuesday, Oct. 7 at 1:00
Solutions to 8.78 Problem Set 4 - Fall 008 Due Tuesday, Oct. 7 at :00. (a Prove that for any arithmetic functions f, f(d = f ( n d. To show the relation, we only have to show this equality of sets: {d
More information8 Elliptic Curve Cryptography
8 Elliptic Curve Cryptography 8.1 Elliptic Curves over a Finite Field For the purposes of cryptography, we want to consider an elliptic curve defined over a finite field F p = Z/pZ for p a prime. Given
More informationProof 1: Using only ch. 6 results. Since gcd(a, b) = 1, we have
Exercise 13. Consider positive integers a, b, and c. (a) Suppose gcd(a, b) = 1. (i) Show that if a divides the product bc, then a must divide c. I give two proofs here, to illustrate the different methods.
More informationSummer Mathematics Packet Say Hello to Algebra 2. For Students Entering Algebra 2
Summer Math Packet Student Name: Say Hello to Algebra 2 For Students Entering Algebra 2 This summer math booklet was developed to provide students in middle school an opportunity to review grade level
More information5.1 Simplifying Rational Expressions
5. Simplifying Rational Expressions Now that we have mastered the process of factoring, in this chapter, we will have to use a great deal of the factoring concepts that we just learned. We begin with the
More information2x 1 7. A linear congruence in modular arithmetic is an equation of the form. Why is the solution a set of integers rather than a unique integer?
Chapter 3: Theory of Modular Arithmetic 25 SECTION C Solving Linear Congruences By the end of this section you will be able to solve congruence equations determine the number of solutions find the multiplicative
More information1 Quadratic Functions
Unit 1 Quadratic Functions Lecture Notes Introductory Algebra Page 1 of 8 1 Quadratic Functions In this unit we will learn many of the algebraic techniques used to work with the quadratic function fx)
More informationMath 131 notes. Jason Riedy. 6 October, Linear Diophantine equations : Likely delayed 6
Math 131 notes Jason Riedy 6 October, 2008 Contents 1 Modular arithmetic 2 2 Divisibility rules 3 3 Greatest common divisor 4 4 Least common multiple 4 5 Euclidean GCD algorithm 5 6 Linear Diophantine
More informationPolynomials; Add/Subtract
Chapter 7 Polynomials Polynomials; Add/Subtract Polynomials sounds tough enough. But, if you look at it close enough you ll notice that students have worked with polynomial expressions such as 6x 2 + 5x
More informationChapter 1 Review of Equations and Inequalities
Chapter 1 Review of Equations and Inequalities Part I Review of Basic Equations Recall that an equation is an expression with an equal sign in the middle. Also recall that, if a question asks you to solve
More informationChapter 5. Number Theory. 5.1 Base b representations
Chapter 5 Number Theory The material in this chapter offers a small glimpse of why a lot of facts that you ve probably nown and used for a long time are true. It also offers some exposure to generalization,
More informationWinter Camp 2009 Number Theory Tips and Tricks
Winter Camp 2009 Number Theory Tips and Tricks David Arthur darthur@gmail.com 1 Introduction This handout is about some of the key techniques for solving number theory problems, especially Diophantine
More informationRational Points on Conics, and Local-Global Relations in Number Theory
Rational Points on Conics, and Local-Global Relations in Number Theory Joseph Lipman Purdue University Department of Mathematics lipman@math.purdue.edu http://www.math.purdue.edu/ lipman November 26, 2007
More informationExpanding brackets and factorising
Chapter 7 Expanding brackets and factorising This chapter will show you how to expand and simplify expressions with brackets solve equations and inequalities involving brackets factorise by removing a
More informationPart V. Chapter 19. Congruence of integers
Part V. Chapter 19. Congruence of integers Congruence modulo m Let m be a positive integer. Definition. Integers a and b are congruent modulo m if and only if a b is divisible by m. For example, 1. 277
More informationx 9 or x > 10 Name: Class: Date: 1 How many natural numbers are between 1.5 and 4.5 on the number line?
1 How many natural numbers are between 1.5 and 4.5 on the number line? 2 How many composite numbers are between 7 and 13 on the number line? 3 How many prime numbers are between 7 and 20 on the number
More informationGRE Quantitative Reasoning Practice Questions
GRE Quantitative Reasoning Practice Questions y O x 7. The figure above shows the graph of the function f in the xy-plane. What is the value of f (f( ))? A B C 0 D E Explanation Note that to find f (f(
More informationMATH 2112/CSCI 2112, Discrete Structures I Winter 2007 Toby Kenney Homework Sheet 5 Hints & Model Solutions
MATH 11/CSCI 11, Discrete Structures I Winter 007 Toby Kenney Homework Sheet 5 Hints & Model Solutions Sheet 4 5 Define the repeat of a positive integer as the number obtained by writing it twice in a
More information2005 Cayley Contest. Solutions
anadian Mathematics ompetition n activity of the entre for Education in Mathematics and omputing, University of Waterloo, Waterloo, Ontario 005 ayley ontest (Grade 10) Wednesday, February 3, 005 Solutions
More informationClock Arithmetic. 1. If it is 9 o clock and you get out of school in 4 hours, when do you get out of school?
Clock Arithmetic We are going to learn all about clock addition and the relationship to remainders when you divide numbers. 1 Standard Clock Addition 1. If it is 9 o clock and you get out of school in
More information1. (a) q = 4, r = 1. (b) q = 0, r = 0. (c) q = 5, r = (a) q = 9, r = 3. (b) q = 15, r = 17. (c) q = 117, r = 11.
000 Chapter 1 Arithmetic in 1.1 The Division Algorithm Revisited 1. (a) q = 4, r = 1. (b) q = 0, r = 0. (c) q = 5, r = 3. 2. (a) q = 9, r = 3. (b) q = 15, r = 17. (c) q = 117, r = 11. 3. (a) q = 6, r =
More informationPartial Fractions. Combining fractions over a common denominator is a familiar operation from algebra: 2 x 3 + 3
Partial Fractions Combining fractions over a common denominator is a familiar operation from algebra: x 3 + 3 x + x + 3x 7 () x 3 3x + x 3 From the standpoint of integration, the left side of Equation
More informationMath 110 HW 3 solutions
Math 0 HW 3 solutions May 8, 203. For any positive real number r, prove that x r = O(e x ) as functions of x. Suppose r
More informationM381 Number Theory 2004 Page 1
M81 Number Theory 2004 Page 1 [[ Comments are written like this. Please send me (dave@wildd.freeserve.co.uk) details of any errors you find or suggestions for improvements. ]] Question 1 20 = 2 * 10 +
More informationCoach Stones Expanded Standard Pre-Calculus Algorithm Packet Page 1 Section: P.1 Algebraic Expressions, Mathematical Models and Real Numbers
Coach Stones Expanded Standard Pre-Calculus Algorithm Packet Page 1 Section: P.1 Algebraic Expressions, Mathematical Models and Real Numbers CLASSIFICATIONS OF NUMBERS NATURAL NUMBERS = N = {1,2,3,4,...}
More informationQuadratic Equations Part I
Quadratic Equations Part I Before proceeding with this section we should note that the topic of solving quadratic equations will be covered in two sections. This is done for the benefit of those viewing
More informationTomáš Madaras Congruence classes
Congruence classes For given integer m 2, the congruence relation modulo m at the set Z is the equivalence relation, thus, it provides a corresponding partition of Z into mutually disjoint sets. Definition
More informationPUTNAM TRAINING NUMBER THEORY. Exercises 1. Show that the sum of two consecutive primes is never twice a prime.
PUTNAM TRAINING NUMBER THEORY (Last updated: December 11, 2017) Remark. This is a list of exercises on Number Theory. Miguel A. Lerma Exercises 1. Show that the sum of two consecutive primes is never twice
More informationNo Solution Equations Let s look at the following equation: 2 +3=2 +7
5.4 Solving Equations with Infinite or No Solutions So far we have looked at equations where there is exactly one solution. It is possible to have more than solution in other types of equations that are
More information1 Rational Exponents and Radicals
Introductory Algebra Page 1 of 11 1 Rational Eponents and Radicals 1.1 Rules of Eponents The rules for eponents are the same as what you saw earlier. Memorize these rules if you haven t already done so.
More informationDiscrete Mathematics and Probability Theory Fall 2018 Alistair Sinclair and Yun Song Note 6
CS 70 Discrete Mathematics and Probability Theory Fall 2018 Alistair Sinclair and Yun Song Note 6 1 Modular Arithmetic In several settings, such as error-correcting codes and cryptography, we sometimes
More informationExercise Sheet 3 - Solutions
Algebraic Geometry D-MATH, FS 2016 Prof. Pandharipande Exercise Sheet 3 - Solutions 1. Prove the following basic facts about algebraic maps. a) For f : X Y and g : Y Z algebraic morphisms of quasi-projective
More informationThere are two main properties that we use when solving linear equations. Property #1: Additive Property of Equality
Chapter 1.1: Solving Linear and Literal Equations Linear Equations Linear equations are equations of the form ax + b = c, where a, b and c are constants, and a zero. A hint that an equation is linear is
More informationAlgebra Review. Finding Zeros (Roots) of Quadratics, Cubics, and Quartics. Kasten, Algebra 2. Algebra Review
Kasten, Algebra 2 Finding Zeros (Roots) of Quadratics, Cubics, and Quartics A zero of a polynomial equation is the value of the independent variable (typically x) that, when plugged-in to the equation,
More informationMA094 Part 2 - Beginning Algebra Summary
MA094 Part - Beginning Algebra Summary Page of 8/8/0 Big Picture Algebra is Solving Equations with Variables* Variable Variables Linear Equations x 0 MA090 Solution: Point 0 Linear Inequalities x < 0 page
More informationLESSON 8.1 RATIONAL EXPRESSIONS I
LESSON 8. RATIONAL EXPRESSIONS I LESSON 8. RATIONAL EXPRESSIONS I 7 OVERVIEW Here is what you'll learn in this lesson: Multiplying and Dividing a. Determining when a rational expression is undefined Almost
More informationFermat s Last Theorem for Regular Primes
Fermat s Last Theorem for Regular Primes S. M.-C. 22 September 2015 Abstract Fermat famously claimed in the margin of a book that a certain family of Diophantine equations have no solutions in integers.
More informationThe Euclidean Algorithm and Multiplicative Inverses
1 The Euclidean Algorithm and Multiplicative Inverses Lecture notes for Access 2009 The Euclidean Algorithm is a set of instructions for finding the greatest common divisor of any two positive integers.
More informationSUMMER REVIEW PACKET. Name:
Wylie East HIGH SCHOOL SUMMER REVIEW PACKET For students entering Regular PRECALCULUS Name: Welcome to Pre-Calculus. The following packet needs to be finished and ready to be turned the first week of the
More informationELLIPTIC CURVES BJORN POONEN
ELLIPTIC CURVES BJORN POONEN 1. Introduction The theme of this lecture is to show how geometry can be used to understand the rational number solutions to a polynomial equation. We will illustrate this
More information1 Introduction. 2 Solving Linear Equations. Charlotte Teacher Institute, Modular Arithmetic
1 Introduction This essay introduces some new sets of numbers. Up to now, the only sets of numbers (algebraic systems) we know is the set Z of integers with the two operations + and and the system R of
More informationGrade 6 Math Circles November 1 st /2 nd. Egyptian Mathematics
Faculty of Mathematics Waterloo, Ontario N2L 3G Centre for Education in Mathematics and Computing Grade 6 Math Circles November st /2 nd Egyptian Mathematics Ancient Egypt One of the greatest achievements
More informationGrade 7/8 Math Circles November 21/22/23, The Scale of Numbers
Faculty of Mathematics Waterloo, Ontario N2L 3G1 Introduction Grade 7/8 Math Circles November 21/22/23, 2017 The Scale of Numbers Centre for Education in Mathematics and Computing Last week we quickly
More informationA field F is a set of numbers that includes the two numbers 0 and 1 and satisfies the properties:
Byte multiplication 1 Field arithmetic A field F is a set of numbers that includes the two numbers 0 and 1 and satisfies the properties: F is an abelian group under addition, meaning - F is closed under
More informationUnit 2-1: Factoring and Solving Quadratics. 0. I can add, subtract and multiply polynomial expressions
CP Algebra Unit -1: Factoring and Solving Quadratics NOTE PACKET Name: Period Learning Targets: 0. I can add, subtract and multiply polynomial expressions 1. I can factor using GCF.. I can factor by grouping.
More informationPre Calculus with Mrs. Bluell
Welcome to Pre Calculus with Mrs. Bluell Quick Review Today's Topics include Interval Notation Exponent Rules Quadrants Distance Formula Midpoint Formula Circle Formula Alligator Mouths to Interval Notation
More information