About this Simulation

This interactive simulation allows learners to explore the greatest common divisor (GCD) of two integers through dynamic visualisation. Students can adjust input values, observe how the GCD is calculated, and understand the relationships between divisors and common factors in real-time.

Learning objectives: Understand what the greatest common divisor represents and how to find it | Apply the Euclidean algorithm to compute GCD of any two integers | Recognise patterns in divisibility and common factors through interactive exploration