J
Jari Williamsson
In Ruby, what would be the most efficient way to find the smallest
number that an array of different numbers can be divided by with integer
math?
For example:
[1,2] would return 2
[1,2,3] would return 6
[1,2,4] would return 4
[1,2,3,4] would return 12
Best regards,
Jari Williamsson
number that an array of different numbers can be divided by with integer
math?
For example:
[1,2] would return 2
[1,2,3] would return 6
[1,2,4] would return 4
[1,2,3,4] would return 12
Best regards,
Jari Williamsson