the greatest number which on dividing 1657 and 2037 leaves remainders 10 and 7 respectively , is :
"explanation : required number = h . c . f . of ( 1657 - 10 ) and ( 2037 - 7 ) = h . c . f . of 1647 and 2030 = 1 . answer : b"
gcd(subtract(2037, 7), subtract(1657, 10))