LATENT REFERENCES / TAG2
Euclidean Algorithm
Original title: ユークリッド互除法
This reference note belongs to Tag2 in Latent References, an archive curated by Keigo Yoshida. Its archive region is Analysis. The note preserves its source text and links so that readers can trace the material behind the 3D map.
- Collection
- Tag2
- Archive region
- Analysis
Archived reference note
English translation of the archived note. JP shows the original text. Source links and literal code are retained; the translation does not update or independently verify the source claims.
The Euclidean algorithm is a method for finding the greatest common divisor of 2 natural numbers. For 2 natural numbers a and b, if r is the remainder of a divided by b, the greatest common divisor of a and b equals that of b and r.
ユークリッド互除法は、2 つの自然数の最大公約数を求める手法の一つである。 2 つの自然数 a, b について、a の b による剰余を r とすると、 a と b との最大公約数は b と r との最大公約数に等しいという性質が成り立つ。
Source updated 2023-07-30 · Snapshot 2026-10-08
Source links and calculated neighbors
Cosine values measure shared lexical features, not truth, agreement or identical meaning. Original reference links are labeled separately.
- Euclid's ElementsComputed lexical cosine similarity 0.330 · shared title, text, tags and references