1. **State the problem:** We want to find the least number of coins using 1¢, 5¢, 10¢, and 25¢ coins to make 143 cents (which is $1.43). 2. **Formula and approach:** Use the greedy algorithm for coin change, which works for US coins. Start with the largest coin and use as many as possible, then move to the next smaller coin. 3. **Calculate number of 25¢ coins:** $$\left\lfloor \frac{143}{25} \right\rfloor = 5$$ coins (since 5 × 25 = 125 cents). 4. **Remaining amount:** $$143 - 125 = 18$$ cents. 5. **Calculate number of 10¢ coins:** $$\left\lfloor \frac{18}{10} \right\rfloor = 1$$ coin (10 cents). 6. **Remaining amount:** $$18 - 10 = 8$$ cents. 7. **Calculate number of 5¢ coins:** $$\left\lfloor \frac{8}{5} \right\rfloor = 1$$ coin (5 cents). 8. **Remaining amount:** $$8 - 5 = 3$$ cents. 9. **Calculate number of 1¢ coins:** $$3$$ coins. 10. **Total coins used:** $$5 + 1 + 1 + 3 = 10$$ coins. **Final answer:** The least number of coins to make $1.43 is **10** coins.