Junior Villafana. Math 301. Dr. Meredith. Odd Perfect Numbers
|
|
- Jade Palmer
- 5 years ago
- Views:
Transcription
1 Junior Villafana Math 301 Dr. Meredith Odd Perfect Numbers Arguably the oldest unsolved problem in mathematics is still giving mathematicians a headache, even with the aid of technology; the search for an odd perfect number is still going on today. There has not been a lot of success with finding what an odd perfect number would be, but there have been discoveries that explain what it could possibly look like. I will give some background information on perfect numbers in general and those who are pioneers to this field. A perfect number is a number whose divisors, excluding the number itself, sum up to itself. In less modern terms, the aliquot parts of the digit would be summed up. Aliquot parts are the proper quotient of the number one is dealing with. So the aliquot parts of 8 are 1, 2 and 4; this is because 1 = 8, 2 = 8 and 4 = 8. 8 is not considered an aliquot number since 8 = 8 is not a proper quotient. When dealing with perfect numbers we are only 1 looking at the positive integers, Z 0 ; there are no irrational, imaginary, or any other sort of numbers that would be looked at as perfect from a mathematical point of view. Although it is not certain who were the first to take interest in this idea of perfect numbers, but there is still a lot of history behind it. In fact the first four perfect numbers were discovered in Ancient times, yet no one knows by whom. One thing that is known is that these interesting numbers were studied by Pythagoras and his followers, from a less theoretical standpoint than mathematicians that followed them. Now let s look at an example of the most basic case of a perfect number, this number would be the 6. The divisors of 6 are 1, 2, and 3. When taking the sum of these, = 6, so 6 would indeed be considered a perfect number. This is actually the first perfect number that exists. There are many perfect numbers that have been found over the thousands of years that they have existed, but no one has been able to find one that is odd or prove if one even exists. Many of the greatest and most famous mathematicians through the ages have tried to come up with an answer for odd perfect numbers, yet no one has been able to succeed. The first written discussion of perfect numbers was found in Euclid s Elements. In his book, Euclid explains how to find perfect numbers, there was no distinction whether they would be even or odd. Although now we know that Euclid s formula can only yield even numbers. His explanation and proof were then turned into a more modern proposition which reads: For k > 1, if 2 k 1 is a prime then 2 k 1 2 k 1 is a perfect number. Nicomachus was another mathematician that too interest in Euclid s discoveries. Nicomachus broke up the integers into 3 different groups; superabundant, deficient and perfect. This next quote describes how these groups were characterized, Among simple even numbers, some are superabundant, others are deficient: these two classes are as two extremes opposed to one another; as for those that occupy the middle position between the two, they are said to be perfect. And those which are said to be opposite to each other, the
2 superabundant and the deficient, are divided in their condition, which is inequality, into the too much and the too little. Nicomachus was referring to the aliquot numbers of a digit. A number whose sum of aliquot number is less than itself makes it deficient, greater than itself makes it superabundant and equal to itself makes it perfect. Along with his 3 classes he also made a few bold properties that he believed were true about perfect numbers: 1) the nth perfect number would have n digits 2) all perfect numbers would be even 3) all perfect numbers would end in 6 or 8 alternating between the two 4) Euclid s method would give all possible perfect numbers and 5) there exist infinitely many perfect numbers. All of these assertions were made without any type of proof; they were just believed to be true at the time. As it turns out, not all of these would be valid assertions. A familiar name that many of us know is Pierre de Fermat, he too was trying to contribute to the theory of perfect numbers. Fermat had the intentions of publishing the work that he had done on this topic but never had the time to get to it and he was not as successful on the subject as he had hoped. While exploring perfect numbers Fermat was able to come up with his famous theorem, Fermat s little theorem. With that being said, Fermat was writing to other mathematicians at the time and explaining what he was able to find out about these perfect numbers. One person who really utilized Fermat s information was Mersenne, he would eventually go down in mathematical history for his discovery. He claimed that for prime numbers, p = 2, 3, 5, 7, 13, 17, 19, 31, 67, 127, 257 would produce perfect numbers. Mersenne was a little off when stating this but he was very close to being correct; There was no way of checking these primes at that time, but later it was shown that 67 did not produce a perfect number and also that Mersenne had missed the numbers 61, 89, and 107. Mersenne would have a particular prime named after him, namely the prime 2 k 1, which today we know as the Mersenne primes. This special type of prime is found only when k itself is a prime number. Euclid and Mersenne both knew this. Hence the reason that Mersenne had started off with a list of primes to come up with this new number. These specific primes would go hand in hand when finding perfect numbers. As it turns out, these Mersenne primes are extremely rare. Not every prime number, k, put into 2 k 1 will result in a prime. It turns out to be really tedious work showing that a Mersenne prime is indeed a prime, the latest Mersenne prime took 26 days to check to ensure that the number in fact could not be factored; but finding a Mersenne prime would ensure another perfect number. Yet the problem persists to be that none have been odd. Euler would later come to show a way to describe the form of an odd perfect number by using some information that Descartes had written in a letter for Mersenne. Euler made an observation that every odd number could be written as 4n+1 or 4n+3. He showed that when an odd number, q, is written as 4n+1, any exponent of q will be 1 (mod4). Euler then also proved that an odd perfect prime would have to be in this form, 4n + 1 4k+1 (b 2 ) where b is an odd number and 4n+1 is a prime. Euler contributed towards the efforts on even perfect numbers as well. He discovered a perfect number that was larger than any other before him. Euler in 1772 proved that 2 30 (2 31-1) was a perfect number, this was only the 8 th perfect number that was found. It took 111 years for someone to find the next perfect number, Pervushin discovered that 2 60 (2 61-1) was indeed the 9 th perfect number. Also today,
3 computers are used to compute Mersanne primes which is in direct correlation to finding a new perfect number. The numbers are gigantic in size, some ranging well over 12 million digits. GIMPS, Great Internet Mersenne Prime Search, was founded by Richard Crandall in This is an organization dedicated to finding new Mersenne primes. Descartes was the first person to hint at the existence of an odd perfect number. He had taken a look at what Euclid had discovered and saw no reason there would not be one. Many in this day believe that there does exist such a number and it is known that it would have to be a very large number at that. James Joseph Sylvester was the next to make an important step towards finding this very rare integer. He would go on to show that if an odd perfect number were to exist it would have to contain at least 5 distinct prime factors. Mathematicians and computers have helped out a lot in the last 120 years, in 1888 Catalan had proved that if an odd perfect number was not divisible by 3, 5, or 7 then it had at least 26 distinct primes. Then later Norton improved on Catalan s work to show that it had to actually have 27 distinct primes instead of 26. Other discoveries of that sort have been made, Neilson in 2006 showed that if an odd perfect number was not divisible by 3 then it had at least 12 distinct primes. Also in 2006, Neilson had shown that the minimum number of distinct primes for a general odd perfect number had to be 9. The most recent contribution has come from Kevin Hare who has shown that 75 prime factors would have to be contained in any given odd perfect number. He was able to show this by using ECM (Elliptical curve factorization method) factorization, this computes large multiple point on an elliptical curve modulo the number that you desire to be factored. This method is the same method that other organizations are using to find Mersenne primes. In 1953 Jaques Touchard had proved that any odd perfect number would have to be in the form 12k + 1 or 36k + 9. We also know that an odd perfect number would have to be greater than 300 digits and it would have a prime divisor greater than 1,000,000. There has been no overwhelming evidence showing that it is impossible for an odd perfect number to exist, but no one will disagree that is will be a very difficult task to show that one in fact exist. There is some hope though in finding such a number, when looking at how large the even perfect numbers discovered are, there is no overwhelming evidence that states that an odd perfect number might just be larger. Many of the Pioneers of Mathematics believed there existed such a number; they were just not able to produce one. Today it is unknown if perfect numbers have any practical use. On a more religious point of view, it took God six days to construct Earth and also God chose to make the moon take 28 days to travel around the Earth. Both 6 and 28 are perfect numbers, some people believe that there is a direct relationship between these numbers and religion. Saint Augustine wrote in his famous text The City of God, Six is a number perfect in itself, and not because God created all things in six days; rather, the converse is true. God created all things in six days because the number is perfect.... Although I do not believe that is the main reason for Mathematicians to strive to find the first odd perfect prime, I believe that it is the theory of an odd perfect number is what seems to get their attention. Looking ahead into the future technology is growing ever so fast; programs are being created to help out in this cause. People are still discovering new perfect numbers that satisfy the old formulas derived by Euclid, Fermat and Mersanne. Euler s proof of the form of an odd perfect number could serve as a template for someone that could very well lead them to find what mathematicians throughout the ages could not. The question of does there really exist an odd perfect
4 number, is what seems to keep the interest alive in the topic. Famous Mathematicians throughout the ages, Euclid, Descartes, Mersenne, and Euler are some of the more recognizable names but certainly not the only ones that have contributed to finding an odd perfect number. There still seems to be an interest in the topic since countless mathematicians have been finding new discoveries. Names like Karl Norton, Peter Hagis, Scott Kurowski and George Woltman are just a few names that have been dealing with perfect numbers over the last 60 years. The excitement of uncertainty and the long history behind the theory of this problem must also be in the back of the minds of those working to solve this question. I m sure that there would be a nice amount of money given to the person that finds the first odd perfect number, looking at the prize money given to those who found the 45 th Mersenne prime, $100,000.00, one would assume that finding the first odd perfect number would be worth more. One thing is for certain, if anyone were to find an odd perfect number they would go down in Mathematical History.
5 Bibliography Odd Perfect Number Robbins, Neville. "Chapter 5." Beginning Number Theory. 2nd ed. Sudbury, MA: Jones and Bartlett, Print. Odd Perfect Number Search. Web. 08 Mar < Weisstein, Eric. "Odd Perfect Number -- from Wolfram MathWorld." Wolfram MathWorld: The Web's Most Extensive Mathematics Resource. Web. 08 Mar < "Perfect Numbers." Welcome to the Turnbull Server. Web. 08 Mar < "Odd Perfect Number -- from Wolfram MathWorld." Wolfram MathWorld: The Web's Most Extensive Mathematics Resource. Web. 04 May < "Perfect Numbers." MacTutor History of Mathematics. Web. 04 May <
5.2. Perfect Numbers Divisors of a natural number were covered in Section 5.1.
5.2 Smith Numbers The mathematician Albert Wilansky, when phoning his brother-in-law, Mr. Smith, noticed an interesting property concerning Smith s phone number (493-7775). The number 4,937,775 is composite,
More informationOn the Prime Divisors of Odd Perfect Numbers
On the Prime Divisors of Odd Perfect Numbers Justin Sweeney Department of Mathematics Trinity College Hartford, CT justin.sweeney@trincoll.edu April 27, 2009 1 Contents 1 History of Perfect Numbers 5 2
More informationOn the Composite Terms in Sequence Generated from Mersenne-type Recurrence Relations
On the Composite Terms in Sequence Generated from Mersenne-type Recurrence Relations Pingyuan Zhou E-mail:zhoupingyuan49@hotmail.com Abstract We conjecture that there is at least one composite term in
More information5.1. EXAMPLE 1 Decide whether the first number listed is divisible by the second. (a) 45; 9
5.1 Prime and Composite Numbers In earlier chapters we discussed the set of natural numbers, also called the counting numbers or the positive integers: 1, 2, 3,. Number theory deals with the study of the
More informationIntermediate Math Circles March 6, 2013 Number Theory I
What is Number Theory? Intermediate Math Circles March 6, 01 Number Theory I A branch of mathematics where mathematicians examine and study patterns found within the natural number set (positive integers).
More information6: Polynomials and Polynomial Functions
6: Polynomials and Polynomial Functions 6-1: Polynomial Functions Okay you know what a variable is A term is a product of constants and powers of variables (for example: x ; 5xy ) For now, let's restrict
More informationBefore we talk about prime numbers, we will spend some time with divisibility because there is
Math 1 5.2 Prime Numbers Before we talk about prime numbers, we will spend some time with divisibility. Definition: For whole numbers A and D, with D 0, if there is a whole number Q such that A = D Q,
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 informationThe first dynamical system?
The first dynamical system? Carl Pomerance, Dartmouth College with Mitsuo Kobayashi, Cal Poly Pomona Paul Pollack, University of Georgia In the beginning... 1 Pythagoras 2 Sum of proper divisors Let s(n)
More informationWhat is proof? Lesson 1
What is proof? Lesson The topic for this Math Explorer Club is mathematical proof. In this post we will go over what was covered in the first session. The word proof is a normal English word that you might
More informationSolutions of the Diophantine Equation 2 x + p y = z 2 When p is Prime
Annals of Pure and Applied Mathematics Vol. 16, No. 2, 2018, 471-477 ISSN: 2279-087X (P), 2279-0888(online) Published on 29 March 2018 www.researchmathsci.org DOI: http://dx.doi.org/10.22457/apam.v16n2a25
More informationMATH 25 CLASS 8 NOTES, OCT
MATH 25 CLASS 8 NOTES, OCT 7 20 Contents. Prime number races 2. Special kinds of prime numbers: Fermat and Mersenne numbers 2 3. Fermat numbers 3. Prime number races We proved that there were infinitely
More informationOlympiad Number Theory Through Challenging Problems
Olympiad Number Theory Justin Stevens Page 1 Olympiad Number Theory Through Challenging Problems Authors Justin Stevens Editor and L A TEX Manager David Altizio Dedicated to my sister. Justin Contents
More informationof Nebraska - Lincoln
University of Nebraska - Lincoln DigitalCommons@University of Nebraska - Lincoln MAT Exam Expository Papers Math in the Middle Institute Partnership May 2010 Perfect Numbers: Diana French University of
More informationPrime Numbers. Prime Numbers. Ramesh Sreekantan ISI, Bangalore. December 1, 2014
Prime Numbers Prime Numbers Ramesh Sreekantan ISI, Bangalore December 1, 2014 Introduction - Prime Numbers Prime numbers are the numbers 2,3,5,7... These are natural numbers which cannot be divided by
More informationSundaram's Sieve. by Julian Havil. Sundaram's Sieve
1997 2009, Millennium Mathematics Project, University of Cambridge. Permission is granted to print and copy this page on paper for non commercial use. For other uses, including electronic redistribution,
More informationWORKSHEET ON NUMBERS, MATH 215 FALL. We start our study of numbers with the integers: N = {1, 2, 3,...}
WORKSHEET ON NUMBERS, MATH 215 FALL 18(WHYTE) We start our study of numbers with the integers: Z = {..., 2, 1, 0, 1, 2, 3,... } and their subset of natural numbers: N = {1, 2, 3,...} For now we will not
More information1 Continued Fractions
Continued Fractions To start off the course, we consider a generalization of the Euclidean Algorithm which has ancient historical roots and yet still has relevance and applications today.. Continued Fraction
More informationDirect Proof and Counterexample I:Introduction
Direct Proof and Counterexample I:Introduction Copyright Cengage Learning. All rights reserved. Goal Importance of proof Building up logic thinking and reasoning reading/using definition interpreting :
More informationDirect Proof and Counterexample I:Introduction. Copyright Cengage Learning. All rights reserved.
Direct Proof and Counterexample I:Introduction Copyright Cengage Learning. All rights reserved. Goal Importance of proof Building up logic thinking and reasoning reading/using definition interpreting statement:
More informationNumber Theory. Jason Filippou UMCP. ason Filippou UMCP)Number Theory History & Definitions / 1
Number Theory Jason Filippou CMSC250 @ UMCP 06-08-2016 ason Filippou (CMSC250 @ UMCP)Number Theory History & Definitions 06-08-2016 1 / 1 Outline ason Filippou (CMSC250 @ UMCP)Number Theory History & Definitions
More informationAs the title suggests, we tackle three famous theorems in this chapter. 4.1 The Fundamental Theorem of Arithmetic
Chapter 4 Three Famous Theorems As the title suggests, we tackle three famous theorems in this chapter. 4.1 The Fundamental Theorem of Arithmetic The goal of this section is to prove The Fundamental Theorem
More informationSQUARE PATTERNS AND INFINITUDE OF PRIMES
SQUARE PATTERNS AND INFINITUDE OF PRIMES KEITH CONRAD 1. Introduction Numerical data suggest the following patterns for prime numbers p: 1 mod p p = 2 or p 1 mod 4, 2 mod p p = 2 or p 1, 7 mod 8, 2 mod
More informationFERMAT S TEST KEITH CONRAD
FERMAT S TEST KEITH CONRAD 1. Introduction Fermat s little theorem says for prime p that a p 1 1 mod p for all a 0 mod p. A naive extension of this to a composite modulus n 2 would be: for all a 0 mod
More informationThe first dynamical system
The first dynamical system Carl Pomerance, Dartmouth College Charles University November 8, 2016 As we all know, functions in mathematics are ubiquitous and indispensable. But what was the very first function
More informationNumber theory (Chapter 4)
EECS 203 Spring 2016 Lecture 10 Page 1 of 8 Number theory (Chapter 4) Review Questions: 1. Does 5 1? Does 1 5? 2. Does (129+63) mod 10 = (129 mod 10)+(63 mod 10)? 3. Does (129+63) mod 10 = ((129 mod 10)+(63
More informationSenior Math Circles Cryptography and Number Theory Week 2
Senior Math Circles Cryptography and Number Theory Week 2 Dale Brydon Feb. 9, 2014 1 Divisibility and Inverses At the end of last time, we saw that not all numbers have inverses mod n, but some do. We
More informationBeautiful Mathematics
Beautiful Mathematics 1. Principle of Mathematical Induction The set of natural numbers is the set of positive integers {1, 2, 3,... } and is denoted by N. The Principle of Mathematical Induction is a
More informationPrimes, Divisibility, and Factoring
Ursinus College Digital Commons @ Ursinus College Number Theory Transforming Instruction in Undergraduate Mathematics via Primary Historical Sources (TRIUMPHS) Summer 2017 Primes, Divisibility, and Factoring
More informationExercises Exercises. 2. Determine whether each of these integers is prime. a) 21. b) 29. c) 71. d) 97. e) 111. f) 143. a) 19. b) 27. c) 93.
Exercises Exercises 1. Determine whether each of these integers is prime. a) 21 b) 29 c) 71 d) 97 e) 111 f) 143 2. Determine whether each of these integers is prime. a) 19 b) 27 c) 93 d) 101 e) 107 f)
More informationThe Two Faces of Infinity Dr. Bob Gardner Great Ideas in Science (BIOL 3018)
The Two Faces of Infinity Dr. Bob Gardner Great Ideas in Science (BIOL 3018) From the webpage of Timithy Kohl, Boston University INTRODUCTION Note. We will consider infinity from two different perspectives:
More informationFactoring. Number Theory # 2
1 Number Theory # 2 Factoring In the last homework problem, it takes many steps of the Euclidean algorithm to find that the gcd of the two numbers is 1. However, if we had initially observed that 11384623=5393*2111,
More informationNUMBERS It s the numbers that count
NUMBERS It s the numbers that count Starting from the intuitively obvious this note discusses some of the perhaps not so intuitively obvious aspects of numbers. Henry 11/1/2011 NUMBERS COUNT! Introduction
More information8 Primes and Modular Arithmetic
8 Primes and Modular Arithmetic 8.1 Primes and Factors Over two millennia ago already, people all over the world were considering the properties of numbers. One of the simplest concepts is prime numbers.
More informationOn Exponentially Perfect Numbers Relatively Prime to 15
On Exponentially Perfect Numbers Relatively Prime to 15 by Joseph F. Kolenick Submitted in Partial Fulfillment of the Requirements for the Degree of Master of Science in the Mathematics Program YOUNGSTOWN
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 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 informationMATHEMATICS EXTENDED ESSAY
MATHEMATICS EXTENDED ESSAY How does the RSA algorithm function and why is it used in modern communication? Candidate Name: Murtuza Kainan Candidate Session Number: 003077006 Word Count: 3908 1 P a g e
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 informationCHAPTER 1. REVIEW: NUMBERS
CHAPTER. REVIEW: NUMBERS Yes, mathematics deals with numbers. But doing math is not number crunching! Rather, it is a very complicated psychological process of learning and inventing. Just like listing
More informationOn the Sum of Corresponding Factorials and Triangular Numbers: Some Preliminary Results
Asia Pacific Journal of Multidisciplinary Research, Vol 3, No 4, November 05 Part I On the Sum of Corresponding Factorials and Triangular Numbers: Some Preliminary Results Romer C Castillo, MSc Batangas
More informationEach copy of any part of a JSTOR transmission must contain the same copyright notice that appears on the screen or printed page of such transmission.
Fermat's Little Theorem: Proofs That Fermat Might Have Used Author(s): Bob Burn Source: The Mathematical Gazette, Vol. 86, No. 507 (Nov., 2002), pp. 415-422 Published by: The Mathematical Association Stable
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 informationFundamentals of Mathematics I
Fundamentals of Mathematics I Kent State Department of Mathematical Sciences Fall 2008 Available at: http://www.math.kent.edu/ebooks/10031/book.pdf August 4, 2008 Contents 1 Arithmetic 2 1.1 Real Numbers......................................................
More informationIntroduction. What is RSA. A Guide To RSA by Robert Yates. Topics
A Guide To RSA by Robert Yates. Topics Introduction...01/09 What is RSA...01/09 Mod-Exponentiation...02/09 Euler's Theorem...03/09 RSA Algorithm...08/09 RSA Security...09/09 Introduction Welcome to my
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 informationWith Question/Answer Animations. Chapter 4
With Question/Answer Animations Chapter 4 Chapter Motivation Number theory is the part of mathematics devoted to the study of the integers and their properties. Key ideas in number theory include divisibility
More informationAll variables a, b, n, etc are integers unless otherwise stated. Each part of a problem is worth 5 points.
Math 152, Problem Set 2 solutions (2018-01-24) All variables a, b, n, etc are integers unless otherwise stated. Each part of a problem is worth 5 points. 1. Let us look at the following equation: x 5 1
More informationThe New Largest Known Prime is 2 p 1 With p = Who Cares? Sam Wagstaff Computer Sciences and Mathematics.
The New Largest Known Prime is 2 p 1 With p = 74207281. Who Cares? Sam Wagstaff Computer Sciences and Mathematics November 10, 2016 Earlier in 2016, Cooper, Woltman, Kurowski, Blosser and GIMPS found this
More informationAll About Numbers Definitions and Properties
All About Numbers Definitions and Properties Number is a numeral or group of numerals. In other words it is a word or symbol, or a combination of words or symbols, used in counting several things. Types
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 informationMath in the News: Mersenne Primes
Math in the News: Mersenne Primes Helmut Knaust Department of Mathematical Sciences The University of Texas at El Paso El Paso TX 79968-0514 hknaust@utep.edu Greater El Paso Council of Teachers of Mathematics
More informationWORKSHEET MATH 215, FALL 15, WHYTE. We begin our course with the natural numbers:
WORKSHEET MATH 215, FALL 15, WHYTE We begin our course with the natural numbers: N = {1, 2, 3,...} which are a subset of the integers: Z = {..., 2, 1, 0, 1, 2, 3,... } We will assume familiarity with their
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 informationMath 412: Number Theory Lecture 3: Prime Decomposition of
Math 412: Number Theory Lecture 3: Prime Decomposition of Integers Gexin Yu gyu@wm.edu College of William and Mary Prime numbers Definition: a (positive) integer p is prime if p has no divisor other than
More informationPrimes and Factorization
Primes and Factorization 1 A prime number is an integer greater than 1 with no proper divisors. The list begins 2, 3, 5, 7, 11, 13, 19,... See http://primes.utm.edu/ for a wealth of information about primes.
More information35 Chapter CHAPTER 4: Mathematical Proof
35 Chapter 4 35 CHAPTER 4: Mathematical Proof Faith is different from proof; the one is human, the other is a gift of God. Justus ex fide vivit. It is this faith that God Himself puts into the heart. 21
More informationarxiv:math.nt/ v1 5 Jan 2005
NEW TECHNIQUES FOR BOUNDS ON THE TOTAL NUMBER OF PRIME FACTORS OF AN ODD PERFECT NUMBER arxiv:math.nt/0501070 v1 5 Jan 2005 KEVIN G. HARE Abstract. Let σ(n) denote the sum of the positive divisors of n.
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 informationCHAMP presentation #1 September 9, 1pm. Ms. Leigh
CHAMP presentation #1 September 9, 1pm Ms. Leigh dog@uh.edu 1 Why do we have all these numbers anyhow? Well the short answer is to solve problems. The longer answer is because mathematicians find them
More informationIntroduction: Pythagorean Triplets
Introduction: Pythagorean Triplets On this first day I want to give you an idea of what sorts of things we talk about in number theory. In number theory we want to study the natural numbers, and in particular
More informationNumber Theory Math 420 Silverman Exam #1 February 27, 2018
Name: Number Theory Math 420 Silverman Exam #1 February 27, 2018 INSTRUCTIONS Read Carefully Time: 50 minutes There are 5 problems. Write your name neatly at the top of this page. Write your final answer
More informationC.T.Chong National University of Singapore
NUMBER THEORY AND THE DESIGN OF FAST COMPUTER ALGORITHMS C.T.Chong National University of Singapore The theory of numbers has long been considered to be among the purest of pure mathematics. Gauss ( 1777-1855)
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 informationTHE MATHEMATICS OF EULER. Introduction: The Master of Us All. (Dunham, Euler the Master xv). This quote by twentieth-century mathematician André Weil
THE MATHEMATICS OF EULER Introduction: The Master of Us All All his life he seems to have carried in his head the whole of the mathematics of his day (Dunham, Euler the Master xv). This quote by twentieth-century
More informationFermat s Little Theorem. Fermat s little theorem is a statement about primes that nearly characterizes them.
Fermat s Little Theorem Fermat s little theorem is a statement about primes that nearly characterizes them. Theorem: Let p be prime and a be an integer that is not a multiple of p. Then a p 1 1 (mod p).
More informationCambridge University Press How to Prove it: A Structured Approach: Second edition Daniel J. Velleman Excerpt More information
Introduction What is mathematics? High school mathematics is concerned mostly with solving equations and computing answers to numerical questions. College mathematics deals with a wider variety of questions,
More informationWednesday, February 21. Today we will begin Course Notes Chapter 5 (Number Theory).
Wednesday, February 21 Today we will begin Course Notes Chapter 5 (Number Theory). 1 Return to Chapter 5 In discussing Methods of Proof (Chapter 3, Section 2) we introduced the divisibility relation from
More informationChapter 1. Number of special form. 1.1 Introduction(Marin Mersenne) 1.2 The perfect number. See the book.
Chapter 1 Number of special form 1.1 Introduction(Marin Mersenne) See the book. 1.2 The perfect number Definition 1.2.1. A positive integer n is said to be perfect if n is equal to the sum of all its positive
More informationCHAPTER 1 REAL NUMBERS KEY POINTS
CHAPTER 1 REAL NUMBERS 1. Euclid s division lemma : KEY POINTS For given positive integers a and b there exist unique whole numbers q and r satisfying the relation a = bq + r, 0 r < b. 2. Euclid s division
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 information22. The Quadratic Sieve and Elliptic Curves. 22.a The Quadratic Sieve
22. The Quadratic Sieve and Elliptic Curves 22.a The Quadratic Sieve Sieve methods for finding primes or for finding factors of numbers are methods by which you take a set P of prime numbers one by one,
More informationLecture 5: Arithmetic Modulo m, Primes and Greatest Common Divisors Lecturer: Lale Özkahya
BBM 205 Discrete Mathematics Hacettepe University http://web.cs.hacettepe.edu.tr/ bbm205 Lecture 5: Arithmetic Modulo m, Primes and Greatest Common Divisors Lecturer: Lale Özkahya Resources: Kenneth Rosen,
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 informationMATH10040: Chapter 0 Mathematics, Logic and Reasoning
MATH10040: Chapter 0 Mathematics, Logic and Reasoning 1. What is Mathematics? There is no definitive answer to this question. 1 Indeed, the answer given by a 21st-century mathematician would differ greatly
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 informationChapter 12: Ruler and compass constructions
Chapter 12: Ruler and compass constructions Matthew Macauley Department of Mathematical Sciences Clemson University http://www.math.clemson.edu/~macaule/ Math 4120, Spring 2014 M. Macauley (Clemson) Chapter
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 information226 My God, He Plays Dice! Entanglement. Chapter This chapter on the web informationphilosopher.com/problems/entanglement
226 My God, He Plays Dice! Entanglement Chapter 29 20 This chapter on the web informationphilosopher.com/problems/entanglement Entanglement 227 Entanglement Entanglement is a mysterious quantum phenomenon
More informationGrade 7/8 Math Circles. Mathematical Thinking
Faculty of Mathematics Waterloo, Ontario N2L 3G1 Centre for Education in Mathematics and Computing Grade 7/8 Math Circles March 22 & 23 2016 Mathematical Thinking Today we will take a look at some of the
More informationMATH 361: NUMBER THEORY FOURTH LECTURE
MATH 361: NUMBER THEORY FOURTH LECTURE 1. Introduction Everybody knows that three hours after 10:00, the time is 1:00. That is, everybody is familiar with modular arithmetic, the usual arithmetic of the
More informationSolved and unsolved problems in elementary number theory
Solved and unsolved problems in elementary number theory Paul Pollack Athens/Atlanta Number Theory Seminar February 25, 2014 1 of 45 For a less slanted view of the subject, consider purchasing: 2 of 45
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 informationLet π and e be trancendental numbers and consider the case:
Jonathan Henderson Abstract: The proposed question, Is π + e an irrational number is a pressing point in modern mathematics. With the first definition of transcendental numbers coming in the 1700 s there
More informationEuclidean Geometry. The Elements of Mathematics
Euclidean Geometry The Elements of Mathematics Euclid, We Hardly Knew Ye Born around 300 BCE in Alexandria, Egypt We really know almost nothing else about his personal life Taught students in mathematics
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 informationDirect Proof MAT231. Fall Transition to Higher Mathematics. MAT231 (Transition to Higher Math) Direct Proof Fall / 24
Direct Proof MAT231 Transition to Higher Mathematics Fall 2014 MAT231 (Transition to Higher Math) Direct Proof Fall 2014 1 / 24 Outline 1 Overview of Proof 2 Theorems 3 Definitions 4 Direct Proof 5 Using
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 information7. Prime Numbers Part VI of PJE
7. Prime Numbers Part VI of PJE 7.1 Definition (p.277) A positive integer n is prime when n > 1 and the only divisors are ±1 and +n. That is D (n) = { n 1 1 n}. Otherwise n > 1 is said to be composite.
More informationCHAPTER 1. Introduction
CHAPTER 1 Introduction A typical Modern Geometry course will focus on some variation of a set of axioms for Euclidean geometry due to Hilbert. At the end of such a course, non-euclidean geometries (always
More informationInstructions For Use: Add, Divide, Repeat
Instructions For Use: Add, Divide, Repeat Patterns in the Period Lengths of Simple Periodic Continued Fractional Representations of Square Roots of Integers Near Perfect Squares Rileigh Luczak QED: Chicago
More informationPeter G. Brown. 1 π = 4
Parabola Volume 34, Issue (998) ASLICE OF THE PI Peter G. Brown. Ifyouweretoaskavarietyofpeoplewhatπ was,youwouldprobablygetavarietyof different answers. The Bible gives π as 3, or at least implies this
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 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 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 informationWhat do we actually know about prime numbers distribution?
1 On the number of composite numbers less than a given value. Lemmas, continued. Paper III: What do we know about prime numbers distribution? Paper II presented 3 of 7 lemmas that confirm the conjecture
More informationSimple Math: Cryptography
1 Introduction Simple Math: Cryptography This section develops some mathematics before getting to the application. The mathematics that I use involves simple facts from number theory. Number theory is
More informationThe first function. Carl Pomerance, Dartmouth College (U. Georgia, emeritus)
The first function Carl Pomerance, Dartmouth College (U. Georgia, emeritus) Connections in Discrete Mathematics A celebration of the work of Ron Graham Simon Fraser University, June 15 19, 2015 On a papyrus
More informationNotice how these numbers thin out pretty quickly. Yet we can find plenty of triples of numbers (a, b, c) such that a+b = c.
THE ABC Conjecture Mark Saul, Ph.D. Center for Mathematical Talent Courant Institute of Mathematical Sciences New York University I The abc conjecture was formulated independently by Joseph Oesterle and
More information