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 vote171 views1 answer
Hackereath
Python
8 votes182 views6 answers
Redirect django
Python
1 vote164 views1 answer
Creating dictionary using the keys
Python
0 vote167 views1 answer
Instantiate a dictionary python
Python
3 votes173 views2 answers
AttributeError: module 'tensorflow' has no attribute 'placeholder'
Python
0 vote140 views1 answer
Label encoding multiple columns
Python
0 vote141 views1 answer
From threading import thread ImportError: cannot import name 'thread' from 'threading' (/usr/lib/python3.7/threading.py)
Python
-1 vote157 views1 answer
What will be the output of the following python code? print("abc. def".capitalize())
Python
72 votes150 views6 answers
How to reverse a string in python
Python
0 vote160 views1 answer
Renaming Column Name Dataframe
Python