2587392 mod 157656 = 64896, reducing to gcd(157656, 64896). Then 157656 mod 64896 = 27864, 64896 mod 27864 = 9168, 27864 mod 9168 = 360, 9168 mod 360 = 168, 360 mod 168 = 24 and 168 mod 24 = 0, giving GCD 24.
Class 9 Ganita Manjari Part 2 chapter 11 question answer
Class 9 Ganita Manjari Part 2 chapter 11 The World of Algorithms solutions
Successive divisions give:
2587392 = 16 × 157656 + 64896 ⇒ gcd(157656, 64896);
157656 = 2 × 64896 + 27864 ⇒ gcd(64896, 27864);
64896 = 2 × 27864 + 9168 ⇒ gcd(27864, 9168);
27864 = 3 × 9168 + 360 ⇒ gcd(9168, 360);
9168 = 25 × 360 + 168 ⇒ gcd(360, 168);
360 = 2 × 168 + 24 ⇒ gcd(168, 24);
168 = 7 × 24 + 0 ⇒ gcd(24, 0).
Thus, the GCD is 24.
For more NCERT Solutions of Class 9 Maths Ganita Manjari Part 2 Chapter 11 The World of Algorithms Question Answer (2026-27)
https://www.tiwariacademy.com/ncert-solutions/class-9/maths/ganita-manjari-chapter-11/