So what would the Cody size of a brute-force algorithm be for this problem?
I got the correct answers within 50*eps for all answers except x=0.001 for c. Is c_correct value correct for x=0.001? I put in a small correction factor 1.5e-14 to get your c_correct value.
this one is truely a wonderfun code! make my eyes open.
Mr Castanon is a true god. I preferred asking wolfram solver.
Wish I studied infinite series properly at school
Yes, you are right S L, a direct brute force summation is surely not the most efficient method of determining the sums of these series. You are the only one so far with a valid solution that met the 50*eps tests. In fact your answers are very much closer than that to mine, within a few eps. However, there is another single analytic function that can be used which is much simpler and would undoubtedly give you a lower "size" than 92 if you or others can find it. R. Stafford
thanks for the hint
How to subtract?
Without the French accent please!
Find nth maximum
Recaman Sequence - I
Sum the Infinite Series II
Subdivide the Segment
Compute Area from Fixed Sum Cumulative Probability
Choose a web site to get translated content where available and see local events and offers. Based on your location, we recommend that you select: .
You can also select a web site from the following list:
Select the China site (in Chinese or English) for best site performance. Other MathWorks country sites are not optimized for visits from your location.
Contact your local office