Y by
I know the Euclidean algorithm can be used to find the GCD of very large numbers. But, (unless you want to use the relationship between LCM and GCD), there isn't a simple algorithm (that I'm aware of) that will work for large LCMs.
That example wasn't that bad. But some cases are even worse. Does an algorithm exist for this?
That example wasn't that bad. But some cases are even worse. Does an algorithm exist for this?