Public Math Seminar Good Day To Math. Course Syllabus. July, Instructor : Sung Min Lee Visiting Lecturer : Won Kyung Lee

Size: px
Start display at page:

Download "Public Math Seminar Good Day To Math. Course Syllabus. July, Instructor : Sung Min Lee Visiting Lecturer : Won Kyung Lee"

Transcription

1 Public Math Seminar Good Day To Math Course Syllabus July, 2015 Instructor : Sung Min Lee Visiting Lecturer : Won Kyung Lee Class Details Location : Room 507, Main Building Korea National University of Arts, Seokgwandong Campus, Hwarangro 32-gil, Seongbukgu, Seoul Class Time : 4 to 6 P.M., every Tuesday and Friday. Seminar Overview The seminar, Good Day To Math is composed of seven Mathematics lectures by Sung Min Lee, a graduate student from Carleton College, and one Physics lecture by a visiting lecturer, Won Kyung Lee, a student from Yonsei University. The main objective of the seminar is to deconstruct the stereotype that Math is a study of computation. The seminar does not require any Mathematical background from audience. Each lecture chooses a different topic from Mathematics, and it introduces an idea, covers a number of propositions, and demonstrates proofs rigorously, yet explaining in easy language and providing many examples. For those who cannot attend, the contents of the seminar is also uploaded in a blog for free. Contact Information ryeedmidstal@gmail.com Blog: 1 of 7

2 Table of Contents 1 1. Infinite Sets and Cardinality (07/07) 2. Prime Numbers (07/10) 3. Group Theory (07/14) 4. Elementary Number Theory (07/17) 5. Combinatorics (07/21) 6. Measure Theory (07/24) 7. Unsolved Problems (07/28) Details of Contents 1. Infinite Sets and Cardinality (7th of July, 2015; Class Size: 20) - Sets of Numbers - Natural Numbers (N) - Integers (Z) - Rational Numbers (Q) - Real Numbers (R) - Basic Set Theories - Definition of Elements and Sets - Notations - Functions - Definition of Functions - Injective, Surjective, and Bijective Functions - Comparison of Cardinalities of Finite Sets with Functions - Countable Infinities - Proof that N is equinumerous to the Set of Even Numbers - Proof that Z is equinumerous to N - Proof that Q is equinumerous to Z - Notation of Countable Infinities; Aleph-Null - Uncountable Infinities - Proof that there is no bijective function from [0,1] to N - Claim 2 that [0,1] is equinumerous to R - Notation of Uncountable Infinities; Continuum - A Brief History of Continuum Hypothesis - Fields Medals and International Congress of Mathematicians (ICM) 1 This section only covers the lectures by Sung Min Lee 2 Claim session does not present the proof. The proofs are either skipped or presented in the book I was writing. 2 of 7

3 - Origin of ICM - Hilbert s Speech at ICM in Hilbert s 23 Problems and The First Problem - A Brief History of Gödel s Incompleteness Theorem - Controversy About Set Theory in the 20th Century - Philosophy of Mathematics - Logicism and Formalism - Constructivism and Intuitionism - Russell s Paradox and Barber s Paradox - Kurt Gödel s Incompleteness Theorem - Definition of Completeness and Soundness of Logic System - Existence of Statements of which Truth Values are Independent of Axiom Sets - Incompleteness of Continuum Hypothesis - Paradox of Hotel Hilbert (In Book 3) 2. Prime Numbers (10th of July, 2015; Class Size: 21) - Introduction to Prime Numbers - Definition of Prime Numbers - History of Prime Number Research - Sieve of Eratosthenes - Demonstration of Sieve of Eratosthenes - Trial Division Algorithm and Its Efficiency - Properties of Prime - Unique Factorization Property - Proof that there are infinitely many prime numbers - Proof that there are infinitely many prime numbers congruent to 3 mod 4 - Dirichlet s Theorem - Green-Tao Theorem - Prime Number Theorem - Preliminaries - Prime Counting Function - Natural Constant - Log Function - Tilde Equivalence - Prime Number Theorem - Graphical Demonstration of π(x) and x/ln x - Statistical Evidence - Zeta Function and Its Euler Product Form - History of Basel Problem and Zeta Function - Inducement of Euler Product from Zeta Function 3 In Book materials are presented only in the book, not in the class. 3 of 7

4 - Open Conjectures (In Book) - Twin Prime Conjectures and Its Progress - Goldbach Conjecture and Weak Goldbach Conjecture - Infinitude of Sophie-Germain Primes - Legendre Conjecture - Second Hardy-Littlewood Conjecture 3. Group Theory (14th of July, 2015; Class Size : 15) - Definition of Group - Identity Element - Inverse Element - Closure - Order of an Element - Abelian Groups - Modular Arithmetic and Coprimeness - Definition of Additive Groups - Definition of Multiplicative Groups - Commutativity - Non-Abelian Groups - Definition of Dihedral Groups - Definition of Symmetry Groups - Non-commutativity of a Dihedral Group and Symmetry Groups - Definition of Asymmetry Groups - Operation Table - Operation Table of an Additive Group, Z/4Z - Operation Table of a Multiplicative Group, (Z/10Z) x - Operation Table of a Dihedral Group, D3 - Operation Table of a Symmetry Group, S3 - Group Homomorphism - Showing that the operation tables of Z/4Z and (Z/10Z) x are similar - Showing that the operation tables of D3 and S3 are similar - Definition of Homomorphism - Graphical Explanation of Homomorphism Between D3 and S3 - Graphical Explanation of Homomorphism Between A4 and a Rotation Group of a Tetrahedron 4. Elementary Number Theory (17th of July, 2015; Class Size : 17) - Modular Arithmetic - Definition of Mod - Examples of Congruence - Modular Algebra - Examples of Modular Algebras; ax = b (mod n) 4 of 7

