Euclid's Algorithm is one of the oldest algorithms known to mankind. It was found in Euclid's Elements, something dates back to 300 B.C.

When Euclid came up with the algorithm, mathematics was not known as it is today; in fact, he used geometrical methods in his discovery, as algebra was not known at that time, as a branch of mathematics.

Euclid's algorithm is used to find the HCF - Highest Common Factor - or GCD - Greatest Common Divider - of two numbers.

The following animation shows how it determines the HCF of two numbers:

Please work out the following questions to complement what you have just learnt.

This is a vast collection of tutorials, covering the syllabuses of GCSE, iGCSE, A-level and even at undergraduate level. They are organized according to these specific levels. The major categories are for core mathematics, statistics, mechanics and trigonometry. Under each category, the tutorials are grouped according to the academic level. This is also an opportunity to pay tribute to the intellectual giants like Newton, Pythagoras and Leibniz, who came up with lots of concepts in maths that we take for granted today - by using them to serve mankind.

"There's no such thing as a free lunch."

The best things in nature are free with no strings attached - fresh air, breathtakingly warm sunshine, scene of meadow on the horizon...

Vivax Solutions, while mimicking nature, offers a huge set of tutorials along with interactive tools for free.

Please use them and excel in the sphere of science education.

Everything is free; not even registration is required.

Maths is challenging; so is finding the right book. K A Stroud, in this book, cleverly managed to make all the major topics crystal clear with plenty of examples; popularity of the book speak for itself - 7^{th} edition in print.