Generate two random numbers and find their HCF - or GCD.
The Chrome Web Store rounds user counts down to the leading digit, so the user line moves in steps. The ratings count is exact and is the better signal of real adoption.
About Euclid's Algorithm
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.
Growth
| Window | Users | Change | Ratings | Rating |
| 7 days | −2 | −13.3% | 0 | 0.00 |
| 30 days | −1 | −7.1% | 0 | 0.00 |
| 6 months | +4 | +44.4% | 0 | 0.00 |
| 1 year | +7 | +116.7% | 0 | 0.00 |
Chrome Web Store search rankings
Where Euclid's Algorithm appears when people search the store, with the 30 day change
| Search phrase | Position | 30 days |
| algorithm | #6 | 0 |
Version history
1 versions recorded