Four days ago, Kitri and Basilio agreed to meet up at a Barcelona marketplace to watch the New Year fireworks. Now, Kitri has arrived on time and been waiting for her beloved Basilio, who is almost never on time. She wonders what the chances are that Basilio arrives more than late. As much as Kitri loves Basilio, she knows little about his habits, except for the fact that Basilio is always late on average , give or take .
Knowing nothing else but a well-known inequality, Kitri works out that a very good upper bound for the probability Basilio arriving later than is , and she's somewhat relieved. What is , rounded to the nearest integer?
Note: This problem has been modified from a previous version to be more precise.
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
This is a straightforward application of the one-sided Chebyshev's inequality, with μ = 3 0 , σ = 5 , c = 4 5 − 3 0 = 1 5 :
P ( T ≥ μ + c ) = P ( T ≥ 3 0 + 1 5 ) ≤ σ 2 + c 2 σ 2 = 5 2 + 1 5 2 5 2 = 1 0 1 . So the answer we seek is 1 0 0 P = 1 0 .
Thanks @Otto Bretscher for the discussion!