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 vote196 views1 answer
Time now random seed python
Python
1 vote227 views2 answers
Load data python
Python
0 vote211 views1 answer
Call a function with prameters inm tkinter buttion
Python
-1 vote161 views1 answer
Attributeerror: module 'numpy' has no attribute 'length'
Python
2 votes208 views2 answers
Python code fpr fibon
Python
0 vote215 views1 answer
Pygame kreis definition
Python
1 vote278 views1 answer
Django gunicorn static file not found
Python Django
0 vote197 views1 answer
Find total no of true in a list in python
Python
-1 vote203 views1 answer
Show dataframe pandas python
Python
13 votes196 views3 answers
Python array looping
Python