hi, Can anyone suggest me the approach for finding the lcm of the n numbers?
my approach: find the max of the n numbers and start dividing it by all numbers , if all are dividing it then print it, else take next multiple of the max number and repaet the division process. but i think this is too slow. i want better than this. So any one has better idea bout this ?
Edited 4 Years Ago by nitin1