o
    §ƒðj«@  ã                   @   sJ  d dl Z d dlmZ d gd ZeddƒD ]Zegdde >  ede> dded > …< qd>dd„Zd>dd	„Zd
d„ Z	dd„ Z
dd„ Zdd„ Ze jZe jZdd„ Zdd„ Zdd„ Zdd„ Zdd„ Zdd„ Zdd„ Zd d!„ Zd"d#„ Zd$d%„ Zd&d'„ Zd(d)„ Zd*d+„ Zd,d-„ Zd.d/„ Zd0d1„ Zd2d3„ Zd4d5„ Z d6d7„ Z!d8d9„ Z"d:d;„ Z#d<d=„ Z$dS )?é    Né   é   é   é   c                 C   sæ   | sd S t | |? ƒ} | d@ }|rt| | S d| }| dL } |  ¡ d }| d|> kr.|| S |dk rC| d@ sB| dL } |d7 }| d@ r6n(|d? }| d@ sk| d|> d @ r_|dL }| d|> d @ sS| |L } ||7 }| d@ rK|t| d@   S )Néÿ   r   r   i,  )ÚabsÚ_small_trailingÚ
bit_length)ÚxÚnÚlow_byteÚtÚzÚp© r   ú˜/tmp/claude-1000/-var-www-html-academy/3f42efd1-c2b7-4d08-9b05-30d86bb35479/scratchpad/piper/venv/lib/python3.10/site-packages/sympy/external/ntheory.pyÚ	bit_scan1   s4   þ€ÿür   c                 C   s   t | d|>  |ƒS )Nr   )r   )r
   r   r   r   r   Ú	bit_scan00   s   r   c                 C   sÔ   |dk rt dƒ‚| dkrdS |dkrt| ƒ}| |? |fS d}t| |ƒ\}}|sf|} |d7 }|dkr]|d g}|r]|d }t| |ƒ\}}|sW|dt|ƒ> 7 }|} | |d ¡ n| ¡  |s8t| |ƒ\}}|r'| |fS )Né   zfactor must be > 1r   )r   r   r   é   éÿÿÿÿ)Ú
ValueErrorr   ÚdivmodÚlenÚappendÚpop)r
   ÚfÚbÚmÚyÚremÚpow_listÚ_fr   r   r   Úremove4   s4   
ø	òr#   c                 C   ó   t t t | ƒ¡ƒS )z
Return x!.)ÚintÚmlibÚifac©r
   r   r   r   Ú	factorialP   ó   r)   c                 C   r$   )zInteger square root of x.)r%   r&   Úisqrtr(   r   r   r   ÚsqrtU   r*   r,   c                 C   s"   t  t| ƒ¡\}}t|ƒt|ƒfS )z'Integer square root of x and remainder.©r&   Úsqrtremr%   )r
   ÚsÚrr   r   r   r.   Z   s   r.   c                 C   s   | dk r	d|  fS d| fS )Nr   r   r   r   ©r   r   r   r   Ú_signd   s   
r2   c                 C   s°   | r|st | ƒpt |ƒ}|sdS || | || fS t| ƒ\}} t|ƒ\}}d\}}d\}}|rOt| |ƒ\}	}
||
} }|||	|  }}|||	|  }}|s/| || || fS )N)r   r   r   )r   r   ©r   r   )r   r2   r   )Úar   ÚgÚx_signÚy_signr
   r0   r   r/   ÚqÚcr   r   r   Úgcdextj   s    
