Revision as of 13:11, 21 October 2008 by Jmason (Talk)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Yikes, wish I had better experience with series.

This seems plausible and all, and I can see how it would work for the challenge problem, but it seems to me that other averages may not actually make the error smaller, which is a fact I think you realize. I guess only sums that oscillate around their ultimate value will act this way. I'd rather take the easy way out and take more points. --John Mason

Alumni Liaison

Correspondence Chess Grandmaster and Purdue Alumni

Prof. Dan Fleetwood