Number Theory. Jason Filippou UMCP. ason Filippou UMCP)Number Theory History & Definitions / 1

Size: px
Start display at page:

Download "Number Theory. Jason Filippou UMCP. ason Filippou UMCP)Number Theory History & Definitions / 1"

Transcription

1 Number Theory Jason Filippou UMCP ason Filippou UMCP)Number Theory History & Definitions / 1

2 Outline ason Filippou UMCP)Number Theory History & Definitions / 1

3 Definition (?) of Number Theory The Queen of Mathematics. Study of the integers and their generalizations (primes, rationals, etc) Used to be known as arithmetic, but nowadays arithmetic refers to first grade calculations. ason Filippou UMCP)Number Theory History & Definitions / 1

4 Short Historical Overview Short Historical Overview ason Filippou UMCP)Number Theory History & Definitions / 1

5 Short Historical Overview Babylonians Figure 1: The Plimpton 322 Babylonian tablet This tablet (created circa 1800BC) contains a series of large Pythagorean triples! ason Filippou UMCP)Number Theory History & Definitions / 1

6 Short Historical Overview Babylonians Figure 1: The Plimpton 322 Babylonian tablet This tablet (created circa 1800BC) contains a series of large Pythagorean triples! Triplets of integers a, b, c such that a 2 + b 2 = c 2 ason Filippou UMCP)Number Theory History & Definitions / 1

7 Short Historical Overview Babylonians These guys just brute-forced those numbers ason Filippou UMCP)Number Theory History & Definitions / 1

8 Short Historical Overview Babylonians (3, 4, 5), (5, 12, 13) (7, 24, 25), (8, 15, 17)...,... (36, 323, 325), (37, 684, 685)...,... Currently believed that this plaque establishes the mathematical identity: ( 1 x 2( 1 )) 2 ( = x + x 2( 1 )) 2 x ason Filippou UMCP)Number Theory History & Definitions / 1

9 Short Historical Overview Egyptians, Greeks We don t know anything else about Babylonian Number Theory! Babylonian algebra and astronomy, on the other hand... Also, Egyptian astronomy, geometry. Greek geometry. ason Filippou UMCP)Number Theory History & Definitions / 1

10 Short Historical Overview Greek philosophers The Greek mathematicians Pythagoras and Thales were influenced either by the Babylonians or the Egyptians, or both. Pythagorean theorem. Thales theorem. Figure 2: Pythagoras of Samos. Figure 3: Thales of Miletus. ason Filippou UMCP)Number Theory History & Definitions / 1

11 Short Historical Overview Euclid Euclid s Elements contain the first set of axioms of Number Theory as we know it today. In chapters of his 9th book of Elements, Euclid makes statements such as: Odd times even is even If an odd number divides an even number, it also divides half of it. The 10th book in Elements contains a formal proof that 2 is an irrational number. This discovery was very upsetting for the Greeks. Figure 4: Euclid of Alexandria ason Filippou UMCP)Number Theory History & Definitions / 1

12 Short Historical Overview Chinese The Chinese Remainder Theorem, or The Mathematical Classic of Sun Tzu TM (not the famous military tactician), states: Suppose n 1,..., n k are integers, pairwise co-prime. Then, for any given sequence of integers a 1,..., a k, there exists an integer x which solves the following system of equations: x a 1 (mod n 1 ) x a 2 (mod n 2 ). x a k (mod n k ) ason Filippou UMCP)Number Theory History & Definitions / 1

13 Short Historical Overview? ason Filippou UMCP)Number Theory History & Definitions / 1

14 Short Historical Overview Fermat s Last Theorem Arguably, the most famous problem in the history of Mathematics. Jason Filippou UMCP)Number Theory History & Definitions / 1

15 Short Historical Overview Fermat s Last Theorem Arguably, the most famous problem in the history of Mathematics. Statement: There do not exist positive integers a, b, c that satisfy the equation: an + bn = cn for values of n 3. Jason Filippou UMCP)Number Theory History & Definitions / 1

16 Short Historical Overview Fermat s Last Theorem Arguably, the most famous problem in the history of Mathematics. Statement: There do not exist positive integers a, b, c that satisfy the equation: an + bn = cn for values of n 3. Fermat claimed an elegant solution, for which the margin of the text was too small. Finally proven by Sir Andrew Wiles, September 1994, 357 years after its inception! Figure 5: Pierre de Fermat. Figure 6: Sir Andrew Wiles. Jason Filippou UMCP)Number Theory History & Definitions / 1

17 Short Historical Overview A hard branch of Mathematics Take-home message: Number theory is hard! Hard to learn the math to understand it, hard to properly follow the enormous string of proofs (see: Wiles 1993 attempt). In this module, we ll attempt to give you the weaponry to master the latter! ason Filippou UMCP)Number Theory History & Definitions / 1

18 Short Historical Overview Famous open problems Hodge Conjecture. Riemann Hypothesis. Birch & Swinnerton-Dyer Conjecture. ason Filippou UMCP)Number Theory History & Definitions / 1

