A school librarian wants to stack 56 Hindi novels and 196 English novels in identical bundles, so she needs . Earlier she used the first gcd algorithm, which finds the divisors of 56 by checking every number from 1 to 56 and then the divisors of 196 by checking every number from 1 to 196. Now she uses the improved algorithm: check each from 1 to and keep if it divides both numbers.
Count one check for each number tested. How many fewer numbers does she check now?
