We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
You can use euler003 to reverse engineer or verify the answer.
console.log(test_euler005(2520))functiontest_euler005(n){letfactors=euler003(n)factors.shift()returnfactors}/** Modified euler003 to export all prime factors of N */functioneuler003(n,divisor=2,factors=[]){letsquare=(x)=>Math.pow(x,2)factors.push(divisor)while((n%divisor)!=0&&square(divisor)<=n){divisor++}returnsquare(divisor)<=n?euler003(n/divisor,divisor,factors):[...factors,n]}
Cookie support is required to access HackerRank
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 →
You can use euler003 to reverse engineer or verify the answer.