I'm not sure if the concept is similar but the fact that two pointers will meet in a loop seems similar this question :

Suppose three friends A , B and C covers the periphery of a closed path in 2 , 4 ,6 minutes respectively. When they will meet again ?

the answer is LCM(2,4,6) = 12 minutes. I don't have concrete mathematical proof but I hope it helps.