Perl: the Markov chain saw  
PerlMonks 
Re: Spooky math problemby (anonymized user) (Curate) 
on Aug 30, 2005 at 13:39 UTC ( #487756=note: print w/replies, xml )  Need Help?? 
Another approach: There is some additional information needed. 1) The smallest size per digit you are capable of writing the numbers, 2) the largest envelope size you are capable of acquiring, these collectively limit the number of digits the remaining number can have. For the sake of argument lets call it D. If the numbers in envelopes are M and N, with M being the one handed to you, then the probability that N < M is p=(M1)*10^(D). Because D is arbitrarily large, p is arbitrarily small.
One world, one people
In Section
Meditations

