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 vote188 views2 answers
Explode multiple columns pandas
Python
5 votes182 views1 answer
Python flask query params
Python
83 votes171 views6 answers
How to check python version in cmd
Python
0 vote197 views1 answer
Syntax of calloc
Python
0 vote192 views1 answer
Beautifulsoup remove empty tags
Python
0 vote168 views1 answer
Strip array of strings python
Python
3 votes192 views3 answers
Python zip()
Python
0 vote174 views2 answers
Json to base64 python
Python
2 votes181 views1 answer
Pip avticate venv
Python
-1 vote179 views1 answer
Kick member discord py
Python