(i) Each Step 3 replaces gcd(m,n) by gcd(n,mmodn).
- 234=90×2+54: remainder 54, giving gcd(90,54).
- 90=54×1+36: remainder 36, giving gcd(54,36).
- 54=36×1+18: remainder 18, giving gcd(36,18).
- 36=18×2+0: remainder 0, giving gcd(18,0).
Step 2 reports 18, so gcd(234,90)=18, after 4 reductions.
(ii) She should buy an 18-litre bucket. The 234 L tank needs 234÷18=13 bucketfuls and the 90 L tank needs 90÷18=5 bucketfuls.
(iii) Euclid's subtraction algorithm:
gcd(234,90)→gcd(90,144)→gcd(144,90)→gcd(90,54)→gcd(54,36)
→gcd(36,18)→gcd(18,18)→gcd(18,0)=18
The Step 3 subtractions are 234−90, 144−90, 90−54, 54−36, 36−18 and 18−18: 6 reductions (plus one reversal by Step 1). Āryabhaṭa's division algorithm needs only 4, so it is quicker: one division by 90 does the work of two subtractions of 90.