Developer Tools
Cooling signalUnknownLow-risk permissions
Euclid's Algorithm icon

Euclid's Algorithm

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

Users5Current public install base
Rating--Store average score
Reviews0Public review volume
Manifest versionV3Extension platform version
7-day growth-1Net users gained this week
7-day growth rate-16.7%Relative weekly velocity
Preview

Euclid's Algorithm Media preview

2 assets
Trend

30-day user trend

Review user movement over the last 30 days.

User Growth Over Time

556662026年6月22日2026年6月25日2026年6月28日Latest: 5
Rating trend

30-day rating change

Track rating movement over time to see whether quality signals remain stable.

Not enough rating snapshots yet. More data will appear as new snapshots are collected.
Growth overview

Daily, weekly, and monthly growth

Compare 1-day, 7-day, and 30-day net growth and growth rate.

1-day growthFlat
00%
7-day growthDeclining
-1-16.7%
30-day growthDeclining
-3-37.5%
Technical snapshot

Version, languages, and crawl freshness

Review publication date, version, supported languages, and crawl timestamps.

Version1.0
ManifestV3
Size69.81KiB
Languages1English (United Kingdom)
Published
Store updated
Last crawled
English (United Kingdom)
Overview

Product summary

Review the store description, core capabilities, and common use cases.

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.

Reviews

Recent review snapshot

Inspect the latest comments and rating distribution.

5★
0
4★
0
3★
0
2★
0
1★
0
Related products

Similar and related extensions

Review related products from the Chrome Web Store detail page.