Exploring Number Theory via Diophantine Equations
|
|
- Eleanore Gaines
- 5 years ago
- Views:
Transcription
1 Exploring Number Theory via Diophantine Equations Department of Mathematics Colorado College Fall, 2009
2 Outline Some History Linear Pythagorean Triples Introduction to Continued Fractions Elementary Problems and Early Work Fermat s Last Theorem
3 Diophantus Diophantine equations are named after the Greek mathematician Diophantus, c. 250, of Alexandria. In his Arithmetica, a treatise of several books, he studies some 200 equations in two or more variables with the restriction that the solutions be rational numbers. (1570) Bombelli included translated parts in his Algebra. (1575) Holzmann (a.k.a. Xylander) attempted a completed translation. (1593) Viète reproduced a large part in his Zetetica. (1621) Bachet published Diophantus text in Greek, as well as a Latin translation with commentary.
4 Fermat, Euler, and Gauss Weil, in his book Number Theory, remarks that the birth of modern number theory happens on two occassions.... by 1636, as we learn from his correspondence, [Fermat] had not only studied [Bachet] but was already developing ideas of his own... In Euler reports that he has just been reading Fermat and that he has been greatly impressed by Fermat s assertion that every integer is a sum of four squares... In 1801, Gauss Disquisitiones Arithmeticae marked the culmination of the work of Fermat, Euler, and others. Gauss also introduces fundamental concepts such as congruences and generalized integers.
5 Hilbert In 1900, with the long history of mathematicians working on various Diophatine equations, David Hilbert challenged the mathematical community to find an algorithm which would determine, given a Diophantine equation, whether or not there is a solution in the integers. Theorem (Davis-Putnam-Robinson, Matijasevi c) There is no such algorithm. This theorem, in some sense, forces us to attack Diophantine equations in a more reserved manner, but also ensures that there is still work to do.
6 Linear Pythagorean Triples An Example Suppose there is a piggy bank which contains only quarters, dimes, and nickels, with a total value of $10. Can we determine exactly how many of each coin is inside? A model we could use for answering this question is a linear Diophantine equation 25x + 10y + 5z = 1000, with x representing the number of quarters, y the dimes, and z the nickels.
7 Linear Pythagorean Triples Two-Variable Linear A linear Diophantine equation in two variables is of the form ax + by + c = 0 or ax + by = c, with a, b, and c integers, and for which the variables x and y can only have integer values. Question Can we determine when such an equation has a solution? Example Consider 30x + 14y = 1. We can rewrite this as 2(15x + 7y) = 1, so the left side is always even and the right side is never even.
8 Linear Pythagorean Triples Greatest Common Divisor The greatest common divisor, or GCD, of two integers a and b is the largest positive integer which divides both a and b. We denote it by (a, b). Example Let a = 30 and b = 14. Since 30 = 2 15 = and 14 = 2 7, the common divisors are ±1 and ±2. So (30, 14) = 2. We can express the GCD as a linear combination : 2 = = 30(1) + 14( 2).
9 Linear Pythagorean Triples Existence of a Solution In the example 30x + 14y = 1, the GCD of 30 and 14 does not divide 1 and the equation has no solutions. Consider 30x + 14y = 6. With x = 1 and y = 2, we saw 30(1) + 14( 2) = 2. Since 6 = 2 3, when we try x = 3, and y = 2 3 = 6: 30(3) + 14( 6) = 3( 30(1) + 14( 2) ) = 3(2) = 6. Theorem For ax + by = c, there is a solution when c is divisible by (a, b), otherwise there are none.
10 Linear Pythagorean Triples All Solutions We have explored when a solution exists, but in number theory we would like to understand all solutions. We continue with 30x + 14y = 6, and the solution x = 3, y = 6 above. Suppose u and v give another solution. 30u + 14v = 30(3) + 14( 6) 30(u 3) = 14( 6 v) 15(u 3) = 7( 6 v) This forces, for some integer k, u = 3 7k and v = k, so our one explicit solution tells us how to get all the others.
11 Linear Pythagorean Triples Pythagorean Triples A familiar non-linear Diophantine equation is x 2 + y 2 = z 2. We see (3, 4, 5), (6, 8, 10), and (5, 12, 13) all satisfy the equation. Questions Are we in a situation as above? Does one solution produce others in a simple way? All others? If (x, y, z) is Pythagorean, then so is (kx, ky, kz) since (kx) 2 + (ky) 2 = k 2 (x 2 + y 2 ) = k 2 z 2 = (kz) 2. So, (3, 4, 5) produces (6, 8, 10), (9, 12, 15),..., (51, 68, 85),...
12 Linear Pythagorean Triples Primitive Solutions Let (x, y, z) be Pythagorean, with (x, y) = (x, z) = (y, z) = 1. (We may assume x, z are odd and y is even.) Factoring, we get y 2 = z 2 x 2 = (z + x)(z x), and since y is even, ( y ) ( ) ( ) 2 z + x z x = Since (x, z) = 1, the terms on the right have no common factors. With a little algebra we get, for some integers r and s, z + x = 2r 2, z x = 2s 2, and y = 2rs.
13 Linear Pythagorean Triples Gaussian Integers Recall all complex numbers can be written as a + ib, where a and b are real numbers and i := 1. If we only allow integer values for a and b we have the set Z[i] of Gaussian integers. Fact Z[i] enjoys the property of unique factorization into primes. In Z[i], we can factor z 2 = x 2 + y 2 = (x + iy)(x iy), and then unique factorization leads to x + iy = (r + si) 2 = (r 2 s 2 ) + i(2rs).
14 Introduction to Continued Fractions Elementary Problems and Let d be an integer. A Pell equation is one of the form x 2 dy 2 = ±1. In 1657, Fermat challenged the English mathematicians of the time to solve x 2 dy 2 = 1 for general d, and if failing that to at least try x 2 61y 2 = 1 and x 2 109y 2 = 1, where he chose small coefficients pour ne vous donner pas trop de peine (so you don t have too much work). d x y
15 Introduction to Continued Fractions Elementary Problems and Simple Cases With any Pell equation x 2 dy 2 = 1, there are the trivial solutions x = ±1, y = 0, and possibly x = 0, y = ±1. Suppose d = 1. Then there can be no non-trivial solutions since x 2 ( 1)y 2 = x 2 + y 2 1. Now suppose d = 4 (a perfect square). Then x 2 4y 2 = x 2 (2 2 )y 2 = x 2 (2y) 2 = (x 2y)(x + 2y) = 1.
16 Introduction to Continued Fractions Elementary Problems and Remaining Cases From now on we assume d > 0 and is not a perfect square. Fact If d > 0 is not a perfect square then d is irrational. Notice that for x, y > 0 x 2 dy 2 = 1 ( ) x 2 = d + 1 y y 2 d. So, x y is a rational number which approximates d.
17 Introduction to Continued Fractions Elementary Problems and Approximating Irrational Numbers Let x be an irrational number. We define a sequence of integers {a 0, a 1, a 2,...} as follows. Set a 0 to be the largest integer < x, and x 1 = 1/(x a 0 ). Note that x 1 is irrational and x 1 > 1. Set a 1 to be the largest integer < x 1, and x 2 = 1/(x 1 a 1 ).... Set a i to be the largest integer < x i, and x i+1 = 1/(x i a i ). This gives a sequence of rational approximations to x p 0 q 0 = a 0, p 1 q 1 = a a 1, p 2 1 = a 0 + q 2 a 1 + 1,... a 2
18 Introduction to Continued Fractions Elementary Problems and An Example Consider x = 2. First, 1 < x < 2, so a 0 = 1 and x 1 = 1/( 2 1) = Next, 2 < x 1 < 3, so a 1 = 2 and then 1 x 2 = ( = 1 2+1) = Since x 2 = x 1, the process repeats and our sequence is {1, 2, 2, 2,...}. The sequence of rational approximations is then p 0 q 0 = 1, p 1 q 1 = = 3 2, p 2 q 2 = = 7 5,...
19 Introduction to Continued Fractions Elementary Problems and Applications to Theorem If 2 p q < 1 then p 2q 2 q approximations of 2. is one of the continued fraction rational What if we know x, y > 0 is a solution to x 2 2y 2 = 1? Example: d = 2 Let x = 17, y = 12: = = = <
20 Introduction to Continued Fractions Elementary Problems and Generating New Solutions If we allow ourselves to work with d, we have and multiplication formula x 2 dy 2 = (x + y d)(x y d) (x ± y d)(u ± v d) = (xu + dyv) ± (xv + uy) d. With these, if x 2 dy 2 = 1 and u 2 dv 2 = 1 then 1 = (x 2 dy 2 )(u dv 2 ) = (x dy)(x + dy)(u dv)(u + dv) = (x dy)(u dv)(x + dy)(u + dv) = (xu + dyv) 2 d(xv + uy) 2.
21 Introduction to Continued Fractions Elementary Problems and An Example Now, from one solution with x > 0 and y > 0, we have infinitely many solutions x n + y n d = (x + y d) n, for n 1. Example: d = 2 We see that x = 3, y = 2 is a solution to x 2 2y 2 = 1. ( ) 2 = ( ) 3 = ( ) 4 = ( ) 5 =
22 Introduction to Continued Fractions Elementary Problems and A Complete Solution Theorem (Lagrange, 1768) There exists a positive integer solution x 1, y 1 to the Pell equation x 2 dy 2 = 1 such that all other positive integer solutions x n, y n are derived from it via the power rule x n + y n d = (x1 + y 1 d) n, for n 1. Note: It not quite as simple to describe the solutions of x 2 dy 2 = 1, but they will still come from the rational approximation process described above.
23 Introduction to Continued Fractions Elementary Problems and Polygonal Numbers The d-gonal numbers are partial sums of the arithmetic progression with initial term 1 and common difference d 2. T n = n = n(n+1) 2 S n = (2n 1) = n 2 P n = (3n 2) = 3n2 n 2
24 Introduction to Continued Fractions Elementary Problems and Triangular-Square Numbers A triangular-square number: T m = S n for some m and n. Question Are there any triangular-square numbers besides 1? By the formulae above T m = S n m 2 +m 2 = n 2 m 2 + m = 2n 2 ( ) m = 2n2 (2m + 1) 2 1 = 2(2n) 2 (2m + 1) 2 2(2n) 2 = 1.
25 Introduction to Continued Fractions Elementary Problems and Triangular-Square Numbers So, the question is reduced to solving x 2 2y 2 = 1 with x, y > 0 and x odd, y even. It turns out that to satisfy this equation, x must be odd and y must be even. x y m = (x 1)/ n = y/ T m = S n Note T 49 = S 35 = 1225 means = (These numbers are Sloane s A )
26 Introduction to Continued Fractions Elementary Problems and Square-Pentagonal Numbers A square-pentagonal number: S m = P n for some m and n. Question Are there any square-pentagonal numbers besides 1? By the formulae above S m = m 2 = 2m 2 = P n 3n2 n 2 3n 2 n ( (n 2m 2 = (2m) 2 = (6n 1) 2 1 (6n 1) 2 6(2m) 2 = 1. ) )
27 Introduction to Continued Fractions Elementary Problems and Square-Pentagonal Numbers This time the problem is reduced to solving x 2 6y 2 = 1, with x, y > 0, x = 6n 1, and y even. In x 2 6y 2 = 1, y is always even, x = 6n ± 1, but not necessarily x = 6n 1. x y m n S m = P n (These numbers are Sloane s A )
28 Introduction to Continued Fractions Elementary Problems and Pythagorean Triples again Are there other Pythagorean triples like (3, 4, 5), i.e. with consecutive numbers in the first two variables? We want to solve m 2 + (m + 1) 2 = n 2. Notice that here, n must be odd. 2m 2 + 2m + 1 = n 2 ( 2(m 2 + m) + 1 = n 2 (m ) ) = n 2 (2m + 1) = 2n 2 (2m + 1) 2 2n 2 = 1
29 Introduction to Continued Fractions Elementary Problems and Pythagorean Triples again m 2 + (m + 1) 2 = n 2 (2m + 1) 2 2n 2 = 1. So, we need to understand solutions to x 2 2y 2 = 1. It turns out x and y must be odd, so our condition on n is automatic. x y m = (x 1)/ n = y = 5 2, = 29 2, =
30 Introduction to Continued Fractions Elementary Problems and Pythagorean Triples again Are there Pythagorean triples with consecutive numbers in the last two variables? We want m 2 + n 2 = (n + 1) 2, which is equivalent to m 2 = 2n + 1. So, m needs to be odd, i.e. m = 2k + 1. This makes n = (m 2 1)/2 = 2k 2 + 2k. k k k 2 + 2k k 2 + 2k This has nothing to do with Pell s equation.
31 Early Work Fermat s Last Theorem An Example In the 17 th century, Bachet and Fermat studied the equation y 2 = x 3 2. We will see that this equation has a finite number of solutions in the integers. We can start by simple trial-and-error: x = 1: = 1 2 = 1, no possible (real) y. x = 2: = 8 2 = 6, no possible (integer) y. x = 3: = 27 2 = 25 = 5 2, so y = ±5 works. So far, (3, ±5) are two integral solution of the equation.
32 Early Work Fermat s Last Theorem Integral Solutions of y 2 = x 3 2 Recall: Z[i] consists of complex numbers x + iy, with x, y restricted to the integers. If we denote α = 2, we can define a set Z[α] of complex numbers of the form x + αy, again with x, y restricted to the integers. Fact Z[α] also has the property of unique factorization into primes. In Z[α], the equation y 2 = x 3 2 can be factored (y + α)(y α) = x 3.
33 Early Work Fermat s Last Theorem Integral Solutions of y 2 = x 3 2 From (y + α)(y α) = x 3 and unique factorization, one obtains y + α = (u + αv) 3, u, v integers. Expanding the right-hand side and collecting terms gives y = u 3 6uv 2 and 1 = 3u 2 2v 3 = v(3u 2 2v 2 ), so it must be that u = v = 1. Thus, the only integral solutions to y 2 = x 3 2 are (3, ±5).
34 Early Work Fermat s Last Theorem The equation y 2 = x 3 2 is an example of an elliptic curve. More generally, an elliptic curve is the set of solutions to an equation of the form y 2 = x 3 + ax 2 + bx + c. For integral solutions there is a nice theorem. Theorem (Siegel, 1926) If a, b, and c are integers, then there are only finitely many integral solutions to y 2 = x 3 + ax 2 + bx + c.
35 Early Work Fermat s Last Theorem Adding Solutions For elliptic curves, understanding all of the solutions in the rational numbers is a much more complicated problem.
36 Early Work Fermat s Last Theorem Mordell-Weil Theorem In 1922, Mordell used Fermat s idea of descent to prove Theorem (Mordell, 1922) For y 2 = x 3 + ax 2 + bx + c, with a, b, and c integers, there exists a finite set of rational solutions (x 1, y 1 ),..., (x r, y r ) such that all other rational solutions can be obtained from these by repeated application of the chord-tangent process. Problem This proof only gives existence. Currently, there is no method to generate this finite set, nor a way to determine just how many points (the rank) are needed in this finite set.
37 Early Work Fermat s Last Theorem The Statement In his copy of Bachet, Fermat stated: Cubum autem in duos cubos, aut quadratoquadratum in duos quadratoquadratos, et generaliter nullam in infinitum ultra quadratum potestatem in duos eiusdem nominis fas est dividere cuius rei demonstrationem mirabilem sane detexi. Hanc marginis exiguitas non caperet. It is impossible to separate a cube into two cubes, or a fourth power into two fourth powers, or in general, any power higher than the second into two like powers. I have discovered a truly marvellous proof of this, which this margin is too narrow to contain. I.e., the equation x n + y n = z n has no integer solutions.
38 Early Work Fermat s Last Theorem Frey, Ribet, and Wiles In 1985, Frey suggested that one consider the elliptic curve E a,b,c : y 2 = x(x a n )(x + b n ) where a n + b n = c n. A conjecture of Taniyama and Shimura states that such an elliptic curve should be modular. Theorem (Ribet) E a,b,c is not modular. Theorem (Wiles-Taylor) E a,b,c is modular. So, assuming there exist integers a, b, c with a n + b n = c n leads to a contradiction by way of a strange elliptic curve.
39 Early Work Fermat s Last Theorem The End Thank you for your attention.
Indtroduction to Diophantine Equations
Indtroduction to Diophantine Equations Qingyun Wang November 13, 2011 (In the very beginning, divide the class into 4 groups, we will constantly do some competions, and the winners will earn a certain
More informationLogic and Mathematics. 1. Lecture
l211 Logic and Mathematics 1. Lecture Norbert PREINING preining@jaist.ac.jp www.preining.info/l211/index-en.html 2014-10-7 Self-introduction Logic and Mathematics Aims of the course Ideas and concepts
More informationImpact of Women in Number Theory
Impact of Women in Number Theory Allysa Lumley Impact of Women Mathematicians on Research and Education in Mathematics BIRS 2018 March 17, 2018 Allysa Lumley (York) Impact of Women in Number Theory March
More informationAn Elementary Proof Of Fermat s Last Theorem
An Elementary Proof Of Fermat s Last Theorem Bezaliel Anotida Joshua July 22, 2015 ABSTRACT. In 1995, Princeton professor, Sir Andrew John Wiles, quenched the quest for a proof of Fermat s Last Theorem
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 informationHistory of Mathematics
History of Mathematics Paul Yiu Department of Mathematics Florida Atlantic University Summer 2011 6A: Fermat: Beginning of modern number theory (2) Fermat s little theorem Given a prime p, and any geometric
More informationOutline of the Seminar Topics on elliptic curves Saarbrücken,
Outline of the Seminar Topics on elliptic curves Saarbrücken, 11.09.2017 Contents A Number theory and algebraic geometry 2 B Elliptic curves 2 1 Rational points on elliptic curves (Mordell s Theorem) 5
More information= 5 2 and = 13 2 and = (1) = 10 2 and = 15 2 and = 25 2
BEGINNING ALGEBRAIC NUMBER THEORY Fermat s Last Theorem is one of the most famous problems in mathematics. Its origin can be traced back to the work of the Greek mathematician Diophantus (third century
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 informationMath Topics in Algebra Course Notes: A Proof of Fermat s Last Theorem. Spring 2013
Math 847 - Topics in Algebra Course Notes: A Proof of Fermat s Last Theorem Spring 013 January 6, 013 Chapter 1 Background and History 1.1 Pythagorean triples Consider Pythagorean triples (x, y, z) so
More informationDiscrete Logarithms. Let s begin by recalling the definitions and a theorem. Let m be a given modulus. Then the finite set
Discrete Logarithms Let s begin by recalling the definitions and a theorem. Let m be a given modulus. Then the finite set Z/mZ = {[0], [1],..., [m 1]} = {0, 1,..., m 1} of residue classes modulo m is called
More informationDATA PRIVACY AND SECURITY
DATA PRIVACY AND SECURITY Instructor: Daniele Venturi Master Degree in Data Science Sapienza University of Rome Academic Year 2018-2019 Interlude: Number Theory Cubum autem in duos cubos, aut quadratoquadratum
More information. In particular if a b then N(
Gaussian Integers II Let us summarise what we now about Gaussian integers so far: If a, b Z[ i], then N( ab) N( a) N( b). In particular if a b then N( a ) N( b). Let z Z[i]. If N( z ) is an integer prime,
More informationElliptic Curves. Kenneth A. Ribet. PARC Forum October 17, UC Berkeley
UC Berkeley PARC Forum October 17, 2008 In talking about elliptic curves, one can do no better than to quote the Yale mathematician Serge Lang (1927 2005), who began one of his many monographs as follows:
More informationEXAMPLES OF MORDELL S EQUATION
EXAMPLES OF MORDELL S EQUATION KEITH CONRAD 1. Introduction The equation y 2 = x 3 +k, for k Z, is called Mordell s equation 1 on account of Mordell s long interest in it throughout his life. A natural
More informationShi Feng Sheng Danny Wong
Exhibit C A Proof of the Fermat s Last Theorem Shi Feng Sheng Danny Wong Abstract: Prior to the Diophantine geometry, number theory (or arithmetic) was to study the patterns of the numbers and elementary
More informationFermat s Marvelous Proofs for Fermat s Last Theorem. Abstract
Fermat s Marvelous Proofs for Fermat s Last Theorem Chun-Xuan, Jiang Institute for Basic Research Palm Harbor, FL468-577, USA and P. O. Box 94, Beijing 00854, China jiangchunxuan@sohu.com Abstract Using
More informationInstructor: Daniele Venturi. Master Degree in Data Science Sapienza University of Rome Academic Year
Data Privacy and Security Instructor: Daniele Venturi Master Degree in Data Science Sapienza University of Rome Academic Year 2017-2018 Interlude: Number Theory Cubum autem in duos cubos, aut quadratoquadratum
More informationEXAMPLES OF MORDELL S EQUATION
EXAMPLES OF MORDELL S EQUATION KEITH CONRAD 1. Introduction The equation y 2 = x 3 +k, for k Z, is called Mordell s equation 1 on account of Mordell s long interest in it throughout his life. A natural
More informationChakravala - a modern Indian method. B.Sury
Chakravala - a modern Indian method BSury Indian Statistical Institute Bangalore, India sury@isibangacin IISER Pune, India Lecture on October 18, 2010 1 Weil Unveiled What would have been Fermat s astonishment
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 informationFermat s Last Theorem
Fermat s Last Theorem T. Muthukumar tmk@iitk.ac.in 0 Jun 014 An ancient result states that a triangle with vertices A, B and C with lengths AB = a, BC = b and AC = c is right angled at B iff a + b = c.
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 information24/10/ Dr Ray Adams
Fermat s Conjecture 24/10/2017 1 Dr Ray Adams Fermat s Conjecture 24/10/2017 2 Dr Ray Adams Fermat s Conjecture 24/10/2017 3 Dr Ray Adams Fermat s Conjecture 24/10/2017 4 Dr Ray Adams Fermat s Conjecture
More informationIntroduction to Number Theory
INTRODUCTION Definition: Natural Numbers, Integers Natural numbers: N={0,1,, }. Integers: Z={0,±1,±, }. Definition: Divisor If a Z can be writeen as a=bc where b, c Z, then we say a is divisible by b or,
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 informationArithmetic Progressions Over Quadratic Fields
Arithmetic Progressions Over Quadratic Fields Alexander Diaz, Zachary Flores, Markus Vasquez July 2010 Abstract In 1640 Pierre De Fermat proposed to Bernard Frenicle de Bessy the problem of showing that
More information1. multiplication is commutative and associative;
Chapter 4 The Arithmetic of Z In this chapter, we start by introducing the concept of congruences; these are used in our proof (going back to Gauss 1 ) that every integer has a unique prime factorization.
More informationOn the Cardinality of Mersenne Primes
On the Cardinality of Mersenne Primes Garimella Rama Murthy, Associate Professor, International Institute of Information Technology (IIIT), Gachibowli, Hyderabad-32,AP,INDIA ABSTRACT In this research paper,
More informationMath Circle Beginners Group February 28, 2016 Euclid and Prime Numbers Solutions
Math Circle Beginners Group February 28, 2016 Euclid and Prime Numbers Solutions Warm-up Problems 1. What is a prime number? Give an example of an even prime number and an odd prime number. A prime number
More informationLecture 2. The Euclidean Algorithm and Numbers in Other Bases
Lecture 2. The Euclidean Algorithm and Numbers in Other Bases At the end of Lecture 1, we gave formulas for the greatest common divisor GCD (a, b), and the least common multiple LCM (a, b) of two integers
More informationSquare-Triangular Numbers
Square-Triangular Numbers Jim Carlson April 26, 2004 Contents 1 Introduction 2 2 Existence 2 3 Finding an equation 3 4 Solutions by brute force 4 5 Speeding things up 5 6 Solutions by algebraic numbers
More informationPerspectives of Mathematics
Perspectives of Mathematics Module on Diophantine Equations and Geometry Fall 2004 Michael Stoll What is a diophantine equation? 1. Introduction and Examples Being diophantine is not so much a property
More informationElliptic Curves & Number Theory. R. Sujatha School of Mathematics TIFR
Elliptic Curves & Number Theory R. Sujatha School of Mathematics TIFR Aim: To explain the connection between a simple ancient problem in number theory and a deep sophisticated conjecture about Elliptic
More informationGaussian integers. 1 = a 2 + b 2 = c 2 + d 2.
Gaussian integers 1 Units in Z[i] An element x = a + bi Z[i], a, b Z is a unit if there exists y = c + di Z[i] such that xy = 1. This implies 1 = x 2 y 2 = (a 2 + b 2 )(c 2 + d 2 ) But a 2, b 2, c 2, d
More informationContents Part A Number Theory Highlights in the History of Number Theory: 1700 BC 2008
Contents Part A Number Theory 1 Highlights in the History of Number Theory: 1700 BC 2008... 3 1.1 Early Roots to Fermat... 3 1.2 Fermat... 6 1.2.1 Fermat s Little Theorem... 7 1.2.2 Sums of Two Squares...
More informationMATH 4400 SOLUTIONS TO SOME EXERCISES. 1. Chapter 1
MATH 4400 SOLUTIONS TO SOME EXERCISES 1.1.3. If a b and b c show that a c. 1. Chapter 1 Solution: a b means that b = na and b c that c = mb. Substituting b = na gives c = (mn)a, that is, a c. 1.2.1. Find
More informationAlmost fifth powers in arithmetic progression
Almost fifth powers in arithmetic progression L. Hajdu and T. Kovács University of Debrecen, Institute of Mathematics and the Number Theory Research Group of the Hungarian Academy of Sciences Debrecen,
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 informationElliptic Curves and Mordell s Theorem
Elliptic Curves and Mordell s Theorem Aurash Vatan, Andrew Yao MIT PRIMES December 16, 2017 Diophantine Equations Definition (Diophantine Equations) Diophantine Equations are polynomials of two or more
More informationNumber Theory in Problem Solving. Konrad Pilch
Number Theory in Problem Solving Konrad Pilch April 7, 2016 1 Divisibility Number Theory concerns itself mostly with the study of the natural numbers (N) and the integers (Z). As a consequence, it deals
More informationENTRY NUMBER THEORY. [ENTRY NUMBER THEORY] Authors: Oliver Knill: 2003 Literature: Hua, introduction to number theory.
ENTRY NUMBER THEORY [ENTRY NUMBER THEORY] Authors: Oliver Knill: 2003 Literature: Hua, introduction to number theory ABC conjecture [ABC conjecture] If a,b,c are positive integers, let N(a,b,c) be the
More informationMath Circle Beginners Group February 28, 2016 Euclid and Prime Numbers
Math Circle Beginners Group February 28, 2016 Euclid and Prime Numbers Warm-up Problems 1. What is a prime number? Give an example of an even prime number and an odd prime number. (a) Circle the prime
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 informationSOLUTIONS TO PROBLEM SET 1. Section = 2 3, 1. n n + 1. k(k + 1) k=1 k(k + 1) + 1 (n + 1)(n + 2) n + 2,
SOLUTIONS TO PROBLEM SET 1 Section 1.3 Exercise 4. We see that 1 1 2 = 1 2, 1 1 2 + 1 2 3 = 2 3, 1 1 2 + 1 2 3 + 1 3 4 = 3 4, and is reasonable to conjecture n k=1 We will prove this formula by induction.
More informationThe world of Diophantine equations
Indian Statistical Institute Bangalore, India sury@isibang.ac.in National seminar on Algebra and Number Theory Pavanatma College, Idukki, Kerala December 5, 2014 Diophantus of Alexandria, Egypt lived during
More informationChapter 1 Why Quadratic Diophantine Equations?
Chapter 1 Why Quadratic Diophantine Equations? In order to motivate the study of quadratic type equations, in this chapter we present several problems from various mathematical disciplines leading to such
More informationElementary Number Theory
Elementary Number Theory 21.8.2013 Overview The course discusses properties of numbers, the most basic mathematical objects. We are going to follow the book: David Burton: Elementary Number Theory What
More informationSums of four squares and Waring s Problem Brandon Lukas
Sums of four squares and Waring s Problem Brandon Lukas Introduction The four-square theorem states that every natural number can be represented as the sum of at most four integer squares. Look at the
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 informationLEGENDRE S THEOREM, LEGRANGE S DESCENT
LEGENDRE S THEOREM, LEGRANGE S DESCENT SUPPLEMENT FOR MATH 370: NUMBER THEORY Abstract. Legendre gave simple necessary and sufficient conditions for the solvablility of the diophantine equation ax 2 +
More informationDiophantine equations
Diophantine equations So far, we have considered solutions to equations over the real and complex numbers. This chapter instead focuses on solutions over the integers, natural and rational numbers. There
More informationMAS114: Exercises. October 26, 2018
MAS114: Exercises October 26, 2018 Note that the challenge problems are intended to be difficult! Doing any of them is an achievement. Please hand them in on a separate piece of paper if you attempt them.
More informationASSIGNMENT Use mathematical induction to show that the sum of the cubes of three consecutive non-negative integers is divisible by 9.
ASSIGNMENT 1 1. Use mathematical induction to show that the sum of the cubes of three consecutive non-negative integers is divisible by 9. 2. (i) If d a and d b, prove that d (a + b). (ii) More generally,
More informationOn the polynomial x(x + 1)(x + 2)(x + 3)
On the polynomial x(x + 1)(x + 2)(x + 3) Warren Sinnott, Steven J Miller, Cosmin Roman February 27th, 2004 Abstract We show that x(x + 1)(x + 2)(x + 3) is never a perfect square or cube for x a positive
More informationLECTURE 2 FRANZ LEMMERMEYER
LECTURE 2 FRANZ LEMMERMEYER Last time we have seen that the proof of Fermat s Last Theorem for the exponent 4 provides us with two elliptic curves (y 2 = x 3 + x and y 2 = x 3 4x) in the guise of the quartic
More information1 Total Gadha s Complete Book of NUMBER SYSTEM TYPES OF NUMBERS Natural Numbers The group of numbers starting from 1 and including 1,,, 4, 5, and so on, are known as natural numbers. Zero, negative numbers,
More informationContest Number Theory
Contest Number Theory Andre Kessler December 7, 2008 Introduction Number theory is one of the core subject areas of mathematics. It can be somewhat loosely defined as the study of the integers. Unfortunately,
More informationNumber Theory. Henry Liu, 6 July 2007
Number Theory Henry Liu, 6 July 007 1. Introduction In one sentence, number theory is the area of mathematics which studies the properties of integers. Some of the most studied subareas are the theories
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 informationA Classical Introduction to Modern Number Theory
Kenneth Ireland Michael Rosen A Classical Introduction to Modern Number Theory Second Edition Springer Contents Preface to the Second Edition Preface v vii CHAPTER 1 Unique Factorization 1 1 Unique Factorization
More informationSOLUTIONS Math 345 Homework 6 10/11/2017. Exercise 23. (a) Solve the following congruences: (i) x (mod 12) Answer. We have
Exercise 23. (a) Solve the following congruences: (i) x 101 7 (mod 12) Answer. We have φ(12) = #{1, 5, 7, 11}. Since gcd(7, 12) = 1, we must have gcd(x, 12) = 1. So 1 12 x φ(12) = x 4. Therefore 7 12 x
More informationIntroduction to Arithmetic Geometry
Introduction to Arithmetic Geometry 18.782 Andrew V. Sutherland September 5, 2013 What is arithmetic geometry? Arithmetic geometry applies the techniques of algebraic geometry to problems in number theory
More informationFACTORIZATION AND THE PRIMES
I FACTORIZATION AND THE PRIMES 1. The laws of arithmetic The object of the higher arithmetic is to discover and to establish general propositions concerning the natural numbers 1, 2, 3,... of ordinary
More informationAlgebraic Number Theory. René Schoof
Algebraic Number Theory René Schoof Rome, Spring 2003 [Version of 5 October 2009; edited by BJJ Moonen] Contents 1 Introduction 1 2 Number fields 9 3 Norms, traces and discriminants 15 4 Rings of integers
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 informationExplicit Methods in Algebraic Number Theory
Explicit Methods in Algebraic Number Theory Amalia Pizarro Madariaga Instituto de Matemáticas Universidad de Valparaíso, Chile amaliapizarro@uvcl 1 Lecture 1 11 Number fields and ring of integers Algebraic
More 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 informationa the relation arb is defined if and only if = 2 k, k
DISCRETE MATHEMATICS Past Paper Questions in Number Theory 1. Prove that 3k + 2 and 5k + 3, k are relatively prime. (Total 6 marks) 2. (a) Given that the integers m and n are such that 3 (m 2 + n 2 ),
More informationGROUP ROUND INSTRUCTIONS
GROUP ROUND INSTRUCTIONS Your team will have 40 minutes to answer 10 questions. Each team will have the same questions. Each question is worth 6 points. However, some questions are easier than others!
More informationPELL S EQUATION NATIONAL INSTITUTE OF TECHNOLOGY ROURKELA, ODISHA
PELL S EQUATION A Project Report Submitted by PANKAJ KUMAR SHARMA In partial fulfillment of the requirements For award of the degree Of MASTER OF SCIENCE IN MATHEMATICS UNDER GUIDANCE OF Prof GKPANDA DEPARTMENT
More informationLinear Diophantine Equations
Parabola Volume 49, Issue 2 (2013) Linear Diophantine Equations David Angell 1 Many popular and well known puzzles can be approached by setting up and solving equations. Frequently, however, it will be
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 informationDiscrete Math, Second Problem Set (June 24)
Discrete Math, Second Problem Set (June 24) REU 2003 Instructor: Laszlo Babai Scribe: D Jeremy Copeland 1 Number Theory Remark 11 For an arithmetic progression, a 0, a 1 = a 0 +d, a 2 = a 0 +2d, to have
More informationInteger-sided equable shapes
Integer-sided equable shapes Shapes with integer side lengths and with equal area and perimeter. Rectangles ab = (a + b) 1 = 1 a + 1 b Trapezia 6 8 14 1 4 3 0 Triangles 6 10 8 P = = 4 13 1 P = = 30 8 10
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 informationARITHMETIC PROGRESSION OF SQUARES AND SOLVABILITY OF THE DIOPHANTINE EQUATION 8x = y 2
International Conference in Number Theory and Applications 01 Department of Mathematics, Faculty of Science, Kasetsart University Speaker: G. K. Panda 1 ARITHMETIC PROGRESSION OF SQUARES AND SOLVABILITY
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 informationPrimes. Rational, Gaussian, Industrial Strength, etc. Robert Campbell 11/29/2010 1
Primes Rational, Gaussian, Industrial Strength, etc Robert Campbell 11/29/2010 1 Primes and Theory Number Theory to Abstract Algebra History Euclid to Wiles Computation pencil to supercomputer Practical
More informationNumbers, Groups and Cryptography. Gordan Savin
Numbers, Groups and Cryptography Gordan Savin Contents Chapter 1. Euclidean Algorithm 5 1. Euclidean Algorithm 5 2. Fundamental Theorem of Arithmetic 9 3. Uniqueness of Factorization 14 4. Efficiency
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 informationDiophantine equations and beyond
Diophantine equations and beyond lecture King Faisal prize 2014 Gerd Faltings Max Planck Institute for Mathematics 31.3.2014 G. Faltings (MPIM) Diophantine equations and beyond 31.3.2014 1 / 23 Introduction
More informationElliptic Curves and the abc Conjecture
Elliptic Curves and the abc Conjecture Anton Hilado University of Vermont October 16, 2018 Anton Hilado (UVM) Elliptic Curves and the abc Conjecture October 16, 2018 1 / 37 Overview 1 The abc conjecture
More informationAlgebraic Number Theory and Fermat s Last Theorem
Algebraic Number Theory and Fermat s Last Theorem Edward Evans Project Advisor: Dr. Daniel Robertz, School of Computing, Electronics, and Mathematics, Plymouth University, Drake Circus, Plymouth, PL4 8AA
More informationCryptography. Number Theory with AN INTRODUCTION TO. James S. Kraft. Lawrence C. Washington. CRC Press
AN INTRODUCTION TO Number Theory with Cryptography James S Kraft Gilman School Baltimore, Maryland, USA Lawrence C Washington University of Maryland College Park, Maryland, USA CRC Press Taylor & Francis
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 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 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 informationPell s Equation Claire Larkin
Pell s Equation is a Diophantine equation in the form: Pell s Equation Claire Larkin The Equation x 2 dy 2 = where x and y are both integer solutions and n is a positive nonsquare integer. A diophantine
More informationON SOME DIOPHANTINE EQUATIONS (I)
An. Şt. Univ. Ovidius Constanţa Vol. 10(1), 2002, 121 134 ON SOME DIOPHANTINE EQUATIONS (I) Diana Savin Abstract In this paper we study the equation m 4 n 4 = py 2,where p is a prime natural number, p
More informationarxiv: v2 [math.nt] 23 Sep 2011
ELLIPTIC DIVISIBILITY SEQUENCES, SQUARES AND CUBES arxiv:1101.3839v2 [math.nt] 23 Sep 2011 Abstract. Elliptic divisibility sequences (EDSs) are generalizations of a class of integer divisibility sequences
More informationThe Surprising Proofs
The Surprising Proofs By Leszek W. Guła Lublin-POLAND lwgula@wp.pl May 30, June 12 13 and July 02 03, 2017 Abstract. The proof of the Fermat s Last Theorem. The proof of the theorem - For all and for all
More informationGrade 8 Chapter 7: Rational and Irrational Numbers
Grade 8 Chapter 7: Rational and Irrational Numbers In this chapter we first review the real line model for numbers, as discussed in Chapter 2 of seventh grade, by recalling how the integers and then the
More informationA Local-Global Principle for Diophantine Equations
A Local-Global Principle for Diophantine Equations (Extended Abstract) Richard J. Lipton and Nisheeth Vishnoi {rjl,nkv}@cc.gatech.edu Georgia Institute of Technology, Atlanta, GA 30332, USA. Abstract.
More informationA Motivated Introduction to Modular Forms
May 3, 2006 Outline of talk: I. Motivating questions II. Ramanujan s τ function III. Theta Series IV. Congruent Number Problem V. My Research Old Questions... What can you say about the coefficients of
More information15 Elliptic curves and Fermat s last theorem
15 Elliptic curves and Fermat s last theorem Let q > 3 be a prime (and later p will be a prime which has no relation which q). Suppose that there exists a non-trivial integral solution to the Diophantine
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 informationALGEBRA. 1. Some elementary number theory 1.1. Primes and divisibility. We denote the collection of integers
ALGEBRA CHRISTIAN REMLING 1. Some elementary number theory 1.1. Primes and divisibility. We denote the collection of integers by Z = {..., 2, 1, 0, 1,...}. Given a, b Z, we write a b if b = ac for some
More informationSolutions to Practice Final
s to Practice Final 1. (a) What is φ(0 100 ) where φ is Euler s φ-function? (b) Find an integer x such that 140x 1 (mod 01). Hint: gcd(140, 01) = 7. (a) φ(0 100 ) = φ(4 100 5 100 ) = φ( 00 5 100 ) = (
More informationSQUARES FROM SUMS OF FIXED POWERS. Mark Bauer and Michael A. Bennett University of Calgary and University of British Columbia, Canada
SQUARES FROM SUMS OF FIXED POWERS Mark Bauer and Michael A. Bennett University of Calgary and University of British Columbia, Canada Abstract. In this paper, we show that if p and q are positive integers,
More information