(phwRSSKrSSKJr Srg!\a Nf=f!\a Nf=f)Nxc0^[T5n[U4Sj[U555n[U- R [SU5R 5nUS-/n[U5H(nUR USU-R55 M* [R"S5/n[SU5H0nUR XER[US- 5U- 5 M2 UVs/sHn[R"U5PM nnU$s snf)atGiven 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. c3B># UHnTU[U--v M g7f)Nr).0ias R/var/www/html/venv/lib/python3.13/site-packages/scipy/special/_precompute/utils.py %lagrange_inversion..s (x!AaDAIxsr) lensumrangerseriesremoveOappendexpandmpmpfcoeff)r nfhhpowerkbrs` r lagrange_inversionr s AA (uQx ((A 1 Q1%%'AdVF 1X vbz!|++-.  A 1a[ AE*1,-AqAA H s/ D)mpmathr ImportError sympy.abcrrr r%sA        s&&