19 Short Historical Overview Famous open problems Hodge Conjecture. Riemann Hypothesis. Birch & Swinnerton-Dyer Conjecture. Goldbach s conjecture. Statement: Every even integer greater than 2 can be expressed as the sum of two primes. Currently holds up to , but not proven formally. ason Filippou UMCP)Number Theory History & Definitions / 1

20 Basic Definitions ason Filippou UMCP)Number Theory History & Definitions / 1

21 Commonly used number sets Naturals Naturals without zero Odd and even naturals Integers Integers without zero Positive integers with zero (equiv. to naturals) Positive integers without zero (equiv. to N ) Negative integers with or without zero Odd and even integers Rational numbers Real numbers Positive, negative real numbers, with or without zero Prime numbers N N N odd, N even, respectively Z Z Z + Z + Z, Z Z odd, Z even Q R R +, R, R +, R P Table 1: Some commonly used number set symbols. ason Filippou UMCP)Number Theory History & Definitions / 1

22 Parity Definition (Even numbers) An integer n is even iff a there exists an integer k such that n = 2k. a Common abbreviation for if and only if. ason Filippou UMCP)Number Theory History & Definitions / 1

23 Parity Definition (Even numbers) An integer n is even iff a there exists an integer k such that n = 2k. a Common abbreviation for if and only if. Corollary (Parity of 0) 0 is an even number. ason Filippou UMCP)Number Theory History & Definitions / 1

24 Parity Definition (Even numbers) An integer n is even iff a there exists an integer k such that n = 2k. a Common abbreviation for if and only if. Corollary (Parity of 0) 0 is an even number. Definition (Odd numbers) An integer n is odd iff there exists an integer k such that n = 2k + 1. ason Filippou UMCP)Number Theory History & Definitions / 1

25 Rational numbers Definition (Rational number) A number r is called rational iff m Z, n Z such that r = m n. ason Filippou UMCP)Number Theory History & Definitions / 1

26 Rational numbers Definition (Rational number) A number r is called rational iff m Z, n Z such that r = m n. Corollary (Integer are rationals) Every integer number is also rational. ason Filippou UMCP)Number Theory History & Definitions / 1

27 Hierarchy of number sets Q Z N Figure 7: Our current hierarchy of number sets. ason Filippou UMCP)Number Theory History & Definitions / 1

28 Rational questions on rational numbers for rational students Are the following numbers rational? ason Filippou UMCP)Number Theory History & Definitions / 1

29 Rational questions on rational numbers for rational students Are the following numbers rational? 1 2/3 ason Filippou UMCP)Number Theory History & Definitions / 1

30 Rational questions on rational numbers for rational students Are the following numbers rational? 1 2/3 2 20/30 ason Filippou UMCP)Number Theory History & Definitions / 1

31 Rational questions on rational numbers for rational students Are the following numbers rational? 1 2/3 2 20/ /3 ason Filippou UMCP)Number Theory History & Definitions / 1

32 Rational questions on rational numbers for rational students Are the following numbers rational? 1 2/3 2 20/ /3 4 0/1 ason Filippou UMCP)Number Theory History & Definitions / 1

33 Rational questions on rational numbers for rational students Are the following numbers rational? 1 2/3 2 20/ /3 4 0/ ason Filippou UMCP)Number Theory History & Definitions / 1

34 Rational questions on rational numbers for rational students Are the following numbers rational? 1 2/3 2 20/ /3 4 0/ ason Filippou UMCP)Number Theory History & Definitions / 1

35 Rational questions on rational numbers for rational students Are the following numbers rational? 1 2/3 2 20/ /3 4 0/ ason Filippou UMCP)Number Theory History & Definitions / 1

36 Rational questions on rational numbers for rational students Are the following numbers rational? 1 2/3 2 20/ /3 4 0/ π, φ, e, 2 ason Filippou UMCP)Number Theory History & Definitions / 1

37 Rational questions on rational numbers for rational students Are the following numbers rational? 1 2/3 2 20/ /3 4 0/ π, φ, e, 2 So there s something beyond rational numbers! ason Filippou UMCP)Number Theory History & Definitions / 1

38 Irrational numbers Definition (Irrational numbers) A number is irrational iff it is not rational. ason Filippou UMCP)Number Theory History & Definitions / 1

39 Irrational numbers Definition (Irrational numbers) A number is irrational iff it is not rational. Corollary If s is an irrational number, there does not exist a pair of integers m, n, with n 0, such that s = m n. ason Filippou UMCP)Number Theory History & Definitions / 1

40 Irrational numbers Definition (Irrational numbers) A number is irrational iff it is not rational. Corollary If s is an irrational number, there does not exist a pair of integers m, n, with n 0, such that s = m n. Rationals and irrationals together give us the set of real numbers: R. ason Filippou UMCP)Number Theory History & Definitions / 1

41 Hierarchy of number sets, revisited R Q Z R Q N Figure 8: Our hierarchy, updated. We will not deal with higher number systems (complex numbers, quaternions). Note that rationals and irrationals complement each other (obviously). ason Filippou UMCP)Number Theory History & Definitions / 1

