Section 5.1 Number Theory.

Slides:



Advertisements
Similar presentations
Chapter 5 Number Theory © 2008 Pearson Addison-Wesley. All rights reserved.
Advertisements

Thinking Mathematically
Section 5.1 Prime Factorization and Greatest Common Factor.
Decimals and Fractions
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.
Number Theory and the Real Number System
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.
Section 5-4 Greatest Common Factor and Least Common Multiple.
Chapter Primes and Greatest Common Divisors ‒Primes ‒Greatest common divisors and least common multiples 1.
Lesson 1: Factors and Multiples of Whole Numbers
Copyright © 2013, 2010, and 2007, Pearson Education, Inc.
Factors, Fractions, and Exponents
CSE115/ENGR160 Discrete Mathematics 03/15/11
Chapter 5 Number Theory © 2008 Pearson Addison-Wesley.
Chapter Number Theory 4 4 Copyright © 2013, 2010, and 2007, Pearson Education, Inc.
BY MISS FARAH ADIBAH ADNAN IMK
Highest Common Factors And Least common multiple
Chapter 5 Number Theory © 2008 Pearson Addison-Wesley. All rights reserved.
 2012 Pearson Education, Inc. Slide Chapter 5 Number Theory.
Section 5.1 Number Theory.
SECTION 5-3 Selected Topics from Number Theory Slide
© by Kenneth H. Rosen, Discrete Mathematics & its Applications, Sixth Edition, Mc Graw-Hill, 2007 Chapter 3 (Part 2): The Fundamentals: Algorithms, the.
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.
Slide 5-1 Copyright © 2005 Pearson Education, Inc. SEVENTH EDITION and EXPANDED SEVENTH EDITION.
Number Theory.  A prime number is a natural number greater than 1 that has exactly two factors (or divisors), itself and 1.  Prime numbers less than.
Numbers MST101. Number Types 1.Counting Numbers (natural numbers) 2.Whole Numbers 3.Fractions – represented by a pair of whole numbers a/b where b ≠ 0.
SECTION 5-1 Prime and Composite Numbers Slide
HAWKES LEARNING SYSTEMS Students Matter. Success Counts. Copyright © 2013 by Hawkes Learning Systems/Quant Systems, Inc. All rights reserved. Section 1.9.
Factors
© T Madas. A prime number or simply a prime, is a number with exactly two factors. These two factors are always the number 1 and the prime number itself.
5.1 Divisibility. Natural Numbers The set of natural numbers or counting numbers is {1,2,3,4,5,6,…}
Factors are numbers you can multiply together to get another number. Multiples are numbers that can be divided by another number without a remainder. Its.
Copyright © 2009 Pearson Education, Inc. Chapter 5 Section 1 - Slide 1 Chapter 1 Number Theory and the Real Number System.
Copyright © 2008 Pearson Addison-Wesley. All rights reserved. Chapter 2 Fractions.
Copyright © Cengage Learning. All rights reserved. 1 Whole Numbers.
Chapter 2 (Part 1): The Fundamentals: Algorithms, the Integers & Matrices The Integers and Division (Section 2.4)
Slide Copyright © 2009 Pearson Education, Inc. Unit 1 Number Theory MM-150 SURVEY OF MATHEMATICS – Jody Harris.
Slide Copyright © 2009 Pearson Education, Inc. Slide Copyright © 2009 Pearson Education, Inc. Chapter 1 Number Theory and the Real Number System.
 2012 Pearson Education, Inc. Slide Chapter 5 Number Theory.
© 2010 Pearson Prentice Hall. All rights reserved. CHAPTER 5 Number Theory and the Real Number System.
Slide Copyright © 2009 Pearson Education, Inc. 5.1 Number Theory.
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.
Number Theory: Prime and Composite Numbers
Slide Copyright © 2009 Pearson Education, Inc. Slide Copyright © 2009 Pearson Education, Inc. Chapter 1 Number Theory and the Real Number System.
Chapter 3 The Fundamentals: Algorithms, the integers, and matrices Section 3.4: The integers and division Number theory: the part of mathematics involving.
Number Theory. Introduction to Number Theory Number theory is about integers and their properties. We will start with the basic principles of divisibility,
Section 5.1 Number Theory.
Factors
CS 210 Discrete Mathematics The Integers and Division (Section 3.4)
Number Theory and the Real Number System
Chapter 5: Number Theory
Copyright © 2016, 2013, and 2010, Pearson Education, Inc.
Thinking Critically 4.1 Divisibility Of Natural Numbers
Subject : Algebra Std - 9th Subject- Algebra Topic- Real Numbers.
Exercise 24 ÷ 2 12.
Prime Factorization Prime factorization is the long string of factors that is made up of all prime numbers.
Section 5.1 Number Theory.
Number Theory and the Real Number System
Review Basic Math Divisibility tests Prime and Composite Numbers
Chapter 5 Number Theory 2012 Pearson Education, Inc.
Chapter 5 Number Theory 2012 Pearson Education, Inc.
Factors, Primes & Composite Numbers
Copyright © 2013, 2010, and 2007, Pearson Education, Inc.
Factors, Primes & Composite Numbers
Number Theory.
Number Theory: Prime & Composite Numbers
Factors, Primes & Composite Numbers
Factors, Primes & Composite Numbers
Presentation transcript:

Section 5.1 Number Theory

What You Will Learn Introduction to Number Theory Prime Numbers Composite Numbers Prime Factorization

Number Theory The study of numbers and their properties. The numbers we use to count are called counting numbers, or natural numbers, denoted by N. N = {1, 2, 3, 4, 5, …}

