128k views
3 votes
How to find the gcd using the Euclidean algorithm

How to find the gcd using the Euclidean algorithm-example-1
User Ymmx
by
8.1k points

1 Answer

5 votes

Answer: GCF(48, 11) = 1

Explanation:

User Reigertje
by
8.2k points

No related questions found