Ethan Acott

Euclid’s Algorithm (EA) is a simple process by which you can find out the greatest common factor (GCF) of two numbers by repeatedly subtracting the smaller number from the bigger one. Euclid proved and used it in his series of textbooks, called the ‘Elements’. On my first practicum, I was distraught to find that when I was teaching factorisation by common factor to my year 10s, many of them couldn’t remember their times tables. I couldn’t find any method of getting them to find the GCF between