ür:   c                 C   sz   | dk rdS dd| d@ > @ rdS | d }dd|d > @ rdS d	d|d
 > @ r(dS dd|d > @ r2dS t  t| ƒ¡d dkS )z$Return True if x is a square number.r   Fl	   ì}ù{·wïoÏ^¿?{þ~ý r   é   iE¯ l   ì}}k-î[o{?_}éc   l   ì=}:žM¯vÏ?£_ é[   l   ì}¬sŽ�;®y½éU   r-   ©r
   r   r   r   r   Ú	is_square   s   r@   c                 C   s&   zt | d|ƒW S  ty   tdƒ‚w )zÍModular inverse of x modulo m.

    Returns y such that x*y == 1 mod m.

    Uses ``math.pow`` but reproduces the behaviour of ``gmpy2.invert``
    which raises ZeroDivisionError if no inverse exists.
    r   zinvert() no inverse exists)Úpowr   ÚZeroDivisionErrorr?   r   r   r   Úinvert£   s
   ÿrC   c                 C   sH   |dks|d st dƒ‚| |; } | sdS t| |d d |ƒdkr"dS dS )z€Legendre symbol (x / y).

    Following the implementation of gmpy2,
    the error is raised only when y is an even number.
    r   r   zy should be an odd primer   r   )r   rA   )r
   r   r   r   r   Úlegendre±   s   rD   c                 C   sè   |dks|d st dƒ‚| |; } | st|dkƒS |dks | dkr"dS t| |ƒdkr+dS d}| dkrr| d dkrR| dkrR| dL } |d dv rH| }| d dkrR| dks;|| } }| d |d   kredkrjn n| }| |; } | dks1|S )	zJacobi symbol (x / y).r   r   z#y should be an odd positive integerr   r   ©é   r   é   rF   )r   r%   Úgcd)r
   r   Újr   r   r   ÚjacobiÁ   s,   ý
 ø	rJ   c                 C   sv   t | |ƒdkr	dS |dkrdS |dk r| dk rdnd}t|ƒ}t|ƒ}||L }|d r4| d dv r4| }|t| |ƒ S )zKronecker symbol (x / y).r   r   r   r   r   rE   )rH   r   r   rJ   )r
   r   Úsignr/   r   r   r   Ú	kroneckerÙ   s   rL   c           	      C   s”  | dk rt dƒ‚|dk rt dƒ‚| dv r| dfS |dkr | dfS |dkr2t | ¡\}}t|ƒ| fS ||  ¡ kr:dS zt| d	|  d
 ƒ}W n- tys   t | ¡| }|dkrkt|d ƒ}td||  d ƒ|> }ntd| ƒ}Y nw |dkržd|}}	 ||d  }||d | | |  | }}t|| ƒdk rœnq~n|}|| }|| k r´|d7 }|| }|| k s¨|| krÄ|d8 }|| }|| ks¸||| kfS )Nr   zy must be nonnegativer   zn must be positiver3   Tr   )r   Fg      ð?g      à?é5   g       @l           r   )	r   r&   r.   r%   r	   ÚOverflowErrorÚmathÚlog2r   )	r   r   r
   r    ÚguessÚexpÚshiftÚxprevr   r   r   r   Úirootè   sV   €ú