5 - Claim that Number of Solutions Vary Depending On Equations - Euclidean Algorithm - Demonstration of Euclidean Algorithm - Comparison of Its Efficiency to Elementary Method 4 - Claim that gcd(a,b) always divides ax+by for diophantine solutions x,y - Proof that ax = b (mod n) has solutions if and only if gcd(a,n) divides b - Euler Totient Function - Definition and Example of Totient Function - Properties of Totient Function - For n > 2, ϕ(n) is always even - For prime p, ϕ(p) = p-1 - Computing ϕ(n) - Fermat s Little Theorem and Euler s Theorem - Statement and Example of Fermat s Little Theorem and Euler s Theorem - Proof with Group Theory 5. Combinatorics (21st of July, 2015; Class Size : 10) - Fibonacci Sequence - Fibonacci s Rabbits - Generation of Fibonacci Sequence - Generating Function - Definition of Generating Functions - Computing n-th Fibonacci Number with Generating Function - Recurrence Relation - Chessboard Problems - Mutilated Chessboard Problem 5 and Solution - Number of Ways to Cover a 1 by n Chessboard With Monominos and Dominos - Basic Graph Theory - History of Graph Theory; Seven Bridges of Konisberg - Definition of Graphs - Eulerian Circuit and Hamiltonian Circuits - Necessary and Sufficient Conditions for Eulerian/Hamiltonian Circuits - Complete Graphs - Ramsey Theory - Definition of Ramsey Theory - Proof that R(3,3) = 6 - Proof that R(1,n) = 1 - Proof that R(2,n) = n 4 This is the algorithm that is to find gcd(a,b), find prime factorization of a and b respectively and compute the product of shared prime factors of 7

6 6. Measure Theory (24th of July, 2015; Class Size : 11) - Coordinate System - 1-Dimensional Coordinate System - 2-Dimensional Coordinate Systems: Rectangular and Polar Coordinates - 3-Dimensional Coordinate Systems: Rectangular, Cylindrical, and Spherical Coordinates - Definition of Dimensions from Coordinate Systems - Measure Theory - Definition of Lebesgue Measures - 1,2,3-Dimensional Lebesgue Measures - k-dimensional Hausdorff Measure - Relationship Between Hausdorff Measure and Hausdorff Dimension 6 - Fractals and Hausdorff Dimension - Cantor Set - Cantor Dust - Sierpinski Triangle - Von Koch Curve 7. Unsolved Problems (28th of July, 2015; Class Size : 11) - Fermat s Last Theorem (FLT) - Who is Pierre de Fermat? - FLT Briefing - Definition of Elliptic Curves - Taniyama-Shimura Conjecture (TSC) - Frey s Equation (FE) - Ribet s Theorem (RT) - Correlation of FLT, TSC, FE, and RT - Who is Andrew Wiles? - Poincare Conjecture (PC) - Who is Henri Poincare? - PC Briefing - Definition of Manifolds, n-sphere, Simply-Connected Space, Compactness, and Homeomorphism - Example of Non-Simply-Connected Space - Example of Homeomorphism; Coffee Cup and Donut - Progress of Generalized Poincare Conjecture; Milnor, Smale, and Freedman - Who is Grigori Perelman? - Four Color Theorem (FCT) 6 Let A be a set, and ka be the set scaled by k. Assuming m(ka) = k^x m(a), then the dimension of A can be defined as x. 6 of 7

7 - FCT Briefing - Origin of FCT - Graph Theoretical Approach - Planar Graph - Proof of Six Color Theorem - Controversy about Haken and Appel s Approach - Riemann Hypothesis (RH) - Who is Bernhard Riemann? - RH Briefing - Definition of Zeta Function, Complex Number, and Real Parts - Analytic Continuation of Zeta Function - Definition of Trivial Zeroes - Graphical Demonstration of Zeta Function on Complex Plane and Its Non-Trivial Zeroes - Rumors and Taboos Related to Riemann Hypothesis - Montgomery and Dyson s Discovery 7 - Will a proof to the RH affect security of RSA? - Possible Scenarios about RH 7 They discovered that an equation of atomic energy level distribution and distribution of nontrivial solutions share a similarity. 7 of 7

8 7 월매주화 / 금, 오후 4 시 -6 시, 총 8 강 한국예술종합학교본부 5 층강의실 507 호

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

Mathematics Without Calculations It s a Beautiful Thing!

