Scribd Logo
Upload

Welcome to Scribd!

  • Euclid

    Uploaded by

    Manish Kumar Singh
    6 views2 pages
    Euclid's division lemma states that for any two positive integers a and b, there exist unique integers q and r such that a = bq + r, where 0 ≤ r < b. This lemma can be used to find the highest common factor (HCF) of two integers. To find the HCF of two integers a and b using Euclid's division lemma, repeatedly apply the lemma to divide the divisor and remainder until the remainder is 0, at which point the divisor is the HCF. For example, to find the HCF of 375 and 135: 375 = 135 × 2 + 105, then 135 = 105 × 1 + 30, then 105 = 30 × 3 + 15, then 30 =

    Original Description:

    Copyright

    © Attribution Non-Commercial (BY-NC)

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    Euclid's division lemma states that for any two positive integers a and b, there exist unique integers q and r such that a = bq + r, where 0 ≤ r < b. This lemma can be used to find the highest common factor (HCF) of two integers. To find the HCF of two integers a and b using Euclid's division lemma, repeatedly apply the lemma to divide the divisor and remainder until the remainder is 0, at which point the divisor is the HCF. For example, to find the HCF of 375 and 135: 375 = 135 × 2 + 105, then 135 = 105 × 1 + 30, then 105 = 30 × 3 + 15, then 30 =

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    6 views2 pages

    Euclid

    Uploaded by

    Manish Kumar Singh
    Euclid's division lemma states that for any two positive integers a and b, there exist unique integers q and r such that a = bq + r, where 0 ≤ r < b. This lemma can be used to find the highest common factor (HCF) of two integers. To find the HCF of two integers a and b using Euclid's division lemma, repeatedly apply the lemma to divide the divisor and remainder until the remainder is 0, at which point the divisor is the HCF. For example, to find the HCF of 375 and 135: 375 = 135 × 2 + 105, then 135 = 105 × 1 + 30, then 105 = 30 × 3 + 15, then 30 =

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 2

    Euclids division lemma, states that for any two positive integers a and b we can find two whole

    numbers q and r such that

    Euclids division lemma can be used to: Find the highest common factor of any two positive integers and to show the common properties of numbers. Finding H.C.F using Euclids division lemma: Suppose, we have two positive integers a and b such that a is greater than b. Apply Euclids division lemmato the given integers a and b to find two whole numbers q and r such that, a is equal to b multiplied by q plus r.

    Check the value of r. If r is equal to zero then b is theHCF of the given numbers. If r is not equal to zero, applyEuclids division lemma to the new divisor b and remainder r. Continue this process till the remainder r becomes zero. The value of the divisor b in that case is the HCF of the two given numbers. Euclids division algorithm can also be used to find some common properties of numbers.

    For two positive integers a and b there exists two different or same unique integers q and r such that a = bq + r where 0 < r < b This looks like as the general process of division. But it has great significance in finding the HCF of two numbers. Application of Euclid's Division Lemma in Finding HCF: Let us find the HCF of 375 and 135. The first step for this is apply Euclid's division Lemma in the given pair of the number: Thus, 375 = 135 x 2 + 105 Now take 135 (the divisor) as one number and 105 (the reminder) as the text number in the pair and apply the division lemma in the pair. 135 = 105 x 1 + 30 Then take 105 (the divisor) as one number and 30 (the reminder) as the next number in the pair and apply division lemma in the pair. 105 = 30 x 3 + 15

    Then take 30 (the divisor) as one number and 15 (the reminder) as the next number in the pair and apply division lemma in the pair. 30 = 15 x 2 + 0 Here you have got 0 as reminder, so stop the process. The divisor which you got in the last step is the HCF i.e. 15 is the HCF of 375 and 135. So forfinding HCF of two numbers the following steps are followed. Step 1 - Apply Euclid's division Lemma to the given pair. Step 2 - If the reminder in step 1 is zero then stop the process and write the divisor as HCF Step 3 - If condition given in step 2 is not satisfied, then apply step 1 once again and repeat the process untill you get 0 as reminder.

    You might also like