Find Carmichael number sage

for n in range(2,7000):
    if not is_prime(n):
        carmichael = True
        for a in range(1,n):
            if Mod(a,n)^n != Mod(a,n):
                carmichael = False
                break
        if carmichael:
            print n

Source: math.ucdavis.edu

Similar codes

0 vote109 views1 answer
Pd.read_csv how to cumsum a column
Python
0 vote105 views1 answer
Codegrepper is cool
Python
24 votes166 views6 answers
Django update model
Python Django
0 vote115 views1 answer
Repeat printing rows excel using python whenever i run the script
Python
26 votes117 views4 answers
Python send email with attachment
Python
73 votes109 views1 answer
Pip install error
Python
0 vote110 views1 answer
Tensor.expand_as
Python
5 votes113 views2 answers
Selenium.common.exceptions.SessionNotCreatedException: Message: session not created: This version of ChromeDriver only supports Chrome version 81
Python
0 vote73 views1 answer
Change the side of the axis plt python
Python
0 vote116 views1 answer
Python pandas convert comma separated number string to integer list
Python