403Webshell
Server IP : 217.160.0.135  /  Your IP : 216.73.217.85
Web Server : Apache
System : Linux www 6.18.52-i1-ampere #1203 SMP Mon Sep 14 18:29:59 CEST 2026 aarch64
User : sws1074145052 ( 1074145052)
PHP Version : 8.3.32
Disable Function : NONE
MySQL : OFF  |  cURL : ON  |  WGET : ON  |  Perl : ON  |  Python : OFF  |  Sudo : OFF  |  Pkexec : OFF
Directory :  /usr/lib/python3/dist-packages/scipy/special/_precompute/__pycache__/

Upload File :
current_dir [ Writeable ] document_root [ Writeable ]

 

Command :

[ Back ]     

Current File : /usr/lib/python3/dist-packages/scipy/special/_precompute/__pycache__/utils.cpython-311.pyc
�

d�cw��T�	ddlZn#e$rYnwxYw	ddlmZn#e$rYnwxYwd�ZdS)�N��xc�N��t���}t�fd�t|��D����}t|z�td|�����}|dzg}t|��D]2}|�|d|z������3tj	d��g}td|��D]<}|�||�
t|dz
��|z���=d�|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.

    c3�>�K�|]}�|t|zzV��dS)Nr)�.0�i�as  ��A/usr/lib/python3/dist-packages/scipy/special/_precompute/utils.py�	<genexpr>z%lagrange_inversion.<locals>.<genexpr>s/�����(�(�!�A�a�D��A��I�(�(�(�(�(�(�r����c�6�g|]}tj|����S�)�mp�mpf)rrs  r
�
<listcomp>z&lagrange_inversion.<locals>.<listcomp>%s �����q��������r)�len�sum�ranger�series�removeO�append�expandrr�coeff)r	�n�f�h�hpower�k�bs`      r
�lagrange_inversionr"s��� 	�A���A��(�(�(�(�u�Q�x�x�(�(�(�(�(�A�	
�1����Q��1���%�%�'�'�A���d�V�F�
�1�X�X�/�/���
�
�v�b�z�!�|�+�+�-�-�.�.�.�.�	������A�
�1�a�[�[�.�.��	���������A��E�*�*�1�,�-�-�-�-���A����A��Hr)�mpmathr�ImportError�	sympy.abcrr"rrr
�<module>r&s���	��������	�	�	��D�	����	����������	�	�	��D�	����
�
�
�
�
s�����"�"

Youez - 2016 - github.com/yon3zu
LinuXploit