A school has two halls, one with 90 chairs and one with 114 chairs. The manager wants to arrange the chairs in rows so that every row in both halls has the same number of chairs, with more than one chair in a row and no chair left over.
(i) Use the first algorithm for gcd to write the list of common divisors of 90 and 114.
(ii) How many different row lengths can the manager use?
(iii) What is the longest possible row, and how many rows will each hall have?