Mathematics Without Calculations It s a Beautiful Thing! Sacred Heart University DigitalCommons@SHU Mathematics Faculty Publications Mathematics Department 8-4-2016 Mathematics Without Calculations It s a Beautiful Thing! Jason J. Molitierno Sacred Heart University,

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

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

Chapter 1 : The language of mathematics.

Chapter 1 : The language of mathematics. MAT 200, Logic, Language and Proof, Fall 2015 Summary Chapter 1 : The language of mathematics. Definition. A proposition is a sentence which is either true or false. Truth table for the connective or :

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

Riemann s Hypothesis and Conjecture of Birch and Swinnerton-Dyer are False

Riemann s Hypothesis and Conjecture of Birch and Swinnerton-Dyer are False Riemann s Hypothesis and Conjecture of Birch and Swinnerton-yer are False Chun-Xuan Jiang. O. Box 3924, Beijing 854 China jcxuan@sina.com Abstract All eyes are on the Riemann s hypothesis, zeta and L-functions,

More information

Discrete Logarithms. Let s begin by recalling the definitions and a theorem. Let m be a given modulus. Then the finite set

Discrete Logarithms. Let s begin by recalling the definitions and a theorem. Let m be a given modulus. Then the finite set Discrete Logarithms Let s begin by recalling the definitions and a theorem. Let m be a given modulus. Then the finite set Z/mZ = {[0], [1],..., [m 1]} = {0, 1,..., m 1} of residue classes modulo m is called

More information

UNIVERSITY OF DELHI DEPARTMENT OF MATHEMATICS. GENERIC ELECTIVE (GE) Courses For BA/B.Com. Programme. (Effective from Academic Year )

UNIVERSITY OF DELHI DEPARTMENT OF MATHEMATICS. GENERIC ELECTIVE (GE) Courses For BA/B.Com. Programme. (Effective from Academic Year ) UNIVERSITY OF DELHI DEPARTMENT OF MATHEMATICS GENERIC ELECTIVE (GE) Courses For BA/B.Com. Programme (Effective from Academic Year 2018-19) PROGRAMME BROCHURE XXXXX Revised Syllabus as approved by Academic

More information

MATH 310 Course Objectives

MATH 310 Course Objectives MATH 310 Course Objectives Upon successful completion of MATH 310, the student should be able to: Apply the addition, subtraction, multiplication, and division principles to solve counting problems. Apply

More information

Hilbert s problems, Gödel, and the limits of computation

Hilbert s problems, Gödel, and the limits of computation Hilbert s problems, Gödel, and the limits of computation Logan Axon Gonzaga University April 6, 2011 Hilbert at the ICM At the 1900 International Congress of Mathematicians in Paris, David Hilbert gave

More information

Chapter 5. Modular arithmetic. 5.1 The modular ring

Chapter 5. Modular arithmetic. 5.1 The modular ring Chapter 5 Modular arithmetic 5.1 The modular ring Definition 5.1. Suppose n N and x, y Z. Then we say that x, y are equivalent modulo n, and we write x y mod n if n x y. It is evident that equivalence

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

The Different Sizes of Infinity

The Different Sizes of Infinity The Different Sizes of Infinity New York City College of Technology Cesar J. Rodriguez November 11, 2010 A Thought to Ponder At... Does Infinity Come in Varying Sizes? 2 Points of Marked Interest(s) General

More information

Contents Part A Number Theory Highlights in the History of Number Theory: 1700 BC 2008

Contents Part A Number Theory Highlights in the History of Number Theory: 1700 BC 2008 Contents Part A Number Theory 1 Highlights in the History of Number Theory: 1700 BC 2008... 3 1.1 Early Roots to Fermat... 3 1.2 Fermat... 6 1.2.1 Fermat s Little Theorem... 7 1.2.2 Sums of Two Squares...

More information

Logic and Mathematics. 1. Lecture

Logic and Mathematics. 1. Lecture l211 Logic and Mathematics 1. Lecture Norbert PREINING preining@jaist.ac.jp www.preining.info/l211/index-en.html 2014-10-7 Self-introduction Logic and Mathematics Aims of the course Ideas and concepts

More information

Part IA Numbers and Sets

Part IA Numbers and Sets Part IA Numbers and Sets Definitions Based on lectures by A. G. Thomason Notes taken by Dexter Chua Michaelmas 2014 These notes are not endorsed by the lecturers, and I have modified them (often significantly)

More information

Math Topics in Algebra Course Notes: A Proof of Fermat s Last Theorem. Spring 2013

Math Topics in Algebra Course Notes: A Proof of Fermat s Last Theorem. Spring 2013 Math 847 - Topics in Algebra Course Notes: A Proof of Fermat s Last Theorem Spring 013 January 6, 013 Chapter 1 Background and History 1.1 Pythagorean triples Consider Pythagorean triples (x, y, z) so

More information

Hilbert s problems, Gödel, and the limits of computation

Hilbert s problems, Gödel, and the limits of computation Hilbert s problems, Gödel, and the limits of computation Logan Axon Gonzaga University November 14, 2013 Hilbert at the ICM At the 1900 International Congress of Mathematicians in Paris, David Hilbert

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

