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 vote120 views1 answer
Django form field class
Python Django
16 votes105 views6 answers
Python how to print
Python
2 votes89 views2 answers
Make a list in python 3
Python
1 vote97 views1 answer
How to recurse a function
Python
2 votes89 views1 answer
Python saving a screentshot with PIL
Python
2 votes191 views4 answers
Streamlit python install
Python
8 votes113 views3 answers
Fatal error in launcher: Unable to create process using '"'
Python
1 vote98 views2 answers
Python convert multidimensional array to one dimensional
Python
0 vote94 views2 answers
Python argsort
Python
0 vote109 views1 answer
Reset all weights tensorflow
Python