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 vote221 views1 answer
Convert to pdf fresh little library that outputs our notebook in a nice LaTex format without installing/doing anything else.
Python
6 votes227 views4 answers
Np.random.seed
Python
5 votes208 views2 answers
Run JupyterLab
Python
0 vote214 views2 answers
Set cookie in python requests
Python
5 votes211 views1 answer
Python put quotes in string
Python
3 votes232 views2 answers
List vs tuple
Python
2 votes199 views1 answer
Edge detection opencv python
Python
1 vote218 views2 answers
Python zip function
Python
12 votes218 views6 answers
Python flask
Python
0 vote208 views1 answer
Numpy int64 to int
Python