The numbers 1, 2, 3, are called the counting numbers or natural numbers. The study of the properties of counting numbers is called number theory.

Similar documents
Number Theory. Number Theory. 6.1 Number Theory

Discrete Structures Lecture Primes and Greatest Common Divisor

Slide 1 / 69. Slide 2 / 69. Slide 3 / 69. Whole Numbers. Table of Contents. Prime and Composite Numbers

Intermediate Math Circles Number Theory II Problems and Solutions

Number Theory and Divisibility

5.1. Primes, Composites, and Tests for Divisibility

Math 110 FOUNDATIONS OF THE REAL NUMBER SYSTEM FOR ELEMENTARY AND MIDDLE SCHOOL TEACHERS

Arithmetic, Algebra, Number Theory

August 15, M1 1.4 Common Factors_Multiples Compacted.notebook. Warm Up MI 36. Jun 20 10:53 AM

2 Elementary number theory

Divisibility of Natural Numbers

Section 3-4: Least Common Multiple and Greatest Common Factor

Chapter 5: The Integers

Divisibility, Factors, and Multiples

5: The Integers (An introduction to Number Theory)

Associative property

Prime Factorization and GCF. In my own words

4 Number Theory and Cryptography

1 Paid Copy Don t Share With Anyone

Unit 1. Number Theory

Integers and Division

7.2 Applications of Euler s and Fermat s Theorem.

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

Intermediate Math Circles February 14, 2018 Contest Prep: Number Theory

SEVENTH EDITION and EXPANDED SEVENTH EDITION

NS8-1 Factors and Multiples

Decimal Addition: Remember to line up the decimals before adding. Bring the decimal straight down in your answer.

Homework #2 solutions Due: June 15, 2012

Quantitative Aptitude

Systems of Linear Equations

A number that can be written as, where p and q are integers and q Number.

Number Theory 1. A unit is that by virtue of which each of the things that exist is called one. 1 A number is a multitude composed of units.


Expressions that always have the same value. The Identity Property of Addition states that For any value a; a + 0 = a so = 3

N= {1,2,3,4,5,6,7,8,9,10,11,...}

Exam 2 Review Chapters 4-5

HCF & LCM Solved Sums

Integer factorization, part 1: the Q sieve. part 2: detecting smoothness. D. J. Bernstein

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

The CENTRE for EDUCATION in MATHEMATICS and COMPUTING cemc.uwaterloo.ca Cayley Contest. (Grade 10) Thursday, February 20, 2014

Massachusetts Tests for Educator Licensure (MTEL )

ALGEBRA+NUMBER THEORY +COMBINATORICS

Chapter 3: Section 3.1: Factors & Multiples of Whole Numbers

Slides by Christopher M. Bourke Instructor: Berthe Y. Choueiry. Spring 2006

Finding Divisors, Number of Divisors and Summation of Divisors. Jane Alam Jan

Number Theory Math 420 Silverman Exam #1 February 27, 2018

MATH 4400 SOLUTIONS TO SOME EXERCISES. 1. Chapter 1

4 Powers of an Element; Cyclic Groups

CHAPTER 1 REAL NUMBERS KEY POINTS

Section 4. Quantitative Aptitude

UNC Charlotte 2005 Algebra March 7, 2005

A group of figures, representing a number, is called a numeral. Numbers are divided into the following types.

MATH 501 Discrete Mathematics. Lecture 6: Number theory. German University Cairo, Department of Media Engineering and Technology.

and LCM (a, b, c) LCM ( a, b) LCM ( b, c) LCM ( a, c)

Numbers and Operations Review

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

Math Review. for the Quantitative Reasoning measure of the GRE General Test

Number Theory. Introduction

Intermediate Math Circles March 6, 2013 Number Theory I

Objective. The student will be able to: solve systems of equations using elimination with multiplication. SOL: A.9

a the relation arb is defined if and only if = 2 k, k

INTRODUCTION TO FRACTIONS

Introduction to Information Security

Topic Contents. Factoring Methods. Unit 3: Factoring Methods. Finding the square root of a number

Applied Cryptography and Computer Security CSE 664 Spring 2017

1. Revision Description Reflect and Review Teasers Answers Recall of Rational Numbers:

Chapter 9 Mathematics of Cryptography Part III: Primes and Related Congruence Equations

Adding Three or More Fractions

8-1 Factors and Greatest Common Factors 8-1. Factors and Greatest Common Factors

Finding Prime Factors

