Re: simple stats problem



On Sat, 15 Mar 2008 22:45:43 -0700 (PDT), Digital Puer
<digital_puer@xxxxxxxxxxx> wrote:

Hi, I've been trying to figure out this problem I got on an interview,
but I haven't been able to get a clear answer.

Suppose I have a room of N computers. Suppose each computer
fails at a rate of once every 14 days.

Now what is the probably that at least one of them fails?

I'm thinking it's 1 - prob(none of them fail). But then how do I
figure that out?

And if the question is what is the probably that at least one of them
fails, does that necessarily mean "out of those 14 days"? I didn't
have any other info than that.

Thanks for any help.

My guess is they want the probability of at least one failure for a
single day.

Assuming that the failure potential is "memoryless" (in other words,
the probability of failure for each computer is 1/14 on any given day,
regardless of the history of prior failures, and assuming the
computers are independent of each other with regard to failures, then
the probability of that no computer fails on a given day is (13/14)^N,
and hence the probability of at least one failure is 1 - (13/14)^N.

If you did want to consider 14 straight days, it's just as easy. The
probability of no failure for all computers for 14 straight days would
just be ((13/14)^N)^14 which simplifies to (13/14)^(14N). Hence the
probability that at least one of the N computers fails in 14 straight
days is 1 - ((13/14)^(14N)).

quasi
.



Relevant Pages

  • Re: Algorithm For Ensuring p & q Sufficiently Large For n in RSA
    ... overheating, mere hardware design bugs, and the occasional cosmic ray ... around computers for some time already witnessed such occurrences. ... of elementary operations for which I could have witnessed such failure ... a primality test which may get it wrong with probability ...
    (sci.crypt)
  • Re: simple stats problem
    ... Suppose I have a room of N computers. ... Now what is the probably that at least one of them fails? ... if no time limit is specified. ... If they wanted to ask the probability that at least one failed in those ...
    (sci.math)
  • Re: When to check the return value of malloc
    ... How difficult is it to compute the probability that a single call to ... Just check the result of every single call to malloc(). ... a mallocfailure; I'm just saying that it's better than ignoring ... If mallocfails ...
    (comp.lang.c)
  • Re: Gen. Bernard Schriever dies
    ... >> She was a problem solver, who saw computers as a tool for easing ... of failure, and which can detect and work around failures. ... > That "pointing device" would later be recognised by Douglas ... >> A SAGE sector also monitored the information and intercepts of all ...
    (sci.space.history)
  • Re: Where to get a unique id for a newly allocated datastructure member
    ... you can reduce the probability of a collision to a ... Wouldn't it be better to use the timestamp _and_ a random number? ... the time period during which some computers somewhere will have their ... reduce the probability to that of anyone's brain suddenly melting ...
    (comp.lang.c)