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 vote381 views1 answer
2nd to last index python
Python
0 vote325 views1 answer
Symbolic variables python
Python
30 votes331 views5 answers
Colab mount drive
Python
0 vote321 views1 answer
Nums: List[int] in python function
Python
210 votes508 views6 answers
Looping over dictionary python
Python
0 vote318 views1 answer
Admin site
Python
0 vote304 views10 answers
Sqlite3 with flask web application CRUD pdf
Python
11 votes358 views3 answers
Username Python
Python
2 votes394 views3 answers
To_frame python
Python
2 votes374 views1 answer
Django template capitalize equivalent
Python Django