There is an east-west street of length L units. And we park cars of unit length along the north side until we can't place any more cars. Each car is placed randomly (uniformly).
What is the expected number of cars that can be parked (as a function of L)?
I'll start you off...
For 0 <= L < 1, F(L) = 0
For 1 <= L < 2, F(L) = 1
Okay... now the easy ones are out of the way, can you describe the function for L>=2?
(In reply to re: Different?
I meant to say hard to park 2 cars for 2.1, and hard to park less than 2 cars for 2.9; Look at the difference between 1.19 and 1.95.
Posted by Gamer
on 2004-07-02 22:40:21