#### Thank you for registering.

One of our academic counsellors will contact you within 1 working day.

Click to Chat

1800-5470-145

+91 7353221155

CART 0

• 0
MY CART (5)

Use Coupon: CART20 and get 20% off on all online Study Material

ITEM
DETAILS
MRP
DISCOUNT
FINAL PRICE
Total Price: Rs.

There are no items in this cart.
Continue Shopping

# Use Euclid’s algorithm to find the HCF of 4052 and 12576.

Latika Leekha
askIITians Faculty 165 Points
7 years ago
Euclid’s Algorithm is a method of finding the G.C.D of two positive integers.
The algorithm states that the G.C.D of two positive integers is the largest integer that divides both of them without leaving a remainder.
Hence, using the algorithm we have,
12576 = 4052 . 3 + 420
We shall proceed this way until we obtain the remainder as zero.
4052 = 420.9 + 272
420 = 272.1 + 148
272 =148.1 + 124
124 = 4.6 + 0
Hence we have obtained the remainder as zero.
This shows that the H.C.F of 4052 and 12576 is 4.
Thanks & Regards
Latika Leekha
Rishi Sharma
askIITians Faculty 646 Points
one year ago
Dear Student,
Please find below the solution to your problem.

Euclid’s Algorithm is a method of finding the G.C.D of two positive integers.
The algorithm states that the G.C.D of two positive integers is the largest integer that divides both of them without leaving a remainder.
Hence, using the algorithm we have,
12576 = 4052 . 3 + 420
We shall proceed this way until we obtain the remainder as zero.
4052 = 420.9 + 272
420 = 272.1 + 148
272 =148.1 + 124
124 = 4.6 + 0
Hence we have obtained the remainder as zero.
This shows that the H.C.F of 4052 and 12576 is 4.

Thanks and Regards