üþþrU   c                 C   sr   |dk rt dƒ‚| dk rt dƒ‚| dkrdS | d dkr | dkS || ; }t| |ƒdkr/t dƒ‚t|| d | ƒdkS )Nr   z7is_fermat_prp() requires 'a' greater than or equal to 2r   z.is_fermat_prp() requires 'n' be greater than 0Fr   z&is_fermat_prp() requires gcd(n,a) == 1)r   rH   rA   ©r   r4   r   r   r   Úis_fermat_prp  s   rW   c                 C   s|   |dk rt dƒ‚| dk rt dƒ‚| dkrdS | d dkr | dkS || ; }t| |ƒdkr/t dƒ‚t|| d? | ƒt|| ƒ|  kS )Nr   z6is_euler_prp() requires 'a' greater than or equal to 2r   z-is_euler_prp() requires 'n' be greater than 0Fr   z%is_euler_prp() requires gcd(n,a) == 1)r   rH   rA   rJ   rV   r   r   r   Úis_euler_prp%  s   rX   c                 C   sv   t | d ƒ}t|| |? | ƒ}|dks|| d krdS t|d ƒD ]}t|d| ƒ}|| d kr1 dS |dkr8 dS q dS )Nr   Tr   F)r   rA   Úrange)r   r4   r/   Ú_r   r   r   Ú_is_strong_prp4  s   ÿr[   c                 C   sh   |dk rt dƒ‚| dk rt dƒ‚| dkrdS | d dkr | dkS || ; }t| |ƒdkr/t dƒ‚t| |ƒS )Nr   z7is_strong_prp() requires 'a' greater than or equal to 2r   z.is_strong_prp() requires 'n' be greater than 0Fr   z&is_strong_prp() requires gcd(n,a) == 1)r   rH   r[   rV   r   r   r   Úis_strong_prpB  s   
r\   c           	      C   s¾  |dkrdS |d d|  }d}|}||  }|dkr`t |ƒdd… D ]<}|| |  }|| d |  }|dkr^|| | || ||  }}|d@ rM|| 7 }|d@ rU|| 7 }|d? |d? }}q"nö|dkr´|d	kr´t |ƒdd… D ]>}|| |  }|dkr…|| d |  }n
|| d |  }d}|dkr®|| |d> }}|d@ r¤|| 7 }|dL }||7 }d	}qp|| ; }n¢|dkrÿt |ƒdd… D ]=}|| |  }|| d|  |  }||9 }|dkrù|| || d> }}|d@ rí|| 7 }|dL }|| }||9 }|| ; }qÀnWt |ƒdd… D ]N}|| |  }|| d|  |  }||9 }|dk�rP|| | || ||  }}|d@ �r:|| 7 }|d@ �rC|| 7 }|d? |d? }}||9 }|| ; }�q||  ||  |fS )
aÀ  Return the modular Lucas sequence (U_k, V_k, Q_k).

    Explanation
    ===========

    Given a Lucas sequence defined by P, Q, returns the kth values for
    U and V, along with Q^k, all modulo n. This is intended for use with
    possibly very large values of n and k, where the combinatorial functions
    would be completely unusable.

    .. math ::
        U_k = \begin{cases}
             0 & \text{if } k = 0\\
             1 & \text{if } k = 1\\
             PU_{k-1} - QU_{k-2} & \text{if } k > 1
        \end{cases}\\
        V_k = \begin{cases}
             2 & \text{if } k = 0\\
             P & \text{if } k = 1\\
             PV_{k-1} - QV_{k-2} & \text{if } k > 1
        \end{cases}

    The modular Lucas sequences are used in numerous places in number theory,
    especially in the Lucas compositeness tests and the various n + 1 proofs.

    Parameters
    ==========

    n : int
        n is an odd number greater than or equal to 3
    P : int
    Q : int
        D determined by D = P**2 - 4*Q is non-zero
    k : int
        k is a nonnegative integer

    Returns
    =======

    U, V, Qk : (int, int, int)
        `(U_k \bmod{n}, V_k \bmod{n}, Q^k \bmod{n})`

    Examples
    ========

    >>> from sympy.external.ntheory import _lucas_sequence
    >>> N = 10**2000 + 4561
    >>> sol = U, V, Qk = _lucas_sequence(N, 3, 1, N//2); sol
    (0, 2, 1)

    References
    ==========

    .. [1] https://en.wikipedia.org/wiki/Lucas_sequence

    r   )r   r   r   r   rG   r   rF   NÚ1r   )Úbin)	r   ÚPÚQÚkÚDÚUÚVÚQkr   r   r   r   Ú_lucas_sequenceQ  s~   9€÷
€

ó


rf   c                 C   sz   |d d|  }|dks|dks|dvrt dƒ‚| dk r t dƒ‚| dkr&dS | d dkr0| dkS t| ||| ƒd ||  kS )	Nr   rG   r   )r   r   z,invalid values for p,q in is_fibonacci_prp()r   z1is_fibonacci_prp() requires 'n' be greater than 0F)r   rf   ©r   r   r8   Údr   r   r   Úis_fibonacci_prpÐ  s   ri   c                 C   sŽ   |d d|  }|dkrt dƒ‚| dk rt dƒ‚| dkrdS | d dkr(| dkS t| || ƒd| fvr7t dƒ‚t| ||| t|| ƒ ƒd dkS )	Nr   rG   r   z(invalid values for p,q in is_lucas_prp()r   z-is_lucas_prp() requires 'n' be greater than 0Fz)is_lucas_prp() requires gcd(n,2*q*D) == 1)r   rH   rf   rJ   rg   r   r   r   Úis_lucas_prpÝ  s    rj   c                 C   sŒ   t dddƒD ];}|d@ r| }t|| ƒ}|dkr+t| dd| d | d ƒd dk  S |dkr6||  r6 dS |d	krAt| ƒrA dS qtd
ƒ‚)ad  Lucas compositeness test with the Selfridge parameters for n.

    Explanation
    ===========

    The Lucas compositeness test checks whether n is a prime number.
    The test can be run with arbitrary parameters ``P`` and ``Q``, which also change the performance of the test.
    So, which parameters are most effective for running the Lucas compositeness test?
    As an algorithm for determining ``P`` and ``Q``, Selfridge proposed method A [1]_ page 1401
    (Since two methods were proposed, referred to simply as A and B in the paper,
    we will refer to one of them as "method A").

    method A fixes ``P = 1``. Then, ``D`` defined by ``D = P**2 - 4Q`` is varied from 5, -7, 9, -11, 13, and so on,
    with the first ``D`` being ``jacobi(D, n) == -1``. Once ``D`` is determined,
    ``Q`` is determined to be ``(P**2 - D)//4``.

    References
    ==========

    .. [1] Robert Baillie, Samuel S. Wagstaff, Lucas Pseudoprimes,
           Math. Comp. Vol 35, Number 152 (1980), pp. 1391-1417,
           https://doi.org/10.1090%2FS0025-5718-1980-0583518-6
           http://mpqs.free.fr/LucasPseudoprimes.pdf

    r   é@B r   r   r   rG   r   Fé   z=appropriate value for D cannot be found in is_selfridge_prp())rY   rJ   rf   r@   r   )r   rb   rI   r   r   r   Ú_is_selfridge_prpì  s   
&€rm   c                 C   ó8   | dk rt dƒ‚| dkrdS | d dkr| dkS t| ƒS )Nr   ú1is_selfridge_prp() requires 'n' be greater than 0Fr   r   )r   rm   r1   r   r   r   Úis_selfridge_prp  ó   rp   c           
      C   sø   |d d|  }|dkrt dƒ‚| dk rt dƒ‚| dkrdS | d dkr(| dkS t| || ƒd| fvr7t dƒ‚t|| ƒ}t| | ƒ}t| ||| | |? ƒ\}}}|dksX|dkrZd	S t|d ƒD ]}	|| d|  |  }|dkrs d	S t|d| ƒ}q`dS )
