# shlomi-fish-homepage / t2 / MathVentures / bugs-in-square-mathml.xhtml.wml

  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 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 #include "prelude.wml" #include "driver.wml" #include "mathjax.wml"

I first encountered this problem in the science journal of a laboratory building where I used to study physics. 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 long will it take for the bugs to meet in the centre 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 infinitesimally, 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[/itex].

Now, if the length of a given square is a[/itex], then the length of the square inside it is (according to Pythagoras theorem):

p a2 + 1 p a2 = a2p2 2p + 1 [/itex]

The lengths 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 2p2 2p + 1 [/itex]

This is according to the formula that the sum of an infinite decreasing geometric series is a1 1 q[/itex] where a1[/itex] is the value of its first item and q[/itex] is the proportion between two consecutive items.

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

limp0 p a1 1 2p2 2p + 1 = limp0 p a1 1 2p2 2p + 1 1 + 2p2 2p + 1 1 + 2p2 2p + 1 = limp0a1 p 1 + 2p2 2p + 1 1 p2 + 2p 1 = limp0a1 1 + 2p2 2p + 1 2 2p = limp0a1 1 + 2 02 2 0 + 1 2 2 0 = a1 (1 + 1) 2 = a1 [/itex]

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.

Scripts and Visualisations

Here’s a script for Gimp version 1.2 that generates a series of squares inside squares, and optionally marks the path of a single bug. And here’s the corresponding script for Gimp version 2.2.

Here’s a Perl script to generate an SVG image of the squares inside each other (that was displayed above).