What two numbers up to 60 are the least multiple of each other in a progression?

Question

Mathematics

There are two stands running in parallel, which scoop out all possible data created by any of the software of these stands from one source. I want to understand what delays are better to set, so that as rarely as possible there is a probability of a "race condition" with the highest polling frequency within the 1st, maximum 2-3 minutes.

For example, the probability that the first application will take the data created by the second, when polling 6 seconds for the first and 7 seconds for the second, is the lowest in the limit of 10 seconds, because the intersection occurs once every 42 seconds (I could be wrong, I would be grateful if you correct ). The probable loss of data in the presented question can be neglected, because both stands are test. Applications can run simultaneously or independently.

Answer 1

It's not very clear, but you seem to want numbers such that they have a maximum least common multiple (that's 42 for 6 and 7).
Of the numbers up to 60, obviously the numbers 60 and 59 suit you - they have no common divisor and the LCM is simply their product (3540). If you need strictly less than 60, then take 58 and 59. In general, 2 maximum numbers in between will be your answer. For neighboring numbers, the LCM is always equal to their product, and the product of the two maximums in the segment will be the largest possible value.

Answer 2

53 / 59

Answer 3

You just need to get rid of the race condition.