By: Katrina Carlsen and Melissa Sparow.  For every integer n ≥ 2, n is a prime number or can be written uniquely (ignoring ordering) as a product of.

Slides:

Advertisements

Similar presentations

The Fundamental Theorem of Arithmetic. Primes p > 1 is prime if the only positive factors are 1 and p if p is not prime it is composite The Fundamental.

Advertisements

CS 202 Epp section ?? Aaron Bloomfield

The Integers and Division. Outline Division: Factors, multiples Exercise 2.3 Primes: The Fundamental Theorem of Arithmetic. The Division Algorithm Greatest.

Euclidean Number theory From the Algorithm to the Basic Theory of Numbers.

5.1 Number Theory. The study of numbers and their properties. The numbers we use to count are called the Natural Numbers or Counting Numbers.

Sets, Combinatorics, Probability, and Number Theory Mathematical Structures for Computer Science Chapter 3 Copyright © 2006 W.H. Freeman & Co.MSCS Slides.

Thinking Mathematically

1 Section 2.4 The Integers and Division. 2 Number Theory Branch of mathematics that includes (among other things): –divisibility –greatest common divisor.

Chapter Primes and Greatest Common Divisors ‒Primes ‒Greatest common divisors and least common multiples 1.

The Fundamental Theorem of Arithmetic (2/12) Definition (which we all already know). A number greater than 1 is called prime if its only divisors are 1.

NUMBER THEORY Chapter 1: The Integers. The Well-Ordering Property.

Basic properties of the integers

CSE115/ENGR160 Discrete Mathematics 03/15/11

Chapter 4 Properties of the integers: mathematical induction Yen-Liang Chen Dept of IM NCU.

3 Gallon Jug5 Gallon Jug Greatest Common Divisor Lecture 8: Sep 30.

The essential quality of a proof is to compel belief.

Fundamental Theorem of Arithmetic. Euclid's Lemma If p is a prime that divides ab, then p divides a or p divides b.

1 Strong Mathematical Induction. Principle of Strong Mathematical Induction Let P(n) be a predicate defined for integers n; a and b be fixed integers.

Properties of the Integers: Mathematical Induction

WHOLE NUMBERS; INTEGERS Whole numbers: Z 0,+ = the natural numbers  {0}. Integers:

CS555Spring 2012/Topic 61 Cryptography CS 555 Topic 6: Number Theory Basics.

Chapter Number Theory 4 4 Copyright © 2013, 2010, and 2007, Pearson Education, Inc.

Prime Factorization.

A number that divides evenly into a larger number without a remainder Factor- Lesson 7 - Attachment A.

Homework Review notes Complete Worksheet #2. Homework State whether the conditional sentence is true or false 1.If 1 = 0, then 1 = – 1 True F F T.

Divisibility October 8, Divisibility If a and b are integers and a  0, then the statement that a divides b means that there is an integer c such.

© by Kenneth H. Rosen, Discrete Mathematics & its Applications, Sixth Edition, Mc Graw-Hill, 2007 Chapter 3 (Part 2): The Fundamentals: Algorithms, the.

Chapter 2 The Fundamentals: Algorithms, the Integers, and Matrices

1 Properties of Integers Objectives At the end of this unit, students should be able to: State the division algorithm Apply the division algorithm Find.

Copyright © 2012, 2009, 2005, 2002 Pearson Education, Inc. Chapter 2 Fractions.

Mathematical Induction. F(1) = 1; F(n+1) = F(n) + (2n+1) for n≥ F(n) n F(n) =n 2 for all n ≥ 1 Prove it!

The Integers & Division. a divides b if a is not zero there is a m such that a.m = b “a is a factor of b” “b is a multiple of a” a|b Division.

Greatest Common Divisor

CompSci 102 Discrete Math for Computer Science

Operations with Rational Numbers Any number that can be written in the form, where m and n are integers and n 0, is called a rational number In other.

Math 409/409G History of Mathematics Books VII – IX of the Elements Part 3: Prime Numbers.

Chapter 2 (Part 1): The Fundamentals: Algorithms, the Integers & Matrices The Integers and Division (Section 2.4)