Nr   rG   r   z/invalid values for p,q in is_strong_lucas_prp()r   ro   Fz0is_strong_lucas_prp() requires gcd(n,2*q*D) == 1T)r   rH   rJ   r   rf   rY   rA   )
r   r   r8   rb   rI   r/   rc   rd   re   rZ   r   r   r   Úis_strong_lucas_prp  s,   
rr   c                 C   sô   t dddƒD ]o}|d@ r| }t|| ƒ}|dkr_t| d ƒ}t| dd| d | d |? ƒ\}}}|dks8|dkr; dS t |d ƒD ]}|| d|  |  }|dkrU  dS t|d| ƒ}qA d	S |dkrj||  rj d	S |d
krut| ƒru d	S qtdƒ‚)Nr   rk   r   r   r   rG   r   TFrl   zDappropriate value for D cannot be found in is_strong_selfridge_prp())rY   rJ   r   rf   rA   r@   r   )r   rb   rI   r/   rc   rd   re   rZ   r   r   r   Ú_is_strong_selfridge_prp7  s*   
$€rs   c                 C   rn   )Nr   z8is_strong_selfridge_prp() requires 'n' be greater than 0Fr   r   )r   rs   r1   r   r   r   Úis_strong_selfridge_prpO  rq   rt   c                 C   óB   | dk rt dƒ‚| dkrdS | d dkr| dkS t| dƒo t| ƒS )Nr   z,is_bpsw_prp() requires 'n' be greater than 0Fr   r   )r   r[   rm   r1   r   r   r   Úis_bpsw_prpY  ó   rv   c                 C   ru   )Nr   z3is_strong_bpsw_prp() requires 'n' be greater than 0Fr   r   )r   r[   rs   r1   r   r   r   Úis_strong_bpsw_prpc  rw   rx   )r   )%rO   Úmpmath.libmpÚlibmpr&   r   rY   rI   r   r   r#   r)   r,   r.   rH   Úlcmr2   r:   r@   rC   rD   rJ   rL   rU   rW   rX   r[   r\   rf   ri   rj   rm   rp   rr   rs   rt   rv   rx   r   r   r   r   Ú<module>   sF   
*

 $.(


