Using Euclid's division algorithm, find the H.C.F. of (iii) 867 and 255 - Mathematics

Advertisements
Advertisements

Using Euclid's division algorithm, find the H.C.F. of (iii) 867 and 255

Advertisements

Solution

Given number are 867 and 255

867 = 255 x 3 + 102  (Step-1)

255 = 102 x 2 + 51  (Step-2)

102 = 51 x 2 + 0  (Step-3)

∴ H.C.F. = 51

  Is there an error in this question or solution?
Chapter 1: Real Numbers - Exercise 1.1 [Page 7]

APPEARS IN

NCERT Mathematics Class 10
Chapter 1 Real Numbers
Exercise 1.1 | Q 1.3 | Page 7

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.


Using Euclid’s algorithm, find the HCF of  504 and 1188 .


Show that every positive integer is either even or odd?


Find the largest number which divides 320 and 457 leaving remainders 5 and 7 respectively.


Without actual division, show that each of the following rational numbers is a terminating decimal. Express each in decimal form.

(i) `19/3125`


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

(i) `11/(2^3× 3)`


Express each of the following as a rational number in its simplest form: 

(i`) 0.bar (8)` 


Express each of the following as a rational number in its simplest form: 

(i) `2. bar (24)`


Which of the following rational numbers have terminating decimal?


If the sum of LCM and HCF of two numbers is 1260 and their LCM is 900 more than their HCF, then the product of two numbers 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


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


If d is the Highest Common Factor of 32 and 60, find x and y satisfying d = 32x + 60y


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


Prove that two consecutive positive integers are always co-prime


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


Share
Notifications



      Forgot password?
Use app×