§
    OŠtjò	  ã                   óŽ   — d dl mZ d dlmZ  G d„ de¦  «        Z G d„ de¦  «        Z G d„ de¦  «        Z G d	„ d
e¦  «        ZdS )é    )Ú	Predicate)Ú
Dispatcherc                   ó0   — e Zd ZdZdZ edd¬¦  «        ZdS )ÚPrimePredicateaÇ  
    Prime number predicate.

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

    ``ask(Q.prime(x))`` is true iff ``x`` is a natural number greater
    than 1 that has no positive divisors other than ``1`` and the
    number itself.

    Examples
    ========

    >>> from sympy import Q, ask
    >>> ask(Q.prime(0))
    False
    >>> ask(Q.prime(1))
    False
    >>> ask(Q.prime(2))
    True
    >>> ask(Q.prime(20))
    False
    >>> ask(Q.prime(-3))
    False

    ÚprimeÚPrimeHandlerzÙHandler for key 'prime'. Test that an expression represents a prime number. When the expression is an exact number, the result (when True) is subject to the limitations of isprime() which is used to return the result.©ÚdocN©Ú__name__Ú
__module__Ú__qualname__Ú__doc__Únamer   Úhandler© ó    úb/var/www/html/CA-Chatbot/venv/lib/python3.11/site-packages/sympy/assumptions/predicates/ntheory.pyr   r      s=   € € € € € ðð ð4 €DØˆjØððñ ô €G€G€Gr   r   c                   ó0   — e Zd ZdZdZ edd¬¦  «        ZdS )ÚCompositePredicatea³  
    Composite number predicate.

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

    ``ask(Q.composite(x))`` is true iff ``x`` is a positive integer and has
    at least one positive divisor other than ``1`` and the number itself.

    Examples
    ========

    >>> from sympy import Q, ask
    >>> ask(Q.composite(0))
    False
    >>> ask(Q.composite(1))
    False
    >>> ask(Q.composite(2))
    False
    >>> ask(Q.composite(20))
    True

    Ú	compositeÚCompositeHandlerzHandler for key 'composite'.r	   Nr   r   r   r   r   r   *   s5   € € € € € ðð ð. €DØˆjÐ+Ð1OÐPÑPÔP€G€G€Gr   r   c                   ó0   — e Zd ZdZdZ edd¬¦  «        ZdS )ÚEvenPredicateaY  
    Even number predicate.

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

    ``ask(Q.even(x))`` is true iff ``x`` belongs to the set of even
    integers.

    Examples
    ========

    >>> from sympy import Q, ask, pi
    >>> ask(Q.even(0))
    True
    >>> ask(Q.even(2))
    True
    >>> ask(Q.even(3))
    False
    >>> ask(Q.even(pi))
    False

    ÚevenÚEvenHandlerzHandler for key 'even'.r	   Nr   r   r   r   r   r   F   s4   € € € € € ðð ð. €DØˆj˜Ð,EÐFÑFÔF€G€G€Gr   r   c                   ó0   — e Zd ZdZdZ edd¬¦  «        ZdS )ÚOddPredicateaN  
    Odd number predicate.

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

    ``ask(Q.odd(x))`` is true iff ``x`` belongs to the set of odd numbers.

    Examples
    ========

    >>> from sympy import Q, ask, pi
    >>> ask(Q.odd(0))
    False
    >>> ask(Q.odd(2))
    False
    >>> ask(Q.odd(3))
    True
    >>> ask(Q.odd(pi))
    False

    ÚoddÚ
OddHandlerzHHandler for key 'odd'. Test that an expression represents an odd number.r	   Nr   r   r   r   r   r   b   s=   € € € € € ðð ð, €DØˆjØððñ ô €G€G€Gr   r   N)Úsympy.assumptionsr   Úsympy.multipledispatchr   r   r   r   r   r   r   r   ú<module>r#      sì   ðØ 'Ð 'Ð 'Ð 'Ð 'Ð 'Ø -Ð -Ð -Ð -Ð -Ð -ð"ð "ð "ð "ð "�Yñ "ô "ð "ðJQð Qð Qð Qð Q˜ñ Qô Qð Qð8Gð Gð Gð Gð G�Iñ Gô Gð Gð8ð ð ð ð �9ñ ô ð ð ð r   