Lecture 11: Correction To The End Of The CLT Proof

author: Brad G. Osgood, Computer Science Department, Stanford University
published: May 21, 2010,   recorded: September 2007,   views: 2642
released under terms of: Creative Commons Attribution Non-Commercial (CC-BY-NC)

Related Open Educational Resources

Related content

Report a problem or upload files

If you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.
Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
Lecture popularity: You need to login to cast your vote.


There’s a single function, P of X, which describes how each one of them is distributed. So it’s a distribution for each. And then I formed P of N of X was the distribution for the sum scaled by square root of N. So it’s the average – excuse me. There was some assumption we made on the Xs on normalation, that is. We assume they had mean zero and we assume they had standard deviation or variance one, and then if you form the sum, the mean of the sum is zero but the standard deviation or the variant center deviation of the sum is the square root of N, so it’s scaled by the square root of N. ...

See the whole transcript at The Fourier Transform and its Applications Co - Lecture 11

Link this page

Would you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !

Write your own review or comment:

make sure you have javascript enabled or clear this field: