Ponder This

Welcome to our monthly puzzles.
You are cordially invited to match wits with some of the best minds in IBM Research.

July 2025 - Challenge

<< June


This puzzle was suggested by Latchezar Christov - thanks!

A wire with length L is stretched between two poles. Swallows come, one by one, and land on the wire. All swallows have a width equal to 1 and cannot overlap on the wire, and each new swallow selects where to land at random with uniform probabilities (taken over all the perimissible options). This repeats until no swallow can land anymore.

In this moment, there are S swallows on the wire. The number S is a discrete random variable whose expectancy N=\mathbf{E}[S] depends on L. We will call "flock density" (FD) the ratio \mathbf{FD}(L) = \frac{N(L)}{L}. For example

FD(1.1)=0.909091
FD(2.2)=0.606061
FD(3.3)=0.665421
FD(10)=0.722358
etc.


Your goal: Find the lengths L_1 and L_2 (L_1,L_2>2) for which the flock density is accordingly \mathbf{FD}(L_1)=\frac{36}{51} and \mathbf{FD}(L_2)=\frac{38}{51}. Provide eight decimal digits of accuracy.

A bonus "*" will be given for finding the median of the distribution of the distance between two consecutive landing points for L\to\infty, where a "landing point" of a swallow is in the middle of the space it occupies. Provide four decimal digits after the decimal point.


We will post the names of those who submit a correct, original solution! If you don't want your name posted then please include such a statement in your submission!

We invite visitors to our website to submit an elegant solution. Send your submission to the ponder@il.ibm.com.

If you have any problems you think we might enjoy, please send them in. All replies should be sent to: ponder@il.ibm.com

 

Challenge: 01/07/2025 @ 10:00 AM EST
Solution: 05/08/2025 @ 12:00 AM EST
List Updated: 06/07/2025 @ 16:35 PM EST

*Bertram Felgenhauer(1/7/2025 4:27 PM IDT)
*Bert Dobbelaere(1/7/2025 11:03 PM IDT)
Lazar Ilic(2/7/2025 4:39 AM IDT)
Alper Halbutogullari(2/7/2025 9:52 AM IDT)
Jiri Spitalsky(2/7/2025 8:20 PM IDT)
Paul Lupascu(2/7/2025 9:13 PM IDT)
*Daniel Bitin(2/7/2025 11:45 PM IDT)
*Guangxi Liu(3/7/2025 6:34 AM IDT)
*King Pig(3/7/2025 4:54 PM IDT)
*Juergen Koehl(4/7/2025 9:54 PM IDT)
*Prashant Wankhede(5/7/2025 9:09 PM IDT)
*Hugo Pfoertner(5/7/2025 9:18 PM IDT)