42 Prime numbers Definition (Prime number) An integer n 2 is called prime iff its only factors (divisors) are 1 and n. ason Filippou UMCP)Number Theory History & Definitions / 1

43 Prime numbers Definition (Prime number) An integer n 2 is called prime iff its only factors (divisors) are 1 and n. Corollary (Primality of 2) 2 is the only even prime number. ason Filippou UMCP)Number Theory History & Definitions / 1

44 Prime numbers Definition (Prime number) An integer n 2 is called prime iff its only factors (divisors) are 1 and n. Corollary (Primality of 2) 2 is the only even prime number. Prime numbers are fundamental in Number Theory, for a variety of reasons. Important enough that the set of primes has a symbol: P Largest known prime: 2 74,207,281 1 (22,338,618 digits). Discovered by the Great Internet Mersenne Prime Search (GIMPS). ason Filippou UMCP)Number Theory History & Definitions / 1

45 Composite numbers Definition (Composite number) An integer n 2 is called composite iff it is not prime. ason Filippou UMCP)Number Theory History & Definitions / 1

46 Composite numbers Definition (Composite number) An integer n 2 is called composite iff it is not prime. Corollary (Primality of 0 and 1) 1 and 0 are neither prime nor composite. ason Filippou UMCP)Number Theory History & Definitions / 1

47 Hierarchy of number sets, revisited R Q Z R Q N P Figure 9: Our final hierarchy. Possible to define more sets, like even and odd integers, Mersenne primes, etc. ason Filippou UMCP)Number Theory History & Definitions / 1

Elementary Number Theory

Elementary 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 information

Formal Proof Methodology

Formal Proof Methodology Formal Proof Methodology Jason Filippou CMSC250 @ UMCP 06-09-2016 ason Filippou (CMSC250 @ UMCP) Formal Proof Methodology 06-09-2016 1 / 45 Today s agenda We will talk about how to formally prove mathematical

More information

Math Circle Beginners Group February 28, 2016 Euclid and Prime Numbers Solutions

Math Circle Beginners Group February 28, 2016 Euclid and Prime Numbers Solutions Math Circle Beginners Group February 28, 2016 Euclid and Prime Numbers Solutions Warm-up Problems 1. What is a prime number? Give an example of an even prime number and an odd prime number. A prime number

More information

Math 412: Number Theory Lecture 3: Prime Decomposition of

Math 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 information

Math Circle Beginners Group February 28, 2016 Euclid and Prime Numbers

Math Circle Beginners Group February 28, 2016 Euclid and Prime Numbers Math Circle Beginners Group February 28, 2016 Euclid and Prime Numbers Warm-up Problems 1. What is a prime number? Give an example of an even prime number and an odd prime number. (a) Circle the prime

More information

Primes. Rational, Gaussian, Industrial Strength, etc. Robert Campbell 11/29/2010 1

Primes. Rational, Gaussian, Industrial Strength, etc. Robert Campbell 11/29/2010 1 Primes Rational, Gaussian, Industrial Strength, etc Robert Campbell 11/29/2010 1 Primes and Theory Number Theory to Abstract Algebra History Euclid to Wiles Computation pencil to supercomputer Practical

More information

An integer p is prime if p > 1 and p has exactly two positive divisors, 1 and p.

An integer p is prime if p > 1 and p has exactly two positive divisors, 1 and p. Chapter 6 Prime Numbers Part VI of PJE. Definition and Fundamental Results Definition. (PJE definition 23.1.1) An integer p is prime if p > 1 and p has exactly two positive divisors, 1 and p. If n > 1

More information

Table of Contents. 2013, Pearson Education, Inc.

Table 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 information

The following techniques for methods of proofs are discussed in our text: - Vacuous proof - Trivial proof

The following techniques for methods of proofs are discussed in our text: - Vacuous proof - Trivial proof Ch. 1.6 Introduction to Proofs The following techniques for methods of proofs are discussed in our text - Vacuous proof - Trivial proof - Direct proof - Indirect proof (our book calls this by contraposition)

More information

Grade 11/12 Math Circles Congruent Number Problem Dr. Carmen Bruni October 28, 2015

Grade 11/12 Math Circles Congruent Number Problem Dr. Carmen Bruni October 28, 2015 Faculty of Mathematics Waterloo, Ontario N2L 3G1 Number Theory Grade 11/12 Math Circles Congruent Number Problem Dr. Carmen Bruni October 28, 2015 Centre for Education in Mathematics and Computing Number

More information

Introduction: Pythagorean Triplets

Introduction: 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 information

CHAPTER 6. Prime Numbers. Definition and Fundamental Results

CHAPTER 6. Prime Numbers. Definition and Fundamental Results CHAPTER 6 Prime Numbers Part VI of PJE. Definition and Fundamental Results 6.1. Definition. (PJE definition 23.1.1) An integer p is prime if p > 1 and the only positive divisors of p are 1 and p. If n

More information

Math Number 842 Professor R. Roybal MATH History of Mathematics 24th October, Project 1 - Proofs

