Bunuel
Mike the mechanic has a machine which has four cog wheels in connection. The largest wheel has 242 teeth and the others have 66, 48 and 26, respectively. How many rotations must the largest wheel make before each of the wheels is back in its starting position?
A. 660
B. 512
C. 484
D. 312
E. None of these
I came up with the following approach:
With what number do I have to multiply 242 in order to evenly divide it by all other given number of teeth?
The least common multiplier (LCM) is the value we are looking for.
We use factorization to do so:
242 = (2*11*11)
66 = (2*3*11)
48 = (2*2*2*2*3)
26 = (2*13)
Multiply each factor the greatest number of times it occurs in either number. If the same factor occurs more than once in both numbers, you multiply the factor the greatest number of times it occurs. This gives you the LCM.
LCM = (2*2*2*2*3*11*11*13)
Divide by 242 = (2*11*11)
Leaves you with (2*2*2*3*13) = 312
IMO: D