Factors The natural numbers that are multiplied together are called factors of the product. A natural number may have many factors. The factors of 18 are 1, 2, 3, 6, 9 and 18.

Divisors If a and b are natural numbers, we say that a is a divisor of b or a divides b, symbolized a|b if the quotient of b divided by a has a remainder of 0. If a divides b, then b is divisible by a.

Prime and Composite Numbers A prime number is a natural number greater than 1 that has exactly two factors (or divisors), itself and 1. A composite number is a natural number that is divisible by a number other than itself and 1. The number 1 is neither prime nor composite; it is called a unit.

Divisibility Rules 265; ends in 5 The number ends in 0 or 5. 5 924; 24 is divisible by 4 The number formed by the last two digits of the number is divisible by 4. 4 924; 8 + 4 + 6 = 18 and 18 is divisible by 3 The sum of the digits of the number is divisible by 3. 3 924; even The number is even. 2 Example Test Divisible by

Divisibility Rules 730; ends in 0 The number ends in 0. 10 837; 8 + 3 + 7 = 18 and 18 is divisible by 9 The sum of the digits of the number is divisible by 9. 9 5824; 824 is divisible by 8 The number formed by the last three digits of the number is divisible by 8. 8 924; divisible by both 2 and 3 The number is divisible by both 2 and 3. 6 Example Test Divisible by

The Fundamental Theorem of Arithmetic Every composite number can be expressed as a unique product of prime numbers. This unique product is referred to as the prime factorization of the number.

Finding Prime Factorizations Method 1: Branching Select any two numbers whose product is the number to be factored. If the factors are not prime numbers, continue factoring each number until all numbers are prime.

Example 2: Prime Factorization by Branching Write 1500 as a product of primes. Solution or Thus, the prime factorization of 1500 = 2 • 2 • 3 • 5 • 5 • 5 = 22 • 3 • 53

Method 2: Division 1. Divide the given number by the smallest prime number by which it is divisible. 2. Place the quotient under the given number. 3. Divide the quotient by the smallest prime number by which it is divisible and again record the quotient. 4. Repeat this process until the quotient is a prime number.

Example 2: Prime Factorization by Division Write 1500 as a product of prime numbers. 2 1500 Solution 2 750 3 375 5 125 5 25 5 1500 = 2 • 2 • 3 • 5 • 5 • 5 = 22 • 3 • 53

Greatest Common Divisor The greatest common divisor (GCD) of a set of natural numbers is the largest natural number that divides (without remainder) every number in that set.

To Determine the GCD of Two or More Numbers 1. Determine the prime factorization of each number. 2. List each prime factor with smallest exponent that appears in each of the prime factorizations. 3. Determine the product of the factors found in step 2.

Example 4: Using Prime Factorization to Determine the GCD Determine the GCD of 54 and 90. Solution 54 = 2 • 33 90 = 2 • 32 • 5 Prime factors with smallest exponents that appear in each factorization 2 and 32 The GCD is 2 • 32 = 18.

Least Common Multiple The least common multiple (LCM) of a set of natural numbers is the smallest natural number that is divisible (without remainder) by each element of the set.

To Determine the LCM of Two or More Numbers 1. Determine the prime factorization of each number. 2. List each prime factor with the greatest exponent that appears in any of the prime factorizations. 3. Determine the product of the factors found in step 2.

Example 6: Using Prime Factorization to Determine the LCM Determine the LCM of 54 and 90. Solution 54 = 2 • 33 90 = 2 • 32 • 5 Prime factors with greatest exponents that appear in either factorization 2, 33 and 5 The LCM is 2 • 33 • 5 = 270.

Search for Larger Prime Numbers More than 2000 years ago, the Greek mathematician Euclid proved that there is no largest prime number. Mathematicians, however, continue to strive to find larger and larger prime numbers.

Mersenne Primes Marin Mersenne (1588–1648), a seventeenth-century monk, found that numbers of the form 2n – 1 are often prime numbers when n is a prime number Numbers of the form 2n – 1 are referred to as Mersenne primes

Mersenne Primes The first 10 Mersenne primes occur when The first time the expression does not generate a prime number, for prime number n, is when n is 11

Mersenne Primes Largest prime discovered August 23, 2008 by Edson Smith, UCLA 243,112,609 – 1 It is 12,978,189 digits long Written in 12-point font it is 17 miles long

Fermat Numbers Pierre de Fermat (1601 – 1665) conjectured that each number of the form , now referred to as a Fermat number, was prime for each natural number n. A conjecture is a supposition that has not been proved or disproved.

Fermat Numbers In 1732, Leonhard Euler proved that for n = 5, 232 + 1 was a composite number, thus disproving Fermat’s conjecture. Since Euler’s time, mathematicians have been able to evaluate only the sixth, seventh, eighth, ninth, tenth, and eleventh Fermat numbers and each of these numbers has been shown to be composite.

Goldbach’s Conjecture In 1742, Christian Goldbach conjectured that every even number greater than or equal to 4 can be represented as the sum of two (not necessarily distinct) prime numbers. For example, 4 = 2 + 2, 6 = 3 + 3, 8 = 3 + 5, 10 = 5 + 5, 12 = 5 + 7. It remains unproven to this day.

Twin Prime Conjecture Twin primes are primes of the form p and p + 2 (3 and 5, 11 and 13). The conjecture states that there are an infinite number of pairs of twin primes. The largest known twin primes are of the form 65,516,468,355 2333,333 ± 1. The were found by the efforts of two research groups: Twin Prime Search and PrimeGrid on August 6, 2009.