Euclid's Algorithm
Extension Actions
CRX ID
ckheolienbhjillondampihopnhmmlcc
Status
- Extension status: Featured
Description from extension meta
Generate two random numbers and find their HCF - or GCD.
Image from store
Description from store
This extension helps you get the HCF - Highest Common Factor - or GCD - Greatest Common Divisor - of two random numbers. The app is based on the famous Euclid's Algorithm. You can generate large numbers of random numbers using the app and find their corresponding HCF - or GCD.
It is an ideal mathematical tool for teachers at GCSE, GCE - OL and IGSE levels.