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

4 votes372 views5 answers
Current time python
Python
9 votes345 views2 answers
Remove duplicate row in df
Python
3 votes368 views2 answers
Python button click code
Python
0 vote338 views1 answer
How do you make plot show with matplotlib ion method
Python
1 vote350 views1 answer
Python - How To Ways to Remove xa0 From a String
Python
7 votes335 views4 answers
Calculate distance in python
Python
39 votes357 views10 answers
Python for loop
Python
0 vote359 views1 answer
Presto sequence example date
Python
0 vote390 views1 answer
Delete migrations django and start over deployment heroku
Python
0 vote330 views1 answer
Pytorch get non diag element
Python