Well, to solve this question, I came up with a clever way To make a number divisible by, for example, all numbers from 1 to 10, we can multiply all numbers from 1 to 10 together. But this way we do not get to the smallest common multiple, because any number that is divisible by 8 is also divisible by 4, so we multiplied to 4 additional ! And in the definition of the smallest common multiple, we have two numbers that are the product of multiplying prime numbers with the most power. I did exactly the same thing. In order to have the most power of a prime number, I stored them in a dictionary that is suitable for this kind of work, and in the end, I multiplied each prime number by its value and multiplied these numbers.