Lecture Notes 1 Basic Concepts of Mathematics MATH 352

Lecture Notes 1 Basic Concepts of Mathematics MATH 352 Lecture Notes 1 Basic Concepts of Mathematics MATH 352 Ivan Avramidi New Mexico Institute of Mining and Technology Socorro, NM 87801 June 3, 2004 Author: Ivan Avramidi; File: absmath.tex; Date: June 11,

More information

MATH 363: Discrete Mathematics

MATH 363: Discrete Mathematics MATH 363: Discrete Mathematics Learning Objectives by topic The levels of learning for this class are classified as follows. 1. Basic Knowledge: To recall and memorize - Assess by direct questions. The

More information

Section 0. Sets and Relations

Section 0. Sets and Relations 0. Sets and Relations 1 Section 0. Sets and Relations NOTE. Mathematics is the study of ideas, not of numbers!!! The idea from modern algebra which is the focus of most of this class is that of a group

More information

MATH 3300 Test 1. Name: Student Id:

MATH 3300 Test 1. Name: Student Id: Name: Student Id: There are nine problems (check that you have 9 pages). Solutions are expected to be short. In the case of proofs, one or two short paragraphs should be the average length. Write your

More information

MATHEMATICS (MATH) Calendar

MATHEMATICS (MATH) Calendar MATHEMATICS (MATH) This is a list of the Mathematics (MATH) courses available at KPU. For information about transfer of credit amongst institutions in B.C. and to see how individual courses transfer, go

More information

Part IA Numbers and Sets

Part IA Numbers and Sets Part IA Numbers and Sets Theorems Based on lectures by A. G. Thomason Notes taken by Dexter Chua Michaelmas 2014 These notes are not endorsed by the lecturers, and I have modified them (often significantly)

More information

Number Theory and Algebraic Equations. Odile Marie-Thérèse Pons

Number Theory and Algebraic Equations. Odile Marie-Thérèse Pons Number Theory and Algebraic Equations Odile Marie-Thérèse Pons Published by Science Publishing Group 548 Fashion Avenue New York, NY 10018, U.S.A. http://www.sciencepublishinggroup.com ISBN: 978-1-940366-74-6

More information

Fermat s Last Theorem

Fermat s Last Theorem Fermat s Last Theorem T. Muthukumar tmk@iitk.ac.in 0 Jun 014 An ancient result states that a triangle with vertices A, B and C with lengths AB = a, BC = b and AC = c is right angled at B iff a + b = c.

More 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

Exploring the infinite : an introduction to proof and analysis / Jennifer Brooks. Boca Raton [etc.], cop Spis treści

Exploring the infinite : an introduction to proof and analysis / Jennifer Brooks. Boca Raton [etc.], cop Spis treści Exploring the infinite : an introduction to proof and analysis / Jennifer Brooks. Boca Raton [etc.], cop. 2017 Spis treści Preface xiii I Fundamentals of Abstract Mathematics 1 1 Basic Notions 3 1.1 A

More information

MATHEMATICS (MATH) Mathematics (MATH) 1

MATHEMATICS (MATH) Mathematics (MATH) 1 Mathematics (MATH) 1 MATHEMATICS (MATH) MATH F113X Numbers and Society (m) Numbers and data help us understand our society. In this course, we develop mathematical concepts and tools to understand what

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

Notation Index. gcd(a, b) (greatest common divisor) NT-16

Notation Index. gcd(a, b) (greatest common divisor) NT-16 Notation Index (for all) B A (all functions) B A = B A (all functions) SF-18 (n) k (falling factorial) SF-9 a R b (binary relation) C(n,k) = n! k! (n k)! (binomial coefficient) SF-9 n! (n factorial) SF-9

More information

Introduction to Information Security

Introduction to Information Security Introduction to Information Security Lecture 5: Number Theory 007. 6. Prof. Byoungcheon Lee sultan (at) joongbu. ac. kr Information and Communications University Contents 1. Number Theory Divisibility

More information

Number Theory and Group Theoryfor Public-Key Cryptography

Number Theory and Group Theoryfor Public-Key Cryptography Number Theory and Group Theory for Public-Key Cryptography TDA352, DIT250 Wissam Aoudi Chalmers University of Technology November 21, 2017 Wissam Aoudi Number Theory and Group Theoryfor Public-Key Cryptography

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

Arithmetic Statistics Lecture 1

Arithmetic Statistics Lecture 1 Arithmetic Statistics Lecture 1 Álvaro Lozano-Robledo Department of Mathematics University of Connecticut May 28 th CTNT 2018 Connecticut Summer School in Number Theory Question What is Arithmetic Statistics?

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

What do you think are the qualities of a good theorem? it solves an open problem (Name one..? )

What do you think are the qualities of a good theorem? it solves an open problem (Name one..? ) What do you think are the qualities of a good theorem? Aspects of "good" theorems: short surprising elegant proof applied widely: it solves an open problem (Name one..? ) creates a new field might be easy

More information

Congruence Classes. Number Theory Essentials. Modular Arithmetic Systems

