hi! suppose i have a number, say.. '7' i want to find the highest possible lcm of the set of numbers that add upto 7 that is.. in this case 3+4 = 7 lcm(3,4) = 12
how do i go about this? i could always brute force the possible combinations(1,6)(2,5)... (1,2,4)....(1,1,1,1,1,1,1) this is clearly very inefficient what if i enumerate pairs of coprimes(2,3)(2,5) etc... could this lead to a better solution? --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected] To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/algogeeks -~----------~----~----~----~------~----~------~--~---
