CameraIcon
CameraIcon
SearchIcon
MyQuestionIcon
MyQuestionIcon
1
You visited us 1 times! Enjoying our articles? Unlock Full Access!
Question

Find the HCF of 1260and 7344using Euclid's division algorithm


Open in App
Solution

HCF using Euclid's division algorithm

  1. According, to Euclid’s division algorithm, any positive integer a can be expressed as a=bq+r.
  2. Where q is the quotient,b is the divisor and r is the remainder, 0r<b.

So, HCF will be

7344=1260×5+10441260=1044×1+2161044=216×4+180216=180×1+36180=36×5+0

Hence, the HCF of 1260and 7344using Euclid's division algorithm is 36.


flag
Suggest Corrections
thumbs-up
60
Join BYJU'S Learning Program
similar_icon
Related Videos
thumbnail
lock
Fundamental Theorem of Arithmetic
MATHEMATICS
Watch in App
Join BYJU'S Learning Program
CrossIcon