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 vote349 views2 answers
Doormat pattern python
Python
0 vote463 views1 answer
Dev.to flask heroku
Python
6 votes357 views1 answer
Python regex replace all non alphanumeric characters
Python
3 votes335 views1 answer
How to make a resizable pygame window
Python
0 vote388 views1 answer
Create jwt token in django
Python Django
0 vote368 views1 answer
Pandas recognize type from strings
Python
119 votes350 views2 answers
Python iterate dictionary key value
Python
3 votes337 views1 answer
Python count number of unique elements in a list
Python
0 vote341 views1 answer
Funny application in python
Python
0 vote379 views1 answer
Weather api python
Python