Scribd Logo
Upload

Welcome to Scribd!

  • 51 views

    Theorem 1.1: (Euclid's Division Lemma)

    Uploaded by

    niranjan bhagat
    This document explains Euclid's algorithm for finding the highest common factor (HCF) of two integers. It provides the steps of the algorithm, which repeatedly uses the division lemma to divide the larger number by the smaller number until getting a remainder of zero. This zero remainder indicates the last divisor is the HCF. Examples are given to find the HCF of various integer pairs and to represent even, odd, and other types of positive integers in terms of multiples and remainders.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd

    Theorem 1.1: (Euclid's Division Lemma)

    Uploaded by

    niranjan bhagat
    51 views1 page
    This document explains Euclid's algorithm for finding the highest common factor (HCF) of two integers. It provides the steps of the algorithm, which repeatedly uses the division lemma to divide the larger number by the smaller number until getting a remainder of zero. This zero remainder indicates the last divisor is the HCF. Examples are given to find the HCF of various integer pairs and to represent even, odd, and other types of positive integers in terms of multiples and remainders.

    Original Description:

    Theorem 1

    Original Title

    Theorem 1

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This document explains Euclid's algorithm for finding the highest common factor (HCF) of two integers. It provides the steps of the algorithm, which repeatedly uses the division lemma to divide the larger number by the smaller number until getting a remainder of zero. This zero remainder indicates the last divisor is the HCF. Examples are given to find the HCF of various integer pairs and to represent even, odd, and other types of positive integers in terms of multiples and remainders.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Download as docx, pdf, or txt
    51 views1 page

    Theorem 1.1: (Euclid's Division Lemma)

    Uploaded by

    niranjan bhagat
    This document explains Euclid's algorithm for finding the highest common factor (HCF) of two integers. It provides the steps of the algorithm, which repeatedly uses the division lemma to divide the larger number by the smaller number until getting a remainder of zero. This zero remainder indicates the last divisor is the HCF. Examples are given to find the HCF of various integer pairs and to represent even, odd, and other types of positive integers in terms of multiples and remainders.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Download as docx, pdf, or txt
    of 1

    Theorem 1.

    1 (Euclid’s Division Lemma) : Notice that 4 = HCF (24, 4) = HCF (124, 24) =
    Given positive integers a and b, HCF (148, 124) =
    there exist unique integers q and r satisfying a HCF (272, 148) = HCF (420, 272) = HCF
    = bq + r, 0 r < b. (4052, 420) = HCF (12576, 4052).

    Euclid’s division algorithm is a technique to Example 2 : Show that every positive even
    compute the Highest Common Factor integer is of the form 2q, and that every
    (HCF) of two given positive integers. positive odd integer is of the form 2q + 1,
    where q is some integer.
    To obtain the HCF of two positive integers, Solution : Let a be any positive integer and b
    say c and d, with c > d, follow = 2. Then, by Euclid’s algorithm,
    the steps below: a = 2q + r, for some integer q 0, and r = 0 or
    Step 1 : Apply Euclid’s division lemma, to c r = 1, because 0 r < 2. So,
    and d. So, we find whole numbers, q and a = 2q or 2q + 1.
    r such that c = dq + r, 0 ≤r < d. If a is of the form 2q, then a is an even integer.
    Step 2 : If r = 0, d is the HCF of c and d. If r Also, a positive integer can be
    ≠0, apply the division lemma to d and r. either even or odd. Therefore, any positive odd
    Step 3 : Continue the process till the integer is of the form 2q + 1.
    remainder is zero. The divisor at this stage will Example 3 : Show that any positive odd
    be the required HCF. integer is of the form 4q + 1 or 4q + 3, where
    Example 1 : Use Euclid’s algorithm to find q is some integer.
    the HCF of 4052 and 12576. Solution : Let us start with taking a, where a
    Solution : is a positive odd integer. We apply the
    Step 1 : Since 12576 > 4052, we apply the division algorithm with a and b = 4.
    division lemma to 12576 and 4052, to get Since 0 r < 4, the possible remainders are 0,
    12576 = 4052 × 3 + 420 1, 2 and 3.
    Step 2 : Since the remainder 420 0, we apply That is, a can be 4q, or 4q + 1, or 4q + 2, or 4q
    the division lemma to 4052 and 420, to + 3, where q is the quotient.
    get However, since a is odd, a cannot be 4q or 4q
    4052 = 420 × 9 + 272 + 2 (since they are both divisible by 2).
    Step 3 : We consider the new divisor 420 and Therefore, any odd integer is of the form 4q +
    the new remainder 272, and apply the 1 or 4q + 3.
    division lemma to get
    420 = 272 × 1 + 148
    We consider the new divisor 272 and the new
    remainder 148, and apply the division
    lemma to get
    272 = 148 × 1 + 124
    We consider the new divisor 148 and the new
    remainder 124, and apply the division
    lemma to get
    148 = 124 × 1 + 24
    We consider the new divisor 124 and the new
    remainder 24, and apply the division
    lemma to get
    124 = 24 × 5 + 4
    We consider the new divisor 24 and the new
    remainder 4, and apply the division
    lemma to get
    24 = 4 × 6 + 0
    The remainder has now become zero, so our
    procedure stops. Since the divisor at this
    stage is 4, the HCF of 12576 and 4052 is 4.

    You might also like