2x 1 7. A linear congruence in modular arithmetic is an equation of the form. Why is the solution a set of integers rather than a unique integer?

3 The fundamentals: Algorithms, the integers, and matrices

Math Ed 305 Defining Common Divisors and Multiples. 1. From a partitive perspective, to say that X is a divisor of Y is to say that:

Expressions and Formulas 1.1. Please Excuse My Dear Aunt Sally

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

Intermediate Math Circles February 26, 2014 Diophantine Equations I

Exercises Exercises. 2. Determine whether each of these integers is prime. a) 21. b) 29. c) 71. d) 97. e) 111. f) 143. a) 19. b) 27. c) 93.

MATHEMATICS IN EVERYDAY LIFE 8

Item 6. Pi and the Universe. Gives Applications to the Geometry of our Universe. 5 Total Pages

USA Mathematical Talent Search Round 3 Solutions Year 20 Academic Year

Homework 3, solutions

Section 4.1 Polynomial Functions and Models. Copyright 2013 Pearson Education, Inc. All rights reserved

Introduction to Number Theory

Lecture 7.4: Divisibility and factorization

MATH STUDENT BOOK. 8th Grade Unit 3

KNOWLEDGE OF NUMBER SENSE, CONCEPTS, AND OPERATIONS

Daily Skill Builders:

Chapter 5. Number Theory. 5.1 Base b representations

FACTORS AND MULTIPLES

Chapter 15. Probability Rules! Copyright 2012, 2008, 2005 Pearson Education, Inc.

Mathematics Challenge 2014

Math 131 notes. Jason Riedy. 6 October, Linear Diophantine equations : Likely delayed 6

4.3 - Primes and Greatest Common Divisors

NUMBER SYSTEMS. Number theory is the study of the integers. We denote the set of integers by Z:

Part 2 - Beginning Algebra Summary

Notes: The Number System (6.NS.1 8)

Summer Math Packet for Students Entering 6th Grade. Please have your student complete this packet and return it to school on Tuesday, September 4.

LP03 Chapter 5. A prime number is a natural number greater that 1 that has only itself and 1 as factors. 2, 3, 5, 7, 11, 13, 17, 19, 23, 29,

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

Chapter 1 A Survey of Divisibility 14

Transcription:

6.1 Number Theory

Number Theory The numbers 1, 2, 3, are called the counting numbers or natural numbers. The study of the properties of counting numbers is called number theory. 2010 Pearson Education, Inc. All rights reserved. Section 6.1, Slide 2

Number Theory The numbers 1, 2, 3, are called the counting numbers or natural numbers. The study of the properties of counting numbers is called number theory. One interesting question is What counting numbers can be written as a product of other numbers, and which cannot? 2010 Pearson Education, Inc. All rights reserved. Section 6.1, Slide 3

If a and b are natural numbers, we say a b to mean a divides b and it means that there is a number q with b = a q We say that 5 divides 30 because there is a natural number 6 such that 5 6 = 30. 5 30 means 5 divides 30

Related statements: If a b - a divides b - a is a divisor of b - a is a factor of b - b is a multiple of a

Examples: a) Does 7 21? b) Does 2 3? c) Does 5 15? d) What numbers divide 6?

You can use a calculator to test divisibility.

A number is factored if it is written as a product of natural numbers. Examples: 22 = 2 x 11 49 = 7 x 7 100 = 4 x 25 or 10 x 10 or...

A number bigger than 1 that only has 1 and itself as factors is called a prime number. Smallest examples: 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37 There are an infinite number of primes.

Largest known prime: 2 57885161-1 Which has 17425170 digits! So proud they made a stamp!

A number which is not prime is called composite. Composite numbers have factors other than 1 and themself.

The Sieve of Eratosthenes is a method for generating a list of prime numbers. Skip 1. Circle 2, cross out multiples of 2. Go to the next number, it is prime, cross out its muliples. Repeat. 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50

If 2 n, then (n/2) n. If 3 n, then (n/3) n. If k n, then (n/k) n. What is the largest number to check to see if n is prime? If k = (n/k), then k 2 = n. So only need to check numbers less than sqrt(n) to see if n is prime.

Prime Numbers Example: Determine whether 83 is prime. Solution: We don t need to check to see if any composites divide 83. Do you see why? Also, we need not check primes greater than 10: None of the primes 2, 3, 5, and 7 divide 83, so 83 is prime. 2010 Pearson Education, Inc. All rights reserved. Section 6.1, Slide 14

