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

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

1 Answer

5 votes

Answer: GCF(48, 11) = 1

Explanation:

answered
User Reigertje
by
8.2k points
Welcome to Qamnty — a place to ask, share, and grow together. Join our community and get real answers from real people.