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

1 vote269 views1 answer
What is the meaning of illiteral with base 10
Python
6 votes251 views4 answers
Print all elements in list python
Python
2 votes250 views1 answer
Pandas reset row indices
Python
1 vote265 views1 answer
Handle queries in ListView django
Python
0 vote251 views1 answer
<type 'file'> python3
Python
0 vote290 views1 answer
Scrape website with login python selenium
Python
0 vote264 views1 answer
To_bytes python
Python
0 vote277 views1 answer
Removing duplicates using json python
Python
27 votes219 views2 answers
Get user from mention discord.py
Python
0 vote273 views1 answer
Python function guts
Python