Math Number 842 Professor R. Roybal MATH History of Mathematics 24th October, Project 1 - Proofs Math Number 842 Professor R. Roybal MATH 331 - History of Mathematics 24th October, 2017 Project 1 - Proofs Mathematical proofs are an important concept that was integral to the development of modern mathematics.

More information

Introduction to Number Theory

Introduction to Number Theory INTRODUCTION Definition: Natural Numbers, Integers Natural numbers: N={0,1,, }. Integers: Z={0,±1,±, }. Definition: Divisor If a Z can be writeen as a=bc where b, c Z, then we say a is divisible by b or,

More information

Accelerated Math. Class work 3. Algebra.

Accelerated Math. Class work 3. Algebra. Accelerated Math. Class work 3. Algebra. We say that a natural number is divisible by another natural number if the result of this operation is a natural number. If this is not the case then we can divide

More information

Contest Number Theory

Contest Number Theory Contest Number Theory Andre Kessler December 7, 2008 Introduction Number theory is one of the core subject areas of mathematics. It can be somewhat loosely defined as the study of the integers. Unfortunately,

More information

Elliptic Curves & Number Theory. R. Sujatha School of Mathematics TIFR

Elliptic Curves & Number Theory. R. Sujatha School of Mathematics TIFR Elliptic Curves & Number Theory R. Sujatha School of Mathematics TIFR Aim: To explain the connection between a simple ancient problem in number theory and a deep sophisticated conjecture about Elliptic

More information

Shi Feng Sheng Danny Wong

Shi 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 information

MAT246H1S - Concepts In Abstract Mathematics. Solutions to Term Test 1 - February 1, 2018

MAT246H1S - Concepts In Abstract Mathematics. Solutions to Term Test 1 - February 1, 2018 MAT246H1S - Concepts In Abstract Mathematics Solutions to Term Test 1 - February 1, 2018 Time allotted: 110 minutes. Aids permitted: None. Comments: Statements of Definitions, Principles or Theorems should

More information

Direct Proof MAT231. Fall Transition to Higher Mathematics. MAT231 (Transition to Higher Math) Direct Proof Fall / 24

Direct 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 information

Deepening Mathematics Instruction for Secondary Teachers: Algebraic Structures

Deepening Mathematics Instruction for Secondary Teachers: Algebraic Structures Deepening Mathematics Instruction for Secondary Teachers: Algebraic Structures Lance Burger Fresno State Preliminary Edition Contents Preface ix 1 Z The Integers 1 1.1 What are the Integers?......................

More information

With Question/Answer Animations. Chapter 4

With 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 information

Diophantine equations

Diophantine equations Diophantine equations So far, we have considered solutions to equations over the real and complex numbers. This chapter instead focuses on solutions over the integers, natural and rational numbers. There

More information

= 5 2 and = 13 2 and = (1) = 10 2 and = 15 2 and = 25 2

= 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 information

Grade 6 Math Circles. Ancient Mathematics

Grade 6 Math Circles. Ancient Mathematics Faculty of Mathematics Waterloo, Ontario N2L 3G1 Introduction Grade 6 Math Circles October 17/18, 2017 Ancient Mathematics Centre for Education in Mathematics and Computing Have you ever wondered where

More information

On the Cardinality of Mersenne Primes

On 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 information

MATH 25 CLASS 8 NOTES, OCT

MATH 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 information

Syllabus for MTH U201: History of Mathematics

Syllabus for MTH U201: History of Mathematics Syllabus for MTH U201: History of Mathematics Instructor: Professor Mark Bridger Office: 527 Nightingale; ext. 2450 Hours: M,W,Th, 1:00-1:30, and by appointment e-mail: bridger@neu.edu Text: The History

More information

Math 312, Lecture 1. Zinovy Reichstein. September 9, 2015 Math 312

Math 312, Lecture 1. Zinovy Reichstein. September 9, 2015 Math 312 Math 312, Lecture 1 Zinovy Reichstein September 9, 2015 Math 312 Number theory Number theory is a branch of mathematics Number theory Number theory is a branch of mathematics which studies the properties

More information

Section 3.1: Direct Proof and Counterexample 1

Section 3.1: Direct Proof and Counterexample 1 Section 3.1: Direct Proof and Counterexample 1 In this chapter, we introduce the notion of proof in mathematics. A mathematical proof is valid logical argument in mathematics which shows that a given conclusion

More information

5.2. Perfect Numbers Divisors of a natural number were covered in Section 5.1.

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 information

MATH10040: Chapter 0 Mathematics, Logic and Reasoning

MATH10040: 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 information

The Real Number System

The Real Number System MATH 337 The Real Number System Sets of Numbers Dr. Neal, WKU A set S is a well-defined collection of objects, with well-defined meaning that there is a specific description from which we can tell precisely

More information

Definition 6.1 (p.277) A positive integer n is prime when n > 1 and the only positive divisors are 1 and n. Alternatively

Definition 6.1 (p.277) A positive integer n is prime when n > 1 and the only positive divisors are 1 and n. Alternatively 6 Prime Numbers Part VI of PJE 6.1 Fundamental Results Definition 6.1 (p.277) A positive integer n is prime when n > 1 and the only positive divisors are 1 and n. Alternatively D (p) = { p 1 1 p}. Otherwise

