If the intervals are rational multiples, you can calculate the least common multiple. That will give you the interval between recurrences, assuming there is one at all. There will be one if the time for one delays from the other by a multiple of the greatest common divisor. For example, if one event recurs every 60 seconds and the other recurs every 33 seconds, the least common multiple is 660 seconds. The matches, if any, will recur that frequently. There will be a match if the delay from the first to the second is a multiple of the greatest common divisor, which is 3 seconds. If the delay is not a multiple of this, they will never match.