Tamil Nadu Board of Secondary EducationSSLC (English Medium) Class 10th
Advertisement Remove all ads

Use Euclid’s Division Algorithm to find the Highest Common Factor (H.C.F) of 867 and 255 - Mathematics

Advertisement Remove all ads
Advertisement Remove all ads
Sum

Use Euclid’s Division Algorithm to find the Highest Common Factor (H.C.F) of 867 and 255

Advertisement Remove all ads

Solution

To find the H.C.F. of 867 and 255, Using Euclid’s division algorithm.

867 = 255 × 3 + 102

The remainder 102 ≠ 0.

Again using Euclid’s division algorithm

255 = 102 × 2 + 51

The remainder 51 ≠ 0.

Again using Euclid’s division algorithm

102 = 51 × 2 + 0

The remainder is zero.

Therefore = 51

Therefore the H.C.F. of 867 and 255 is 51.

Concept: Euclid’s Division Algorithm
  Is there an error in this question or solution?
Advertisement Remove all ads

APPEARS IN

Tamil Nadu Board Samacheer Kalvi Class 10th SSLC Mathematics Answers Guide
Chapter 2 Numbers and Sequences
Exercise 2.1 | Q 6. (ii) | Page 43
Advertisement Remove all ads
Share
Notifications

View all notifications


      Forgot password?
View in app×