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 vote133 views1 answer
Multiprocessing a for loop python
Python
1 vote107 views1 answer
Remove ,drop,effacer, dataframe,python
Python
0 vote68 views1 answer
5+2 in python
Python
0 vote110 views1 answer
Zipfian distribution python
Python
77 votes111 views6 answers
Random from list python
Python
89 votes123 views4 answers
New env in conda
Python
0 vote111 views1 answer
Requirements.txt dev python
Python
0 vote127 views1 answer
How to read a pkl file in python
Python
0 vote118 views1 answer
Recursive python program to print numbers from n to 1
Python
0 vote114 views1 answer
Python dictionary get vs setdefault
Python