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 vote184 views1 answer
Python memoization
Python
14 votes191 views2 answers
Pyhon sort a list of tuples
Python
6 votes183 views2 answers
Python check if value is undefined
Python
1 vote192 views1 answer
Python fiscal year prior
Python
0 vote233 views1 answer
Django on delete set default
Python Django
-1 vote189 views2 answers
Beautifulsoup docs
Python
3 votes254 views2 answers
Python subprocess exception handling
Python
0 vote190 views1 answer
Python soma números
Python
2 votes187 views1 answer
How to load ui file in pyqt5
Python
0 vote200 views2 answers
Graph 3d python
Python