A coding club must share 217 badges and 155 stickers equally among the largest possible number of members, so it needs . The members compare how much work five methods take. Count one check for each number tested, and one reduction for each use of Step 3 of Euclid's algorithm.

(i) Find the number of checks for methods 1, 2 and 3.
(ii) Method 4 checks downwards and stops at the first dividing both numbers, counting that . At which does it stop, and how many checks does it make?
(iii) Find the number of reductions for method 5. Rank the five methods from least to most work.
