Using Euclid’s division algorithm, first the largest number that divides 1251, 9377 and 15628 leaving remainders 1, 2 and 3, respectively. 2) and (3 9377 and 15628 leaving remainders 1 first the largest number that divides 1251 respectively Using Euclid’s division algorithm November 22, 2020 Category: Chapter 1 - Real Numbers , Maths , NCERT Class 10 , Facebook Messenger WhatsApp Share this:TwitterFacebook Related