Euclid's Algorithm

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

As of May 2026, Euclid's Algorithm has 6 users in the Developer Tools category.

Usersdown 25.0 percent25.0%
6
6
Ratingno change0%
— reviews
Reviewsno change0%
Version
1.0
Manifest V3

History

2 snapshots

Tracking since Apr 24, 2026.

9.247.55.76Apr 24, 2026May 19, 2026
View as table
DateUsersRatingReviewsVersion
Apr 24, 202681.0
May 19, 202691.0
Now61.0

Permissions & access

Permissions
None declared
Host access
None declared

Screenshots

Euclid's Algorithm screenshot 1

About

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.

Technical

Version
1.0
Manifest
V3
Size
69.81KiB
Min Chrome
88
Languages
1
Featured
Yes

Metadata

ID
ckheolienbhjillondampihopnhmmlcc
Developer ID
u9e9c47c2a650fdc9ae08378ee177f68b
Developer Email
[email protected]
Created
Aug 2, 2023
Last Updated (Store)
Aug 2, 2023
Last Scraped
May 19, 2026
Website
Support URL
Privacy Policy

Similar extensions

Alternatives to Euclid's Algorithm, ranked by description similarity.

Data sourced from the Chrome Web Store · last verified May 19, 2026.