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 vote165 views1 answer
Frequency meaning
Python
1 vote144 views1 answer
Not getting spanish characters python
Python
0 vote135 views1 answer
Python draw polygon
Python
3 votes242 views2 answers
Python defaultdict(list)
Python
0 vote144 views1 answer
Blue ray size
Python
1 vote246 views1 answer
Python how to see what pip packages are installed
Python
0 vote135 views1 answer
Enumerate() to skip items
Python
0 vote133 views1 answer
Execute command dynamo civid
Python
0 vote141 views1 answer
Python operator overloading deal with type
Python
2 votes158 views1 answer
Change false to true python
Python