ユークリッドの互除法
1. Euclidean algorithmIn mathematics, the Euclidean algorithm (also called Euclid's algorithm) is an efficient method for computing the greatest common divisor (GCD) of two integers, also known as the greatest common factor (GCF) or highest common factor (HCF). It is named after the Greek mathematician Euclid, who described it in Books VII and X of his Elements. The earliest surviving description of the Euclidean algorithm is in Euclid's Elements (c.
Read “Euclidean algorithm” on English Wikipedia
Read “ユークリッドの互除法” on Japanese Wikipedia
Read “Euclidean algorithm” on DBpedia
Read “Euclidean algorithm” on English Wikipedia
Read “ユークリッドの互除法” on Japanese Wikipedia
Read “Euclidean algorithm” on DBpedia
Discussions
Log in to talk about this word.