Three bells in a Mumbai temple toll at intervals, and a student wants the greatest common spacing. He instead applies Euclid's algorithm to 510 and 92.
What is HCF(510, 92)?

Question

Three bells in a Mumbai temple toll at intervals, and a student wants the greatest common spacing. He instead applies Euclid's algorithm to 510 and 92. What is HCF(510, 92)?

Accepted Answer

2. 510 = 92 x 5 + 50; 92 = 50 x 1 + 42; 50 = 42 x 1 + 8; 42 = 8 x 5 + 2; 8 = 2 x 4 + 0. HCF = 2.

Three bells in a Mumbai temple toll at intervals, and a student wants the greatest common spacing. He instead applies Euclid's algorithm to 510 and 92.
What is HCF(510, 92)?

Step-by-Step Solution

Master this chapter in 30 minutes a day.

More Class 10 Euclid's Division Lemma practice

Three bells in a Mumbai temple toll at intervals, and a student wants the greatest common spacing. He instead applies Euclid's algorithm to 510 and 92.What is HCF(510, 92)?

Step-by-Step Solution

Master this chapter in 30 minutes a day.

More Class 10 Euclid's Division Lemma practice

Three bells in a Mumbai temple toll at intervals, and a student wants the greatest common spacing. He instead applies Euclid's algorithm to 510 and 92.
What is HCF(510, 92)?