Congruence Classes. Number Theory Essentials. Modular Arithmetic Systems Cryptography Introduction to Number Theory 1 Preview Integers Prime Numbers Modular Arithmetic Totient Function Euler's Theorem Fermat's Little Theorem Euclid's Algorithm 2 Introduction to Number Theory

More information

Announcements. CS243: Discrete Structures. Sequences, Summations, and Cardinality of Infinite Sets. More on Midterm. Midterm.

Announcements. CS243: Discrete Structures. Sequences, Summations, and Cardinality of Infinite Sets. More on Midterm. Midterm. Announcements CS43: Discrete Structures Sequences, Summations, and Cardinality of Infinite Sets Işıl Dillig Homework is graded, scores on Blackboard Graded HW and sample solutions given at end of this

More information

Riemann s Zeta Function and the Prime Number Theorem

Riemann s Zeta Function and the Prime Number Theorem Riemann s Zeta Function and the Prime Number Theorem Dan Nichols nichols@math.umass.edu University of Massachusetts Dec. 7, 2016 Let s begin with the Basel problem, first posed in 1644 by Mengoli. Find

More information

Handbook of Logic and Proof Techniques for Computer Science

Handbook of Logic and Proof Techniques for Computer Science Steven G. Krantz Handbook of Logic and Proof Techniques for Computer Science With 16 Figures BIRKHAUSER SPRINGER BOSTON * NEW YORK Preface xvii 1 Notation and First-Order Logic 1 1.1 The Use of Connectives

More information

Summary Slides for MATH 342 June 25, 2018

Summary Slides for MATH 342 June 25, 2018 Summary Slides for MATH 342 June 25, 2018 Summary slides based on Elementary Number Theory and its applications by Kenneth Rosen and The Theory of Numbers by Ivan Niven, Herbert Zuckerman, and Hugh Montgomery.

More information

Review Sheet for the Final Exam of MATH Fall 2009

Review Sheet for the Final Exam of MATH Fall 2009 Review Sheet for the Final Exam of MATH 1600 - Fall 2009 All of Chapter 1. 1. Sets and Proofs Elements and subsets of a set. The notion of implication and the way you can use it to build a proof. Logical

More information

PMATH 600s. Prerequisite: PMATH 345 or 346 or consent of department.

PMATH 600s. Prerequisite: PMATH 345 or 346 or consent of department. PMATH 600s PMATH 632 First Order Logic and Computability (0.50) LEC Course ID: 002339 The concepts of formal provability and logical consequence in first order logic are introduced, and their equivalence

More information

Odd Primes. Theory W: Structure and organization of odd primes (8th problem of Hilbert) mathscience.tsoft .com

Odd Primes. Theory W: Structure and organization of odd primes (8th problem of Hilbert) mathscience.tsoft .com T-Soft@mail mathscience.tsoftemail.com Odd Primes Theory W: Structure and organization of odd primes (8th problem of Hilbert) WOLF François and WOLF Marc PhDs in materials science Ceramists engineers IT

More information

CONGRUENT NUMBERS AND ELLIPTIC CURVES

CONGRUENT NUMBERS AND ELLIPTIC CURVES CONGRUENT NUMBERS AND ELLIPTIC CURVES JIM BROWN Abstract. In this short paper we consider congruent numbers and how they give rise to elliptic curves. We will begin with very basic notions before moving

More information

Introduction to Arithmetic Geometry

Introduction to Arithmetic Geometry Introduction to Arithmetic Geometry 18.782 Andrew V. Sutherland September 5, 2013 What is arithmetic geometry? Arithmetic geometry applies the techniques of algebraic geometry to problems in number theory

More information

Number Theory: Final Project. Camilla Hollanti, Mohamed Taoufiq Damir, Laia Amoros

Number Theory: Final Project. Camilla Hollanti, Mohamed Taoufiq Damir, Laia Amoros Number Theory: Final Project 0 About the Final Project (30 of the final grade) Projects can be realized individually or in pairs. Choose your topic and possible pair by Friday, November 16th: Link to Google

More information

MATHEMATICS (MATH) Mathematics (MATH) 1 MATH AP/OTH CREDIT CALCULUS II MATH SINGLE VARIABLE CALCULUS I

MATHEMATICS (MATH) Mathematics (MATH) 1 MATH AP/OTH CREDIT CALCULUS II MATH SINGLE VARIABLE CALCULUS I Mathematics (MATH) 1 MATHEMATICS (MATH) MATH 101 - SINGLE VARIABLE CALCULUS I Short Title: SINGLE VARIABLE CALCULUS I Description: Limits, continuity, differentiation, integration, and the Fundamental

More information

Discrete Mathematics: Lectures 6 and 7 Sets, Relations, Functions and Counting Instructor: Arijit Bishnu Date: August 4 and 6, 2009

Discrete Mathematics: Lectures 6 and 7 Sets, Relations, Functions and Counting Instructor: Arijit Bishnu Date: August 4 and 6, 2009 Discrete Mathematics: Lectures 6 and 7 Sets, Relations, Functions and Counting Instructor: Arijit Bishnu Date: August 4 and 6, 2009 Our main goal is here is to do counting using functions. For that, we

More information

Understanding Computation

