1. **State the problem:** Find the Highest Common Factor (HCF) of 12 and 18 using the division method. 2. **Explain the division method:** The division method (also known as the Euclidean algorithm) involves dividing the larger number by the smaller number and then dividing the divisor by the remainder repeatedly until the remainder is zero. The last non-zero remainder is the HCF. 3. **Step 1:** Divide 18 by 12. $$18 \div 12 = 1 \text{ remainder } 6$$ 4. **Step 2:** Now divide 12 by the remainder 6. $$12 \div 6 = 2 \text{ remainder } 0$$ 5. **Step 3:** Since the remainder is now zero, the divisor at this step, 6, is the HCF. **Final answer:** The HCF of 12 and 18 is $6$.