# shlomi-fish-homepage / t2 / MathVentures / bug_square.html

 ``` 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111``` ``` Math-Ventures: Bugs in a square

Bugs in a square

I first encountered this problem in the science journal of a laboratory building I used to study physics in. It is rather well known, and I found some other solutions to it. One used differential equations which is rather high stuff. The other is "intuitive", and so lacks enough support, so it didn't satisfy me either. Anyway, I devised my own solution beforehand.

Here's the riddle:

Four bugs are standing at the corners of a square. At time 0 a bell rings and they start moving towards each other. Each bug advances in the direction of the bug which was initially at the position clockwise from it.

Assuming the square is 1 meter long, and the bugs are moving in the velocity of 1 meter per second, how will it take for the bugs to meet in the center of the square?

The solution can be found some space below:

Solution:

I'll use the following model to simplify the problem: suppose the bugs don't move towards each other infinitesimly, but rather move in a straight line, and then stop, and then move again toward their new positions, and so forth. The bugs move toward their initial position until they reach a position which is in proportion p to the initial distance between them. Then they move again, towards a position which is in proportion p to their distance, and so forth.

Thus they form an infinite series of squares inside each other. You can see an illustration of this scheme to the right of this text for the proportion p=0.15.

Now, if the length of a given square is a, then the length of the square inside it is (according to pythgoras theorem): square-root((p*a)^2+((1-p)*a)^2) = a*square-root(2*p^2-2*p+1). The lengthes of the squares form a decreasing geometrical series, with that proportion. Thus the length of the path a bug travel until they meet is:

p * a1 / [ 1 - square-root(2*p^2-2*p+1) ]

This is according to the formula that the sum of an infinite decresing geometric series is a1 / (1-q) where a1 is the value of its first item and q is the proportion between two consecutive items.

Now, to find the length an infinitesimal bug will travel, we just limit p to 0:

_____________           p*a1                       p*a1           1+V 2*p^2-2*p+1   lim ---------------   =  lim  ----------------  * -----------------  =   p->0   ____________      p->0    ____________        _____________       1-V 2*p^2-2*p+1           1-V 2*p^2-2*p+1     1+V 2*p^2-2*p+1                   ____________                    _____________        a1*p*(1+V 2*p^2-2*p+1)          a1 * (1+V 2*p^2-2*p+1 )   lim  ---------------------  =  lim   ----------------------  =    p->0                           p->0      2 - 2*p        1 - 2*p^2 + 2*p - 1                 _____________        a1 * (1+V 2*0-2*0+1  )      a1 * (1+1)     lim  ---------------------  =  ------------- = a1   p->0     2 - 2*0                     2
Therefore, the length of a bug's path is equal to the length of the original square's side. The time it will take a 1 meter per second fast bugs who stand at the corner of a 1*1 meter square to meet is 1/1 = 1 second.

You can find here a Gimp script that generates a series of squares inside squares, and optionally marks the path of a single bug.

Back to the Math-Ventures Web page

Back to Shlomi Fish' Homepage

```