UniMaths
Free chapterTry everything here: cards, proofs and practice. Sign up free to save your progress and unlock all 6 chapters.Sign up free
ALG1 · 1

Integers and divisibility

21 concepts · 78 questions

← Back to cards1 / 4
ALG1Quick check●○○○○new1 Integers and divisibility

Compute gcd⁡(1071,462)\gcd(1071, 462) by Euclid's algorithm.