Given that 0 < x and x < 2*pi where x is in radians, write a function
[c,s] = infinite_series(x);
that returns with the sums of the two infinite series
c = cos(2*x)/1/2 + cos(3*x)/2/3 + cos(4*x)/3/4 + ... + cos((n+1)*x)/n/(n+1) + ... s = sin(2*x)/1/2 + sin(3*x)/2/3 + sin(4*x)/3/4 + ... + sin((n+1)*x)/n/(n+1) + ...
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.
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
Find all elements less than 0 or greater than 10 and replace them with NaN
11145 Solvers
Remove all the words that end with "ain"
982 Solvers
It dseon't mettar waht oedrr the lrettes in a wrod are.
474 Solvers
Find state names that start with the letter N
440 Solvers
355 Solvers