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 vote191 views3 answers
Python isdigit
Python
0 vote164 views1 answer
Grading system in python with nested if
Python
1 vote198 views1 answer
Can variables have spaces python
Python
0 vote189 views1 answer
How to input sentence in python
Python
0 vote163 views1 answer
Black code formatter
Python
1 vote182 views2 answers
Python turn off garbage collection
Python
0 vote156 views1 answer
How to get azure keyvalaut values into python function app
Python
0 vote164 views1 answer
Python get desktop directory
Python
1 vote243 views1 answer
Django gmail smtp
Python Django
1 vote149 views1 answer
Create np nan array
Python