Divisibility Tests and Factoring 2010 Pearson Education, Inc. All rights reserved. Section 6.1, Slide 15

Divisibility Tests and Factoring Example: Test the number 11,352 for divisibility by 6. Solution: 11,352 is even, so it is divisible by 2. 1 + 1 + 3 + 5 + 2 = 12, which is divisible by 3, so 11,352 is divisible by 3. Since the number is divisible by both 2 and 3, it is divisible by 6. 2010 Pearson Education, Inc. All rights reserved. Section 6.1, Slide 16

Example: Is 201 a prime number?

Divisibility Tests and Factoring One way to find the prime factorization of a number is to use a factor tree. 2010 Pearson Education, Inc. All rights reserved. Section 6.1, Slide 18

Divisibility Tests and Factoring Example: Factor 4,620. Solution: 4,620 = 2 3 7 11 2 5 = 2 2 3 5 7 11 2010 Pearson Education, Inc. All rights reserved. Section 6.1, Slide 19

Example: Factor 1050

Great Dilemma of our Times: Hot Dog Buns are sold in packs of 8 Hot Dogs are sold in packs of 10 What is the smallest number of hot dogs in buns that can be made with no leftovers?

Examples: 10 is the GCD of 30 and 70 9 is the GCD of 27 and 900 1 is the GCD of 5 and 11

To find the GCD of two numbers: - find the prime factorization of both numbers (with factor trees). - the primes (and their multiples) that they have in common is the GCD. - if they have nothing in common then the GCD is just 1.

Example: The GCD of 1050 and 768 1050 = 2 x 3 x 5 x 5 x 7 768 = 2 x 2 x 2 x 2 x 2 x 2 x 2 x 2 x 3

Example: The GCD of 220 and 273 220 = 2 x 2 x 5 x 11 273 = 3 x 7 x 13

Example: The GCD of 1944 and 26244 1944 = 2 3 x 3 5 26244 = 2 2 x 3 8

Examples: 210 is the LCM of 30 and 70 2700 is the LCM of 27 and 900 55 is the LCM of 5 and 11

Example with 28 and 42 Multiples of 28: 28, 56, 84, 112, 140, 168, 196, 224, 252,... Multiples of 42: 42, 84, 126, 168, 210, 252, 294, Common Multiples: Least Common Multiple:

To find the LCM of two numbers: - find the prime factorization of both numbers (with factor trees). - the product of the bigger multiple of each prime is the LCM.

Example: The LCM of 220 and 1672 220 = 2 x 2 x 5 x 11 1672 = 2 x 2 x 2 x 11 x 19

Example: The LCM of 220 and 273 220 = 2 x 2 x 5 x 11 273 = 3 x 7 x 13

Great Dilemma of our Times: Hot Dog Buns are sold in packs of 8 Hot Dogs are sold in packs of 10 What is the smallest number of hot dogs in buns that can be made with no leftovers?

Greatest Common Divisors and Least Common Multiples 2010 Pearson Education, Inc. All rights reserved. Section 6.1, Slide 33

Alternative method using powers Example: The GCD of 600 and 540 Write 600 = 2 3 3 1 5 2 and 540 = 2 2 3 3 5 1. In forming the GCD, we multiply the 2 2, the 3 1, and 5 1, which were the smallest powers of the primes that divide both numbers. So the GCD is 2 2 3 1 5 1.

Alternative method using powers Example: The LCM of 600 and 540 Write 600 = 2 3 3 1 5 2 and 540 = 2 2 3 3 5 1. Then in forming the LCM, we multiply the 2 3, the 3 3, and 5 2, which were the highest powers of the primes that divide either number. So, the LCM is 2 3 3 3 5 2.

Greatest Common Divisors and Least Common Multiples If we look at what happened in the last two examples carefully, we see the following pattern: Multiplying the s gives the LCM. Multiplying the s gives the GCD. 2010 Pearson Education, Inc. All rights reserved. Section 6.1, Slide 36

Applying the GCD and LCM Example: Assume that bullet trains have just departed from Tokyo to Osaka, Niigata, and Akita. If a train to Osaka departs every 90 minutes, a train to Niigata departs every 120 minutes, and a train to Akita departs every 80 minutes, when will all three trains again depart at the same time? (solution on next slide) 2010 Pearson Education, Inc. All rights reserved. Section 6.1, Slide 37

Applying the GCD and LCM Solution: 2 4 3 2 5 = 720 minutes = 12 hours 2010 Pearson Education, Inc. All rights reserved. Section 6.1, Slide 38