What is the HCF of 1095 and 1168?

To find the Highest Common Factor (H.C.F.) of 1095 and 1168, the most efficient method is Euclid's Division Algorithm, which involves repeated division until the remainder becomes zero.

Step-by-Step Calculation (Euclid's Division Algorithm)

1. Divide the larger number by the smaller number:

• Divide 1168 by 1095.

• 1168 = (1095 × 1) + 73

• Here, the remainder is 73.

2. Divide the previous divisor by the remainder:

• Now, divide the previous divisor (1095) by the new remainder (73).

• 1095 ÷ 73 = 15 exactly.

• 1095 = (73 × 15) + 0

3. Determine the H.C.F.:

• When the remainder becomes zero, the divisor at that stage is the H.C.F.

• Since the remainder is 0 when 73 is the divisor, the H.C.F. is 73.