I have many tiny cups which will hold 3 marbles each. Ram has 512 marbles and Shyam has 675 marbles. Who can put all his marbles into the cups such that all the cups he uses are full and none of his marbles are left out?
Among 675 and 512, 675 is divisible by 3. Hence all the 675 marbles can be placed in cups in groups of 3 such that none get left out.