U Hv fwã@sTz ddlZWnek r YnXzddlmZWnek rFYnXdd„ZdS)éN©Úxcs²tˆƒ}t‡fdd„t|ƒDƒƒ}t| td|¡ ¡}|dg}t|ƒD]}| |d| ¡¡qJt  d¡g}td|ƒD]"}| ||  t|d¡|¡q|dd„|Dƒ}|S)a”Given a series f(x) = a[1]*x + a[2]*x**2 + ... + a[n-1]*x**(n - 1), use the Lagrange inversion formula to compute a series g(x) = b[1]*x + b[2]*x**2 + ... + b[n-1]*x**(n - 1) so that f(g(x)) = g(f(x)) = x mod x**n. We must have a[0] = 0, so necessarily b[0] = 0 too. The algorithm is naive and could be improved, but speed isn't an issue here and it's easy to read. c3s|]}ˆ|t|VqdS)Nr)Ú.0Úi©Úa©úC/tmp/pip-unpacked-wheel-96ln3f52/scipy/special/_precompute/utils.pyÚ sz%lagrange_inversion..réÿÿÿÿécSsg|]}t |¡‘qSr)ÚmpÚmpf)rrrrr Ú %sz&lagrange_inversion..) ÚlenÚsumÚrangerZseriesZremoveOÚappendÚexpandr rZcoeff)rÚnÚfÚhZhpowerÚkÚbrrr Úlagrange_inversion s    r)Zmpmathr Ú ImportErrorZ sympy.abcrrrrrr Ús