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 vote212 views1 answer
Python second element of every tuple in list
Python
0 vote215 views1 answer
Regular Expression to Stop at First Match
Python
-1 vote206 views4 answers
Python creare decoratori
Python
4 votes224 views3 answers
Write a list into csv python
Python
9 votes225 views1 answer
Drop the last row of a dataframe
Python
0 vote248 views1 answer
Python - row slice dataframe by number of rows
Python
2 votes242 views1 answer
Django EMAIL_BACKEND console
Python Django
1 vote254 views1 answer
How to find the mode using pandas groupby
Python
1 vote210 views1 answer
Set size of button tkinter
Python
15 votes214 views3 answers
Remove punctuation python string library
Python