Proof that an Infinite Number of Mersenne Prime Numbers Exit
|
|
- Caitlin Moore
- 7 years ago
- Views:
Transcription
1 Proof that an Infinite Number of Mersenne Prime Numbers Exit Stephen Marshall 29 Aug 2014 Abstract This paper presents a complete and exhaustive proof of the infinitude of Mersenne prime numbers. The approach to this proof uses same logic that Euclid used to prove there are an infinite number of prime numbers. Then we prove that if p > 1 and d > 0 are integers, that p and are both primes if and only if for integer n (see reference 1 and 2): n = (p 1)! 1 p + ( 1)d d! + 1 p + 1 We use this proof for d = 2 p( k + m ) - 2 p ( k ) to prove the infinitude of Mersenne prime numbers. 1
2 Introduction Marin Mersenne, (8 September September 1648) was a French theologian, philosopher, mathematician and music theorist, often referred to as the "father of acoustics" (Bohn 1988:225). Mersenne was "the center of the world of science and mathematics during the first half of the 1600s." The Mersenne primes are named after the Mersenne who first studied them in the early 17th century. In Number Theory, a Mersenne prime is a prime number of the form. This is to say that it is a prime number which is one less than a power of two. The first four Mersenne primes are 3, 7, 31 and 127. If n is a composite number then so is 2 n 1. The definition is therefore unchanged when written where p is assumed prime. More generally, numbers of the form without the primality requirement are called Mersenne numbers. Mersenne numbers are sometimes defined to have the additional requirement that n be prime, equivalently that they be pernicious Mersenne numbers, namely those pernicious numbers whose binary representation contains no zeros. The smallest composite pernicious Mersenne number is As of May 2014, 48 Mersenne primes are known. The largest known prime number (2 57,885,161 1) is a Mersenne prime. Since 1997, all newly found Mersenne primes have been discovered by the Great Internet Mersenne Prime Search (GIMPS), a distributed computing project on the Internet. Proof: We shall select the set of Mersenne primes and make an assumption that this set of Mersenne prime numbers are finite. We shall then prove that this assumption is incorrect and by contradiction prove that an infinite number of Mersenne primes exist. 2
3 First, according to our finite set of k Mersenne primes, we shall let p be equal to the last Mersenne prime in the finite set, which is shown below: Let, p = Mp(k) = 2 p( k ) 1 Where Mp(k) is the k th Mersenne prime in the finite set. Let, Mp(k + m) = 2 p( k + m ) 1, where m is an integer. And let, Mp(k + m) = 2 p(k + m ) 1, where, Mp(k + m), is a Mersenne number not in the finite set of Mersenne primes, therefore, Mp(k + m) must be composite and not prime. Then we shall let = 2 p( k ) 1 + d = 2 p ( k + m ) 1 = Mp(k + m) Where Mp(k + m) is a composite Mersenne number by definition and d is a positive integer. Then for our case, d = 2 p( k + m ) - 2 p ( k ) We will prove that p and p+ d are both primes if and only if for integer n n = (p 1)! 1 p + ( 1)d d! + 1 p + 1 3
4 Therefore, we must show that = 2 p( k ) 1 + d = 2 p ( k + m ) 1 = Mp(k + m) is prime to prove that 2 p( k + m ) 1 = Mp(k + m) is prime, this will prove that Mp(k + m) is prime instead of composite which will show there is a Mersenne prime that is outside our assumed set of finite Mersenne primes. We shall use Euclid's logic that he used to prove there are an infinite number of prime numbers to prove there are an infinite number Mersenne primes. First we shall assume there are only a finite number of k Mersenne primes for all positive integers, specifically the last Mersenne prime in our finite set is; Mp(k) = 2 p( k ) 1 1) Say, 2 p( 1 ) 1, 2 p( 2 ) 1, 2 p( 3 ) 1,...., 2 p( k 1 ) 1, 2 p( k ) 1 2) Let N = (2 p( 1 ) 1)(2 p( 2 ) 1)(2 p( 3 ) 1),.... (2 p( k 1 ) 1)(2 p( k ) 1) +1 By the fundamental theorem of arithmetic, N is divisible by some prime q. Since N is the product of all existing Mersenne primes plus 1, then this prime q cannot be among the k 2 p( i ) 1 that make up the k Mersenne primes since by assumption these are all the Mersenne primes that exist and N is not divisible by any of the k 2 p( i ) 1 Mersenne primes. N is clearly seen not to be divisible by any of the k Mersenne primes. First we know that 2 is a prime number that is not in the set of finite Mersenne primes since the first Mersenne prime is 3. We also know that 2 is the only even prime number, therefore, the finite set of k Mersenne primes are all odd numbers. Since the product of odd numbers is always odd, then the product of all the k in our Mersenne primes in the finite 4
5 set of Mersenne primes is an odd number. Since N is product of all the k Mersenne primes + 1, then N is an even number, and since all the Mersenne primes are odd numbers and N is even, then N is not divisible by any of the k Mersenne primes. Therefore, q must be another prime number that does not exist in the finite set of Mersenne prime numbers. Therefore, since this proof could be repeated an infinite number of times we have proven that an infinite number of prime numbers q exist outside of our finite set of Mersenne primes. Now we must prove that at least one of these infinite prime numbers, q, is a Mersenne prime. We will pick a prime number p = Mp(k) = 2 p( k ) 1 which is the last Mersenne prime from our finite set of Mersenne primes and we will need to prove that there exists a prime 2 p(k + m ) 1, that is also a Mersenne prime. Both p and p +2k do not exist in the finite set of Mersenne primes. Note we are not proving this for all q primes outside the finite set of Mersenne primes, we are only picking one number 2 p(k + m ) 1 from the infinite set of primes outside our finite set and then we shall prove that 2 p(k + m ) 1 is prime given that 2 p( k ) 1 is Mersenne prime, this will show that at least one Mersenne prime exists outside our finite set of Mersenne primes. Now we shall proceed to prove 2 p(k + m ) 1 is prime as follows: We will prove that if p > 1 and d > 0 are integers, that p and are both primes if and only if for positive integer n (see reference 1 and 2): n = (p 1)! 1 p + ( 1)d d! + 1 p + 1 5
6 Proof: The equation above can be reduced and re-written as: 3) (p 1)! + 1 p + ( 1)d d! (p 1)! + 1 Since ( 1)! = ( 1)( 2) ( d)(p 1)!, we have ( 1)! ( 1) d d!(p 1)! (mod ), and it follows that equation 4 above is an integer if and only if: 4) (p 1)! + 1 ( 1)! p is an integer. From Wilson s Theorem, if p and are two prime numbers, then each of the terms of, equation 4 above, is an integer, which proves the necessary condition. Wilson s Theorem states: That a natural number n > 1 is a prime number if and only if. That is, it asserts that the factorial is one less than a multiple of n exactly when n is a prime number. Another way of stating it is for a natural number n > 1 is a prime number if and only if: When (n 1)! is divided by n, the remainder minus 1 is divides evenly into (n-1)! Conversely, assume equation 4 above, is an integer. If p or is not a prime, then by Wilson s Theorem, at least one of the terms of (4) is not an integer. This 6
7 implies that none of the terms of equation 4 is an integer or equivalently neither of p and is prime. It follows that both fractions of (4) are in reduced form. It is easy to see that if a/b and a /b are reduced fractions such that a/b + a /b = (ab + a b)/(bb ) is an integer, then b b and b b. Applying this result to equation 4, we obtain that () p, which is impossible. We may therefore conclude that if equation 4 is an integer, then both p and must be prime numbers. Therefore, the equation below is proven since it can be reduced to equation 3 above. Therefore, since the below equation can be reduced to equation 3 above, we have proven that if p > 1 and d > 0 are integers, then p and are both primes if and only if for positive integer n: n = (p 1)! 1 p + ( 1)d d! + 1 p + 1 For our case, = 2 p( k ) 1 + d = 2 p ( k + m ) 1 Therefore, p = 2 p( k ) 1 = Mp(k) is the k th Mersenne prime in the finite set of Mersenne primes. Therefore p is prime. Then d = 2 p( k + m ) - 2 p ( k ) Therefore, we must prove that n is an integer for integer s k and m, of which k denotes the last Mersenne prime in our assumed finite set of Mersenne primes. If n is proven an integer then is prime, therefore, = 2 p( k + m ) 1, is prime and 2 p ( k + m ) 1, 7
8 is a Mersenne prime outside our finite set of k Mersenne primes, therefore, our assumption of a finite set of Mersenne primes is contradicted and it is proven that there are an infinite number of Mersenne primes. It suffices to prove n is an integer. 8
9 n = (2 p( k ) 1 1 1)! 2 p( k ) 1 + ( 1) (( 2p( k + m ) 2p( k ) 2 p(k + m ) 2 p(k )! 2 p(k ) p( k + 1 m ) 2 p ( k ) + 2 p( k ) p(k ) p k + m 2 p ( k ) Reducing, n = (2 p( k ) 1 2)! 2 p( k ) 1 + 2p(k + m ) 2 p(k )! p(k + 1 m ) + 2 p( k ) p(k + m ) Multiplying by 2 p( k ) 1, n(2 p( k ) 1) = (2 p( k ) 2)! 1 + (2p( k ) 1) 2 p(k + m ) 2 p(k )! p(k + m ) (2p( k) 1) p(k + m ) Multiplying by (2 p( k + m ) - 1), n(2 p(k ) 1)(2 p ( k + m ) 1) = (2 p( k ) 2)! 2 p( k + m ) 1) + (2 p( k + m ) 1)! 2 p(k + m ) 2 p(k )! + 2 p ( k + m ) 1 + (2 p( k ) 1) Reducing again, n(2 p(k ) 1)(2 p ( k + m ) 1) = (2 p( k ) 2)! 2 p( k + m ) 1) + (2 p( k + m ) 1)! 2 p(k + m ) 2 p(k )! + 2 p ( k + m ) + (2 p( k ) 2) 9
10 We already know p is prime, therefore, p = integer. Since p is an integer and by definition k and m are integers, the right hand side of the above equation is an integer. Since the right hand side of the above equation is an integer and p and k are integers on the left hand side of the equation, then n must be an integer for the left side of equation to be an integer, or n would need to be a rational fraction that is divisible by p. This implies that n = x p where, p is prime and x is an interger. Then p = x n, since p is prime, then p is only divisible by p and 1, therefore, n can only be equal to p or 1 in this case, which are both integers, thus n must be an integer. It suffices to show that n is an integer since we have proven that p = 2 p( k ) 1 and = 2 p ( k + m ) 1, where d = 2 p( k + m ) - 2 p ( k ), are both primes if and only if for integer n: n = (p 1)! 1 p + ( 1)d d! + 1 p + 1 Since n = integer, we have proven that p = 2 p( k ) 1 = Mp(k) and = 2 p ( k + m ) 1 are both prime. Since we proved earlier that if 2 p( k + m ) 1 is prime then it also is not in the finite set of 2 p( i ) 1 Mersenne primes, therefore, since we have proven that 2 p( k + m ) 1 is prime, then we have proven that there is a Mersenne prime outside the our assumed finite set of Mersenne primes. This is a contradiction from our assumption that the set of Mersenne primes is finite, therefore, by contradiction the set of Mersenne primes is infinite. Also this same proof can be repeated infinitely for each finite set of Mersenne primes, in other words a new Mersenne prime can added to each set of finite Mersenne primes. This thoroughly proves that an infinite number of Mersenne primes exist. 10
11 References: 1) TYCM, Vol. 19, 1988, p ) 1001 Problems in Classical Number Theory, Jean-Marie De Koninck and Armel Mercier,
Primes in Sequences. Lee 1. By: Jae Young Lee. Project for MA 341 (Number Theory) Boston University Summer Term I 2009 Instructor: Kalin Kostadinov
Lee 1 Primes in Sequences By: Jae Young Lee Project for MA 341 (Number Theory) Boston University Summer Term I 2009 Instructor: Kalin Kostadinov Lee 2 Jae Young Lee MA341 Number Theory PRIMES IN SEQUENCES
More informationToday s Topics. Primes & Greatest Common Divisors
Today s Topics Primes & Greatest Common Divisors Prime representations Important theorems about primality Greatest Common Divisors Least Common Multiples Euclid s algorithm Once and for all, what are prime
More informationHandout #1: Mathematical Reasoning
Math 101 Rumbos Spring 2010 1 Handout #1: Mathematical Reasoning 1 Propositional Logic A proposition is a mathematical statement that it is either true or false; that is, a statement whose certainty or
More informationCS 103X: Discrete Structures Homework Assignment 3 Solutions
CS 103X: Discrete Structures Homework Assignment 3 s Exercise 1 (20 points). On well-ordering and induction: (a) Prove the induction principle from the well-ordering principle. (b) Prove the well-ordering
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 informationCHAPTER 5. Number Theory. 1. Integers and Division. Discussion
CHAPTER 5 Number Theory 1. Integers and Division 1.1. Divisibility. Definition 1.1.1. Given two integers a and b we say a divides b if there is an integer c such that b = ac. If a divides b, we write a
More informationBasic Proof Techniques
Basic Proof Techniques David Ferry dsf43@truman.edu September 13, 010 1 Four Fundamental Proof Techniques When one wishes to prove the statement P Q there are four fundamental approaches. This document
More informationWRITING PROOFS. Christopher Heil Georgia Institute of Technology
WRITING PROOFS Christopher Heil Georgia Institute of Technology A theorem is just a statement of fact A proof of the theorem is a logical explanation of why the theorem is true Many theorems have this
More informationHomework until Test #2
MATH31: Number Theory Homework until Test # Philipp BRAUN Section 3.1 page 43, 1. It has been conjectured that there are infinitely many primes of the form n. Exhibit five such primes. Solution. Five such
More informationNumber Theory. Proof. Suppose otherwise. Then there would be a finite number n of primes, which we may
Number Theory Divisibility and Primes Definition. If a and b are integers and there is some integer c such that a = b c, then we say that b divides a or is a factor or divisor of a and write b a. Definition
More informationk, then n = p2α 1 1 pα k
Powers of Integers An integer n is a perfect square if n = m for some integer m. Taking into account the prime factorization, if m = p α 1 1 pα k k, then n = pα 1 1 p α k k. That is, n is a perfect square
More informationElementary Number Theory and Methods of Proof. CSE 215, Foundations of Computer Science Stony Brook University http://www.cs.stonybrook.
Elementary Number Theory and Methods of Proof CSE 215, Foundations of Computer Science Stony Brook University http://www.cs.stonybrook.edu/~cse215 1 Number theory Properties: 2 Properties of integers (whole
More informationApplications of Fermat s Little Theorem and Congruences
Applications of Fermat s Little Theorem and Congruences Definition: Let m be a positive integer. Then integers a and b are congruent modulo m, denoted by a b mod m, if m (a b). Example: 3 1 mod 2, 6 4
More informationDiscrete Mathematics and Probability Theory Fall 2009 Satish Rao, David Tse Note 2
CS 70 Discrete Mathematics and Probability Theory Fall 2009 Satish Rao, David Tse Note 2 Proofs Intuitively, the concept of proof should already be familiar We all like to assert things, and few of us
More informationThe Prime Numbers. Definition. A prime number is a positive integer with exactly two positive divisors.
The Prime Numbers Before starting our study of primes, we record the following important lemma. Recall that integers a, b are said to be relatively prime if gcd(a, b) = 1. Lemma (Euclid s Lemma). If gcd(a,
More informationMATH10040 Chapter 2: Prime and relatively prime numbers
MATH10040 Chapter 2: Prime and relatively prime numbers Recall the basic definition: 1. Prime numbers Definition 1.1. Recall that a positive integer is said to be prime if it has precisely two positive
More information15 Prime and Composite Numbers
15 Prime and Composite Numbers Divides, Divisors, Factors, Multiples In section 13, we considered the division algorithm: If a and b are whole numbers with b 0 then there exist unique numbers q and r such
More informationCONTINUED FRACTIONS AND PELL S EQUATION. Contents 1. Continued Fractions 1 2. Solution to Pell s Equation 9 References 12
CONTINUED FRACTIONS AND PELL S EQUATION SEUNG HYUN YANG Abstract. In this REU paper, I will use some important characteristics of continued fractions to give the complete set of solutions to Pell s equation.
More information5544 = 2 2772 = 2 2 1386 = 2 2 2 693. Now we have to find a divisor of 693. We can try 3, and 693 = 3 231,and we keep dividing by 3 to get: 1
MATH 13150: Freshman Seminar Unit 8 1. Prime numbers 1.1. Primes. A number bigger than 1 is called prime if its only divisors are 1 and itself. For example, 3 is prime because the only numbers dividing
More informationIntroduction. Appendix D Mathematical Induction D1
Appendix D Mathematical Induction D D Mathematical Induction Use mathematical induction to prove a formula. Find a sum of powers of integers. Find a formula for a finite sum. Use finite differences to
More informationContinued Fractions and the Euclidean Algorithm
Continued Fractions and the Euclidean Algorithm Lecture notes prepared for MATH 326, Spring 997 Department of Mathematics and Statistics University at Albany William F Hammond Table of Contents Introduction
More informationEvery Positive Integer is the Sum of Four Squares! (and other exciting problems)
Every Positive Integer is the Sum of Four Squares! (and other exciting problems) Sophex University of Texas at Austin October 18th, 00 Matilde N. Lalín 1. Lagrange s Theorem Theorem 1 Every positive integer
More informationMath Workshop October 2010 Fractions and Repeating Decimals
Math Workshop October 2010 Fractions and Repeating Decimals This evening we will investigate the patterns that arise when converting fractions to decimals. As an example of what we will be looking at,
More informationThe Chinese Remainder Theorem
The Chinese Remainder Theorem Evan Chen evanchen@mit.edu February 3, 2015 The Chinese Remainder Theorem is a theorem only in that it is useful and requires proof. When you ask a capable 15-year-old why
More informationSo let us begin our quest to find the holy grail of real analysis.
1 Section 5.2 The Complete Ordered Field: Purpose of Section We present an axiomatic description of the real numbers as a complete ordered field. The axioms which describe the arithmetic of the real numbers
More informationMathematical Induction
Mathematical Induction (Handout March 8, 01) The Principle of Mathematical Induction provides a means to prove infinitely many statements all at once The principle is logical rather than strictly mathematical,
More informationI. GROUPS: BASIC DEFINITIONS AND EXAMPLES
I GROUPS: BASIC DEFINITIONS AND EXAMPLES Definition 1: An operation on a set G is a function : G G G Definition 2: A group is a set G which is equipped with an operation and a special element e G, called
More informationSOLUTIONS FOR PROBLEM SET 2
SOLUTIONS FOR PROBLEM SET 2 A: There exist primes p such that p+6k is also prime for k = 1,2 and 3. One such prime is p = 11. Another such prime is p = 41. Prove that there exists exactly one prime p such
More informationMATHEMATICAL INDUCTION. Mathematical Induction. This is a powerful method to prove properties of positive integers.
MATHEMATICAL INDUCTION MIGUEL A LERMA (Last updated: February 8, 003) Mathematical Induction This is a powerful method to prove properties of positive integers Principle of Mathematical Induction Let P
More informationGrade 6 Math Circles March 10/11, 2015 Prime Time Solutions
Faculty of Mathematics Waterloo, Ontario N2L 3G1 Centre for Education in Mathematics and Computing Lights, Camera, Primes! Grade 6 Math Circles March 10/11, 2015 Prime Time Solutions Today, we re going
More informationArkansas Tech University MATH 4033: Elementary Modern Algebra Dr. Marcel B. Finan
Arkansas Tech University MATH 4033: Elementary Modern Algebra Dr. Marcel B. Finan 3 Binary Operations We are used to addition and multiplication of real numbers. These operations combine two real numbers
More informationLecture 13 - Basic Number Theory.
Lecture 13 - Basic Number Theory. Boaz Barak March 22, 2010 Divisibility and primes Unless mentioned otherwise throughout this lecture all numbers are non-negative integers. We say that A divides B, denoted
More informationLecture 3: Finding integer solutions to systems of linear equations
Lecture 3: Finding integer solutions to systems of linear equations Algorithmic Number Theory (Fall 2014) Rutgers University Swastik Kopparty Scribe: Abhishek Bhrushundi 1 Overview The goal of this lecture
More informationTheorem3.1.1 Thedivisionalgorithm;theorem2.2.1insection2.2 If m, n Z and n is a positive
Chapter 3 Number Theory 159 3.1 Prime Numbers Prime numbers serve as the basic building blocs in the multiplicative structure of the integers. As you may recall, an integer n greater than one is prime
More informationSECTION 10-2 Mathematical Induction
73 0 Sequences and Series 6. Approximate e 0. using the first five terms of the series. Compare this approximation with your calculator evaluation of e 0.. 6. Approximate e 0.5 using the first five terms
More informationNumber Theory Hungarian Style. Cameron Byerley s interpretation of Csaba Szabó s lectures
Number Theory Hungarian Style Cameron Byerley s interpretation of Csaba Szabó s lectures August 20, 2005 2 0.1 introduction Number theory is a beautiful subject and even cooler when you learn about it
More informationMath 319 Problem Set #3 Solution 21 February 2002
Math 319 Problem Set #3 Solution 21 February 2002 1. ( 2.1, problem 15) Find integers a 1, a 2, a 3, a 4, a 5 such that every integer x satisfies at least one of the congruences x a 1 (mod 2), x a 2 (mod
More information47 Numerator Denominator
JH WEEKLIES ISSUE #22 2012-2013 Mathematics Fractions Mathematicians often have to deal with numbers that are not whole numbers (1, 2, 3 etc.). The preferred way to represent these partial numbers (rational
More informationThe last three chapters introduced three major proof techniques: direct,
CHAPTER 7 Proving Non-Conditional Statements The last three chapters introduced three major proof techniques: direct, contrapositive and contradiction. These three techniques are used to prove statements
More information3. Mathematical Induction
3. MATHEMATICAL INDUCTION 83 3. Mathematical Induction 3.1. First Principle of Mathematical Induction. Let P (n) be a predicate with domain of discourse (over) the natural numbers N = {0, 1,,...}. If (1)
More informationA Study on the Necessary Conditions for Odd Perfect Numbers
A Study on the Necessary Conditions for Odd Perfect Numbers Ben Stevens U63750064 Abstract A collection of all of the known necessary conditions for an odd perfect number to exist, along with brief descriptions
More informationa 11 x 1 + a 12 x 2 + + a 1n x n = b 1 a 21 x 1 + a 22 x 2 + + a 2n x n = b 2.
Chapter 1 LINEAR EQUATIONS 1.1 Introduction to linear equations A linear equation in n unknowns x 1, x,, x n is an equation of the form a 1 x 1 + a x + + a n x n = b, where a 1, a,..., a n, b are given
More informationClock Arithmetic and Modular Systems Clock Arithmetic The introduction to Chapter 4 described a mathematical system
CHAPTER Number Theory FIGURE FIGURE FIGURE Plus hours Plus hours Plus hours + = + = + = FIGURE. Clock Arithmetic and Modular Systems Clock Arithmetic The introduction to Chapter described a mathematical
More information8 Divisibility and prime numbers
8 Divisibility and prime numbers 8.1 Divisibility In this short section we extend the concept of a multiple from the natural numbers to the integers. We also summarize several other terms that express
More informationFull and Complete Binary Trees
Full and Complete Binary Trees Binary Tree Theorems 1 Here are two important types of binary trees. Note that the definitions, while similar, are logically independent. Definition: a binary tree T is full
More informationCongruent Number Problem
University of Waterloo October 28th, 2015 Number Theory Number theory, can be described as the mathematics of discovering and explaining patterns in numbers. There is nothing in the world which pleases
More informationDigitalCommons@University of Nebraska - Lincoln
University of Nebraska - Lincoln DigitalCommons@University of Nebraska - Lincoln MAT Exam Expository Papers Math in the Middle Institute Partnership 7-1-007 Pythagorean Triples Diane Swartzlander University
More informationMath Circle Beginners Group October 18, 2015
Math Circle Beginners Group October 18, 2015 Warm-up problem 1. Let n be a (positive) integer. Prove that if n 2 is odd, then n is also odd. (Hint: Use a proof by contradiction.) Suppose that n 2 is odd
More informationMathematical Induction. Lecture 10-11
Mathematical Induction Lecture 10-11 Menu Mathematical Induction Strong Induction Recursive Definitions Structural Induction Climbing an Infinite Ladder Suppose we have an infinite ladder: 1. We can reach
More information2 When is a 2-Digit Number the Sum of the Squares of its Digits?
When Does a Number Equal the Sum of the Squares or Cubes of its Digits? An Exposition and a Call for a More elegant Proof 1 Introduction We will look at theorems of the following form: by William Gasarch
More information3 0 + 4 + 3 1 + 1 + 3 9 + 6 + 3 0 + 1 + 3 0 + 1 + 3 2 mod 10 = 4 + 3 + 1 + 27 + 6 + 1 + 1 + 6 mod 10 = 49 mod 10 = 9.
SOLUTIONS TO HOMEWORK 2 - MATH 170, SUMMER SESSION I (2012) (1) (Exercise 11, Page 107) Which of the following is the correct UPC for Progresso minestrone soup? Show why the other numbers are not valid
More informationElementary Number Theory
Elementary Number Theory A revision by Jim Hefferon, St Michael s College, 2003-Dec of notes by W. Edwin Clark, University of South Florida, 2002-Dec L A TEX source compiled on January 5, 2004 by Jim Hefferon,
More informationThe Fundamental Theorem of Arithmetic
The Fundamental Theorem of Arithmetic 1 Introduction: Why this theorem? Why this proof? One of the purposes of this course 1 is to train you in the methods mathematicians use to prove mathematical statements,
More informationLEARNING OBJECTIVES FOR THIS CHAPTER
CHAPTER 2 American mathematician Paul Halmos (1916 2006), who in 1942 published the first modern linear algebra book. The title of Halmos s book was the same as the title of this chapter. Finite-Dimensional
More informationSet Theory Basic Concepts and Definitions
Set Theory Basic Concepts and Definitions The Importance of Set Theory One striking feature of humans is their inherent need and ability to group objects according to specific criteria. Our prehistoric
More informationGREATEST COMMON DIVISOR
DEFINITION: GREATEST COMMON DIVISOR The greatest common divisor (gcd) of a and b, denoted by (a, b), is the largest common divisor of integers a and b. THEOREM: If a and b are nonzero integers, then their
More informationSession 6 Number Theory
Key Terms in This Session Session 6 Number Theory Previously Introduced counting numbers factor factor tree prime number New in This Session composite number greatest common factor least common multiple
More informationChapter 11 Number Theory
Chapter 11 Number Theory Number theory is one of the oldest branches of mathematics. For many years people who studied number theory delighted in its pure nature because there were few practical applications
More informationCOMP 250 Fall 2012 lecture 2 binary representations Sept. 11, 2012
Binary numbers The reason humans represent numbers using decimal (the ten digits from 0,1,... 9) is that we have ten fingers. There is no other reason than that. There is nothing special otherwise about
More informationContinued Fractions. Darren C. Collins
Continued Fractions Darren C Collins Abstract In this paper, we discuss continued fractions First, we discuss the definition and notation Second, we discuss the development of the subject throughout history
More informationKevin James. MTHSC 412 Section 2.4 Prime Factors and Greatest Comm
MTHSC 412 Section 2.4 Prime Factors and Greatest Common Divisor Greatest Common Divisor Definition Suppose that a, b Z. Then we say that d Z is a greatest common divisor (gcd) of a and b if the following
More informationHOMEWORK 5 SOLUTIONS. n!f n (1) lim. ln x n! + xn x. 1 = G n 1 (x). (2) k + 1 n. (n 1)!
Math 7 Fall 205 HOMEWORK 5 SOLUTIONS Problem. 2008 B2 Let F 0 x = ln x. For n 0 and x > 0, let F n+ x = 0 F ntdt. Evaluate n!f n lim n ln n. By directly computing F n x for small n s, we obtain the following
More informationStupid Divisibility Tricks
Stupid Divisibility Tricks 101 Ways to Stupefy Your Friends Appeared in Math Horizons November, 2006 Marc Renault Shippensburg University Mathematics Department 1871 Old Main Road Shippensburg, PA 17013
More informationQuotient Rings and Field Extensions
Chapter 5 Quotient Rings and Field Extensions In this chapter we describe a method for producing field extension of a given field. If F is a field, then a field extension is a field K that contains F.
More informationMathematical Induction
Mathematical Induction In logic, we often want to prove that every member of an infinite set has some feature. E.g., we would like to show: N 1 : is a number 1 : has the feature Φ ( x)(n 1 x! 1 x) How
More informationWorking with whole numbers
1 CHAPTER 1 Working with whole numbers In this chapter you will revise earlier work on: addition and subtraction without a calculator multiplication and division without a calculator using positive and
More information= 2 + 1 2 2 = 3 4, Now assume that P (k) is true for some fixed k 2. This means that
Instructions. Answer each of the questions on your own paper, and be sure to show your work so that partial credit can be adequately assessed. Credit will not be given for answers (even correct ones) without
More informationSUM OF TWO SQUARES JAHNAVI BHASKAR
SUM OF TWO SQUARES JAHNAVI BHASKAR Abstract. I will investigate which numbers can be written as the sum of two squares and in how many ways, providing enough basic number theory so even the unacquainted
More information8 Square matrices continued: Determinants
8 Square matrices continued: Determinants 8. Introduction Determinants give us important information about square matrices, and, as we ll soon see, are essential for the computation of eigenvalues. You
More informationJust the Factors, Ma am
1 Introduction Just the Factors, Ma am The purpose of this note is to find and study a method for determining and counting all the positive integer divisors of a positive integer Let N be a given positive
More informationPage 331, 38.4 Suppose a is a positive integer and p is a prime. Prove that p a if and only if the prime factorization of a contains p.
Page 331, 38.2 Assignment #11 Solutions Factor the following positive integers into primes. a. 25 = 5 2. b. 4200 = 2 3 3 5 2 7. c. 10 10 = 2 10 5 10. d. 19 = 19. e. 1 = 1. Page 331, 38.4 Suppose a is a
More informationBreaking The Code. Ryan Lowe. Ryan Lowe is currently a Ball State senior with a double major in Computer Science and Mathematics and
Breaking The Code Ryan Lowe Ryan Lowe is currently a Ball State senior with a double major in Computer Science and Mathematics and a minor in Applied Physics. As a sophomore, he took an independent study
More information5.1 Radical Notation and Rational Exponents
Section 5.1 Radical Notation and Rational Exponents 1 5.1 Radical Notation and Rational Exponents We now review how exponents can be used to describe not only powers (such as 5 2 and 2 3 ), but also roots
More informationSYSTEMS OF PYTHAGOREAN TRIPLES. Acknowledgements. I would like to thank Professor Laura Schueller for advising and guiding me
SYSTEMS OF PYTHAGOREAN TRIPLES CHRISTOPHER TOBIN-CAMPBELL Abstract. This paper explores systems of Pythagorean triples. It describes the generating formulas for primitive Pythagorean triples, determines
More informationFactoring Whole Numbers
2.2 Factoring Whole Numbers 2.2 OBJECTIVES 1. Find the factors of a whole number 2. Find the prime factorization for any number 3. Find the greatest common factor (GCF) of two numbers 4. Find the GCF for
More informationNotes on Complexity Theory Last updated: August, 2011. Lecture 1
Notes on Complexity Theory Last updated: August, 2011 Jonathan Katz Lecture 1 1 Turing Machines I assume that most students have encountered Turing machines before. (Students who have not may want to look
More informationMATRIX ALGEBRA AND SYSTEMS OF EQUATIONS
MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS Systems of Equations and Matrices Representation of a linear system The general system of m equations in n unknowns can be written a x + a 2 x 2 + + a n x n b a
More informationRevised Version of Chapter 23. We learned long ago how to solve linear congruences. ax c (mod m)
Chapter 23 Squares Modulo p Revised Version of Chapter 23 We learned long ago how to solve linear congruences ax c (mod m) (see Chapter 8). It s now time to take the plunge and move on to quadratic equations.
More information3 Some Integer Functions
3 Some Integer Functions A Pair of Fundamental Integer Functions The integer function that is the heart of this section is the modulo function. However, before getting to it, let us look at some very simple
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 informationGroups in Cryptography
Groups in Cryptography Çetin Kaya Koç http://cs.ucsb.edu/~koc/cs178 koc@cs.ucsb.edu Koç (http://cs.ucsb.edu/~koc) ucsb cs 178 intro to crypto winter 2013 1 / 13 Groups in Cryptography A set S and a binary
More informationChapter 9. Systems of Linear Equations
Chapter 9. Systems of Linear Equations 9.1. Solve Systems of Linear Equations by Graphing KYOTE Standards: CR 21; CA 13 In this section we discuss how to solve systems of two linear equations in two variables
More informationC H A P T E R Regular Expressions regular expression
7 CHAPTER Regular Expressions Most programmers and other power-users of computer systems have used tools that match text patterns. You may have used a Web search engine with a pattern like travel cancun
More informationLemma 5.2. Let S be a set. (1) Let f and g be two permutations of S. Then the composition of f and g is a permutation of S.
Definition 51 Let S be a set bijection f : S S 5 Permutation groups A permutation of S is simply a Lemma 52 Let S be a set (1) Let f and g be two permutations of S Then the composition of f and g is a
More informationWHAT ARE MATHEMATICAL PROOFS AND WHY THEY ARE IMPORTANT?
WHAT ARE MATHEMATICAL PROOFS AND WHY THEY ARE IMPORTANT? introduction Many students seem to have trouble with the notion of a mathematical proof. People that come to a course like Math 216, who certainly
More informationAn Innocent Investigation
An Innocent Investigation D. Joyce, Clark University January 2006 The beginning. Have you ever wondered why every number is either even or odd? I don t mean to ask if you ever wondered whether every number
More informationMATH 289 PROBLEM SET 4: NUMBER THEORY
MATH 289 PROBLEM SET 4: NUMBER THEORY 1. The greatest common divisor If d and n are integers, then we say that d divides n if and only if there exists an integer q such that n = qd. Notice that if d divides
More informationSettling a Question about Pythagorean Triples
Settling a Question about Pythagorean Triples TOM VERHOEFF Department of Mathematics and Computing Science Eindhoven University of Technology P.O. Box 513, 5600 MB Eindhoven, The Netherlands E-Mail address:
More information1. Prove that the empty set is a subset of every set.
1. Prove that the empty set is a subset of every set. Basic Topology Written by Men-Gen Tsai email: b89902089@ntu.edu.tw Proof: For any element x of the empty set, x is also an element of every set since
More information4.2 Euclid s Classification of Pythagorean Triples
178 4. Number Theory: Fermat s Last Theorem Exercise 4.7: A primitive Pythagorean triple is one in which any two of the three numbers are relatively prime. Show that every multiple of a Pythagorean triple
More informationSUBGROUPS OF CYCLIC GROUPS. 1. Introduction In a group G, we denote the (cyclic) group of powers of some g G by
SUBGROUPS OF CYCLIC GROUPS KEITH CONRAD 1. Introduction In a group G, we denote the (cyclic) group of powers of some g G by g = {g k : k Z}. If G = g, then G itself is cyclic, with g as a generator. Examples
More informationALGEBRAIC APPROACH TO COMPOSITE INTEGER FACTORIZATION
ALGEBRAIC APPROACH TO COMPOSITE INTEGER FACTORIZATION Aldrin W. Wanambisi 1* School of Pure and Applied Science, Mount Kenya University, P.O box 553-50100, Kakamega, Kenya. Shem Aywa 2 Department of Mathematics,
More informationCONTENTS. Please note:
CONTENTS Introduction...iv. Number Systems... 2. Algebraic Expressions.... Factorising...24 4. Solving Linear Equations...8. Solving Quadratic Equations...0 6. Simultaneous Equations.... Long Division
More informationGrade 7/8 Math Circles Fall 2012 Factors and Primes
1 University of Waterloo Faculty of Mathematics Centre for Education in Mathematics and Computing Grade 7/8 Math Circles Fall 2012 Factors and Primes Factors Definition: A factor of a number is a whole
More informationHandout NUMBER THEORY
Handout of NUMBER THEORY by Kus Prihantoso Krisnawan MATHEMATICS DEPARTMENT FACULTY OF MATHEMATICS AND NATURAL SCIENCES YOGYAKARTA STATE UNIVERSITY 2012 Contents Contents i 1 Some Preliminary Considerations
More informationMath 3000 Section 003 Intro to Abstract Math Homework 2
Math 3000 Section 003 Intro to Abstract Math Homework 2 Department of Mathematical and Statistical Sciences University of Colorado Denver, Spring 2012 Solutions (February 13, 2012) Please note that these
More informationIf n is odd, then 3n + 7 is even.
Proof: Proof: We suppose... that 3n + 7 is even. that 3n + 7 is even. Since n is odd, there exists an integer k so that n = 2k + 1. that 3n + 7 is even. Since n is odd, there exists an integer k so that
More informationU.C. Berkeley CS276: Cryptography Handout 0.1 Luca Trevisan January, 2009. Notes on Algebra
U.C. Berkeley CS276: Cryptography Handout 0.1 Luca Trevisan January, 2009 Notes on Algebra These notes contain as little theory as possible, and most results are stated without proof. Any introductory
More informationThe Euclidean Algorithm
The Euclidean Algorithm A METHOD FOR FINDING THE GREATEST COMMON DIVISOR FOR TWO LARGE NUMBERS To be successful using this method you have got to know how to divide. If this is something that you have
More informationZeros of a Polynomial Function
Zeros of a Polynomial Function An important consequence of the Factor Theorem is that finding the zeros of a polynomial is really the same thing as factoring it into linear factors. In this section we
More information