MAT 320 Spring 2011 Section 1.2. 320 = 276 ·1 + 44 276 = 44 ·6 + 12 44 = 12 ·3 + 8 12 = 8 ·1 + 4 8 = 4 ·2 + 0 Start by dividing the smaller number into.

Slides:

Advertisements

Similar presentations

Division & Divisibility. 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.

Advertisements

GREATEST COMMON FACTOR

Remainder and Factor Theorems

5.5 Real Zeros of Polynomial Functions

Section 4.1: Primes, Factorization, and the Euclidean Algorithm Practice HW (not to hand in) From Barr Text p. 160 # 6, 7, 8, 11, 12, 13.

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.

Section 5-4 Greatest Common Factor and Least Common Multiple.

Dividing Polynomials.

Chapter 2 Polynomial and Rational Functions Copyright © 2014, 2010, 2007 Pearson Education, Inc Dividing Polynomials: Remainder and Factor Theorems.

Dividing Polynomials Objectives

Division: “Facts and Properties”

Chapter II. THE INTEGERS

Section 5.4 Dividing Polynomials. Review of Long Division What terms do we use to describe 672 and 21? Because the reminder is zero, we know that 21 is.

Section 3.3 Dividing Polynomials; Remainder and Factor Theorems

Fall 2002CMSC Discrete Structures1 Let us get into… Number Theory.

BY MISS FARAH ADIBAH ADNAN IMK

LECTURE 5 Learning Objectives  To apply division algorithm  To apply the Euclidean algorithm.

CSCI 1900 Discrete Structures

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.

Polynomial Division: Dividing one polynomial by another polynomial to find the zeros of the polynomial. Ex 1: Find the zeros of Solution:1 st way: At.

6.1 Using Properties of Exponents What you should learn: Goal1 Goal2 Use properties of exponents to evaluate and simplify expressions involving powers.

Section 1.1: Integer Operations and the Division Algorithm

WIKIPEDIA HAS MANY MORE DIVISIBILITY RULES. EXAMPLE Since 52=13(4) is divisible by 4, is divisible by 4 Since 452=56(8)+4 is not divisible.

The Integers. The Division Algorithms A high-school question: Compute 58/17. We can write 58 as 58 = 3 (17) + 7 This forms illustrates the answer: “3.

3.3: Dividing Polynomials: Remainder and Factor Theorems Long Division of Polynomials 1.Arrange the terms of both the dividend and the divisor in descending.

1 C ollege A lgebra polynomial and Rational Functions (Chapter3) L:16 1 University of Palestine IT-College.

Division and Factors When we divide one polynomial by another, we obtain a quotient and a remainder. If the remainder is 0, then the divisor is a factor.

Section 2.4 Dividing Polynomials; Remainder and Factor Theorems.

Rational Numbers and Fields

MAT 320 Spring 2008 Section 1.2.  Start with two integers for which you want to find the GCD. Apply the division algorithm, dividing the smaller number.

Objective Use long division and synthetic division to divide polynomials.

1.3 Solving Linear Equations

Factors Prime Factors Multiples Common Factors and Highest Common Factor (HCF) Factors and Multiples Common Multiples and Lowest Common Multiple (LCM)

Date: 2.4 Real Zeros of Polynomial Functions

Math 409/409G History of Mathematics Books VII – IX of the Elements Part 1: Divisibility.

The Remainder Theorem A-APR 2 Explain how to solve a polynomial by factoring.

a. b.  To simplify this process, we can use a process called division.  Synthetic division works when dividing a polynomial by.  To get started, make.

The Real Zeros of a Polynomial Function Section 5.2 Also Includes Section R.6 : Synthetic Division 1.

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

Polynomial and Synthetic Division Objective: To solve polynomial equations by long division and synthetic division.

Section 4.3 Polynomial Division; The Remainder and Factor Theorems Copyright ©2013, 2009, 2006, 2001 Pearson Education, Inc.

Holt Algebra Dividing Polynomials Synthetic division is a shorthand method of dividing a polynomial by a linear binomial by using only the coefficients.

Algebra Review. Systems of Equations Review: Substitution Linear Combination 2 Methods to Solve:

Ch04-Number Theory and Cryptography 1. Introduction to Number Theory Number theory is about integers and their properties. We will start with the basic.

Number Theory Lecture 1 Text book: Discrete Mathematics and its Applications, 7 th Edition.

Key Vocabulary: Dividend Divisor Quotient Remainder.

