You are viewing a single comment's thread. Return to all comments →
we have to find the lcm as simple as that so for ..findind the lcm u just have to apply the algorithm of lcm=a*b/gcd(a,b)
Seems like cookies are disabled on this browser, please enable them to open this website
Project Euler #5: Smallest multiple
You are viewing a single comment's thread. Return to all comments →
we have to find the lcm as simple as that so for ..findind the lcm u just have to apply the algorithm of lcm=a*b/gcd(a,b)