Euclid's Algorithm icon

Euclid's Algorithm

by VivaxSolutions · Developer Tools
FeaturedManifest V3 Free
View in Chrome Web Store Data as of 17 Oct 2026

Generate two random numbers and find their HCF - or GCD.

Users
13
−1 in 30 days
Rating
0.0 / 5
unchanged in 30 days
Ratings
0
0 in 30 days
Store rank
#177K
#148K among extensions
Version
1.0
updated 2 Aug 2023

Users

monthly, 3 years
0714Aug 2023Apr 2025Oct 2026
Latest, 17 Oct 2026: 13 usersMove the mouse over the chart for any month

Ratings count

monthly, 3 years
001Aug 2023Apr 2025Oct 2026
Latest, 17 Oct 2026: 0 ratingsMove the mouse over the chart for any month

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

WindowUsersChangeRatingsRating
7 days−2−13.3%00.00
30 days−1−7.1%00.00
6 months+4+44.4%00.00
1 year+7+116.7%00.00

Chrome Web Store search rankings

Where Euclid's Algorithm appears when people search the store, with the 30 day change
Search phrasePosition30 days
algorithm#60

Version history

1 versions recorded
1.02 Aug 2023

Details

Category
Developer Tools
First seen
2 Aug 2023
Size
70 KB
Languages
en-GB
Pricing
Free
Extension ID
ckheolienbhjillondampihopnhmmlcc

Permissions and risk

Minimal riskimpact 0, likelihood 0

Alternatives to Euclid's Algorithm

Extensions that rank for the same store searches or share the Developer Tools category, ordered by users