More information

A proof has to be rigorously checked before it is published, after which other mathematicians can use it to further develop the subject.

A proof has to be rigorously checked before it is published, after which other mathematicians can use it to further develop the subject. Proof in mathematics is crucial to its development. When an idea is formulated or an observation is noticed it becomes necessary to prove what has been discovered. Then again, the observation may prove

More information

Lecture 5: Arithmetic Modulo m, Primes and Greatest Common Divisors Lecturer: Lale Özkahya

Lecture 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 information

As the title suggests, we tackle three famous theorems in this chapter. 4.1 The Fundamental Theorem of Arithmetic

As 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 information

IST 4 Information and Logic

IST 4 Information and Logic IST 4 Information and Logic Quizzes grade (6): average of top n-2 T = today x= hw#x out x= hw#x due mon tue wed thr fri 1 M1 oh 1 8 oh M1 15 oh 1 T 2 oh M2 22 oh PCP oh 2 oh sun oh 29 oh M2 oh = office

More information

History of Mathematics

History 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 information

Appendix: a brief history of numbers

Appendix: a brief history of numbers Appendix: a brief history of numbers God created the natural numbers. Everything else is the work of man. Leopold Kronecker (1823 1891) Fundamentals of Computing 2017 18 (2, appendix) http://www.dcs.bbk.ac.uk/~michael/foc/foc.html

More information

Cool Results on Primes

Cool 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 information

Foundations of Basic Geometry

Foundations of Basic Geometry GENERAL I ARTICLE Foundations of Basic Geometry Jasbir S Chahal Jasbir S Chahal is Professor of Mathematics at Brigham Young University, Provo, Utah, USA. His research interest is in number theory. The

More information

7. Prime Numbers Part VI of PJE

7. 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 information

ENTRY NUMBER THEORY. [ENTRY NUMBER THEORY] Authors: Oliver Knill: 2003 Literature: Hua, introduction to number theory.

ENTRY NUMBER THEORY. [ENTRY NUMBER THEORY] Authors: Oliver Knill: 2003 Literature: Hua, introduction to number theory. ENTRY NUMBER THEORY [ENTRY NUMBER THEORY] Authors: Oliver Knill: 2003 Literature: Hua, introduction to number theory ABC conjecture [ABC conjecture] If a,b,c are positive integers, let N(a,b,c) be the

More information

Euclid-Euler-Jiang Prime Theorem

