A sweet-shop owner has 84 laddoos and 108 jalebis. She wants trays that each hold the same number of sweets, laddoo trays and jalebi trays of the same size, with nothing left over. Instead of two separate scans, she uses the improved method that builds both lists of divisors together: one scan of , adding to the first list if it divides 84 and to the second list if it divides 108.
Counting one check for each value of in the scan, how many values of does this single scan check?
