In a clock workshop, two gear wheels mesh with each other. One has 84 teeth and the other has 90 teeth. One tooth on each wheel is marked, and the two marked teeth touch at the start. Each time one tooth passes the meeting point, the other wheel also moves on by one tooth.

(i) The marks meet again when the number of teeth passed is a multiple of both 84 and 90. Scanning the multiples of 90 in order (90, 180, 270, …), and counting the multiple at which you stop, how many multiples do you check before reaching the first one that 84 divides?
(ii) Get the same number using .
(iii) How many full turns does each wheel make before the marks meet again?