Understanding Computation Understanding Computation 1 Mathematics & Computation -Mathematics has been around for a long time as a method of computing. -Efforts to find canonical way of computations. - Machines have helped with

More information

Instructor s suggestions for use of Number Theory notes

Instructor s suggestions for use of Number Theory notes Number Theory Instructor s suggestions for use of Number Theory notes Goal. Our goal is to inspire students to be actively engaged in mathematical thought. We want them to discover ideas on their own,

More information

Notes for Math 290 using Introduction to Mathematical Proofs by Charles E. Roberts, Jr.

Notes for Math 290 using Introduction to Mathematical Proofs by Charles E. Roberts, Jr. Notes for Math 290 using Introduction to Mathematical Proofs by Charles E. Roberts, Jr. Chapter : Logic Topics:. Statements, Negation, and Compound Statements.2 Truth Tables and Logical Equivalences.3

More information

Divisibility. 1.1 Foundations

Divisibility. 1.1 Foundations 1 Divisibility 1.1 Foundations The set 1, 2, 3,...of all natural numbers will be denoted by N. There is no need to enter here into philosophical questions concerning the existence of N. It will suffice

More information

An Invitation to Modern Number Theory. Steven J. Miller and Ramin Takloo-Bighash PRINCETON UNIVERSITY PRESS PRINCETON AND OXFORD

An Invitation to Modern Number Theory. Steven J. Miller and Ramin Takloo-Bighash PRINCETON UNIVERSITY PRESS PRINCETON AND OXFORD An Invitation to Modern Number Theory Steven J. Miller and Ramin Takloo-Bighash PRINCETON UNIVERSITY PRESS PRINCETON AND OXFORD Contents Foreword Preface Notation xi xiii xix PART 1. BASIC NUMBER THEORY

More information

ECEN 5022 Cryptography

