A carpenter in Saharanpur has two wooden rods, 188 cm and 24 cm long. He wants to cut both into pieces of the same length, as long as possible, with no wood wasted.

(i) Use Āryabhaṭa's division algorithm (reduce to ) on , writing each remainder.
(ii) Count each use of the reduction step as one reduction. How many reductions does it need? Euclid's subtraction algorithm needs 13 reductions here. Explain why subtraction is so slow for these numbers.
(iii) What is the length of each piece, and how many pieces are there in all?
