# OCME · 知識與練習查找

302 MKO / 1,441 families / 360 batches / 36,000 questions.

36,000 second-context math/bilingual reviewed; 0 display/symbol-checked candidates. Source questions: candidate. English: ai_candidate. No new proof, Lean, SREG or training.

1 results; page 1/1.

## 第 18830 題：Euclidean演算法

- ID: `q-20261014-advance-20261105-r03-euclidean-algorithm-0005`; number: 18830
- Processing: second_context_reviewed
- MKO: [mko-euclidean-algorithm](/zh-Hant/mko/mko-euclidean-algorithm/)
- Family: [qf-mod36-euclid-division-chain](/zh-Hant/explore/?family=qf-mod36-euclid-division-chain)
- Batch: [batch-20261014-advance-20261105-r03-euclidean-algorithm-foundations](/zh-Hant/explore/?batch=batch-20261014-advance-20261105-r03-euclidean-algorithm-foundations)
- [Derivation](/zh-Hant/questions/q-20261014-advance-20261105-r03-euclidean-algorithm-0005/) / [Markdown](/zh-Hant/questions/q-20261014-advance-20261105-r03-euclidean-algorithm-0005/index.md) / [JSON](/data/question-derivations/questions/q-20261014-advance-20261105-r03-euclidean-algorithm-0005.json)