1 item
Generate two random numbers and find their HCF - or GCD. 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.
Aug 2, 2023
rating_count is the Chrome Web Store ratings count, not a written-review count.
Media assets
Screenshots and videos on the listing.
Has promo video
Whether the listing includes at least one video.
Languages
Declared language locales.
Developer website
Listing exposes a developer website URL.
Contact email
Listing exposes a contact email.
Keyword in name
Case-insensitive substring match in the name.
Keyword in description
Case-insensitive substring match in the description.
Keyword occurrences in description
Count of case-insensitive occurrences in the description.
Category user-count percentile
Share of same-category extensions with fewer users (null if unknown).
These are transparent listing completeness / keyword signals, not a prediction of Chrome Web Store search ranking.