FERMAT S LAST THEOREM
|
|
- Mae Rodgers
- 5 years ago
- Views:
Transcription
1 FERMAT S LAST THEOREM REVISITED AGAIN Colin Newton 8/0/08 0
2 FERMAT S LAST THEOREM When Fermat wrote a note in the margin of his coy of Bachet s Arithmetica to the effect that he had a marvellous roof that x n + y n z n where n is any integer greater than, erhas he was thinking along the following lines. The argument is based on the roof that if y and z are nth owers then x is not an nth ower, conversely if both x and y are nth owers then z is not an nth ower. The roofs investigate owers of n, n + and n for all n > 0. Definition Define a Pythagorean Trile (PT) as x + y = z, and all three are integers. Definition Define a Diohantine Trile (DT) as y x = zd, and all three are integers. Theorem Proof Any integer x > with ( w < x) x generates all Pythagorean Triles. x + y = z and without loss of generality assume x < y then x = z y = (z y)(z + y) since (z y)(z + y) = z + z y y z y = z y. Let z y = w then z = y + w and x = w (y + w + y) therefore x = w (y + w) = yw + w hence yw = x w and y = x w and z = y + w = x w + w = x + w For x >, w x and for y to be ositive, w < x. Notes for Theorem. If x is even, w odd or even, then y, and hence z, may be fractions with the denominator equal to. e.g. for x =, y = 5/ and z = 7/ with w =, multilying by gives the Trile (8, 5, 7 ). x = 0 roduces (0,, 6) with w =, but also (0, /, 9/) with w = and (0, 5/, 5/) with w = 5. Multily by to obviate the roblem. For all Primitive Pythagorean Triles GCD (x, y) = : For x > there always exists a Pythagorean Trile, for x odd let w =, x even let w =. If x is odd, w is odd since the numerators of both y and z must be even to be divisible by. If x is even, and w is even then the numerators of both y and z are divisible by. 5 If x is odd, w is odd and y is even, if x is even, w is even and y is odd, in both cases z is odd. Theorem Any integer x > with ( wd < x) x generates all Diohantine Triles. Proof y x = zd. For zd to be ositive and without loss of generality assume x < y then x = y zd = (y zd)(y + zd) since (y zd)(y + zd) = y + yzd zdy zd = y zd. Let y zd = wd then y = zd + wd and x = wd (zd + wd + zd) hence x = wd (zd + wd) = zd wd + wd therefore zd wd = x wd and zd = x w d and y = zd + wd = x w d + w d = x + w d Note For Theorem below, the x and y in Theorem are equal to the x and y in Theorem.
3 Theorem Proof. Any integer x > and w such that ( w < x) x cannot generate both a Pythagorean Trile and a Diohantine Trile simultaneously. Assume that x + y = z is a PT, then to generate a DT requires that y x = zd, hence zd = (x w ) w x = (x w ) w x w w = z y from Theorem and zd = x 6x w + w zd an integer. To be square the exression under the must be of the form x x w + w = (x w ) by the Binomial Theorem, i.e. the coefficients of the exansion of (x w ) are given by the nd row of Pascal s Triangle. Assume that y x = zd is a DT, then to generate a PT requires that x + y = z hence z = (x + w d) w + x = (x + w d) + w dx d w wd = y zd from Theorem d and z = x + 6x w d + w d z an integer. To be square the exression under the must be of the form x + x wd + wd = (x + wd ) by the Binomial Theorem, i.e. the coefficients of the exansion of (x + wd ) are given by the nd row of Pascal s Triangle. Before roceeding, a coule of Lemmas (Lemmata?) and also a coule of identities. Lemma The roduct of two squares is also a square. Proof x y = (x y) for all x and y greater than 0. Lemma Proof Identity Identity Theorem The roduct of two numbers, where one or both are non-square is not a square. x y = (x y) x y square for one or both x and y > and square. (x + y) n = c0x n + cx n- y + cx n- y cx y n- + c0y n by the Binomial Theorem where the coefficients c0, c, c,... c, c, c0 are the values of the corresonding numbers in the nth row of Pascal s Triangle and c0 =. x n y n = (x y) (x n- + x n- y + x n- y x y n- + x y n- + y n- ) where all the coefficients are. It is left to the reader to multily it out to rove it. Fermat s Last Theorem for x + y a fourth ower. Proof The roof is for x or y not being a fourth ower, hence x + y z. Assume for a contradiction, x + y = z then x = z y = (z y ) (z + y ) where both (z y ) and (z + y ) require to be square by Lemma. However, by Theorems, and, if (z y ) = a square then (z + y ) a square and vice-versa, hence (z y ) (z + y ) a square by Lemma, therefore x is not a square and not equal to a fourth ower since x = (x ), this roves x z y hence the equation x + y z is true. Exchanging x and y roduces the same result
4 Theorem 5 Fermat s Last Theorem for n, i.e. x n + y n z n for all n >. The roof is by induction on n. For n = x + y = z x = z y = (z y ) (z + y ) x by Theorems, and, and already roven by Theorem. For n x n + y n = z n x n = z n y n = z n y n = (z n y n ) (z n + y n ) = (Z Y ) (Z + Y ) where Z = z n and Y = y n but (Z Y ) (Z + Y ) a fourth ower by Theorems,, and. For (n + ) x (n+) + y (n+) = z (n+) x (n+) = z (n+) y (n+) = z (n+) y (n+) = (z (n+) y (n+) ) (z (n+) + y (n+) ) = (Z Y ) (Z + Y ) where Z = z (n+) and Y = y (n+) but (Z Y ) (Z + Y ) a fourth ower by Theorems,, and. Theorems and 5 rove that the equation x n + y n z n is true for all n > 0. Theorem 6 Fermat s Last Theorem for n + where n =, i.e. x 6 + y 6 z 6. then Assume for a contradiction that x 6 + y 6 = z 6 x 6 = y 6 z 6. x 6 = (z y ) (z + z y + y ). To be a sixth ower, the first bracket requires to be a square which it may be by Theorem, but also the second bracket requires to be a fourth ower, which is imossible since to be so, it requires to be of the form (z + z y + y ) by the Binomial Theorem as er Identity. Hence x is not a sixth ower and the equation x 6 + y 6 z 6 is true. Theorem 7 Fermat s Last Theorem for n + where n is any integer >. The roof is by induction on n, the case for n = is roven by Theorem 6 but for n > n + x n+ + y n+ = z n+ x n+ = z n+ y n+ therefore x n + = (z y ) (z n + z n- y x y n- + y n ) where the first bracket may be square by Theorem, however all the coefficients of the second bracket are, but for a fourth ower should be the coefficients of the nth row of Pascal s Triangle by the Binomial Theorem as er Identity. Hence x is not a (n + )th ower and the equation x n+ + y n+ z n+ is true for all n >. (n + ) + x (n+)+ + y (n+)+ = z (n+)+ x (n+)+ = z (n+)+ y (n+)+ therefore x (n+)+ = (z y ) (z (n+) + z (n+)- y x y (n+)- + y (n+) ) where the first bracket may be square by Theorem, however all the coefficients of the second bracket are, but for a fourth ower, require to be the coefficients of the (n + )th row of Pascal s Triangle by the Binomial Theorem as er Identity. Hence x is not a ((n + ) + )th ower and the equation x (n+)+ z (n+)+ y (n+)+ x (n+)+ + y (n+)+ z (n+)+ is true for all n >. Theorems to 7 rove Fermat s Last Theorem is true for all even owers of n greater than.
5 Theorem 8 Fermat s Last Theorem for n where n is any integer > 0. The roof is by induction on n. For n = n = x + y = z x = z y = (z y) (z + z y + y ) by Identity. The only two factors that satisfy this equation are x and x but (z + z y + y ) square since, by the Binomial Theorem it must be of the form (z + z y + y ) = (z + y). Hence, by Lemma, x z y i.e. x + y z. Note (z y) (z + z y + y ) = z + z y + z y z y z y y = z y. For n x n- + y n- = z n- x n- = z n- y n- and by Identity = (z y) (z n- + z n- y z y n- + y n- ) where the second bracket may be the exansion of several factors. The only two factors that satisfy this equation are x and x n-. The second bracket cannot be a (n )th ower, since it is of the form of Identity and not of the form of Identity, hence x n- + y n- z n- and therefore equation x n- + y n- z n- is true. (n + ) x (n+)- + y (n+)- = z (n+)- x (n+)- = z (n+)- y (n+)- and by Identity = (z y) (z (n+)- + z (n+)- y zy (n+)- + y (n+)- ) where the second bracket may be the exansion of several factors. The only two factors that satisfy this equation are x and x (n+)-. The second bracket cannot be a ((n+)-)th ower, since by the Binomial Theorem, it must be of the form of Identity. Therefore x is not a ((n + ) )th ower and the equation x (n+)- y (n+)- + z (n +)- x (n+)- + y (n+)- z (n+)- is true. Theorem 9 Fermat s Last Theorem for n + where n is any integer > 0. The roof is by induction on n. For n = n + = 5 x 5 + y 5 = z 5 x 5 = z 5 y 5 = (z y)(z + z y + z y + zy + y ). The only two factors that satisfy this equation are x and x but (z + z y + z y + zy + y ) a fourth ower since to be so requires that (z + z y + 6 z y + z y + y ) = (z + y) by the Binomial Theorem. Hence x 5 z 5 y 5 and therefore equation x 5 + y 5 z 5 is true. For n + x n + + y n + = z x n + = z y and by Identity = (z y) (z n + z n - y z y n - + y n ) where the second bracket may be the exansion of several factors. The only two factors that satisfy this equation are x and x n. The second bracket cannot be a nth ower, since it is of the form of Identity and not of the form of Identity, and therefore x n + y n + z and hence equation x n + + y n + z is true. (n + ) + x (n+)+ + y (n+)+ = z (n+)+ x (n+)+ = z (n+)+ y (n+)+ = (z y) (z (n+) + z (n+)- y + z (n+)- y... + z y (n+)- + y (n+ ) where the second bracket may be the exansion of several factors. The only two factors that satisfy this equation are x and x (n+). The second bracket cannot be a (n + )th ower, since it is of the form of Identity and not of the form of Identity, hence x (n+)+ z (n+)+ y (n+)+ which imlies that the equation x (n+)+ + y (n+)+ z (n+)+ is true. Theorems 8 and 9 rove Fermat s Last Theorem is true for all odd owers of n greater than.
Practice Final Solutions
Practice Final Solutions 1. Find integers x and y such that 13x + 1y 1 SOLUTION: By the Euclidean algorithm: One can work backwards to obtain 1 1 13 + 2 13 6 2 + 1 1 13 6 2 13 6 (1 1 13) 7 13 6 1 Hence
More informationPractice Final Solutions
Practice Final Solutions 1. True or false: (a) If a is a sum of three squares, and b is a sum of three squares, then so is ab. False: Consider a 14, b 2. (b) No number of the form 4 m (8n + 7) can be written
More informationMath 104B: Number Theory II (Winter 2012)
Math 104B: Number Theory II (Winter 01) Alina Bucur Contents 1 Review 11 Prime numbers 1 Euclidean algorithm 13 Multilicative functions 14 Linear diohantine equations 3 15 Congruences 3 Primes as sums
More informationMath 4400/6400 Homework #8 solutions. 1. Let P be an odd integer (not necessarily prime). Show that modulo 2,
MATH 4400 roblems. Math 4400/6400 Homework # solutions 1. Let P be an odd integer not necessarily rime. Show that modulo, { P 1 0 if P 1, 7 mod, 1 if P 3, mod. Proof. Suose that P 1 mod. Then we can write
More informationPythagorean triples and sums of squares
Pythagorean triles and sums of squares Robin Chaman 16 January 2004 1 Pythagorean triles A Pythagorean trile (x, y, z) is a trile of ositive integers satisfying z 2 + y 2 = z 2. If g = gcd(x, y, z) then
More informationHENSEL S LEMMA KEITH CONRAD
HENSEL S LEMMA KEITH CONRAD 1. Introduction In the -adic integers, congruences are aroximations: for a and b in Z, a b mod n is the same as a b 1/ n. Turning information modulo one ower of into similar
More informationMATH 2710: NOTES FOR ANALYSIS
MATH 270: NOTES FOR ANALYSIS The main ideas we will learn from analysis center around the idea of a limit. Limits occurs in several settings. We will start with finite limits of sequences, then cover infinite
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 informationBy Evan Chen OTIS, Internal Use
Solutions Notes for DNY-NTCONSTRUCT Evan Chen January 17, 018 1 Solution Notes to TSTST 015/5 Let ϕ(n) denote the number of ositive integers less than n that are relatively rime to n. Prove that there
More informationMersenne and Fermat Numbers
NUMBER THEORY CHARLES LEYTEM Mersenne and Fermat Numbers CONTENTS 1. The Little Fermat theorem 2 2. Mersenne numbers 2 3. Fermat numbers 4 4. An IMO roblem 5 1 2 CHARLES LEYTEM 1. THE LITTLE FERMAT THEOREM
More informationJonathan Sondow 209 West 97th Street, New York, New York
#A34 INTEGERS 11 (2011) REDUCING THE ERDŐS-MOSER EQUATION 1 n + 2 n + + k n = (k + 1) n MODULO k AND k 2 Jonathan Sondow 209 West 97th Street, New York, New York jsondow@alumni.rinceton.edu Kieren MacMillan
More informationAn Overview of Witt Vectors
An Overview of Witt Vectors Daniel Finkel December 7, 2007 Abstract This aer offers a brief overview of the basics of Witt vectors. As an alication, we summarize work of Bartolo and Falcone to rove that
More informationQUADRATIC RECIPROCITY
QUADRATIC RECIPROCITY JORDAN SCHETTLER Abstract. The goals of this roject are to have the reader(s) gain an areciation for the usefulness of Legendre symbols and ultimately recreate Eisenstein s slick
More informationp-adic Properties of Lengyel s Numbers
1 3 47 6 3 11 Journal of Integer Sequences, Vol. 17 (014), Article 14.7.3 -adic Proerties of Lengyel s Numbers D. Barsky 7 rue La Condamine 75017 Paris France barsky.daniel@orange.fr J.-P. Bézivin 1, Allée
More informationQUADRATIC RECIPROCITY
QUADRATIC RECIPROCITY JORDAN SCHETTLER Abstract. The goals of this roject are to have the reader(s) gain an areciation for the usefulness of Legendre symbols and ultimately recreate Eisenstein s slick
More informationRepresenting Integers as the Sum of Two Squares in the Ring Z n
1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 17 (2014), Article 14.7.4 Reresenting Integers as the Sum of Two Squares in the Ring Z n Joshua Harrington, Lenny Jones, and Alicia Lamarche Deartment
More information1 Integers and the Euclidean algorithm
1 1 Integers and the Euclidean algorithm Exercise 1.1 Prove, n N : induction on n) 1 3 + 2 3 + + n 3 = (1 + 2 + + n) 2 (use Exercise 1.2 Prove, 2 n 1 is rime n is rime. (The converse is not true, as shown
More informationThe Group of Primitive Almost Pythagorean Triples
The Grou of Primitive Almost Pythagorean Triles Nikolai A. Krylov and Lindsay M. Kulzer arxiv:1107.2860v2 [math.nt] 9 May 2012 Abstract We consider the triles of integer numbers that are solutions of the
More information19th Bay Area Mathematical Olympiad. Problems and Solutions. February 28, 2017
th Bay Area Mathematical Olymiad February, 07 Problems and Solutions BAMO- and BAMO- are each 5-question essay-roof exams, for middle- and high-school students, resectively. The roblems in each exam are
More informationThe Euler Phi Function
The Euler Phi Function 7-3-2006 An arithmetic function takes ositive integers as inuts and roduces real or comlex numbers as oututs. If f is an arithmetic function, the divisor sum Dfn) is the sum of the
More informationARITHMETIC PROGRESSIONS OF POLYGONAL NUMBERS WITH COMMON DIFFERENCE A POLYGONAL NUMBER
#A43 INTEGERS 17 (2017) ARITHMETIC PROGRESSIONS OF POLYGONAL NUMBERS WITH COMMON DIFFERENCE A POLYGONAL NUMBER Lenny Jones Deartment of Mathematics, Shiensburg University, Shiensburg, Pennsylvania lkjone@shi.edu
More informationAlgebraic Number Theory
Algebraic Number Theory Joseh R. Mileti May 11, 2012 2 Contents 1 Introduction 5 1.1 Sums of Squares........................................... 5 1.2 Pythagorean Triles.........................................
More informationSets of Real Numbers
Chater 4 Sets of Real Numbers 4. The Integers Z and their Proerties In our revious discussions about sets and functions the set of integers Z served as a key examle. Its ubiquitousness comes from the fact
More informationIntrinsic Approximation on Cantor-like Sets, a Problem of Mahler
Intrinsic Aroximation on Cantor-like Sets, a Problem of Mahler Ryan Broderick, Lior Fishman, Asaf Reich and Barak Weiss July 200 Abstract In 984, Kurt Mahler osed the following fundamental question: How
More informationProof of the Fermat s Last Theorem
Proof of the Fermat s Last Theorem Michael Pogorsky mpogorsky@yahoo.com Abstract This is one of the versions of proof of the Theorem developed by means of general algebra based on polynomials ; ; their
More informationNumber Theory Naoki Sato
Number Theory Naoki Sato 0 Preface This set of notes on number theory was originally written in 1995 for students at the IMO level. It covers the basic background material that an IMO
More informationMATH 3240Q Introduction to Number Theory Homework 7
As long as algebra and geometry have been searated, their rogress have been slow and their uses limited; but when these two sciences have been united, they have lent each mutual forces, and have marched
More informationMA3H1 Topics in Number Theory. Samir Siksek
MA3H1 Toics in Number Theory Samir Siksek Samir Siksek, Mathematics Institute, University of Warwick, Coventry, CV4 7AL, United Kingdom E-mail address: samir.siksek@gmail.com Contents Chater 0. Prologue
More informationPrimes - Problem Sheet 5 - Solutions
Primes - Problem Sheet 5 - Solutions Class number, and reduction of quadratic forms Positive-definite Q1) Aly the roof of Theorem 5.5 to find reduced forms equivalent to the following, also give matrices
More informationWe collect some results that might be covered in a first course in algebraic number theory.
1 Aendices We collect some results that might be covered in a first course in algebraic number theory. A. uadratic Recirocity Via Gauss Sums A1. Introduction In this aendix, is an odd rime unless otherwise
More informationCERIAS Tech Report The period of the Bell numbers modulo a prime by Peter Montgomery, Sangil Nahm, Samuel Wagstaff Jr Center for Education
CERIAS Tech Reort 2010-01 The eriod of the Bell numbers modulo a rime by Peter Montgomery, Sangil Nahm, Samuel Wagstaff Jr Center for Education and Research Information Assurance and Security Purdue University,
More informationMA3H1 TOPICS IN NUMBER THEORY PART III
MA3H1 TOPICS IN NUMBER THEORY PART III SAMIR SIKSEK 1. Congruences Modulo m In quadratic recirocity we studied congruences of the form x 2 a (mod ). We now turn our attention to situations where is relaced
More informationOn the Multiplicative Order of a n Modulo n
1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 13 2010), Article 10.2.1 On the Multilicative Order of a n Modulo n Jonathan Chaelo Université Lille Nord de France F-59000 Lille France jonathan.chaelon@lma.univ-littoral.fr
More informationf(r) = a d n) d + + a0 = 0
Math 400-00/Foundations of Algebra/Fall 07 Polynomials at the Foundations: Roots Next, we turn to the notion of a root of a olynomial in Q[x]. Definition 8.. r Q is a rational root of fx) Q[x] if fr) 0.
More informationRATIONAL AND INTEGRAL POINTS ON CURVES. Andrew Granville. Table of Contents
RATIONAL AND INTEGRAL POINTS ON CURVES Andrew Granville Abstract. These are notes that have been extracted from a book that I am writing on elementary number theory. I make no attemt here to organize this
More informationMATH 371 Class notes/outline September 24, 2013
MATH 371 Class notes/outline Setember 24, 2013 Rings Armed with what we have looked at for the integers and olynomials over a field, we re in a good osition to take u the general theory of rings. Definitions:
More informationOn generalizing happy numbers to fractional base number systems
On generalizing hay numbers to fractional base number systems Enriue Treviño, Mikita Zhylinski October 17, 018 Abstract Let n be a ositive integer and S (n) be the sum of the suares of its digits. It is
More information[Ch 3, 4] Logic and Proofs (2) 1. Valid and Invalid Arguments ( 2.3, 3.4) 400 lecture note #2. 1) Basics
400 lecture note #2 [Ch 3, 4] Logic and Proofs (2) 1. Valid and Invalid Arguments ( 2.3, 3.4) 1) Basics An argument is a sequence of statements ( s1, s2,, sn). All statements in an argument, excet for
More informationElementary Proof That There are Infinitely Many Primes p such that p 1 is a Perfect Square (Landau's Fourth Problem)
Elementary Proof That There are Infinitely Many Primes such that 1 is a Perfect Square (Landau's Fourth Problem) Stehen Marshall 7 March 2017 Abstract This aer resents a comlete and exhaustive roof of
More informationNUMBER SYSTEMS. Number theory is the study of the integers. We denote the set of integers by Z:
NUMBER SYSTEMS Number theory is the study of the integers. We denote the set of integers by Z: Z = {..., 3, 2, 1, 0, 1, 2, 3,... }. The integers have two oerations defined on them, addition and multilication,
More informationMAT 311 Solutions to Final Exam Practice
MAT 311 Solutions to Final Exam Practice Remark. If you are comfortable with all of the following roblems, you will be very well reared for the midterm. Some of the roblems below are more difficult than
More informationDISCRIMINANTS IN TOWERS
DISCRIMINANTS IN TOWERS JOSEPH RABINOFF Let A be a Dedekind domain with fraction field F, let K/F be a finite searable extension field, and let B be the integral closure of A in K. In this note, we will
More informationD-MATH Algebra I HS18 Prof. Rahul Pandharipande. Solution 1. Arithmetic, Zorn s Lemma.
D-MATH Algebra I HS18 Prof. Rahul Pandharipande Solution 1 Arithmetic, Zorn s Lemma. 1. (a) Using the Euclidean division, determine gcd(160, 399). (b) Find m 0, n 0 Z such that gcd(160, 399) = 160m 0 +
More informationDiophantine Equations
Diohantine Equations Winter Semester 018/019 University of Bayreuth Michael Stoll Contents 1. Introduction and Examles 3. Aetizers 8 3. The Law of Quadratic Recirocity 1 Print version of October 5, 018,
More informationChapter 7 Rational and Irrational Numbers
Chater 7 Rational and Irrational Numbers In this chater we first review the real line model for numbers, as discussed in Chater 2 of seventh grade, by recalling how the integers and then the rational numbers
More informationAveraging sums of powers of integers and Faulhaber polynomials
Annales Mathematicae et Informaticae 42 (20. 0 htt://ami.ektf.hu Averaging sums of owers of integers and Faulhaber olynomials José Luis Cereceda a a Distrito Telefónica Madrid Sain jl.cereceda@movistar.es
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 informationQuadratic Reciprocity
Quadratic Recirocity 5-7-011 Quadratic recirocity relates solutions to x = (mod to solutions to x = (mod, where and are distinct odd rimes. The euations are oth solvale or oth unsolvale if either or has
More informationName (please print) Mathematics Final Examination December 14, 2005 I. (4)
Mathematics 513-00 Final Examination December 14, 005 I Use a direct argument to prove the following implication: The product of two odd integers is odd Let m and n be two odd integers Since they are odd,
More informationMAS 4203 Number Theory. M. Yotov
MAS 4203 Number Theory M. Yotov June 15, 2017 These Notes were comiled by the author with the intent to be used by his students as a main text for the course MAS 4203 Number Theory taught at the Deartment
More informationPOINTS ON CONICS MODULO p
POINTS ON CONICS MODULO TEAM 2: JONGMIN BAEK, ANAND DEOPURKAR, AND KATHERINE REDFIELD Abstract. We comute the number of integer oints on conics modulo, where is an odd rime. We extend our results to conics
More informationWhen is n a member of a Pythagorean Triple?
Abstract When is n a member of a Pythagorean Triple? Dominic and Alfred Vella ' Theorem is perhaps the best known result in the whole of mathematics and yet many things remain unknown (or perhaps just
More informationErnie Croot 1. Department of Mathematics, Georgia Institute of Technology, Atlanta, GA Abstract
SUMS OF THE FORM 1/x k 1 + + 1/x k n MODULO A PRIME Ernie Croot 1 Deartment of Mathematics, Georgia Institute of Technology, Atlanta, GA 30332 ecroot@math.gatech.edu Abstract Using a sum-roduct result
More informationInfinitely Many Quadratic Diophantine Equations Solvable Everywhere Locally, But Not Solvable Globally
Infinitely Many Quadratic Diohantine Equations Solvable Everywhere Locally, But Not Solvable Globally R.A. Mollin Abstract We resent an infinite class of integers 2c, which turn out to be Richaud-Degert
More informationIntroduction to Arithmetic Geometry Fall 2013 Lecture #10 10/8/2013
18.782 Introduction to Arithmetic Geometry Fall 2013 Lecture #10 10/8/2013 In this lecture we lay the groundwork needed to rove the Hasse-Minkowski theorem for Q, which states that a quadratic form over
More informationCharacteristics of Fibonacci-type Sequences
Characteristics of Fibonacci-tye Sequences Yarden Blausa May 018 Abstract This aer resents an exloration of the Fibonacci sequence, as well as multi-nacci sequences and the Lucas sequence. We comare and
More informationMarch 4, :21 WSPC/INSTRUCTION FILE FLSpaper2011
International Journal of Number Theory c World Scientific Publishing Comany SOLVING n(n + d) (n + (k 1)d ) = by 2 WITH P (b) Ck M. Filaseta Deartment of Mathematics, University of South Carolina, Columbia,
More informationa 2 + b 2 = (p 2 q 2 ) 2 + 4p 2 q 2 = (p 2 + q 2 ) 2 = c 2,
5.3. Pythagorean triples Definition. A Pythagorean triple is a set (a, b, c) of three integers such that (in order) a 2 + b 2 c 2. We may as well suppose that all of a, b, c are non-zero, and positive.
More information6 Binary Quadratic forms
6 Binary Quadratic forms 6.1 Fermat-Euler Theorem A binary quadratic form is an exression of the form f(x,y) = ax 2 +bxy +cy 2 where a,b,c Z. Reresentation of an integer by a binary quadratic form has
More informationTopic 7: Using identity types
Toic 7: Using identity tyes June 10, 2014 Now we would like to learn how to use identity tyes and how to do some actual mathematics with them. By now we have essentially introduced all inference rules
More informationAlmost 4000 years ago, Babylonians had discovered the following approximation to. x 2 dy 2 =1, (5.0.2)
Chater 5 Pell s Equation One of the earliest issues graled with in number theory is the fact that geometric quantities are often not rational. For instance, if we take a right triangle with two side lengths
More informationA FEW EQUIVALENCES OF WALL-SUN-SUN PRIME CONJECTURE
International Journal of Mathematics & Alications Vol 4, No 1, (June 2011), 77-86 A FEW EQUIVALENCES OF WALL-SUN-SUN PRIME CONJECTURE ARPAN SAHA AND KARTHIK C S ABSTRACT: In this aer, we rove a few lemmas
More informationRAMANUJAN-NAGELL CUBICS
RAMANUJAN-NAGELL CUBICS MARK BAUER AND MICHAEL A. BENNETT ABSTRACT. A well-nown result of Beuers [3] on the generalized Ramanujan-Nagell equation has, at its heart, a lower bound on the quantity x 2 2
More informationSection 0.10: Complex Numbers from Precalculus Prerequisites a.k.a. Chapter 0 by Carl Stitz, PhD, and Jeff Zeager, PhD, is available under a Creative
Section 0.0: Comlex Numbers from Precalculus Prerequisites a.k.a. Chater 0 by Carl Stitz, PhD, and Jeff Zeager, PhD, is available under a Creative Commons Attribution-NonCommercial-ShareAlike.0 license.
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 informationCHAPTER 1 POLYNOMIALS
1 CHAPTER 1 POLYNOMIALS 1.1 Removing Nested Symbols of Grouping Simplify. 1. 4x + 3( x ) + 4( x + 1). ( ) 3x + 4 5 x 3 + x 3. 3 5( y 4) + 6 y ( y + 3) 4. 3 n ( n + 5) 4 ( n + 8) 5. ( x + 5) x + 3( x 6)
More informationArithmetic Consequences of Jacobi s Two-Squares Theorem
THE RAMANUJAN JOURNAL 4, 51 57, 2000 c 2000 Kluwer Academic Publishers. Manufactured in The Netherlands. Arithmetic Consequences of Jacobi s Two-Squares Theorem MICHAEL D. HIRSCHHORN School of Mathematics,
More information#A88 INTEGERS 16 (2016) ON RECIPROCAL SUMS FORMED BY SOLUTIONS OF PELL S EQUATION
#A88 INTEGERS 6 (06) ON RECIPROCAL SUMS FORMED BY SOLUTIONS OF PELL S EQUATION Carsten Elsner Fachhochschule für die Wirtschaft University of Alied Sciences Hannover Germany carsten.elsner@fhdw.de Received:
More informationp-adic Measures and Bernoulli Numbers
-Adic Measures and Bernoulli Numbers Adam Bowers Introduction The constants B k in the Taylor series exansion t e t = t k B k k! k=0 are known as the Bernoulli numbers. The first few are,, 6, 0, 30, 0,
More informationarxiv:math/ v2 [math.nt] 21 Oct 2004
SUMS OF THE FORM 1/x k 1 + +1/x k n MODULO A PRIME arxiv:math/0403360v2 [math.nt] 21 Oct 2004 Ernie Croot 1 Deartment of Mathematics, Georgia Institute of Technology, Atlanta, GA 30332 ecroot@math.gatech.edu
More informationWhy Proofs? Proof Techniques. Theorems. Other True Things. Proper Proof Technique. How To Construct A Proof. By Chuck Cusack
Proof Techniques By Chuck Cusack Why Proofs? Writing roofs is not most student s favorite activity. To make matters worse, most students do not understand why it is imortant to rove things. Here are just
More informationMATH 361: NUMBER THEORY EIGHTH LECTURE
MATH 361: NUMBER THEORY EIGHTH LECTURE 1. Quadratic Recirocity: Introduction Quadratic recirocity is the first result of modern number theory. Lagrange conjectured it in the late 1700 s, but it was first
More informationThe Arm Prime Factors Decomposition
The Arm Prime Factors Decomosition Arm Boris Nima arm.boris@gmail.com Abstract We introduce the Arm rime factors decomosition which is the equivalent of the Taylor formula for decomosition of integers
More information.4. Congruences. We say that a is congruent to b modulo N i.e. a b mod N i N divides a b or equivalently i a%n = b%n. So a is congruent modulo N to an
. Modular arithmetic.. Divisibility. Given ositive numbers a; b, if a 6= 0 we can write b = aq + r for aroriate integers q; r such that 0 r a. The number r is the remainder. We say that a divides b (or
More informationMATH 361: NUMBER THEORY THIRD LECTURE
MATH 36: NUMBER THEORY THIRD LECTURE. Introduction The toic of this lecture is arithmetic functions and Dirichlet series. By way of introduction, consider Euclid s roof that there exist infinitely many
More information4727 Further Pure Mathematics 3
hysicsandmathstutor.com 477 Mark Scheme June 009 477 Further Pure Mathematics 6 6 B For arg z seen or imlied i cos isin cos isin 8 8 cos isin, 8 8 cos 5 isin 5 8 8, For dividing arg z by i A A 4 4 6 For
More informationElementary Analysis in Q p
Elementary Analysis in Q Hannah Hutter, May Szedlák, Phili Wirth November 17, 2011 This reort follows very closely the book of Svetlana Katok 1. 1 Sequences and Series In this section we will see some
More informationMobius Functions, Legendre Symbols, and Discriminants
Mobius Functions, Legendre Symbols, and Discriminants 1 Introduction Zev Chonoles, Erick Knight, Tim Kunisky Over the integers, there are two key number-theoretic functions that take on values of 1, 1,
More informationTHE THEORY OF NUMBERS IN DEDEKIND RINGS
THE THEORY OF NUMBERS IN DEDEKIND RINGS JOHN KOPPER Abstract. This aer exlores some foundational results of algebraic number theory. We focus on Dedekind rings and unique factorization of rime ideals,
More informationMATH 361: NUMBER THEORY ELEVENTH LECTURE
MATH 361: NUMBER THEORY ELEVENTH LECTURE The subjects of this lecture are characters, Gauss sums, Jacobi sums, and counting formulas for olynomial equations over finite fields. 1. Definitions, Basic Proerties
More informationOn the Rank of the Elliptic Curve y 2 = x(x p)(x 2)
On the Rank of the Ellitic Curve y = x(x )(x ) Jeffrey Hatley Aril 9, 009 Abstract An ellitic curve E defined over Q is an algebraic variety which forms a finitely generated abelian grou, and the structure
More informationNOTES. Hyperplane Sections of the n-dimensional Cube
NOTES Edited by Sergei Tabachnikov Hyerlane Sections of the n-dimensional Cube Rolfdieter Frank and Harald Riede Abstract. We deduce an elementary formula for the volume of arbitrary hyerlane sections
More informationBOUNDS FOR THE SIZE OF SETS WITH THE PROPERTY D(n) Andrej Dujella University of Zagreb, Croatia
GLASNIK MATMATIČKI Vol. 39(59(2004, 199 205 BOUNDS FOR TH SIZ OF STS WITH TH PROPRTY D(n Andrej Dujella University of Zagreb, Croatia Abstract. Let n be a nonzero integer and a 1 < a 2 < < a m ositive
More informationERRATA AND SUPPLEMENTARY MATERIAL FOR A FRIENDLY INTRODUCTION TO NUMBER THEORY FOURTH EDITION
ERRATA AND SUPPLEMENTARY MATERIAL FOR A FRIENDLY INTRODUCTION TO NUMBER THEORY FOURTH EDITION JOSEPH H. SILVERMAN Acknowledgements Page vii Thanks to the following eole who have sent me comments and corrections
More informationBasic Proof Examples
Basic Proof Examples Lisa Oberbroeckling Loyola University Maryland Fall 2015 Note. In this document, we use the symbol as the negation symbol. Thus p means not p. There are four basic proof techniques
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 informationThe Hasse Minkowski Theorem Lee Dicker University of Minnesota, REU Summer 2001
The Hasse Minkowski Theorem Lee Dicker University of Minnesota, REU Summer 2001 The Hasse-Minkowski Theorem rovides a characterization of the rational quadratic forms. What follows is a roof of the Hasse-Minkowski
More informationConjectures and proof. Book page 24-30
Conjectures and proof Book page 24-30 What is a conjecture? A conjecture is used to describe a pattern in mathematical terms When a conjecture has been proved, it becomes a theorem There are many types
More informationANALYTIC NUMBER THEORY AND DIRICHLET S THEOREM
ANALYTIC NUMBER THEORY AND DIRICHLET S THEOREM JOHN BINDER Abstract. In this aer, we rove Dirichlet s theorem that, given any air h, k with h, k) =, there are infinitely many rime numbers congruent to
More informationON THE NORM OF AN IDEMPOTENT SCHUR MULTIPLIER ON THE SCHATTEN CLASS
PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 00, Number 0, Pages 000 000 S 000-9939XX)0000-0 ON THE NORM OF AN IDEMPOTENT SCHUR MULTIPLIER ON THE SCHATTEN CLASS WILLIAM D. BANKS AND ASMA HARCHARRAS
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 informationIntroduction to Number Theory
Introduction to Number Theory Paul Yiu Department of Mathematics Florida Atlantic University Spring 017 March 7, 017 Contents 10 Pythagorean and Heron triangles 57 10.1 Construction of Pythagorean triangles....................
More informationISOSCELES TRIANGLES IN Q 3. Matt Noble Department of Mathematics, Middle Georgia State University, Macon, Georgia
#A9 INTEGERS 18 (2018) ISOSCELES TRIANGLES IN Q Matt Noble Deartment of Mathematics, Middle Georgia State University, Macon, Georgia matthew.noble@mga.edu Received: 7/2/17, Acceted: 2//18, Published: 2/19/18
More informationA review of the foundations of perfectoid spaces
A review of the foundations of erfectoid saces (Notes for some talks in the Fargues Fontaine curve study grou at Harvard, Oct./Nov. 2017) Matthew Morrow Abstract We give a reasonably detailed overview
More informationMath 5330 Spring Notes Prime Numbers
Math 5330 Sring 208 Notes Prime Numbers The study of rime numbers is as old as mathematics itself. This set of notes has a bunch of facts about rimes, or related to rimes. Much of this stuff is old dating
More informationZhi-Wei Sun Department of Mathematics, Nanjing University Nanjing , People s Republic of China
Ramanuan J. 40(2016, no. 3, 511-533. CONGRUENCES INVOLVING g n (x n ( n 2 ( 2 0 x Zhi-Wei Sun Deartment of Mathematics, Naning University Naning 210093, Peole s Reublic of China zwsun@nu.edu.cn htt://math.nu.edu.cn/
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 informationMA257: INTRODUCTION TO NUMBER THEORY LECTURE NOTES 2018
MA257: INTRODUCTION TO NUMBER THEORY LECTURE NOTES 2018 J. E. CREMONA Contents 0. Introduction: What is Number Theory? 2 Basic Notation 3 1. Factorization 4 1.1. Divisibility in Z 4 1.2. Greatest Common
More informationOutline. CS21 Decidability and Tractability. Regular expressions and FA. Regular expressions and FA. Regular expressions and FA
Outline CS21 Decidability and Tractability Lecture 4 January 14, 2019 FA and Regular Exressions Non-regular languages: Puming Lemma Pushdown Automata Context-Free Grammars and Languages January 14, 2019
More informationt s (p). An Introduction
Notes 6. Quadratic Gauss Sums Definition. Let a, b Z. Then we denote a b if a divides b. Definition. Let a and b be elements of Z. Then c Z s.t. a, b c, where c gcda, b max{x Z x a and x b }. 5, Chater1
More information