Item logo image for Euclid's Algorithm

Euclid's Algorithm

Featured
ExtensionDeveloper Tools4 users
Item media 1 screenshot

Overview

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.

0 out of 5No ratings

Google doesn't verify reviews. Learn more about results and reviews.

Details

  • Version
    1.0
  • Updated
    August 2, 2023
  • Offered by
    VivaxSolutions
  • Size
    69.81KiB
  • Languages
    English (UK)
  • Developer
    Email
    hemanthaabeywardena@gmail.com
  • Non-trader
    This developer has not identified itself as a trader. For consumers in the European Union, please note that consumer rights do not apply to contracts between you and this developer.

Privacy

The developer has disclosed that it will not collect or use your data.

This developer declares that your data is

  • Not being sold to third parties, outside of the approved use cases
  • Not being used or transferred for purposes that are unrelated to the item's core functionality
  • Not being used or transferred to determine creditworthiness or for lending purposes

Support

For help with questions, suggestions, or problems, please open this page on your desktop browser

Google apps