Number Theory. Introduction to Number Theory Number theory is about integers and their properties. We will start with the basic principles of divisibility,

Section 3.3 Dividing Polynomials; Remainder and Factor Theorems

Lecture 4 The Euclidean Algorithm

Dividing Polynomials A review of long division:

5 Solving Polynomial Equations.

Greatest Common Divisor

Greatest Common Divisor

Dividing Polynomials Long Division A little review:

MATH301- DISCRETE MATHEMATICS Copyright © Nahid Sultana Dr. Nahid Sultana Chapter 4: Number Theory and Cryptography.

Aim #3. 3 How do we divide Polynomials

Section 2.4 Dividing Polynomials; Remainder and Factor Theorems

Applied Discrete Mathematics Week 4: Number Theory

Section 3.3 Dividing Polynomials; Remainder and Factor Theorems

Polynomial Division; The Remainder Theorem and Factor Theorem

Remainder and Factor Theorem

Copyright © 2014, 2010, 2007 Pearson Education, Inc.

5.5 Real Zeros of Polynomial Functions

Dividing Polynomials 6-3 Warm Up Lesson Presentation Lesson Quiz

Copyright © 2014, 2010, 2007 Pearson Education, Inc.

Section 3.3 Dividing Polynomials; Remainder and Factor Theorems

Section 2.6 Solve Equations by Multiplying or Dividing

Miniconference on the Mathematics of Computation

Presentation transcript:

MAT 320 Spring 2011 Section 1.2

320 = 276 · = 44 · = 12 · = 8 · = 4 ·2 + 0 Start by dividing the smaller number into the larger number. Write the result in the form a = bq + r. The divisor (b) from the previous step becomes the dividend (a) in the next step. The remainder (r) from the previous step becomes the divisor (b) in the next step. Keep going until you get a remainder of zero. The last non-zero remainder is the greatest common divisor of the original a and b you started with. In this case, (320, 296) = 4.

592 = 346 · = 246 · = 100 · = 46 · = 8 · = 6 · = 2 ·3 + 0 Start by dividing the smaller number into the larger number. Write the result in the form a = bq + r. The divisor (b) from the previous step becomes the dividend (a) in the next step. The remainder (r) from the previous step becomes the divisor (b) in the next step. Keep going until you get a remainder of zero. The last non-zero remainder is the greatest common divisor of the original a and b you started with. In this case, (346, 592) = 2.

1. Find (54, 240).  The GCD is Find (674, 308).  The GCD is 2.

 Given positive integers a and b with d = (a, b), there exist integers U and V such that aU + bV = d.  For example, (324, 148) = 4, and it turns out that 324 · · (-35) = 4.  How do we find the values of U and V?

 We will use the Euclidean algorithm to find the values of U and V.  Use the Euclidean algorithm, and then solve all of the equations (except for the last one) for the remainder. 324 = 148 · = 28 · = 8 · = 4 · = 324 +(-2)· = 28 4 = 8 +(-5)· +(-3)·

 We want to find values of U and V such that 4 = U · V · 324.  In the language of linear algebra, we want to express 4 as a “linear combination” of 148 and 324.  Notice that the last equation we wrote down has 4 as a linear combination of 28 and 8, which is not quite what we want. 4 = 288 +(-3)·

 So what do we do now? Use the previous equation to substitute into your linear combination.  Simplify your equation, but leave the boxed numbers alone! 4 = 28 +(-3)· ( (-5)·) 4 = 16 · (-3)· 4 = 288 +(-3)·

 Now we have  which expresses 4 as a linear combination of 28 and 148. We’re getting closer to what we want.  Continue substituting, at each step using the previous equation 4 = 16 · (-3)·

 We finally have our values of U and V guaranteed by Bézout’s Theorem. 4 4 = 16 · (-35)· 4 = 16 · (-3)· = 16 · ( 324 +(-2)· 148 ) +(-3)·

 Use the Euclidean Algorithm to show that (15, 36) = 3.  Use back-substitution to find integers U and V so that 3 = 15U + 36V.  3 = 15 · · (-2)

 Earlier we found out that (54, 240) = 6.  Bézout’s Theorem tells us that we can write 6 as a linear combination of 54 and 240.  Since 6 divides 54 and 6 divides 240, every linear combination of 54 and 240 is divisible by 6. (WHY?)  Therefore, 6 is the smallest positive integer that can be written as a linear combination of 54 and 240.  In fact, the “span” of 54 and 240 is exactly the set of multiples of 6!