7.3 Products and Factors of Polynomials Objectives: Multiply polynomials, and divide one polynomial by another by using long division and synthetic division.

MA/CSSE 473 Day 08 Extended Euclid's Algorithm Modular Division Fermat's little theorem.

Factor A factor of an integer is any integer that divides the given integer with no remainder.

Slide Copyright © 2009 Pearson Education, Inc. 5.1 Number Theory.

AF2. Turn off your phones Primes, gcd, some examples, reading.

1 Discrete Structures – CNS2300 Text Discrete Mathematics and Its Applications Kenneth H. Rosen (5 th Edition) Chapter 2 The Fundamentals: Algorithms,

Chapter 4 With Question/Answer Animations 1. Chapter Summary Divisibility and Modular Arithmetic - Sec 4.1 – Lecture 16 Integer Representations and Algorithms.

CS480 Cryptography and Information Security

If more pigeons than pigeonholes, Pigeonhole Principle.

CS 210 Discrete Mathematics The Integers and Division (Section 3.4)

Integers and Division Section 3.4.

Chapter 5: Number Theory

Copyright © 2016, 2013, and 2010, Pearson Education, Inc.

Greatest Common Divisor

Exercise 24 ÷ 2 12.

Prime Factorization Prime factorization is the long string of factors that is made up of all prime numbers.

Applied Discrete Mathematics Week 4: Number Theory

Gaussian Integers and their Relationship to Ordinary Integers

A number that divides evenly into a larger number without a remainder

Direct Proof and Counterexample III

Sec P.1 Cont Sec, P.1 cont..

Fundamental Theorem of Arithmetic

Direct Proof and Counterexample III

Copyright © Cengage Learning. All rights reserved.

The Integers & Division

Copyright © 2013, 2010, and 2007, Pearson Education, Inc.

CMSC 203, Section 0401 Discrete Structures Fall 2004 Matt Gaston

Copyright © Zeph Grunschlag,

Applied Discrete Mathematics Week 10: Introduction to Counting

Prime and Composite.

From the last time: gcd(a, b) can be characterized in two different ways: It is the least positive value of ax + by where x and y range over integers.

Sets, Combinatorics, Probability, and Number Theory

Presentation transcript:

By: Katrina Carlsen and Melissa Sparow

 For every integer n ≥ 2, n is a prime number or can be written uniquely (ignoring ordering) as a product of prime numbers  Ex: unique factorization of 825  Divide by successively larger primes (2,3,5 etc)

Prove the factorization of a composite number n>2 into prime numbers is unique when order is not important. N=p 1 p 2 p 3 …p r and N=q 1 q 2 q 3 …q s p 1 p 2 p 3 …p r = q 1 q 2 q 3 …q s P 1 | p 1 p 2 …p r so P 1 | q 1 q 2 …q s This means P 1 | q i Contradiction. This means factorization is unique!

 integers a and b are relatively prime if gcd(a,b) = 1.  ia +jb = 1  i(21) + j(16) = 1 Find i and j   i (27) + j(25) = 1

 p|p and p|a  gcd(a,p)= p  gcd(a,p) = 1  p|ab  P must divide either a or b  P doesn’t divide a..  1 = ia + jp  Linear combination of prime #s

Given positive integers a and b, gcd(a,b) is the linear combination of a and b that has the smallest positive value.

 1 = ia + jp  Multiply by b  b = (ia)b + (jp)b = i(ab) + (jp)b  p|ab… ab written as kp  b = i(kp) + (jp)b  b = (ik +jb)p  p|b PROVEN!

 Our goal was to proof the Fundamental Theorem of Arithmetic  In order to do so, we needed to understand the Theorem on Division by Prime Numbers, what it means to be Relatively Prime, Linear Combinations and the Theorem on gcd(a,b).

Theorem on Size of Prime Factors: If n is a composite number, then it has a prime factor less than or equal to √n. Given n=1021, find the prime factors of n or determine that it is prime. √1021 = So we will test with prime numbers: 2,3,5,7,11, 13,17,19,23,29,31 None divides That means 1021 is prime.