Proving the Dogs Meet at a Single Point: A Mathematical Analysis

8daysAweek
Messages
10
Reaction score
0

Homework Statement


There are N dogs on the plane. Each dog chases the tail of the next dog with a speed of 1 (and the last dog is chasing the first). I want to prove that the dogs will eventually meet at a single point.
2. The attempt at a solution

I defined a function that is sum of distances between each dog and the next one. If I show that the derivative of this function over time is negative, then this distances will eventually become zero.
I have attached a scan of my attempt. As you can see, the result is not always negative. I know there are better way to solve this problem, I just want to understand what is wrong in my approach. Maybe the derivative at line 2 is wrong?

Thank you.



3. Relevant equations
attachment.php?attachmentid=31811&stc=1&d=1296560206.jpg

p_k is the location of the kth dog on 2D plane.
u_k is the unit vector that points to the next dog, it is also the velocity of the kth dog.
 

Attachments

  • ami_00001.jpg
    ami_00001.jpg
    34.1 KB · Views: 535
Physics news on Phys.org
I do not understand where the second equality in your second lines comes from.
You regard your u's as vectors, but treat your p as 1 dimensional point.
It might be a good idea to write the distances explicitly in terms of the x and y coordinates of the positions of the dog. You can then also express the u in terms of the positions.
 
p is a 2D point. I forgot to mention that d is the distance function between two points.
I got this result using the chain rule:
<br /> \[\frac{{\partial d\left( {{p_i},{p_j}} \right)}}{{\partial {p_i}}} = \frac{{\partial \sqrt {{{\left( {{p_i} - {p_j}} \right)}^2}} }}{{\partial {p_i}}} = \frac{{\frac{1}{2}}}{{\sqrt {{{\left( {{p_i} - {p_j}} \right)}^2}} }} \cdot 2\left( {\left( {{p_i} - {p_j}} \right)} \right) \cdot 1 = \frac{{{p_i} - {p_j}}}{{d\left( {{p_i} - {p_j}} \right)}} = {u_{i \to j}}\]<br />
 
Ok, then your definitions are alright.

I don't have much time right now.
Did you remember that the sum of your angles has to be 2Pi (maybe a multiple of that). Maybe this will help you.
 
Actually as your result goes, the derivative is always positive.

But you made a small mistake in your second line, that also shows in your last post.

As you defined it, \vec u_{k\to k+1} is the vector going from p_k to p_{k+1}, or in vector notation \vec u_{k\to k+1}=\vec p_{k+1}-\vec p_k.
Therefore
<br /> <br /> \[\frac{\partial d\left( p_i,p_j \right)}{\partial p_i} =- u_{i \to j}\]<br /> <br />
This will give you a minus in front of the N in your final result and then the derivative is always negative.
 
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...
Back
Top