1 // eval_rational_series().
7 #include "cl_LF_tran.h"
12 #include "cln/lfloat.h"
13 #include "cln/integer.h"
14 #include "cln/abort.h"
20 // Evaluates S = sum(N1 <= n < N2, a(n)/b(n) * (p(N1)...p(n))/(q(N1)...q(n)))
21 // and returns P = p(N1)...p(N2-1), Q = q(N1)...q(N2-1), B = B(N1)...B(N2-1)
22 // and T = B*Q*S (all integers). On entry N1 < N2.
23 // P will not be computed if a NULL pointer is passed.
25 static void eval_a_series_aux (uintC N1, uintC N2,
26 const cl_a_series& args,
54 var uintC Nm = (N1+N2)/2; // midpoint
57 eval_a_series_aux(N1,Nm,args,<);
58 // Compute right part.
60 eval_a_series_aux(Nm,N2,args,&RT);
61 // Put together partial results.
62 // S = LS + RS, so T = LT + RT.
69 const cl_LF eval_rational_series (uintC N, const cl_a_series& args, uintC len)
72 return cl_I_to_LF(0,len);
74 eval_a_series_aux(0,N,args,&T);
75 return cl_I_to_LF(T,len);
77 // Bit complexity (if p(n), q(n), a(n), b(n) have length O(log(n))):