Use Euclid'S Division Algorithm to Find the Hcf of 255 and 867. - Mathematics

Advertisements
Advertisements
Sum

Use Euclid's division algorithm to find the HCF of 255 and 867.

Advertisements

Solution

The given numbers are 255 and 867. 
Now 867 > 255. So, on applying Euclid's algorithm we get
867=255×3+102">867 = 255 × 3 + 102
Now the remainder is not 0 so, we repeat the process again on 255 and 102
255=102×2+51">255 = 102 × 2 + 51
The algorithm is applied again but this time on the numbers 102 and 51
102=51×2+0">102 = 51 × 2 + 0
Thus, the HCF obtained is 51.

  Is there an error in this question or solution?
2018-2019 (March) 30/4/3

Video TutorialsVIEW ALL [1]

RELATED QUESTIONS

 Show that any positive odd integer is of the form 4q + 1 or 4q + 3, where q is some integer.


Prove that the square of any positive integer is of the form 3m or, 3m + 1 but not of the form 3m +2.


Define HOE of two positive integers and find the HCF of the following pair of numbers:

240 and 6552


Using prime factorization, find the HCF and LCM of  21, 28, 36, 45 .


The HCF of two numbers is 145 and their LCM is 2175. If one of the numbers is 725, find
the other.


Without actual division show that each of the following rational numbers is a non-terminating repeating decimal. 

(i) `32/147`


If a and b are relatively prime then what is their HCF?


The remainder when the square of any prime number greater than 3 is divided by 6, is


Find all positive integers, when divided by 3 leaves remainder 2


Prove that the product of two consecutive positive integers is divisible by 2


When the positive integers a, b and c are divided by 13, the respective remainders are 9, 7 and 10. Show that a + b + c is divisible by 13


Prove that square of any integer leaves the remainder either 0 or 1 when divided by 4


A positive integer, when divided by 88, gives the remainder 61. What will be the remainder when the same number is divided by 11?


Euclid’s division lemma states that for positive integers a and b, there exist unique integers q and r such that a = bq + r, where r must satisfy


Using Euclid’s division lemma, if the cube of any positive integer is divided by 9 then the possible remainders are


Prove that n2 – n divisible by 2 for every positive integer n


When the positive integers a, b and c are divided by 13 the respective remainders is 9, 7 and 10. Find the remainder when a b + + 2 3c is divided by 13


Show that 107 is of the form  4q +3 for any integer q


HCF of 8, 9, 25 is ______.


Show that the cube of a positive integer of the form 6q + r, q is an integer and r = 0, 1, 2, 3, 4, 5 is also of the form 6m + r.


Share
Notifications



      Forgot password?
Use app×