Last Updated
：2025/11/29
extended Euclidean algorithm
（ canonical ）
Quizzes for review
An extension to the Euclidean algorithm, which computes the coefficients of Bézout's identity in addition to the greatest common divisor of two integers.
音声機能が動作しない場合はこちらをご確認ください
See correct answer
extended Euclidean algorithm
When computing modular inverses, the extended Euclidean algorithm is an indispensable tool for finding Bézout coefficients and the greatest common divisor.
See correct answer
When computing modular inverses, the extended Euclidean algorithm is an indispensable tool for finding Bézout coefficients and the greatest common divisor.
音声機能が動作しない場合はこちらをご確認ください
English - English
Word Edit Setting
- Users who have edit permission for words - All Users
- Screen new word creation
- Screen word edits
- Screen word deletion
- Screen the creation of new headword that may be duplicates
- Screen changing entry name
- Users authorized to vote on judging - Editor
- Number of votes required for decision - 1
Sentence Edit Setting
- Users who have edit permission for sentences - All Users
- Screen sentence deletion
- Users authorized to vote on judging - Editor
- Number of votes required for decision - 1
Quiz Edit Setting
- Users who have edit permission for quizzes - All Users
- Users authorized to vote on judging - Editor
- Number of votes required for decision - 1
