Euclidean algorithms
Closed this issue · 1 comments
Khushi260 commented
The Euclidean algorithm is a way to find the greatest common divisor of two positive integers. GCD of two numbers is the largest number that divides both of them. A simple way to find GCD is to factorize both numbers and multiply common prime factors.
This is my first issue in opensource contribution
Consider this as contribution under hacktoberfest 2022.
stale commented
This issue has been automatically marked as inactive because it has not had recent activity. It will be closed in 15 days if no further activity occurs. Thank you for your contributions.