Use Euclid’s algorithm to find the HCF of 900 and 270.

To find the highest common factor (HCF) of 900 and 270 using Euclid's algorithm, we'll perform the following steps:

Step 1: Divide the larger number (900) by the smaller number (270) and find the remainder.
900 ÷ 270 = 3 remainder 90

Step 2: Now, divide the previous divisor (270) by the remainder (90) and find the new remainder.
270 ÷ 90 = 3 remainder 0

Step 3: The remainder obtained is 0, which means we have found the HCF. The divisor at this point (90) is the HCF of 900 and 270.

Therefore, the HCF of 900 and 270 is 90.