Line 2: Line 2:
  
  
   (1-(.001<math>^k</math>))<math>^(365)</math> Serves the condition "atlest"  
+
   (1-(.001<math>^k</math>))^365 Serves the condition "atlest"  
  
  Therefore  1-(1-(.001<math>^k</math>))<math>^(365)</math> Tells us the proability of total outrage happening "atleast" once a year.  
+
  Therefore  1-(1-(.001<math>^k</math>))^365 Tells us the proability of total outrage happening "atleast" once a year.  
  
 
The above expression should be lesser or eual to 0.001....so solve the equation from thereon!!
 
The above expression should be lesser or eual to 0.001....so solve the equation from thereon!!

Revision as of 19:14, 16 September 2008

 Take P,The probability of not getting connected on any one day = (0.001)$ ^k $


  (1-(.001$ ^k $))^365 Serves the condition "atlest" 
Therefore  1-(1-(.001$ ^k $))^365 Tells us the proability of total outrage happening "atleast" once a year. 

The above expression should be lesser or eual to 0.001....so solve the equation from thereon!!

Alumni Liaison

Correspondence Chess Grandmaster and Purdue Alumni

Prof. Dan Fleetwood