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 vote76 views2 answers
To float python
Python
0 vote126 views1 answer
Create folders with subfolders python
Python
1 vote120 views2 answers
Change the size of a button tkinter
Python
0 vote80 views0 answer
Python
0 vote142 views1 answer
How to stop a program after 1 second in python
Python
1 vote126 views1 answer
Jupyter notebook no password or token
Python
0 vote123 views1 answer
Sort rows in csv file using python pandas
Python
0 vote125 views1 answer
Convert_text_to_hexadecimal_viva.py in python
Python
98 votes135 views4 answers
Python 4
Python
0 vote128 views1 answer
Django reverse accessor clashes for abstract class
Python