View Single Post
  #2  
Old November 22nd, 2008, 01:13 AM
CaptainBlack's Avatar
CaptainBlack CaptainBlack is offline
Grand Panjandrum
 
Join Date: Nov 2005
Location: South of England
Posts: 11,379
Country:
Thanks: 667
Thanked 3,619 Times in 2,916 Posts
CaptainBlack has a reputation beyond reputeCaptainBlack has a reputation beyond reputeCaptainBlack has a reputation beyond reputeCaptainBlack has a reputation beyond reputeCaptainBlack has a reputation beyond reputeCaptainBlack has a reputation beyond reputeCaptainBlack has a reputation beyond reputeCaptainBlack has a reputation beyond reputeCaptainBlack has a reputation beyond reputeCaptainBlack has a reputation beyond reputeCaptainBlack has a reputation beyond repute
Default

Quote:
Originally Posted by maths_123 View Post
Can you please help me with this proof. Look at the picture.

THANKS
From the definition of expectation we have:

E(A)=\sum_{i=0}^n i p(A=i)

Now:

p(A\ge k)= \sum_{i=k}^n p(A=i)

So:

\sum_{k=1}^n p(A \ge k)

contains p(A=1) once, p(A=2) twice, etc

hence:

\sum_{k=1}^n p(A \ge k)=\sum_{k=1}^n kp(A=k) = \sum_{k=0}^n kp(A=k)=E(A)

CB
__________________
Truth does not change because it is, or is not, believed by a majority of the people.

Giordano Bruno
Reply With Quote