ECEN 5022 Cryptography Elementary Algebra and Number Theory University of Colorado Spring 2008 Divisibility, Primes Definition. N denotes the set {1, 2, 3,...} of natural numbers and Z denotes the set of integers {..., 2, 1,

More information

PMATH 300s P U R E M A T H E M A T I C S. Notes

PMATH 300s P U R E M A T H E M A T I C S. Notes P U R E M A T H E M A T I C S Notes 1. In some areas, the Department of Pure Mathematics offers two distinct streams of courses, one for students in a Pure Mathematics major plan, and another for students

More information

Elliptic Curves: An Introduction

Elliptic Curves: An Introduction Elliptic Curves: An Introduction Adam Block December 206 Introduction The goal of the following paper will be to explain some of the history of and motivation for elliptic curves, to provide examples and

More information

Part II. Number Theory. Year

Part II. Number Theory. Year Part II Year 2017 2016 2015 2014 2013 2012 2011 2010 2009 2008 2007 2006 2005 2017 Paper 3, Section I 1G 70 Explain what is meant by an Euler pseudoprime and a strong pseudoprime. Show that 65 is an Euler

More information

Elementary Number Theory and Cryptography, 2014

Elementary Number Theory and Cryptography, 2014 Elementary Number Theory and Cryptography, 2014 1 Basic Properties of the Integers Z and the rationals Q. Notation. By Z we denote the set of integer numbers and by Q we denote the set of rational numbers.

More information

Essential Background for Real Analysis I (MATH 5210)

Essential Background for Real Analysis I (MATH 5210) Background Material 1 Essential Background for Real Analysis I (MATH 5210) Note. These notes contain several definitions, theorems, and examples from Analysis I (MATH 4217/5217) which you must know for

More information

Outline. Some Review: Divisors. Common Divisors. Primes and Factors. b divides a (or b is a divisor of a) if a = mb for some m

Outline. Some Review: Divisors. Common Divisors. Primes and Factors. b divides a (or b is a divisor of a) if a = mb for some m Outline GCD and Euclid s Algorithm AIT 682: Network and Systems Security Topic 5.1 Basic Number Theory -- Foundation of Public Key Cryptography Modulo Arithmetic Modular Exponentiation Discrete Logarithms

More information

Outline. AIT 682: Network and Systems Security. GCD and Euclid s Algorithm Modulo Arithmetic Modular Exponentiation Discrete Logarithms

Outline. AIT 682: Network and Systems Security. GCD and Euclid s Algorithm Modulo Arithmetic Modular Exponentiation Discrete Logarithms AIT 682: Network and Systems Security Topic 5.1 Basic Number Theory -- Foundation of Public Key Cryptography Instructor: Dr. Kun Sun Outline GCD and Euclid s Algorithm Modulo Arithmetic Modular Exponentiation

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

Elliptic Curves and the abc Conjecture

Elliptic Curves and the abc Conjecture Elliptic Curves and the abc Conjecture Anton Hilado University of Vermont October 16, 2018 Anton Hilado (UVM) Elliptic Curves and the abc Conjecture October 16, 2018 1 / 37 Overview 1 The abc conjecture

More information

Outline of the Seminar Topics on elliptic curves Saarbrücken,

Outline of the Seminar Topics on elliptic curves Saarbrücken, Outline of the Seminar Topics on elliptic curves Saarbrücken, 11.09.2017 Contents A Number theory and algebraic geometry 2 B Elliptic curves 2 1 Rational points on elliptic curves (Mordell s Theorem) 5

More information

MATH 2200 Final Review

MATH 2200 Final Review MATH 00 Final Review Thomas Goller December 7, 01 1 Exam Format The final exam will consist of 8-10 proofs It will take place on Tuesday, December 11, from 10:30 AM - 1:30 PM, in the usual room Topics

More information

The Chinese Remainder Theorem

The Chinese Remainder Theorem Chapter 5 The Chinese Remainder Theorem 5.1 Coprime moduli Theorem 5.1. Suppose m, n N, and gcd(m, n) = 1. Given any remainders r mod m and s mod n we can find N such that N r mod m and N s mod n. Moreover,

More information

MATH 361: NUMBER THEORY FOURTH LECTURE

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

10 Problem 1. The following assertions may be true or false, depending on the choice of the integers a, b 0. a "

10 Problem 1. The following assertions may be true or false, depending on the choice of the integers a, b 0. a Math 4161 Dr. Franz Rothe December 9, 2013 13FALL\4161_fall13f.tex Name: Use the back pages for extra space Final 70 70 Problem 1. The following assertions may be true or false, depending on the choice

More information

Topics in Cryptography. Lecture 5: Basic Number Theory

Topics in Cryptography. Lecture 5: Basic Number Theory Topics in Cryptography Lecture 5: Basic Number Theory Benny Pinkas page 1 1 Classical symmetric ciphers Alice and Bob share a private key k. System is secure as long as k is secret. Major problem: generating

More information

Numbers, Groups and Cryptography. Gordan Savin

Numbers, Groups and Cryptography. Gordan Savin Numbers, Groups and Cryptography Gordan Savin Contents Chapter 1. Euclidean Algorithm 5 1. Euclidean Algorithm 5 2. Fundamental Theorem of Arithmetic 9 3. Uniqueness of Factorization 14 4. Efficiency

More information

Why is the Riemann Hypothesis Important?

Why is the Riemann Hypothesis Important? Why is the Riemann Hypothesis Important? Keith Conrad University of Connecticut August 11, 2016 1859: Riemann s Address to the Berlin Academy of Sciences The Zeta-function For s C with Re(s) > 1, set ζ(s)

More information

Sets are one of the basic building blocks for the types of objects considered in discrete mathematics.

Sets are one of the basic building blocks for the types of objects considered in discrete mathematics. Section 2.1 Introduction Sets are one of the basic building blocks for the types of objects considered in discrete mathematics. Important for counting. Programming languages have set operations. Set theory

More information

6.5 Elliptic Curves Over the Rational Numbers

6.5 Elliptic Curves Over the Rational Numbers 6.5 Elliptic Curves Over the Rational Numbers 117 FIGURE 6.5. Louis J. Mordell 6.5 Elliptic Curves Over the Rational Numbers Let E be an elliptic curve defined over Q. The following is a deep theorem about

More information

COMBINATORIALLY CONVEX MODULI AND AN EXAMPLE OF GÖDEL

COMBINATORIALLY CONVEX MODULI AND AN EXAMPLE OF GÖDEL Pioneer Journal of Algebra, Number Theory and its Applications Volume, Number, 2017, Pages This paper is available online at http://www.pspchv.com/content_pjanta.html COMBINATORIALLY CONVEX MODULI AND

More information

Unit 3: Definitions, Theorems and Proofs

Unit 3: Definitions, Theorems and Proofs LINEAR ALGEBRA AND VECTOR ANALYSIS MATH 22A Unit 3: Definitions, Theorems and Proofs Seminar 3.1. Theorems are mathematical statements which can be verified using proofs. Theorems are the backbone of mathematics.

More information

Introduction to Proofs

Introduction to Proofs Introduction to Proofs Notes by Dr. Lynne H. Walling and Dr. Steffi Zegowitz September 018 The Introduction to Proofs course is organised into the following nine sections. 1. Introduction: sets and functions

More information

Congruent Number Problem and Elliptic curves

Congruent Number Problem and Elliptic curves Congruent Number Problem and Elliptic curves December 12, 2010 Contents 1 Congruent Number problem 2 1.1 1 is not a congruent number.................................. 2 2 Certain Elliptic Curves 4 3 Using

More 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

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

Hence, the sequence of triangular numbers is given by., the. n th square number, is the sum of the first. S n

Hence, the sequence of triangular numbers is given by., the. n th square number, is the sum of the first. S n Appendix A: The Principle of Mathematical Induction We now present an important deductive method widely used in mathematics: the principle of mathematical induction. First, we provide some historical context

More information

MAS114: Exercises. October 26, 2018

MAS114: Exercises. October 26, 2018 MAS114: Exercises October 26, 2018 Note that the challenge problems are intended to be difficult! Doing any of them is an achievement. Please hand them in on a separate piece of paper if you attempt them.

More information

LECTURE 2 FRANZ LEMMERMEYER

LECTURE 2 FRANZ LEMMERMEYER LECTURE 2 FRANZ LEMMERMEYER Last time we have seen that the proof of Fermat s Last Theorem for the exponent 4 provides us with two elliptic curves (y 2 = x 3 + x and y 2 = x 3 4x) in the guise of the quartic

More information

Countable and uncountable sets. Matrices.

Countable and uncountable sets. Matrices. Lecture 11 Countable and uncountable sets. Matrices. Instructor: Kangil Kim (CSE) E-mail: kikim01@konkuk.ac.kr Tel. : 02-450-3493 Room : New Milenium Bldg. 1103 Lab : New Engineering Bldg. 1202 Next topic:

More information

A. Algebra and Number Theory

A. Algebra and Number Theory A. Algebra and Number Theory Public-key cryptosystems are based on modular arithmetic. In this section, we summarize the concepts and results from algebra and number theory which are necessary for an understanding

More information

CSE 20 DISCRETE MATH. Winter

CSE 20 DISCRETE MATH. Winter CSE 20 DISCRETE MATH Winter 2017 http://cseweb.ucsd.edu/classes/wi17/cse20-ab/ Today's learning goals Define and use the congruence modulo m equivalence relation Perform computations using modular arithmetic

More information

MATH 115 Concepts in Mathematics

MATH 115 Concepts in Mathematics South Central College MATH 115 Concepts in Mathematics Course Outcome Summary Course Information Description Total Credits 4.00 Total Hours 64.00 Concepts in Mathematics is a general education survey course

More information

Today. Wrapup of Polynomials...and modular arithmetic. Coutability and Uncountability.

Today. Wrapup of Polynomials...and modular arithmetic. Coutability and Uncountability. Today. Wrapup of Polynomials...and modular arithmetic. Coutability and Uncountability. Reed-Solomon code. Problem: Communicate n packets m 1,...,m n on noisy channel that corrupts k packets. Reed-Solomon

More information

Chapter 5: The Integers

Chapter 5: The Integers c Dr Oksana Shatalov, Fall 2014 1 Chapter 5: The Integers 5.1: Axioms and Basic Properties Operations on the set of integers, Z: addition and multiplication with the following properties: A1. Addition

More information

MthEd/Math 300 Williams Fall 2011 Midterm Exam 3

MthEd/Math 300 Williams Fall 2011 Midterm Exam 3 Name: MthEd/Math 300 Williams Fall 2011 Midterm Exam 3 Closed Book / Closed Note. Answer all problems. You may use a calculator for numerical computations. Section 1: For each event listed in the first

More information

Elementary Introduction to the Langlands Program. III

Elementary Introduction to the Langlands Program. III Elementary Introduction to the Langlands Program. III Edward Frenkel University of California, Berkeley Robert Langlands at his office, 2014 (photo: Toronto Star) Langlands Program a bridge between Number

More information

Number Theory Notes Spring 2011

Number Theory Notes Spring 2011 PRELIMINARIES The counting numbers or natural numbers are 1, 2, 3, 4, 5, 6.... The whole numbers are the counting numbers with zero 0, 1, 2, 3, 4, 5, 6.... The integers are the counting numbers and zero

More information

Example 2: Student work M ATHS COURSEWORK. Mathematics SL and HL teacher support material 1. Proving Euler s Totient Theorem

Example 2: Student work M ATHS COURSEWORK. Mathematics SL and HL teacher support material 1. Proving Euler s Totient Theorem M ATHS COURSEWORK Mathematics SL and HL teacher support material 1 TA B L E O F C O N T E N T S Maths Coursework 3 Introduction 3 The Theorem 3 Euler s Totient Function 3 Fermat s Little Theorem 4 Proving

More information

Discrete Mathematics & Mathematical Reasoning Course Overview

Discrete Mathematics & Mathematical Reasoning Course Overview Discrete Mathematics & Mathematical Reasoning Course Overview Colin Stirling Informatics Colin Stirling (Informatics) Discrete Mathematics Today 1 / 19 Teaching staff Lecturers: Colin Stirling, first half

More information

[Part 2] Asymmetric-Key Encipherment. Chapter 9. Mathematics of Cryptography. Objectives. Contents. Objectives

[Part 2] Asymmetric-Key Encipherment. Chapter 9. Mathematics of Cryptography. Objectives. Contents. Objectives [Part 2] Asymmetric-Key Encipherment Mathematics of Cryptography Forouzan, B.A. Cryptography and Network Security (International Edition). United States: McGraw Hill, 2008. Objectives To introduce prime

More information

MATH 2200 Final LC Review

MATH 2200 Final LC Review MATH 2200 Final LC Review Thomas Goller April 25, 2013 1 Final LC Format The final learning celebration will consist of 12-15 claims to be proven or disproven. It will take place on Wednesday, May 1, from

More information

MATH 101: ALGEBRA I WORKSHEET, DAY #1. We review the prerequisites for the course in set theory and beginning a first pass on group. 1.

MATH 101: ALGEBRA I WORKSHEET, DAY #1. We review the prerequisites for the course in set theory and beginning a first pass on group. 1. MATH 101: ALGEBRA I WORKSHEET, DAY #1 We review the prerequisites for the course in set theory and beginning a first pass on group theory. Fill in the blanks as we go along. 1. Sets A set is a collection

More information