That is the calculated number I got.
How was this done?
i = 1 for k in (range(1, 51)): if i % k > 0: for j in range(1, 51): if (i*j) % k == 0: i *= j break print(i)
We take k as a number going from 1 to 50.
I is a number, that we just need as check and printout later.
Now, k is slowly going up, one step each time the first for loop goes around.
The inner for loop is only reached, if k and that number i have a rest bigger 0 when you divide i by k.
Let's start with i=1.
j=1,2 (ij% k!=0)
i = 2*3
That one is a headscratcher, isn't it?
You need all prime numbers and mulitple of it, "other numbers" but not those, that could be already build out of the existing ones inside:))))
Don't worry, it will only get harder from now on!
Don't forget to witness vote for me!:)
And comment to get some BEER
Posted with STEMGeeks