5 1 Number Theory Prime Composite Numbers 2010
5. 1 Number Theory: Prime & Composite Numbers © 2010 Pearson Prentice Hall. All rights reserved. 1
Objectives 1. Determine divisibility. 2. Write the prime factorization of a composite number. 3. Find the greatest common divisor of two numbers. 4. Solve problems using the greatest common divisor. 5. Find the least common multiple of two numbers. 6. Solve problems using the least common multiple. © 2010 Pearson Prentice Hall. All rights reserved. 2
Number Theory and Divisibility • Number theory is primarily concerned with the properties of numbers used for counting, namely 1, 2, 3, 4, 5, and so on. • The set of natural numbers is given by • Natural numbers that are multiplied together are called the factors of the resulting product. © 2010 Pearson Prentice Hall. All rights reserved. 3
Divisibility • If a and b are natural numbers, a is divisible by b if the operation of dividing a by b leaves a remainder of 0. • This is the same as saying that b is a divisor of a, or b divides a. • This is symbolized by writing b|a. Example: We write 12|24 because 12 divides 24 or 24 divided by 12 leaves a remainder of 0. Thus, 24 is divisible by 12. Example: If we write 13|24, this means 13 divides 24 or 24 divided by 13 leaves a remainder of 0. But this is not true, thus, 13|24. © 2010 Pearson Prentice Hall. All rights reserved. 4
Prime Factorization • A prime number is a natural number greater than 1 that has only itself and 1 as factors. • A composite number is a natural number greater than 1 that is divisible by a number other than itself and 1. • The Fundamental Theorem of Arithmetic Every composite number can be expressed as a product of prime numbers in one and only one way. • One method used to find the prime factorization of a composite number is called a factor tree. © 2010 Pearson Prentice Hall. All rights reserved. 5
Example 2: Prime Factorization using a Factor Tree Example: Find the prime factorization of 700. © 2010 Pearson Prentice Hall. All rights reserved. 6
Greatest Common Divisor 1. 2. 3. • To find the greatest common divisor of two or more numbers, Write the prime factorization of each number. Select each prime factor with the smallest exponent that is common to each of the prime factorizations. Form the product of the numbers from step 2. The greatest common divisor is the product of these factors. Pairs of numbers that have 1 as their greatest common divisor are called relatively prime. For example, the greatest common divisor of 5 and 26 is 1. Thus, 5 and 26 are relatively prime. © 2010 Pearson Prentice Hall. All rights reserved. 7
Example 3: Finding the Greatest Common Divisor Example: Find the greatest common divisor of 216 and 234. © 2010 Pearson Prentice Hall. All rights reserved. 8
Least Common Multiple • The least common multiple of two or more natural numbers is the smallest natural number that is divisible by all of the numbers. To find the least common multiple using prime factorization of two or more numbers: 1. Write the prime factorization of each number. 2. Select every prime factor that occurs, raised to the greatest power to which it occurs, in these factorizations. 3. Form the product of the numbers from step 2. The least common multiple is the product of these factors. © 2010 Pearson Prentice Hall. All rights reserved. 9
Example 5: Finding the Least Common Multiple Example: Find the least common multiple of 144 and 300. © 2010 Pearson Prentice Hall. All rights reserved. 10
Example 6: Solving a Problem Using the Least Common Multiple A movie theater runs its films continuously. One movie runs for 80 minutes and a second runs for 120 minutes. Both movies begin at 4: 00 P. M. When will the movies begin again at the same time? © 2010 Pearson Prentice Hall. All rights reserved. 11
The Integers; Order of Operations 5. 2 © 2010 Pearson Prentice Hall. All rights reserved. 12
1. 2. 3. 4. 5. 6. Objectives Define the integers. Graph integers on a number line. Use symbols < and >. Find the absolute value of an integer. Perform operations with integers. Use the order of operations agreement. © 2010 Pearson Prentice Hall. All rights reserved. 13
Define the Integers • The set consisting of the natural numbers, 0, and the negatives of the natural numbers is called the set of integers. Notice the term positive integers is another name for the natural numbers. The positive integers can be written in two ways: 1. Use a “+” sign. For example, +4 is “positive four”. 2. Do not write any sign. For example, 4 is also “positive four”. © 2010 Pearson Prentice Hall. All rights reserved. 14
Example 2: Using the Symbols < and > Insert either < or > in the shaded area between the integers to make each statement true: a. 4 3 b. 1 5 c. 5 2 d. 0 3 © 2010 Pearson Prentice Hall. All rights reserved. 15
Absolute Value • The absolute value of an integer a, denoted by |a|, is the distance from 0 to a on the number line. • Because absolute value describes a distance, it is never negative. Example: Find the absolute value: a. | 3| b. |5| c. |0| Solution: © 2010 Pearson Prentice Hall. All rights reserved. 16
Additive Inverses • Additive inverses have the same absolute value, but lie on opposite sides of zero on the number line. • When we additive inverses, the sum is equal to zero. For example: 1. 18 + ( 18) = 0 2. ( 7) + 7 = 0 In general, the sum of any integer and its additive inverse is 0: a + ( a) = 0 © 2010 Pearson Prentice Hall. All rights reserved. 17
Example 6: Evaluating Exponential Notation Evaluate: a. ( 6)2 Solution: b. 62 © 2010 Pearson Prentice Hall. All rights reserved. c. ( 5)3 d. ( 2)4 18
Order of Operations 1. Perform all operations within grouping symbols. 2. Evaluate all exponential expressions. 3. Do all the multiplications and divisions in the order in which they occur, working from left to right. 4. Finally, do all additions and subtractions in the order in which they occur, working from left to right. © 2010 Pearson Prentice Hall. All rights reserved. 19
Example 7: Using the Order of Operations Simplify 62 – 24 ÷ 22 · 3 + 1. © 2010 Pearson Prentice Hall. All rights reserved. 20
© 2010 Pearson Prentice Hall. All rights reserved.
© 2010 Pearson Prentice Hall. All rights reserved.
- Slides: 22