Created by Andrey Ivashov in the scope of SMath project. Published by Andrey Ivashov.

# Euclidean algorithm (calculating the GCD)

Efficient method for computing the greatest common divisor (GCD), also known as the greatest common factor (GCF) or highest common factor (HCF). The algorithm is also called Euclid's algorithm. User fills in two numbers to find out the GCD. This is a simple Numeric example, that uses While Loop inside. sm Euclidean algorithm (calculating the GCD) (8.81 KB)Downloads: 571 of 571
{"ft_lang_label":"__label__en","ft_lang_prob":0.8791893,"math_prob":0.7081235,"size":652,"snap":"2022-27-2022-33","text_gpt3_token_len":152,"char_repetition_ratio":0.095679015,"word_repetition_ratio":0.0,"special_character_ratio":0.22546013,"punctuation_ratio":0.096491225,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9791641,"pos_list":[0,1,2],"im_url_duplicate_count":[null,null,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2022-07-03T23:08:18Z\",\"WARC-Record-ID\":\"<urn:uuid:24993f39-358e-461b-907e-a2c963fc54c2>\",\"Content-Length\":\"5752\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:5c010219-fca5-43b6-a860-95d16d6b808c>\",\"WARC-Concurrent-To\":\"<urn:uuid:b08a6190-6230-4fda-930d-ab4dbb7fb13c>\",\"WARC-IP-Address\":\"93.191.60.124\",\"WARC-Target-URI\":\"https://en.smath.com/view/9dfdb119-8a54-4059-a209-9dfdfe5c657a/summary\",\"WARC-Payload-Digest\":\"sha1:S27UUZ6FJKE5PSVNVWPIK2UJ27SIAQ7K\",\"WARC-Block-Digest\":\"sha1:2GEOENK264IU2QO3T7F6IN2NXE67EVIC\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2022/CC-MAIN-2022-27/CC-MAIN-2022-27_segments_1656104277498.71_warc_CC-MAIN-20220703225409-20220704015409-00264.warc.gz\"}"}