Euclid-Euler-Jiang Prime Theorem Euclid-Euler-iang Prime Theorem Chun-Xuan iang POBox 394 Beiing 00854 P R China iangchunxuan@sohucom Abstract Santilli s prime chains: P + ap b L ( a b ab If λn a P λ LP n P LPn b we have ( as There exist

More information

Junior Villafana. Math 301. Dr. Meredith. Odd Perfect Numbers

Junior Villafana. Math 301. Dr. Meredith. Odd Perfect Numbers 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

More information

An excursion through mathematics and its history MATH DAY 2013 TEAM COMPETITION

An excursion through mathematics and its history MATH DAY 2013 TEAM COMPETITION An excursion through mathematics and its history MATH DAY 2013 TEAM COMPETITION A quick review of the rules History (or trivia) questions alternate with math questions Math questions are numbered by MQ1,

More information

Eureka Math. Algebra II Module 1 Student File_A. Student Workbook. This file contains Alg II-M1 Classwork Alg II-M1 Problem Sets

Eureka Math. Algebra II Module 1 Student File_A. Student Workbook. This file contains Alg II-M1 Classwork Alg II-M1 Problem Sets Eureka Math Algebra II Module 1 Student File_A Student Workbook This file contains Alg II- Classwork Alg II- Problem Sets Published by the non-profit GREAT MINDS. Copyright 2015 Great Minds. No part of

More information

Proof by Contradiction

Proof by Contradiction Proof by Contradiction MAT231 Transition to Higher Mathematics Fall 2014 MAT231 (Transition to Higher Math) Proof by Contradiction Fall 2014 1 / 12 Outline 1 Proving Statements with Contradiction 2 Proving

More information

of Nebraska - Lincoln

of Nebraska - Lincoln University of Nebraska - Lincoln DigitalCommons@University of Nebraska - Lincoln MAT Exam Expository Papers Math in the Middle Institute Partnership 7-007 Pythagorean Triples Diane Swartzlander University

More information

Chapter 12: Ruler and compass constructions

Chapter 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 information

5.1. EXAMPLE 1 Decide whether the first number listed is divisible by the second. (a) 45; 9

5.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 information

A Brief History of Algebra

A Brief History of Algebra A Brief History of Algebra The Greeks: Euclid, Pythagora, Archimedes Indian and arab mathematicians Italian mathematics in the Renaissance The Fundamental Theorem of Algebra Hilbert s problems 1 Pythagoras,

More information

Cryptography. Number Theory with AN INTRODUCTION TO. James S. Kraft. Lawrence C. Washington. CRC Press

Cryptography. Number Theory with AN INTRODUCTION TO. James S. Kraft. Lawrence C. Washington. CRC Press AN INTRODUCTION TO Number Theory with Cryptography James S Kraft Gilman School Baltimore, Maryland, USA Lawrence C Washington University of Maryland College Park, Maryland, USA CRC Press Taylor & Francis

More information

SQUARE PATTERNS AND INFINITUDE OF PRIMES

SQUARE 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 information

MATH 205 L01 W 2006 MIDTERM AND SOLUTIONS

MATH 205 L01 W 2006 MIDTERM AND SOLUTIONS MATH 205 L01 W 2006 MIDTERM AND SOLUTIONS 1. For each of the following answer True or. Do not write T or F. [20] (a) Fermat is famous for his proof of the infinitude of primes. (b) The 10 Euro bill has

More information

4 PRIMITIVE ROOTS Order and Primitive Roots The Index Existence of primitive roots for prime modulus...

4 PRIMITIVE ROOTS Order and Primitive Roots The Index Existence of primitive roots for prime modulus... PREFACE These notes have been prepared by Dr Mike Canfell (with minor changes and extensions by Dr Gerd Schmalz) for use by the external students in the unit PMTH 338 Number Theory. This booklet covers

More information

LECTURE 1: DIVISIBILITY. 1. Introduction Number theory concerns itself with studying the multiplicative and additive structure of the natural numbers

LECTURE 1: DIVISIBILITY. 1. Introduction Number theory concerns itself with studying the multiplicative and additive structure of the natural numbers LECTURE 1: DIVISIBILITY 1. Introduction Number theory concerns itself with studying the multiplicative and additive structure of the natural numbers N = {1, 2, 3,... }. Frequently, number theoretic questions

More information

586 Index. vertex, 369 disjoint, 236 pairwise, 272, 395 disjoint sets, 236 disjunction, 33, 36 distributive laws

586 Index. vertex, 369 disjoint, 236 pairwise, 272, 395 disjoint sets, 236 disjunction, 33, 36 distributive laws Index absolute value, 135 141 additive identity, 254 additive inverse, 254 aleph, 465 algebra of sets, 245, 278 antisymmetric relation, 387 arcsine function, 349 arithmetic sequence, 208 arrow diagram,

More information

Applied Cryptography and Computer Security CSE 664 Spring 2017

Applied Cryptography and Computer Security CSE 664 Spring 2017 Applied Cryptography and Computer Security Lecture 11: Introduction to Number Theory Department of Computer Science and Engineering University at Buffalo 1 Lecture Outline What we ve covered so far: symmetric

More information

Fermat s Last Theorem for Regular Primes

Fermat 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 information

COMP Intro to Logic for Computer Scientists. Lecture 15

COMP Intro to Logic for Computer Scientists. Lecture 15 COMP 1002 Intro to Logic for Computer Scientists Lecture 15 B 5 2 J Types of proofs Direct proof of x F x Show that F x holds for arbitrary x, then use universal generalization. Often, F x is of the form

More information

Beautiful Mathematics

Beautiful 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 information

Adam Blank Spring 2017 CSE 311. Foundations of Computing I. * All slides are a combined effort between previous instructors of the course

Adam Blank Spring 2017 CSE 311. Foundations of Computing I. * All slides are a combined effort between previous instructors of the course Adam Blank Spring 2017 CSE 311 Foundations of Computing I * All slides are a combined effort between previous instructors of the course HW 3 De-Brief HW 3 De-Brief PROOFS! HW 3 De-Brief Proofs This is

More information

Square-Triangular Numbers

Square-Triangular Numbers Square-Triangular Numbers Jim Carlson April 26, 2004 Contents 1 Introduction 2 2 Existence 2 3 Finding an equation 3 4 Solutions by brute force 4 5 Speeding things up 5 6 Solutions by algebraic numbers

More information

Math.3336: Discrete Mathematics. Proof Methods and Strategy

Math.3336: Discrete Mathematics. Proof Methods and Strategy Math.3336: Discrete Mathematics Proof Methods and Strategy Instructor: Dr. Blerina Xhabli Department of Mathematics, University of Houston https://www.math.uh.edu/ blerina Email: blerina@math.uh.edu Fall

More information

P1-763.PDF Why Proofs?

P1-763.PDF Why Proofs? P1-763.PDF Why Proofs? During the Iron Age men finally started questioning mathematics which eventually lead to the creating of proofs. People wanted to know how and why is math true, rather than just

More information

Proof of Beal s Conjecture

Proof of Beal s Conjecture Proof of Beal s Conjecture Stephen Marshall 26 Feb 14 Abstract: This paper presents a complete and exhaustive proof of the Beal Conjecture. The approach to this proof uses the Fundamental Theorem of Arithmetic

More information

The Surprising Proofs

The Surprising Proofs The Surprising Proofs By Leszek W. Guła Lublin-POLAND lwgula@wp.pl May 30, June 12 13 and July 02 03, 2017 Abstract. The proof of the Fermat s Last Theorem. The proof of the theorem - For all and for all

More information

An Algorithm for Prime Factorization

An Algorithm for Prime Factorization An Algorithm for Prime Factorization Fact: If a is the smallest number > 1 that divides n, then a is prime. Proof: By contradiction. (Left to the reader.) A multiset is like a set, except repetitions are

More information

1.7 Proof Methods and Strategy

1.7 Proof Methods and Strategy 1.7 Proof Methods and Strategy Proof Strategies Finding proofs can be difficult. Usual process of proving: Replace terms by their definitions Analyze what the hypothesis and the conclusion mean Try to

More information

SEVENTH EDITION and EXPANDED SEVENTH EDITION

SEVENTH EDITION and EXPANDED SEVENTH EDITION SEVENTH EDITION and EXPANDED SEVENTH EDITION Slide 5-1 Chapter 5 Number Theory and the Real Number System 5.1 Number Theory Number Theory The study of numbers and their properties. The numbers we use to

More information

Kathleen A. Acker Robert McGee Carol Serotta. Cabrini College Colloquium October (c) 2010 Kathleen A. Acker, Ph.D.

Kathleen A. Acker Robert McGee Carol Serotta. Cabrini College Colloquium October (c) 2010 Kathleen A. Acker, Ph.D. Kathleen A. Acker Robert McGee Carol Serotta Cabrini College Colloquium October 2010 1 Our Challenge: Teaching ancient mathematics using modern technology! A talk in three parts: Math inspired art and

More information

A proof of strong Goldbach conjecture and twin prime conjecture

A proof of strong Goldbach conjecture and twin prime conjecture A proof of strong Goldbach conjecture and twin prime conjecture Pingyuan Zhou E-mail:zhoupingyuan49@hotmail.com Abstract In this paper we give a proof of the strong Goldbach conjecture by studying limit

More information

PRIME NUMBERS YANKI LEKILI

PRIME NUMBERS YANKI LEKILI PRIME NUMBERS YANKI LEKILI We denote by N the set of natural numbers: 1,2,..., These are constructed using Peano axioms. We will not get into the philosophical questions related to this and simply assume

More information

Paper Topics Due: May 9, 2019

Paper Topics Due: May 9, 2019 You are expected to write a 4 6 page paper, in LATEX, on the topic you have chosen. The paper should contain a clear statement of a significant result or idea that you are presenting, a little motivation

More information

Grade 7/8 Math Circles Winter March 20/21/22 Types of Numbers

Grade 7/8 Math Circles Winter March 20/21/22 Types of Numbers Faculty of Mathematics Waterloo, Ontario N2L 3G1 Centre for Education in Mathematics and Computing Grade 7/8 Math Circles Winter 2018 - March 20/21/22 Types of Numbers Introduction Today, we take our number

More information

from Euclid to Einstein

from Euclid to Einstein WorkBook 2. Space from Euclid to Einstein Roy McWeeny Professore Emerito di Chimica Teorica, Università di Pisa, Pisa (Italy) A Pari New Learning Publication Book 2 in the Series WorkBooks in Science (Last

More information

Pythagoras = $1 million problem. Ken Ono Emory University

Pythagoras = $1 million problem. Ken Ono Emory University Pythagoras = $1 million problem Ken Ono Emory University Pythagoras The Pythagorean Theorem Theorem (Pythagoras) If (a, b, c) is a right triangle, then a 2 + b 2 = c 2. Pythagoras The Pythagorean Theorem

More information

Disproof MAT231. Fall Transition to Higher Mathematics. MAT231 (Transition to Higher Math) Disproof Fall / 16

Disproof MAT231. Fall Transition to Higher Mathematics. MAT231 (Transition to Higher Math) Disproof Fall / 16 Disproof MAT231 Transition to Higher Mathematics Fall 2014 MAT231 (Transition to Higher Math) Disproof Fall 2014 1 / 16 Outline 1 s 2 Disproving Universal Statements: Counterexamples 3 Disproving Existence

More information

Before we talk about prime numbers, we will spend some time with divisibility because there is

Before 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 information

Elementary Number Theory

Elementary 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 information

The Impossibility of Certain Types of Carmichael Numbers

The Impossibility of Certain Types of Carmichael Numbers The Impossibility of Certain Types of Carmichael Numbers Thomas Wright Abstract This paper proves that if a Carmichael number is composed of primes p i, then the LCM of the p i 1 s can never be of the

More information

Instructor: Bobby Kleinberg Lecture Notes, 25 April The Miller-Rabin Randomized Primality Test

Instructor: Bobby Kleinberg Lecture Notes, 25 April The Miller-Rabin Randomized Primality Test Introduction to Algorithms (CS 482) Cornell University Instructor: Bobby Kleinberg Lecture Notes, 25 April 2008 The Miller-Rabin Randomized Primality Test 1 Introduction Primality testing is an important

More information

NUMBER THEORY. Anwitaman DATTA SCSE, NTU Singapore CX4024. CRYPTOGRAPHY & NETWORK SECURITY 2018, Anwitaman DATTA

NUMBER THEORY. Anwitaman DATTA SCSE, NTU Singapore CX4024. CRYPTOGRAPHY & NETWORK SECURITY 2018, Anwitaman DATTA NUMBER THEORY Anwitaman DATTA SCSE, NTU Singapore Acknowledgement: The following lecture slides are based on, and uses material from the text book Cryptography and Network Security (various eds) by William

More information

Algorithmic number theory. Questions/Complaints About Homework? The division algorithm. Division

Algorithmic number theory. Questions/Complaints About Homework? The division algorithm. Division Questions/Complaints About Homework? Here s the procedure for homework questions/complaints: 1. Read the solutions first. 2. Talk to the person who graded it (check initials) 3. If (1) and (2) don t work,

More information

CS March 17, 2009

CS March 17, 2009 Discrete Mathematics CS 2610 March 17, 2009 Number Theory Elementary number theory, concerned with numbers, usually integers and their properties or rational numbers mainly divisibility among integers

More information

MTH122: Algebra I. Course length: Two semesters. Materials: Algebra I: A Reference Guide and Problem Sets. Prerequisites: MTH112: Pre-Algebra

MTH122: Algebra I. Course length: Two semesters. Materials: Algebra I: A Reference Guide and Problem Sets. Prerequisites: MTH112: Pre-Algebra MTH122: Algebra I In this course, students explore the tools of algebra. Students learn to identify the structure and properties of the real number system; complete operations with integers and other rational

More information

A Local-Global Principle for Diophantine Equations

A Local-Global Principle for Diophantine Equations A Local-Global Principle for Diophantine Equations (Extended Abstract) Richard J. Lipton and Nisheeth Vishnoi {rjl,nkv}@cc.gatech.edu Georgia Institute of Technology, Atlanta, GA 30332, USA. Abstract.

More information

Intermediate Math Circles March 6, 2013 Number Theory I

Intermediate 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 information

IST 4 Information and Logic

IST 4 Information and Logic IST 4 Information and Logic MQ1 Everyone has a gift! Due Today by 10pm Please email PDF lastname-firstname.pdf to ta4@paradise.caltech.edu HW #1 Due Tuesday, 4/14 230 2:30pm in class T = today x= hw#x

More information

A Generalization of Wilson s Theorem

A Generalization of Wilson s Theorem A Generalization of Wilson s Theorem R. Andrew Ohana June 3, 2009 Contents 1 Introduction 2 2 Background Algebra 2 2.1 Groups................................. 2 2.2 Rings.................................

More information

MATH CSE20 Homework 5 Due Monday November 4

MATH CSE20 Homework 5 Due Monday November 4 MATH CSE20 Homework 5 Due Monday November 4 Assigned reading: NT Section 1 (1) Prove the statement if true, otherwise find a counterexample. (a) For all natural numbers x and y, x + y is odd if one of

More information

UNIT 4 NOTES: PROPERTIES & EXPRESSIONS

UNIT 4 NOTES: PROPERTIES & EXPRESSIONS UNIT 4 NOTES: PROPERTIES & EXPRESSIONS Vocabulary Mathematics: (from Greek mathema, knowledge, study, learning ) Is the study of quantity, structure, space, and change. Algebra: Is the branch of mathematics

More information

Selected Chapters from Number Theory and Algebra

Selected Chapters from Number Theory and Algebra Selected Chapters from Number Theory and Algebra A project under construction Franz Rothe Department of Mathematics University of North Carolina at Charlotte Charlotte, NC 83 frothe@uncc.edu December 8,

More information

Sums of four squares and Waring s Problem Brandon Lukas

Sums of four squares and Waring s Problem Brandon Lukas Sums of four squares and Waring s Problem Brandon Lukas Introduction The four-square theorem states that every natural number can be represented as the sum of at most four integer squares. Look at the

More information

Table of Contents. Number and Operation. Geometry. Measurement. Lesson 1 Goldbach s Conjecture Lesson 2 Micro Mites... 11

Table of Contents. Number and Operation. Geometry. Measurement. Lesson 1 Goldbach s Conjecture Lesson 2 Micro Mites... 11 Table of Contents Number and Operation Lesson 1 Goldbach s Conjecture........................ 5 Prime Factorization Lesson 2 Micro Mites.................................... 11 Division with Decimals Lesson

More information

Solutions of the Diophantine Equation 2 x + p y = z 2 When p is Prime

Solutions 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 information

CHAPTER 3. Congruences. Congruence: definitions and properties

CHAPTER 3. Congruences. Congruence: definitions and properties CHAPTER 3 Congruences Part V of PJE Congruence: definitions and properties Definition. (PJE definition 19.1.1) Let m > 0 be an integer. Integers a and b are congruent modulo m if m divides a b. We write

More information

Part I, Number Systems. CS131 Mathematics for Computer Scientists II Note 1 INTEGERS

Part I, Number Systems. CS131 Mathematics for Computer Scientists II Note 1 INTEGERS CS131 Part I, Number Systems CS131 Mathematics for Computer Scientists II Note 1 INTEGERS The set of all integers will be denoted by Z. So Z = {..., 2, 1, 0, 1, 2,...}. The decimal number system uses the

More information