1
$\begingroup$

Two persons are running on a circular track either in the same direction or in the opposite direction, indefinitely. The speed of both of them is given, say $u$ and $v$. Now, how do I find out the the number of distinct points at which they will meet on the circle.

  • 1
    Have you tried to solve this problem yourself?2012-08-30
  • 0
    Yeah, well the first meeting point is C/(v-u), considering the circumference is C and v>u. Now the meetings points are going to be multiples of this. So n*C/(v-u) is going to be equal to some k*C/(v-u). Since, the path is circular, I'm expecting n can be decomposed to something less than C using modulo, but I'm getting nowhere with this approach :|2012-08-30
  • 0
    Yeah, I've gotta say, the problem is slightly less straightforward than it looks... it would have saved me some time if you'd mentioned that you'd already tried the obvious approach :)2012-08-30

2 Answers 2