How could the central limit theorem be used to gauge the probable size of the error of the estimate of the previous problem? Denoting the estimate by , if A = .2, how large should n be so that
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.