This document provides instructions for an activity to find the highest common factor (HCF) of two numbers experimentally based on Euclid's division lemma. The activity involves cutting strips of cardboard of different lengths to represent numbers, covering them in different colored paper, and arranging them according to the divisions in Euclid's lemma to visually demonstrate the HCF. Figures are provided to show how the strips should be arranged. The HCF is found to be the length of the final remaining strip. Observations of actual measurements are to be recorded to determine the HCF of the original two numbers.